Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2

Percentage Accurate: 85.9% → 99.2%

Time: 12.6s

Alternatives: 14

Speedup: 1.1×

• 23.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} + \frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t} \leq \infty:\\ \;\;\;\;\frac{x}{y} + \frac{\mathsf{fma}\left(z, \mathsf{fma}\left(-2, t, 2\right), 2\right)}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ (/ x y) (/ (+ 2.0 (* (* 2.0 z) (- 1.0 t))) (* z t))) INFINITY)
   (+ (/ x y) (/ (fma z (fma -2.0 t 2.0) 2.0) (* z t)))
   (+ (/ x y) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) + ((2.0 + ((2.0 * z) * (1.0 - t))) / (z * t))) <= ((double) INFINITY)) {
		tmp = (x / y) + (fma(z, fma(-2.0, t, 2.0), 2.0) / (z * t));
	} else {
		tmp = (x / y) + -2.0;
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(x / y), $MachinePrecision] + N[(N[(2.0 + N[(N[(2.0 * z), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(x / y), $MachinePrecision] + N[(N[(z * N[(-2.0 * t + 2.0), $MachinePrecision] + 2.0), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (/.f64 x y) (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))) < +inf.0

   1. Initial program 99.8%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. +-lowering-+.f64 N/A

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

      3. /-lowering-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-*l* N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. sub-neg N/A

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

      8. +-commutative N/A

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

      9. distribute-lft-in N/A

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

      10. neg-mul-1 N/A

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

      11. associate-*r* N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval N/A

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

      14. metadata-eval N/A

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

      15. accelerator-lowering-fma.f64 N/A

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

      16. metadata-eval N/A

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

      17. *-commutative N/A

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

      18. *-lowering-*.f64 N/A

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

      19. /-lowering-/.f64 99.8

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

   4. Applied egg-rr 99.8%

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

   if +inf.0 < (+.f64 (/.f64 x y) (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)))

   1. Initial program 0.0%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 100.0%

      \[\leadsto \frac{x}{y} + \color{blue}{-2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

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

Alternative 2: 84.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{2 + \frac{2}{z}}{t}\\ t_2 := \frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t}\\ t_3 := \frac{x}{y} + -2\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{+53}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 50000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ 2.0 (/ 2.0 z)) t))
        (t_2 (/ (+ 2.0 (* (* 2.0 z) (- 1.0 t))) (* z t)))
        (t_3 (+ (/ x y) -2.0)))
   (if (<= t_2 -1e+53)
     t_1
     (if (<= t_2 50000.0) t_3 (if (<= t_2 INFINITY) t_1 t_3)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (2.0 + (2.0 / z)) / t;
	double t_2 = (2.0 + ((2.0 * z) * (1.0 - t))) / (z * t);
	double t_3 = (x / y) + -2.0;
	double tmp;
	if (t_2 <= -1e+53) {
		tmp = t_1;
	} else if (t_2 <= 50000.0) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (2.0 + (2.0 / z)) / t;
	double t_2 = (2.0 + ((2.0 * z) * (1.0 - t))) / (z * t);
	double t_3 = (x / y) + -2.0;
	double tmp;
	if (t_2 <= -1e+53) {
		tmp = t_1;
	} else if (t_2 <= 50000.0) {
		tmp = t_3;
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (2.0 + (2.0 / z)) / t
	t_2 = (2.0 + ((2.0 * z) * (1.0 - t))) / (z * t)
	t_3 = (x / y) + -2.0
	tmp = 0
	if t_2 <= -1e+53:
		tmp = t_1
	elif t_2 <= 50000.0:
		tmp = t_3
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(2.0 + Float64(2.0 / z)) / t)
	t_2 = Float64(Float64(2.0 + Float64(Float64(2.0 * z) * Float64(1.0 - t))) / Float64(z * t))
	t_3 = Float64(Float64(x / y) + -2.0)
	tmp = 0.0
	if (t_2 <= -1e+53)
		tmp = t_1;
	elseif (t_2 <= 50000.0)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (2.0 + (2.0 / z)) / t;
	t_2 = (2.0 + ((2.0 * z) * (1.0 - t))) / (z * t);
	t_3 = (x / y) + -2.0;
	tmp = 0.0;
	if (t_2 <= -1e+53)
		tmp = t_1;
	elseif (t_2 <= 50000.0)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(2.0 * z), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+53], t$95$1, If[LessEqual[t$95$2, 50000.0], t$95$3, If[LessEqual[t$95$2, Infinity], t$95$1, t$95$3]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -9.9999999999999999e52 or 5e4 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 97.9%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 N/A

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

      2. associate-+r+ N/A

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

      3. +-commutative N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. sub-neg N/A

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

      6. metadata-eval N/A

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

      7. +-commutative N/A

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

      8. *-lft-identity N/A

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

      9. associate-*l/ N/A

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

      10. +-lowering-+.f64 N/A

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

      11. associate-*l/ N/A

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

      12. *-lft-identity N/A

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

      13. /-lowering-/.f64 N/A

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

      14. +-lowering-+.f64 N/A

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

      15. associate-*r/ N/A

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

      16. metadata-eval N/A

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

      17. /-lowering-/.f64 97.5

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

   5. Simplified 97.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \frac{\color{blue}{2 + 2 \cdot \frac{1}{z}}}{t} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \frac{\color{blue}{2 + 2 \cdot \frac{1}{z}}}{t} \]

      2. associate-*r/ N/A

         \[\leadsto \frac{2 + \color{blue}{\frac{2 \cdot 1}{z}}}{t} \]

      3. metadata-eval N/A

         \[\leadsto \frac{2 + \frac{\color{blue}{2}}{z}}{t} \]

      4. /-lowering-/.f64 75.5

         \[\leadsto \frac{2 + \color{blue}{\frac{2}{z}}}{t} \]

   8. Simplified 75.5%

      \[\leadsto \frac{\color{blue}{2 + \frac{2}{z}}}{t} \]

   if -9.9999999999999999e52 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 5e4 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 72.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 97.8%

      \[\leadsto \frac{x}{y} + \color{blue}{-2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.8%

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

Alternative 3: 84.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\mathsf{fma}\left(2, z, 2\right)}{z \cdot t}\\ t_2 := \frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t}\\ t_3 := \frac{x}{y} + -2\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{+53}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 50000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (fma 2.0 z 2.0) (* z t)))
        (t_2 (/ (+ 2.0 (* (* 2.0 z) (- 1.0 t))) (* z t)))
        (t_3 (+ (/ x y) -2.0)))
   (if (<= t_2 -1e+53)
     t_1
     (if (<= t_2 50000.0) t_3 (if (<= t_2 INFINITY) t_1 t_3)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, z, 2.0) / (z * t);
	double t_2 = (2.0 + ((2.0 * z) * (1.0 - t))) / (z * t);
	double t_3 = (x / y) + -2.0;
	double tmp;
	if (t_2 <= -1e+53) {
		tmp = t_1;
	} else if (t_2 <= 50000.0) {
		tmp = t_3;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, z, 2.0) / Float64(z * t))
	t_2 = Float64(Float64(2.0 + Float64(Float64(2.0 * z) * Float64(1.0 - t))) / Float64(z * t))
	t_3 = Float64(Float64(x / y) + -2.0)
	tmp = 0.0
	if (t_2 <= -1e+53)
		tmp = t_1;
	elseif (t_2 <= 50000.0)
		tmp = t_3;
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 * z + 2.0), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(2.0 + N[(N[(2.0 * z), $MachinePrecision] * N[(1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+53], t$95$1, If[LessEqual[t$95$2, 50000.0], t$95$3, If[LessEqual[t$95$2, Infinity], t$95$1, t$95$3]]]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < -9.9999999999999999e52 or 5e4 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < +inf.0

   1. Initial program 97.9%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{2 + 2 \cdot \frac{1}{z}}{t}} \]

   5. Simplified 75.4%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(2, z, 2\right)}{t \cdot z}} \]

   if -9.9999999999999999e52 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z)) < 5e4 or +inf.0 < (/.f64 (+.f64 #s(literal 2 binary64) (*.f64 (*.f64 z #s(literal 2 binary64)) (-.f64 #s(literal 1 binary64) t))) (*.f64 t z))

   1. Initial program 72.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 97.8%

      \[\leadsto \frac{x}{y} + \color{blue}{-2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t} \leq -1 \cdot 10^{+53}:\\ \;\;\;\;\frac{\mathsf{fma}\left(2, z, 2\right)}{z \cdot t}\\ \mathbf{elif}\;\frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t} \leq 50000:\\ \;\;\;\;\frac{x}{y} + -2\\ \mathbf{elif}\;\frac{2 + \left(2 \cdot z\right) \cdot \left(1 - t\right)}{z \cdot t} \leq \infty:\\ \;\;\;\;\frac{\mathsf{fma}\left(2, z, 2\right)}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -2\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 90.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -1e+32)
   (/ (fma 2.0 (/ y (* z t)) x) y)
   (if (<= (/ x y) 2e+30)
     (fma (/ (/ 2.0 z) t) (+ z 1.0) -2.0)
     (+ (/ x y) (/ 2.0 t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1e+32) {
		tmp = fma(2.0, (y / (z * t)), x) / y;
	} else if ((x / y) <= 2e+30) {
		tmp = fma(((2.0 / z) / t), (z + 1.0), -2.0);
	} else {
		tmp = (x / y) + (2.0 / t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -1e+32)
		tmp = Float64(fma(2.0, Float64(y / Float64(z * t)), x) / y);
	elseif (Float64(x / y) <= 2e+30)
		tmp = fma(Float64(Float64(2.0 / z) / t), Float64(z + 1.0), -2.0);
	else
		tmp = Float64(Float64(x / y) + Float64(2.0 / t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -1e+32], N[(N[(2.0 * N[(y / N[(z * t), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 2e+30], N[(N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision] * N[(z + 1.0), $MachinePrecision] + -2.0), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -1.00000000000000005e32

   1. Initial program 83.3%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t \cdot z}} \]

      2. *-lowering-*.f64 89.6

         \[\leadsto \frac{x}{y} + \frac{2}{\color{blue}{t \cdot z}} \]

   5. Simplified 89.6%

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t \cdot z}} \]

   6. Taylor expanded in y around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + 2 \cdot \frac{y}{t \cdot z}}{y}} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{2 \cdot \frac{y}{t \cdot z} + x}}{y} \]

      3. accelerator-lowering-fma.f64 N/A

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

      4. /-lowering-/.f64 N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 91.1

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

   8. Simplified 91.1%

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

   if -1.00000000000000005e32 < (/.f64 x y) < 2e30

   1. Initial program 89.7%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

   5. Simplified 97.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{2}{t \cdot z}, z + 1, -2\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. associate-/r* N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{2}{z}}{t}}, z + 1, -2\right) \]

      3. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{2}{z}}{t}}, z + 1, -2\right) \]

      4. /-lowering-/.f64 97.5

         \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{2}{z}}}{t}, z + 1, -2\right) \]

   7. Applied egg-rr 97.5%

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{2}{z}}{t}}, z + 1, -2\right) \]

   if 2e30 < (/.f64 x y)

   1. Initial program 91.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 85.5

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

   5. Simplified 85.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 85.5

         \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]

   8. Simplified 85.5%

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

Alternative 5: 52.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -7.2 \cdot 10^{+30}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq -4.5 \cdot 10^{-97}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{elif}\;\frac{x}{y} \leq 2.45 \cdot 10^{-19}:\\ \;\;\;\;-2\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -7.2e+30)
   (/ x y)
   (if (<= (/ x y) -4.5e-97)
     (/ 2.0 t)
     (if (<= (/ x y) 2.45e-19) -2.0 (/ x y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -7.2e+30) {
		tmp = x / y;
	} else if ((x / y) <= -4.5e-97) {
		tmp = 2.0 / t;
	} else if ((x / y) <= 2.45e-19) {
		tmp = -2.0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-7.2d+30)) then
        tmp = x / y
    else if ((x / y) <= (-4.5d-97)) then
        tmp = 2.0d0 / t
    else if ((x / y) <= 2.45d-19) then
        tmp = -2.0d0
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -7.2e+30) {
		tmp = x / y;
	} else if ((x / y) <= -4.5e-97) {
		tmp = 2.0 / t;
	} else if ((x / y) <= 2.45e-19) {
		tmp = -2.0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -7.2e+30:
		tmp = x / y
	elif (x / y) <= -4.5e-97:
		tmp = 2.0 / t
	elif (x / y) <= 2.45e-19:
		tmp = -2.0
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -7.2e+30)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= -4.5e-97)
		tmp = Float64(2.0 / t);
	elseif (Float64(x / y) <= 2.45e-19)
		tmp = -2.0;
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -7.2e+30)
		tmp = x / y;
	elseif ((x / y) <= -4.5e-97)
		tmp = 2.0 / t;
	elseif ((x / y) <= 2.45e-19)
		tmp = -2.0;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -7.2e+30], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], -4.5e-97], N[(2.0 / t), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 2.45e-19], -2.0, N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -7.2000000000000004e30 or 2.44999999999999996e-19 < (/.f64 x y)

   1. Initial program 88.1%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. /-lowering-/.f64 70.6

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

   5. Simplified 70.6%

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

   if -7.2000000000000004e30 < (/.f64 x y) < -4.5000000000000001e-97

   1. Initial program 96.2%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{2 + 2 \cdot \frac{1}{z}}{t}} \]

   5. Simplified 80.0%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(2, z, 2\right)}{t \cdot z}} \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{2}{t}} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 40.5

         \[\leadsto \color{blue}{\frac{2}{t}} \]

   8. Simplified 40.5%

      \[\leadsto \color{blue}{\frac{2}{t}} \]

   if -4.5000000000000001e-97 < (/.f64 x y) < 2.44999999999999996e-19

   1. Initial program 86.7%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

   5. Simplified 99.6%

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

   6. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-2} \]
   7. Step-by-step derivation

   8. Simplified 41.9%

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

Alternative 6: 89.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -15000000000000.0)
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (if (<= (/ x y) 2e+30)
     (fma (/ 2.0 (* z t)) (+ z 1.0) -2.0)
     (+ (/ x y) (/ 2.0 t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -15000000000000.0) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else if ((x / y) <= 2e+30) {
		tmp = fma((2.0 / (z * t)), (z + 1.0), -2.0);
	} else {
		tmp = (x / y) + (2.0 / t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -15000000000000.0)
		tmp = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)));
	elseif (Float64(x / y) <= 2e+30)
		tmp = fma(Float64(2.0 / Float64(z * t)), Float64(z + 1.0), -2.0);
	else
		tmp = Float64(Float64(x / y) + Float64(2.0 / t));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -15000000000000.0], N[(N[(x / y), $MachinePrecision] + N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 2e+30], N[(N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision] * N[(z + 1.0), $MachinePrecision] + -2.0), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -1.5e13

   1. Initial program 83.8%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 87.1

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

   5. Simplified 87.1%

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

   if -1.5e13 < (/.f64 x y) < 2e30

   1. Initial program 89.5%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

   5. Simplified 98.1%

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

   if 2e30 < (/.f64 x y)

   1. Initial program 91.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 85.5

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

   5. Simplified 85.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 85.5

         \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]

   8. Simplified 85.5%

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -15000000000000:\\ \;\;\;\;\frac{x}{y} + \left(-2 + \frac{2}{t}\right)\\ \mathbf{elif}\;\frac{x}{y} \leq 2 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{z \cdot t}, z + 1, -2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + \frac{2}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 89.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} + \frac{2}{t}\\ \mathbf{if}\;\frac{x}{y} \leq -15000000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;\frac{x}{y} \leq 2 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{z \cdot t}, z + 1, -2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (/ x y) (/ 2.0 t))))
   (if (<= (/ x y) -15000000000000.0)
     t_1
     (if (<= (/ x y) 2e+30) (fma (/ 2.0 (* z t)) (+ z 1.0) -2.0) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + (2.0 / t);
	double tmp;
	if ((x / y) <= -15000000000000.0) {
		tmp = t_1;
	} else if ((x / y) <= 2e+30) {
		tmp = fma((2.0 / (z * t)), (z + 1.0), -2.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) + Float64(2.0 / t))
	tmp = 0.0
	if (Float64(x / y) <= -15000000000000.0)
		tmp = t_1;
	elseif (Float64(x / y) <= 2e+30)
		tmp = fma(Float64(2.0 / Float64(z * t)), Float64(z + 1.0), -2.0);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x / y), $MachinePrecision], -15000000000000.0], t$95$1, If[LessEqual[N[(x / y), $MachinePrecision], 2e+30], N[(N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision] * N[(z + 1.0), $MachinePrecision] + -2.0), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -1.5e13 or 2e30 < (/.f64 x y)

   1. Initial program 87.5%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 86.3

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

   5. Simplified 86.3%

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

   6. Taylor expanded in t around 0

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 86.2

         \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]

   8. Simplified 86.2%

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t}} \]

   if -1.5e13 < (/.f64 x y) < 2e30

   1. Initial program 89.5%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

   5. Simplified 98.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{2}{t \cdot z}, z + 1, -2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -15000000000000:\\ \;\;\;\;\frac{x}{y} + \frac{2}{t}\\ \mathbf{elif}\;\frac{x}{y} \leq 2 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{z \cdot t}, z + 1, -2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + \frac{2}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 65.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1.45 \cdot 10^{+21}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 160000000:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -1.45e+21)
   (/ x y)
   (if (<= (/ x y) 160000000.0) (+ -2.0 (/ 2.0 t)) (+ (/ x y) -2.0))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.45e+21) {
		tmp = x / y;
	} else if ((x / y) <= 160000000.0) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = (x / y) + -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-1.45d+21)) then
        tmp = x / y
    else if ((x / y) <= 160000000.0d0) then
        tmp = (-2.0d0) + (2.0d0 / t)
    else
        tmp = (x / y) + (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.45e+21) {
		tmp = x / y;
	} else if ((x / y) <= 160000000.0) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = (x / y) + -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -1.45e+21:
		tmp = x / y
	elif (x / y) <= 160000000.0:
		tmp = -2.0 + (2.0 / t)
	else:
		tmp = (x / y) + -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -1.45e+21)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 160000000.0)
		tmp = Float64(-2.0 + Float64(2.0 / t));
	else
		tmp = Float64(Float64(x / y) + -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -1.45e+21)
		tmp = x / y;
	elseif ((x / y) <= 160000000.0)
		tmp = -2.0 + (2.0 / t);
	else
		tmp = (x / y) + -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -1.45e+21], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 160000000.0], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -1.45e21

   1. Initial program 83.3%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. /-lowering-/.f64 77.8

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

   5. Simplified 77.8%

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

   if -1.45e21 < (/.f64 x y) < 1.6e8

   1. Initial program 89.4%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 59.7

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

   5. Simplified 59.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1}{t} - 2} \]
   7. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{2 \cdot \frac{1}{t} + \left(\mathsf{neg}\left(2\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto 2 \cdot \frac{1}{t} + \color{blue}{-2} \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{2 \cdot \frac{1}{t} + -2} \]

      4. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{2 \cdot 1}{t}} + -2 \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{2}}{t} + -2 \]

      6. /-lowering-/.f64 58.8

         \[\leadsto \color{blue}{\frac{2}{t}} + -2 \]

   8. Simplified 58.8%

      \[\leadsto \color{blue}{\frac{2}{t} + -2} \]

   if 1.6e8 < (/.f64 x y)

   1. Initial program 92.1%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 68.8%

      \[\leadsto \frac{x}{y} + \color{blue}{-2} \]
3. Recombined 3 regimes into one program.

4. Final simplification 66.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1.45 \cdot 10^{+21}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 160000000:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -2\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 65.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -8.8 \cdot 10^{+24}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 7800000000:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -8.8e+24)
   (/ x y)
   (if (<= (/ x y) 7800000000.0) (+ -2.0 (/ 2.0 t)) (/ x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -8.8e+24) {
		tmp = x / y;
	} else if ((x / y) <= 7800000000.0) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-8.8d+24)) then
        tmp = x / y
    else if ((x / y) <= 7800000000.0d0) then
        tmp = (-2.0d0) + (2.0d0 / t)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -8.8e+24) {
		tmp = x / y;
	} else if ((x / y) <= 7800000000.0) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -8.8e+24:
		tmp = x / y
	elif (x / y) <= 7800000000.0:
		tmp = -2.0 + (2.0 / t)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -8.8e+24)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 7800000000.0)
		tmp = Float64(-2.0 + Float64(2.0 / t));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -8.8e+24)
		tmp = x / y;
	elseif ((x / y) <= 7800000000.0)
		tmp = -2.0 + (2.0 / t);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -8.8e+24], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 7800000000.0], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -8.80000000000000007e24 or 7.8e9 < (/.f64 x y)

   1. Initial program 87.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. /-lowering-/.f64 73.2

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

   5. Simplified 73.2%

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

   if -8.80000000000000007e24 < (/.f64 x y) < 7.8e9

   1. Initial program 89.4%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 59.7

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

   5. Simplified 59.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1}{t} - 2} \]
   7. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{2 \cdot \frac{1}{t} + \left(\mathsf{neg}\left(2\right)\right)} \]

      2. metadata-eval N/A

         \[\leadsto 2 \cdot \frac{1}{t} + \color{blue}{-2} \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \color{blue}{2 \cdot \frac{1}{t} + -2} \]

      4. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{2 \cdot 1}{t}} + -2 \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{2}}{t} + -2 \]

      6. /-lowering-/.f64 58.8

         \[\leadsto \color{blue}{\frac{2}{t}} + -2 \]

   8. Simplified 58.8%

      \[\leadsto \color{blue}{\frac{2}{t} + -2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -8.8 \cdot 10^{+24}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 7800000000:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 92.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} + \left(-2 + \frac{2}{t}\right)\\ \mathbf{if}\;z \leq -6 \cdot 10^{-22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 0.66:\\ \;\;\;\;\frac{x}{y} + \frac{2}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (/ x y) (+ -2.0 (/ 2.0 t)))))
   (if (<= z -6e-22) t_1 (if (<= z 0.66) (+ (/ x y) (/ 2.0 (* z t))) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + (-2.0 + (2.0 / t));
	double tmp;
	if (z <= -6e-22) {
		tmp = t_1;
	} else if (z <= 0.66) {
		tmp = (x / y) + (2.0 / (z * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x / y) + ((-2.0d0) + (2.0d0 / t))
    if (z <= (-6d-22)) then
        tmp = t_1
    else if (z <= 0.66d0) then
        tmp = (x / y) + (2.0d0 / (z * t))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + (-2.0 + (2.0 / t));
	double tmp;
	if (z <= -6e-22) {
		tmp = t_1;
	} else if (z <= 0.66) {
		tmp = (x / y) + (2.0 / (z * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) + (-2.0 + (2.0 / t))
	tmp = 0
	if z <= -6e-22:
		tmp = t_1
	elif z <= 0.66:
		tmp = (x / y) + (2.0 / (z * t))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)))
	tmp = 0.0
	if (z <= -6e-22)
		tmp = t_1;
	elseif (z <= 0.66)
		tmp = Float64(Float64(x / y) + Float64(2.0 / Float64(z * t)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) + (-2.0 + (2.0 / t));
	tmp = 0.0;
	if (z <= -6e-22)
		tmp = t_1;
	elseif (z <= 0.66)
		tmp = (x / y) + (2.0 / (z * t));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] + N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6e-22], t$95$1, If[LessEqual[z, 0.66], N[(N[(x / y), $MachinePrecision] + N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.9999999999999998e-22 or 0.660000000000000031 < z

   1. Initial program 80.1%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. div-sub N/A

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

      2. sub-neg N/A

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

      3. *-inverses N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-in N/A

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

      6. metadata-eval N/A

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

      7. +-lowering-+.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. /-lowering-/.f64 97.8

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

   5. Simplified 97.8%

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

   if -5.9999999999999998e-22 < z < 0.660000000000000031

   1. Initial program 97.4%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t \cdot z}} \]

      2. *-lowering-*.f64 87.8

         \[\leadsto \frac{x}{y} + \frac{2}{\color{blue}{t \cdot z}} \]

   5. Simplified 87.8%

      \[\leadsto \frac{x}{y} + \color{blue}{\frac{2}{t \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.0%

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

Alternative 11: 63.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} + -2\\ \mathbf{if}\;z \leq -1.25 \cdot 10^{-187}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6.1 \cdot 10^{-108}:\\ \;\;\;\;\frac{\frac{2}{t}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (/ x y) -2.0)))
   (if (<= z -1.25e-187) t_1 (if (<= z 6.1e-108) (/ (/ 2.0 t) z) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + -2.0;
	double tmp;
	if (z <= -1.25e-187) {
		tmp = t_1;
	} else if (z <= 6.1e-108) {
		tmp = (2.0 / t) / z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x / y) + (-2.0d0)
    if (z <= (-1.25d-187)) then
        tmp = t_1
    else if (z <= 6.1d-108) then
        tmp = (2.0d0 / t) / z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + -2.0;
	double tmp;
	if (z <= -1.25e-187) {
		tmp = t_1;
	} else if (z <= 6.1e-108) {
		tmp = (2.0 / t) / z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) + -2.0
	tmp = 0
	if z <= -1.25e-187:
		tmp = t_1
	elif z <= 6.1e-108:
		tmp = (2.0 / t) / z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) + -2.0)
	tmp = 0.0
	if (z <= -1.25e-187)
		tmp = t_1;
	elseif (z <= 6.1e-108)
		tmp = Float64(Float64(2.0 / t) / z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) + -2.0;
	tmp = 0.0;
	if (z <= -1.25e-187)
		tmp = t_1;
	elseif (z <= 6.1e-108)
		tmp = (2.0 / t) / z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]}, If[LessEqual[z, -1.25e-187], t$95$1, If[LessEqual[z, 6.1e-108], N[(N[(2.0 / t), $MachinePrecision] / z), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.2499999999999999e-187 or 6.10000000000000007e-108 < z

   1. Initial program 84.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 62.8%

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

   if -1.2499999999999999e-187 < z < 6.10000000000000007e-108

   1. Initial program 99.8%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Simplified 99.8%

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

   6. Taylor expanded in z around 0

      \[\leadsto \frac{\color{blue}{\frac{2}{t}}}{z} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 77.4

         \[\leadsto \frac{\color{blue}{\frac{2}{t}}}{z} \]

   8. Simplified 77.4%

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

Alternative 12: 63.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} + -2\\ \mathbf{if}\;z \leq -1.25 \cdot 10^{-187}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6.8 \cdot 10^{-108}:\\ \;\;\;\;\frac{2}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (/ x y) -2.0)))
   (if (<= z -1.25e-187) t_1 (if (<= z 6.8e-108) (/ 2.0 (* z t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + -2.0;
	double tmp;
	if (z <= -1.25e-187) {
		tmp = t_1;
	} else if (z <= 6.8e-108) {
		tmp = 2.0 / (z * t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x / y) + (-2.0d0)
    if (z <= (-1.25d-187)) then
        tmp = t_1
    else if (z <= 6.8d-108) then
        tmp = 2.0d0 / (z * t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) + -2.0;
	double tmp;
	if (z <= -1.25e-187) {
		tmp = t_1;
	} else if (z <= 6.8e-108) {
		tmp = 2.0 / (z * t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) + -2.0
	tmp = 0
	if z <= -1.25e-187:
		tmp = t_1
	elif z <= 6.8e-108:
		tmp = 2.0 / (z * t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) + -2.0)
	tmp = 0.0
	if (z <= -1.25e-187)
		tmp = t_1;
	elseif (z <= 6.8e-108)
		tmp = Float64(2.0 / Float64(z * t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) + -2.0;
	tmp = 0.0;
	if (z <= -1.25e-187)
		tmp = t_1;
	elseif (z <= 6.8e-108)
		tmp = 2.0 / (z * t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x / y), $MachinePrecision] + -2.0), $MachinePrecision]}, If[LessEqual[z, -1.25e-187], t$95$1, If[LessEqual[z, 6.8e-108], N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.2499999999999999e-187 or 6.80000000000000004e-108 < z

   1. Initial program 84.6%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

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

   5. Simplified 62.8%

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

   if -1.2499999999999999e-187 < z < 6.80000000000000004e-108

   1. Initial program 99.8%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \color{blue}{\frac{2}{t \cdot z}} \]

      2. *-lowering-*.f64 77.3

         \[\leadsto \frac{2}{\color{blue}{t \cdot z}} \]

   5. Simplified 77.3%

      \[\leadsto \color{blue}{\frac{2}{t \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 66.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-187}:\\ \;\;\;\;\frac{x}{y} + -2\\ \mathbf{elif}\;z \leq 6.8 \cdot 10^{-108}:\\ \;\;\;\;\frac{2}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + -2\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 36.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.1 \cdot 10^{-32}:\\ \;\;\;\;-2\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -1.1e-32) -2.0 (if (<= t 1.0) (/ 2.0 t) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.1e-32) {
		tmp = -2.0;
	} else if (t <= 1.0) {
		tmp = 2.0 / t;
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-1.1d-32)) then
        tmp = -2.0d0
    else if (t <= 1.0d0) then
        tmp = 2.0d0 / t
    else
        tmp = -2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.1e-32) {
		tmp = -2.0;
	} else if (t <= 1.0) {
		tmp = 2.0 / t;
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -1.1e-32:
		tmp = -2.0
	elif t <= 1.0:
		tmp = 2.0 / t
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -1.1e-32)
		tmp = -2.0;
	elseif (t <= 1.0)
		tmp = Float64(2.0 / t);
	else
		tmp = -2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -1.1e-32)
		tmp = -2.0;
	elseif (t <= 1.0)
		tmp = 2.0 / t;
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -1.1e-32], -2.0, If[LessEqual[t, 1.0], N[(2.0 / t), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if t < -1.1e-32 or 1 < t

   1. Initial program 79.1%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

   5. Simplified 56.3%

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

   6. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-2} \]
   7. Step-by-step derivation

   8. Simplified 35.5%

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

   if -1.1e-32 < t < 1

   1. Initial program 97.5%

      \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{2 + 2 \cdot \frac{1}{z}}{t}} \]

   5. Simplified 73.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(2, z, 2\right)}{t \cdot z}} \]

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{2}{t}} \]
   7. Step-by-step derivation

      1. /-lowering-/.f64 36.8

         \[\leadsto \color{blue}{\frac{2}{t}} \]

   8. Simplified 36.8%

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

Alternative 14: 19.9% accurate, 47.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x, y, z, t)
	return -2.0
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := -2.0

Derivation

1. Initial program 88.5%

   \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{2 \cdot \frac{1 - t}{t} + 2 \cdot \frac{1}{t \cdot z}} \]

5. Simplified 65.2%

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

6. Taylor expanded in t around inf

   \[\leadsto \color{blue}{-2} \]
7. Step-by-step derivation

8. Simplified 18.5%

   \[\leadsto \color{blue}{-2} \]
9. Add Preprocessing

Developer Target 1: 99.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{2}{z} + 2}{t} - \left(2 - \frac{x}{y}\right) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (((2.0d0 / z) + 2.0d0) / t) - (2.0d0 - (x / y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024199 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64

  :alt
  (! :herbie-platform default (- (/ (+ (/ 2 z) 2) t) (- 2 (/ x y))))

  (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))