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

Percentage Accurate: 88.0% → 99.6%

Time: 6.9s

Alternatives: 7

Speedup: 0.4×

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

real(8) function code(x, y, z)
    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.0% 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

real(8) function code(x, y, z)
    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: 99.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (y + x) / (1.0d0 - (y / z))
    if (t_0 <= (-1d-257)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = ((-1.0d0) - (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 = (y + x) / (1.0 - (y / z));
	double tmp;
	if (t_0 <= -1e-257) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (-1.0 - (x / y)) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y + x), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e-257], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(-1.0 - N[(x / y), $MachinePrecision]), $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))) < -9.9999999999999998e-258 or 0.0 < (/.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) (/.f64 y z)))

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

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

   1. Initial program 9.1%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. div-sub N/A

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

      11. associate-*l/ N/A

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

      12. metadata-eval N/A

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

      13. distribute-neg-frac N/A

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

      14. distribute-lft-neg-out N/A

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

      15. lft-mult-inverse N/A

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

      16. metadata-eval N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 - \frac{y}{z}} \leq -1 \cdot 10^{-257}:\\ \;\;\;\;\frac{y + x}{1 - \frac{y}{z}}\\ \mathbf{elif}\;\frac{y + x}{1 - \frac{y}{z}} \leq 0:\\ \;\;\;\;\left(-1 - \frac{x}{y}\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{1 - \frac{y}{z}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    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 = (y + x) / (1.0d0 - (y / z))
    t_1 = (z / (z - y)) * (y + x)
    if (t_0 <= (-1d-257)) then
        tmp = t_1
    else if (t_0 <= 0.0d0) then
        tmp = ((-1.0d0) - (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 = (y + x) / (1.0 - (y / z));
	double t_1 = (z / (z - y)) * (y + x);
	double tmp;
	if (t_0 <= -1e-257) {
		tmp = t_1;
	} else if (t_0 <= 0.0) {
		tmp = (-1.0 - (x / y)) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-inverses N/A

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

      3. div-sub N/A

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

      4. associate-/r/ N/A

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

      5. *-rgt-identity N/A

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

      6. associate-*r/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. *-rgt-identity N/A

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

      12. lower-/.f64 N/A

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

      13. *-inverses N/A

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

      14. div-sub N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 97.1

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

   5. Applied rewrites 97.1%

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

   7. Applied rewrites 99.8%

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

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

   1. Initial program 9.1%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. div-sub N/A

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

      11. associate-*l/ N/A

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

      12. metadata-eval N/A

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

      13. distribute-neg-frac N/A

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

      14. distribute-lft-neg-out N/A

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

      15. lft-mult-inverse N/A

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

      16. metadata-eval N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 - \frac{y}{z}} \leq -1 \cdot 10^{-257}:\\ \;\;\;\;\frac{z}{z - y} \cdot \left(y + x\right)\\ \mathbf{elif}\;\frac{y + x}{1 - \frac{y}{z}} \leq 0:\\ \;\;\;\;\left(-1 - \frac{x}{y}\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{z - y} \cdot \left(y + x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (y + x) / (1.0d0 - (y / z))
    if (t_0 <= 0.0d0) then
        tmp = ((x / (z - y)) + (y / (z - 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 = (y + x) / (1.0 - (y / z));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = ((x / (z - y)) + (y / (z - y))) * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y + x), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[(N[(x / N[(z - y), $MachinePrecision]), $MachinePrecision] + N[(y / N[(z - y), $MachinePrecision]), $MachinePrecision]), $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))) < 0.0

   1. Initial program 78.2%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{x}{1 - \frac{y}{z}} + \frac{y}{1 - \frac{y}{z}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-inverses N/A

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

      3. div-sub N/A

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

      4. associate-/r/ N/A

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

      5. *-rgt-identity N/A

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

      6. associate-*r/ N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. *-rgt-identity N/A

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

      12. lower-/.f64 N/A

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

      13. *-inverses N/A

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

      14. div-sub N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 94.5

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

   5. Applied rewrites 94.5%

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

   7. Applied rewrites 97.8%

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

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

   1. Initial program 99.9%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y + x}{1 - \frac{y}{z}} \leq 0:\\ \;\;\;\;\left(\frac{x}{z - y} + \frac{y}{z - y}\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{1 - \frac{y}{z}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 72.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.4 \cdot 10^{-20}:\\ \;\;\;\;y + x\\ \mathbf{elif}\;z \leq 12800000:\\ \;\;\;\;\left(-1 - \frac{x}{y}\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.4e-20)
   (+ y x)
   (if (<= z 12800000.0) (* (- -1.0 (/ x y)) z) (+ y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.4e-20) {
		tmp = y + x;
	} else if (z <= 12800000.0) {
		tmp = (-1.0 - (x / y)) * z;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1.4d-20)) then
        tmp = y + x
    else if (z <= 12800000.0d0) then
        tmp = ((-1.0d0) - (x / y)) * z
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.4e-20) {
		tmp = y + x;
	} else if (z <= 12800000.0) {
		tmp = (-1.0 - (x / y)) * z;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.4e-20:
		tmp = y + x
	elif z <= 12800000.0:
		tmp = (-1.0 - (x / y)) * z
	else:
		tmp = y + x
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.4e-20], N[(y + x), $MachinePrecision], If[LessEqual[z, 12800000.0], N[(N[(-1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.4000000000000001e-20 or 1.28e7 < z

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 80.9

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

   5. Applied rewrites 80.9%

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

   if -1.4000000000000001e-20 < z < 1.28e7

   1. Initial program 74.0%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. +-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. div-sub N/A

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

      11. associate-*l/ N/A

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

      12. metadata-eval N/A

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

      13. distribute-neg-frac N/A

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

      14. distribute-lft-neg-out N/A

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

      15. lft-mult-inverse N/A

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

      16. metadata-eval N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 78.9

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

   5. Applied rewrites 78.9%

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

Alternative 5: 72.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.4e-20)
   (+ y x)
   (if (<= z 12800000.0) (- (fma (/ z y) x z)) (+ y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.4e-20) {
		tmp = y + x;
	} else if (z <= 12800000.0) {
		tmp = -fma((z / y), x, z);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.4e-20)
		tmp = Float64(y + x);
	elseif (z <= 12800000.0)
		tmp = Float64(-fma(Float64(z / y), x, z));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.4000000000000001e-20 or 1.28e7 < z

   1. Initial program 99.9%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 80.9

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

   5. Applied rewrites 80.9%

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

   if -1.4000000000000001e-20 < z < 1.28e7

   1. Initial program 74.0%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. unpow2 N/A

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

      6. associate-/l* N/A

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

      7. distribute-rgt-out-- N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower--.f64 N/A

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

      11. mul-1-neg N/A

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

      12. lower-neg.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 76.3

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

   5. Applied rewrites 76.3%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 27.7%

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

   10. Applied rewrites 29.6%

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

   11. Taylor expanded in z around 0

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

   13. Applied rewrites 76.2%

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

Alternative 6: 67.0% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.1e+118) (- z) (if (<= y 1.15e+21) (+ y x) (- z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.1e+118) {
		tmp = -z;
	} else if (y <= 1.15e+21) {
		tmp = y + x;
	} else {
		tmp = -z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-1.1d+118)) then
        tmp = -z
    else if (y <= 1.15d+21) 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.1e+118) {
		tmp = -z;
	} else if (y <= 1.15e+21) {
		tmp = y + x;
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.1e+118:
		tmp = -z
	elif y <= 1.15e+21:
		tmp = y + x
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.1e+118)
		tmp = Float64(-z);
	elseif (y <= 1.15e+21)
		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.1e+118)
		tmp = -z;
	elseif (y <= 1.15e+21)
		tmp = y + x;
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.1e+118], (-z), If[LessEqual[y, 1.15e+21], N[(y + x), $MachinePrecision], (-z)]]

Derivation

1. Split input into 2 regimes

2. if y < -1.09999999999999993e118 or 1.15e21 < y

   1. Initial program 68.7%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 69.5

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

   5. Applied rewrites 69.5%

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

   if -1.09999999999999993e118 < y < 1.15e21

   1. Initial program 98.7%

      \[\frac{x + y}{1 - \frac{y}{z}} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 73.2

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

   5. Applied rewrites 73.2%

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

Alternative 7: 35.2% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ -z \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := (-z)

Derivation

1. Initial program 88.2%

   \[\frac{x + y}{1 - \frac{y}{z}} \]
2. Add Preprocessing

3. Taylor expanded in y around inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 33.6

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

5. Applied rewrites 33.6%

   \[\leadsto \color{blue}{-z} \]
6. Add Preprocessing

Developer Target 1: 93.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y + x}{-y} \cdot z\\ \mathbf{if}\;y < -3.7429310762689856 \cdot 10^{+171}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 3.5534662456086734 \cdot 10^{+168}:\\ \;\;\;\;\frac{x + y}{1 - \frac{y}{z}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ (+ y x) (- y)) z)))
   (if (< y -3.7429310762689856e+171)
     t_0
     (if (< y 3.5534662456086734e+168) (/ (+ x y) (- 1.0 (/ y z))) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y + x) / -y) * z;
	double tmp;
	if (y < -3.7429310762689856e+171) {
		tmp = t_0;
	} else if (y < 3.5534662456086734e+168) {
		tmp = (x + y) / (1.0 - (y / z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((y + x) / -y) * z
    if (y < (-3.7429310762689856d+171)) then
        tmp = t_0
    else if (y < 3.5534662456086734d+168) then
        tmp = (x + y) / (1.0d0 - (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 = ((y + x) / -y) * z;
	double tmp;
	if (y < -3.7429310762689856e+171) {
		tmp = t_0;
	} else if (y < 3.5534662456086734e+168) {
		tmp = (x + y) / (1.0 - (y / z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((y + x) / -y) * z
	tmp = 0
	if y < -3.7429310762689856e+171:
		tmp = t_0
	elif y < 3.5534662456086734e+168:
		tmp = (x + y) / (1.0 - (y / z))
	else:
		tmp = t_0
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(y + x), $MachinePrecision] / (-y)), $MachinePrecision] * z), $MachinePrecision]}, If[Less[y, -3.7429310762689856e+171], t$95$0, If[Less[y, 3.5534662456086734e+168], N[(N[(x + y), $MachinePrecision] / N[(1.0 - N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< y -3742931076268985600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* (/ (+ y x) (- y)) z) (if (< y 3553466245608673400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ x y) (- 1 (/ y z))) (* (/ (+ y x) (- y)) z))))

  (/ (+ x y) (- 1.0 (/ y z))))