Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, A

Percentage Accurate: 88.6% → 98.7%

Time: 2.6s

Alternatives: 7

Speedup: 0.3×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{1 - \frac{y}{z}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (+ x y) (- 1.0 (/ y z))))

C

double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) / (1.0d0 - (y / z))
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Python

def code(x, y, z):
	return (x + y) / (1.0 - (y / z))

Julia

function code(x, y, z)
	return Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) / (1.0 - (y / z));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 88.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{1 - \frac{y}{z}} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (+ x y) (- 1.0 (/ y z))))

C

double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) / (1.0d0 - (y / z))
end function

Java

public static double code(double x, double y, double z) {
	return (x + y) / (1.0 - (y / z));
}

Python

def code(x, y, z):
	return (x + y) / (1.0 - (y / z))

Julia

function code(x, y, z)
	return Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) / (1.0 - (y / z));
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - \frac{y}{z}\\ t_1 := \frac{x + y}{t\_0}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-211}:\\ \;\;\;\;\frac{y}{t\_0} + \frac{x}{t\_0}\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;\frac{\left(-y\right) - x}{y} \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (/ y z))) (t_1 (/ (+ x y) t_0)))
   (if (<= t_1 -1e-211)
     (+ (/ y t_0) (/ x t_0))
     (if (<= t_1 0.0) (* (/ (- (- y) x) y) z) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 - (y / z);
	double t_1 = (x + y) / t_0;
	double tmp;
	if (t_1 <= -1e-211) {
		tmp = (y / t_0) + (x / t_0);
	} else if (t_1 <= 0.0) {
		tmp = ((-y - x) / y) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = 1.0d0 - (y / z)
    t_1 = (x + y) / t_0
    if (t_1 <= (-1d-211)) then
        tmp = (y / t_0) + (x / t_0)
    else if (t_1 <= 0.0d0) then
        tmp = ((-y - x) / y) * z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 1.0 - (y / z);
	double t_1 = (x + y) / t_0;
	double tmp;
	if (t_1 <= -1e-211) {
		tmp = (y / t_0) + (x / t_0);
	} else if (t_1 <= 0.0) {
		tmp = ((-y - x) / y) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 1.0 - (y / z)
	t_1 = (x + y) / t_0
	tmp = 0
	if t_1 <= -1e-211:
		tmp = (y / t_0) + (x / t_0)
	elif t_1 <= 0.0:
		tmp = ((-y - x) / y) * z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(1.0 - Float64(y / z))
	t_1 = Float64(Float64(x + y) / t_0)
	tmp = 0.0
	if (t_1 <= -1e-211)
		tmp = Float64(Float64(y / t_0) + Float64(x / t_0));
	elseif (t_1 <= 0.0)
		tmp = Float64(Float64(Float64(Float64(-y) - x) / y) * z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 1.0 - (y / z);
	t_1 = (x + y) / t_0;
	tmp = 0.0;
	if (t_1 <= -1e-211)
		tmp = (y / t_0) + (x / t_0);
	elseif (t_1 <= 0.0)
		tmp = ((-y - x) / y) * z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x + y), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-211], N[(N[(y / t$95$0), $MachinePrecision] + N[(x / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[((-y) - x), $MachinePrecision] / y), $MachinePrecision] * z), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < -1.00000000000000009e-211

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x + y}}{1 - \frac{y}{z}} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{1 - \frac{y}{z}}} \]

      3. lift--.f64 N/A

         \[\leadsto \frac{x + y}{\color{blue}{1 - \frac{y}{z}}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{x + y}{1 - \color{blue}{\frac{y}{z}}} \]

      5. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]

      6. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      7. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      9. lift-/.f64 N/A

         \[\leadsto \frac{y}{1 - \color{blue}{\frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      10. lift--.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      11. lower-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \color{blue}{\frac{x}{1 - \frac{y}{z}}} \]

      12. lift-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \color{blue}{\frac{y}{z}}} \]

      13. lift--.f64 88.6

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{\color{blue}{1 - \frac{y}{z}}} \]

   3. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

   if -1.00000000000000009e-211 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < -0.0

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x + y}}{1 - \frac{y}{z}} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{1 - \frac{y}{z}}} \]

      3. lift--.f64 N/A

         \[\leadsto \frac{x + y}{\color{blue}{1 - \frac{y}{z}}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{x + y}{1 - \color{blue}{\frac{y}{z}}} \]

      5. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]

      6. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      7. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      9. lift-/.f64 N/A

         \[\leadsto \frac{y}{1 - \color{blue}{\frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      10. lift--.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      11. lower-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \color{blue}{\frac{x}{1 - \frac{y}{z}}} \]

      12. lift-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \color{blue}{\frac{y}{z}}} \]

      13. lift--.f64 88.6

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{\color{blue}{1 - \frac{y}{z}}} \]

   3. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

   4. Taylor expanded in z around 0

      \[\leadsto \color{blue}{z \cdot \left(-1 \cdot \frac{x}{y} - 1\right)} \]
   5. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot z \]

      4. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(\frac{x}{y}\right)\right) - 1\right) \cdot z \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

      6. lower-/.f64 48.6

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

   6. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\left(\left(-\frac{x}{y}\right) - 1\right) \cdot z} \]

   7. Taylor expanded in y around 0

      \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]

      2. mul-1-neg N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      3. lower--.f64 N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      4. lower-neg.f64 48.6

         \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]

   9. Applied rewrites 48.6%

      \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]

   if -0.0 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z)))

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 98.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x + y}{1 - \frac{y}{z}}\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-207}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{\left(-y\right) - x}{y} \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (+ x y) (- 1.0 (/ y z)))))
   (if (<= t_0 -2e-207) t_0 (if (<= t_0 0.0) (* (/ (- (- y) x) y) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x + y) / (1.0 - (y / z));
	double tmp;
	if (t_0 <= -2e-207) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = ((-y - x) / y) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x + y) / (1.0d0 - (y / z))
    if (t_0 <= (-2d-207)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = ((-y - x) / y) * z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x + y) / (1.0 - (y / z));
	double tmp;
	if (t_0 <= -2e-207) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = ((-y - x) / y) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x + y) / (1.0 - (y / z))
	tmp = 0
	if t_0 <= -2e-207:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = ((-y - x) / y) * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x + y) / Float64(1.0 - Float64(y / z)))
	tmp = 0.0
	if (t_0 <= -2e-207)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(Float64(Float64(-y) - x) / y) * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x + y) / (1.0 - (y / z));
	tmp = 0.0;
	if (t_0 <= -2e-207)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = ((-y - x) / y) * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -2e-207], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(N[((-y) - x), $MachinePrecision] / y), $MachinePrecision] * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < -1.99999999999999985e-207 or -0.0 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z)))

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   if -1.99999999999999985e-207 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z))) < -0.0

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x + y}}{1 - \frac{y}{z}} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{1 - \frac{y}{z}}} \]

      3. lift--.f64 N/A

         \[\leadsto \frac{x + y}{\color{blue}{1 - \frac{y}{z}}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{x + y}{1 - \color{blue}{\frac{y}{z}}} \]

      5. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]

      6. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      7. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      9. lift-/.f64 N/A

         \[\leadsto \frac{y}{1 - \color{blue}{\frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      10. lift--.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      11. lower-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \color{blue}{\frac{x}{1 - \frac{y}{z}}} \]

      12. lift-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \color{blue}{\frac{y}{z}}} \]

      13. lift--.f64 88.6

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{\color{blue}{1 - \frac{y}{z}}} \]

   3. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

   4. Taylor expanded in z around 0

      \[\leadsto \color{blue}{z \cdot \left(-1 \cdot \frac{x}{y} - 1\right)} \]
   5. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot z \]

      4. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(\frac{x}{y}\right)\right) - 1\right) \cdot z \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

      6. lower-/.f64 48.6

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

   6. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\left(\left(-\frac{x}{y}\right) - 1\right) \cdot z} \]

   7. Taylor expanded in y around 0

      \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]

      2. mul-1-neg N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      3. lower--.f64 N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      4. lower-neg.f64 48.6

         \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]

   9. Applied rewrites 48.6%

      \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 73.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -95000000:\\ \;\;\;\;\frac{\left(-y\right) - x}{y} \cdot z\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+32}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;-\mathsf{fma}\left(x, \frac{z}{y}, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -95000000.0)
   (* (/ (- (- y) x) y) z)
   (if (<= y 2.7e+32) (+ y x) (- (fma x (/ z y) z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -95000000.0) {
		tmp = ((-y - x) / y) * z;
	} else if (y <= 2.7e+32) {
		tmp = y + x;
	} else {
		tmp = -fma(x, (z / y), z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -95000000.0)
		tmp = Float64(Float64(Float64(Float64(-y) - x) / y) * z);
	elseif (y <= 2.7e+32)
		tmp = Float64(y + x);
	else
		tmp = Float64(-fma(x, Float64(z / y), z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -95000000.0], N[(N[(N[((-y) - x), $MachinePrecision] / y), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[y, 2.7e+32], N[(y + x), $MachinePrecision], (-N[(x * N[(z / y), $MachinePrecision] + z), $MachinePrecision])]]

Derivation

1. Split input into 3 regimes

2. if y < -9.5e7

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{x + y}}{1 - \frac{y}{z}} \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{1 - \frac{y}{z}}} \]

      3. lift--.f64 N/A

         \[\leadsto \frac{x + y}{\color{blue}{1 - \frac{y}{z}}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{x + y}{1 - \color{blue}{\frac{y}{z}}} \]

      5. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]

      6. +-commutative N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      7. lower-+.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      9. lift-/.f64 N/A

         \[\leadsto \frac{y}{1 - \color{blue}{\frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      10. lift--.f64 N/A

          \[\leadsto \frac{y}{\color{blue}{1 - \frac{y}{z}}} + \frac{x}{1 - \frac{y}{z}} \]

      11. lower-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \color{blue}{\frac{x}{1 - \frac{y}{z}}} \]

      12. lift-/.f64 N/A

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \color{blue}{\frac{y}{z}}} \]

      13. lift--.f64 88.6

          \[\leadsto \frac{y}{1 - \frac{y}{z}} + \frac{x}{\color{blue}{1 - \frac{y}{z}}} \]

   3. Applied rewrites 88.6%

      \[\leadsto \color{blue}{\frac{y}{1 - \frac{y}{z}} + \frac{x}{1 - \frac{y}{z}}} \]

   4. Taylor expanded in z around 0

      \[\leadsto \color{blue}{z \cdot \left(-1 \cdot \frac{x}{y} - 1\right)} \]
   5. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{x}{y} - 1\right) \cdot z \]

      4. mul-1-neg N/A

         \[\leadsto \left(\left(\mathsf{neg}\left(\frac{x}{y}\right)\right) - 1\right) \cdot z \]

      5. lower-neg.f64 N/A

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

      6. lower-/.f64 48.6

         \[\leadsto \left(\left(-\frac{x}{y}\right) - 1\right) \cdot z \]

   6. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\left(\left(-\frac{x}{y}\right) - 1\right) \cdot z} \]

   7. Taylor expanded in y around 0

      \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{-1 \cdot y - x}{y} \cdot z \]

      2. mul-1-neg N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      3. lower--.f64 N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(y\right)\right) - x}{y} \cdot z \]

      4. lower-neg.f64 48.6

         \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]

   9. Applied rewrites 48.6%

      \[\leadsto \frac{\left(-y\right) - x}{y} \cdot z \]

   if -9.5e7 < y < 2.70000000000000013e32

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + y \cdot \left(1 - -1 \cdot \frac{x}{z}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \left(1 - -1 \cdot \frac{x}{z}\right) + \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 - -1 \cdot \frac{x}{z}\right) \cdot y + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, \color{blue}{y}, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, y, x\right) \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(\mathsf{neg}\left(\frac{x}{z}\right)\right), y, x\right) \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

      7. lower-/.f64 48.6

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

   4. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 50.5%

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]

   8. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + y} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y + \color{blue}{x} \]

      2. lower-+.f64 50.5

         \[\leadsto y + \color{blue}{x} \]

   10. Applied rewrites 50.5%

       \[\leadsto \color{blue}{y + x} \]

   if 2.70000000000000013e32 < y

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{z \cdot \left(x + y\right)}{y}} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{z \cdot \left(x + y\right)}{y}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{z \cdot \left(x + y\right)}{y} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{z \cdot \left(x + y\right)}{y} \]

      4. *-commutative N/A

         \[\leadsto -\frac{\left(x + y\right) \cdot z}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto -\frac{\left(x + y\right) \cdot z}{y} \]

      6. +-commutative N/A

         \[\leadsto -\frac{\left(y + x\right) \cdot z}{y} \]

      7. lower-+.f64 42.4

         \[\leadsto -\frac{\left(y + x\right) \cdot z}{y} \]

   4. Applied rewrites 42.4%

      \[\leadsto \color{blue}{-\frac{\left(y + x\right) \cdot z}{y}} \]

   5. Taylor expanded in x around 0

      \[\leadsto -\left(z + \frac{x \cdot z}{y}\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto -\left(\frac{x \cdot z}{y} + z\right) \]

      2. associate-/l* N/A

         \[\leadsto -\left(x \cdot \frac{z}{y} + z\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]

      4. lower-/.f64 48.6

         \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]

   7. Applied rewrites 48.6%

      \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 72.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -\mathsf{fma}\left(x, \frac{z}{y}, z\right)\\ \mathbf{if}\;y \leq -95000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+32}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (fma x (/ z y) z))))
   (if (<= y -95000000.0) t_0 (if (<= y 2.7e+32) (+ y x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -fma(x, (z / y), z);
	double tmp;
	if (y <= -95000000.0) {
		tmp = t_0;
	} else if (y <= 2.7e+32) {
		tmp = y + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(-fma(x, Float64(z / y), z))
	tmp = 0.0
	if (y <= -95000000.0)
		tmp = t_0;
	elseif (y <= 2.7e+32)
		tmp = Float64(y + x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = (-N[(x * N[(z / y), $MachinePrecision] + z), $MachinePrecision])}, If[LessEqual[y, -95000000.0], t$95$0, If[LessEqual[y, 2.7e+32], N[(y + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -9.5e7 or 2.70000000000000013e32 < y

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{z \cdot \left(x + y\right)}{y}} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\frac{z \cdot \left(x + y\right)}{y}\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{z \cdot \left(x + y\right)}{y} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{z \cdot \left(x + y\right)}{y} \]

      4. *-commutative N/A

         \[\leadsto -\frac{\left(x + y\right) \cdot z}{y} \]

      5. lower-*.f64 N/A

         \[\leadsto -\frac{\left(x + y\right) \cdot z}{y} \]

      6. +-commutative N/A

         \[\leadsto -\frac{\left(y + x\right) \cdot z}{y} \]

      7. lower-+.f64 42.4

         \[\leadsto -\frac{\left(y + x\right) \cdot z}{y} \]

   4. Applied rewrites 42.4%

      \[\leadsto \color{blue}{-\frac{\left(y + x\right) \cdot z}{y}} \]

   5. Taylor expanded in x around 0

      \[\leadsto -\left(z + \frac{x \cdot z}{y}\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto -\left(\frac{x \cdot z}{y} + z\right) \]

      2. associate-/l* N/A

         \[\leadsto -\left(x \cdot \frac{z}{y} + z\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]

      4. lower-/.f64 48.6

         \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]

   7. Applied rewrites 48.6%

      \[\leadsto -\mathsf{fma}\left(x, \frac{z}{y}, z\right) \]

   if -9.5e7 < y < 2.70000000000000013e32

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + y \cdot \left(1 - -1 \cdot \frac{x}{z}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \left(1 - -1 \cdot \frac{x}{z}\right) + \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 - -1 \cdot \frac{x}{z}\right) \cdot y + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, \color{blue}{y}, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, y, x\right) \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(\mathsf{neg}\left(\frac{x}{z}\right)\right), y, x\right) \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

      7. lower-/.f64 48.6

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

   4. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 50.5%

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]

   8. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + y} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y + \color{blue}{x} \]

      2. lower-+.f64 50.5

         \[\leadsto y + \color{blue}{x} \]

   10. Applied rewrites 50.5%

       \[\leadsto \color{blue}{y + x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 67.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{+115}:\\ \;\;\;\;-z\\ \mathbf{elif}\;y \leq 4.2 \cdot 10^{+33}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.15e+115) (- z) (if (<= y 4.2e+33) (+ y x) (- z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.15e+115) {
		tmp = -z;
	} else if (y <= 4.2e+33) {
		tmp = y + x;
	} else {
		tmp = -z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-1.15d+115)) then
        tmp = -z
    else if (y <= 4.2d+33) then
        tmp = y + x
    else
        tmp = -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.15e+115) {
		tmp = -z;
	} else if (y <= 4.2e+33) {
		tmp = y + x;
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.15e+115:
		tmp = -z
	elif y <= 4.2e+33:
		tmp = y + x
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.15e+115)
		tmp = Float64(-z);
	elseif (y <= 4.2e+33)
		tmp = Float64(y + x);
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.15e+115)
		tmp = -z;
	elseif (y <= 4.2e+33)
		tmp = y + x;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.15e+115], (-z), If[LessEqual[y, 4.2e+33], N[(y + x), $MachinePrecision], (-z)]]

Derivation

1. Split input into 2 regimes

2. if y < -1.15000000000000002e115 or 4.2000000000000001e33 < y

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(z\right) \]

      2. lower-neg.f64 34.4

         \[\leadsto -z \]

   4. Applied rewrites 34.4%

      \[\leadsto \color{blue}{-z} \]

   if -1.15000000000000002e115 < y < 4.2000000000000001e33

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + y \cdot \left(1 - -1 \cdot \frac{x}{z}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \left(1 - -1 \cdot \frac{x}{z}\right) + \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 - -1 \cdot \frac{x}{z}\right) \cdot y + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, \color{blue}{y}, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, y, x\right) \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(\mathsf{neg}\left(\frac{x}{z}\right)\right), y, x\right) \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

      7. lower-/.f64 48.6

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

   4. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 50.5%

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]

   8. Taylor expanded in z around inf

      \[\leadsto \color{blue}{x + y} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y + \color{blue}{x} \]

      2. lower-+.f64 50.5

         \[\leadsto y + \color{blue}{x} \]

   10. Applied rewrites 50.5%

       \[\leadsto \color{blue}{y + x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 41.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.7 \cdot 10^{+117}:\\ \;\;\;\;y\\ \mathbf{elif}\;z \leq 9 \cdot 10^{+153}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -3.7e+117) y (if (<= z 9e+153) (- z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.7e+117) {
		tmp = y;
	} else if (z <= 9e+153) {
		tmp = -z;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.7d+117)) then
        tmp = y
    else if (z <= 9d+153) then
        tmp = -z
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.7e+117) {
		tmp = y;
	} else if (z <= 9e+153) {
		tmp = -z;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.7e+117:
		tmp = y
	elif z <= 9e+153:
		tmp = -z
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.7e+117)
		tmp = y;
	elseif (z <= 9e+153)
		tmp = Float64(-z);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.7e+117)
		tmp = y;
	elseif (z <= 9e+153)
		tmp = -z;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3.7e+117], y, If[LessEqual[z, 9e+153], (-z), y]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6999999999999999e117 or 9.0000000000000002e153 < z

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + y \cdot \left(1 - -1 \cdot \frac{x}{z}\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto y \cdot \left(1 - -1 \cdot \frac{x}{z}\right) + \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 - -1 \cdot \frac{x}{z}\right) \cdot y + x \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, \color{blue}{y}, x\right) \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, y, x\right) \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(\mathsf{neg}\left(\frac{x}{z}\right)\right), y, x\right) \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

      7. lower-/.f64 48.6

         \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

   4. Applied rewrites 48.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 50.5%

      \[\leadsto \mathsf{fma}\left(1, y, x\right) \]

   8. Taylor expanded in x around 0

      \[\leadsto y \]
   9. Step-by-step derivation

   10. Applied rewrites 18.7%

       \[\leadsto y \]

   if -3.6999999999999999e117 < z < 9.0000000000000002e153

   1. Initial program 88.6%

      \[\frac{x + y}{1 - \frac{y}{z}} \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-1 \cdot z} \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(z\right) \]

      2. lower-neg.f64 34.4

         \[\leadsto -z \]

   4. Applied rewrites 34.4%

      \[\leadsto \color{blue}{-z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 18.7% accurate, 13.1× speedup

Math

\[\begin{array}{l} \\ y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 y)

C

double code(double x, double y, double z) {
	return y;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = y
end function

Java

public static double code(double x, double y, double z) {
	return y;
}

Python

def code(x, y, z):
	return y

Julia

function code(x, y, z)
	return y
end

MATLAB

function tmp = code(x, y, z)
	tmp = y;
end

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 88.6%

   \[\frac{x + y}{1 - \frac{y}{z}} \]

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{x + y \cdot \left(1 - -1 \cdot \frac{x}{z}\right)} \]
3. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto y \cdot \left(1 - -1 \cdot \frac{x}{z}\right) + \color{blue}{x} \]

   2. *-commutative N/A

      \[\leadsto \left(1 - -1 \cdot \frac{x}{z}\right) \cdot y + x \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, \color{blue}{y}, x\right) \]

   4. lower--.f64 N/A

      \[\leadsto \mathsf{fma}\left(1 - -1 \cdot \frac{x}{z}, y, x\right) \]

   5. mul-1-neg N/A

      \[\leadsto \mathsf{fma}\left(1 - \left(\mathsf{neg}\left(\frac{x}{z}\right)\right), y, x\right) \]

   6. lower-neg.f64 N/A

      \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

   7. lower-/.f64 48.6

      \[\leadsto \mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right) \]

4. Applied rewrites 48.6%

   \[\leadsto \color{blue}{\mathsf{fma}\left(1 - \left(-\frac{x}{z}\right), y, x\right)} \]

5. Taylor expanded in x around 0

   \[\leadsto \mathsf{fma}\left(1, y, x\right) \]
6. Step-by-step derivation

7. Applied rewrites 50.5%

   \[\leadsto \mathsf{fma}\left(1, y, x\right) \]

8. Taylor expanded in x around 0

   \[\leadsto y \]
9. Step-by-step derivation

10. Applied rewrites 18.7%

    \[\leadsto y \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2025139 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, A"
  :precision binary64
  (/ (+ x y) (- 1.0 (/ y z))))