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

Percentage Accurate: 86.5% → 99.0%

Time: 10.2s

Alternatives: 14

Speedup: 1.3×

• 23.6% 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: 86.5% 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.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (x / y) + (((2.0 + (2.0 / z)) / t) + -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 = (x / y) + (((2.0d0 + (2.0d0 / z)) / t) + (-2.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.9%

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

   1. +-commutative 84.9%

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

   2. remove-double-neg 84.9%

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

   3. distribute-frac-neg 84.9%

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

   4. unsub-neg 84.9%

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

   5. *-commutative 84.9%

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

   6. associate-*r* 84.9%

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

   7. distribute-rgt1-in 84.9%

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

   8. associate-/l* 85.3%

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

   9. fma-neg 85.3%

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

   10. *-commutative 85.3%

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

   11. fma-define 85.3%

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

   12. *-commutative 85.3%

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

   13. distribute-frac-neg 85.3%

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

   14. remove-double-neg 85.3%

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

3. Simplified 85.3%

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

5. Taylor expanded in t around inf 99.5%

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

   1. sub-neg 99.5%

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

   2. +-commutative 99.5%

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

   3. metadata-eval 99.5%

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

   4. associate-+l+ 99.5%

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

   5. associate-*r/ 99.5%

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

   6. distribute-lft-in 99.5%

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

   7. metadata-eval 99.5%

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

   8. associate-*r/ 99.5%

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

   9. metadata-eval 99.5%

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

7. Simplified 99.5%

   \[\leadsto \color{blue}{\frac{x}{y} + \left(\frac{2 + \frac{2}{z}}{t} + -2\right)} \]
8. Add Preprocessing

Alternative 2: 64.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 5 \cdot 10^{-6}:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{elif}\;\frac{x}{y} \leq 4000:\\ \;\;\;\;\frac{\frac{2}{z}}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -5e+65)
   (/ x y)
   (if (<= (/ x y) 5e-6)
     (+ -2.0 (/ 2.0 t))
     (if (<= (/ x y) 4000.0) (/ (/ 2.0 z) t) (/ x y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 5e-6) {
		tmp = -2.0 + (2.0 / t);
	} else if ((x / y) <= 4000.0) {
		tmp = (2.0 / z) / 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) <= (-5d+65)) then
        tmp = x / y
    else if ((x / y) <= 5d-6) then
        tmp = (-2.0d0) + (2.0d0 / t)
    else if ((x / y) <= 4000.0d0) then
        tmp = (2.0d0 / z) / 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) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 5e-6) {
		tmp = -2.0 + (2.0 / t);
	} else if ((x / y) <= 4000.0) {
		tmp = (2.0 / z) / t;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -5e+65:
		tmp = x / y
	elif (x / y) <= 5e-6:
		tmp = -2.0 + (2.0 / t)
	elif (x / y) <= 4000.0:
		tmp = (2.0 / z) / t
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -5e+65)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 5e-6)
		tmp = Float64(-2.0 + Float64(2.0 / t));
	elseif (Float64(x / y) <= 4000.0)
		tmp = Float64(Float64(2.0 / z) / 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) <= -5e+65)
		tmp = x / y;
	elseif ((x / y) <= 5e-6)
		tmp = -2.0 + (2.0 / t);
	elseif ((x / y) <= 4000.0)
		tmp = (2.0 / z) / t;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -5e+65], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 5e-6], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 4000.0], N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision], N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -4.99999999999999973e65 or 4e3 < (/.f64 x y)

   1. Initial program 83.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 74.4%

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

   if -4.99999999999999973e65 < (/.f64 x y) < 5.00000000000000041e-6

   1. Initial program 85.3%

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

      1. +-commutative 85.3%

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

      2. remove-double-neg 85.3%

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

      3. distribute-frac-neg 85.3%

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

      4. unsub-neg 85.3%

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

      5. *-commutative 85.3%

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

      6. associate-*r* 85.3%

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

      7. distribute-rgt1-in 85.3%

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

      8. associate-/l* 85.3%

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

      9. fma-neg 85.3%

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

      10. *-commutative 85.3%

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

      11. fma-define 85.3%

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

      12. *-commutative 85.3%

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

      13. distribute-frac-neg 85.3%

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

      14. remove-double-neg 85.3%

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

   3. Simplified 85.3%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 96.1%

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

      1. sub-neg 96.1%

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

      2. metadata-eval 96.1%

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

      3. associate-*r/ 96.1%

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

      4. metadata-eval 96.1%

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

      5. associate-/l/ 96.2%

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

      6. *-rgt-identity 96.2%

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

      7. associate-*r/ 96.1%

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

      8. distribute-rgt-in 96.1%

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

      9. associate-*l/ 96.2%

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

      10. *-lft-identity 96.2%

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

      11. +-commutative 96.2%

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

   10. Simplified 96.2%

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

   11. Taylor expanded in z around inf 59.9%

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

       1. sub-neg 59.9%

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

       2. associate-*r/ 59.9%

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

       3. metadata-eval 59.9%

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

       4. metadata-eval 59.9%

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

       5. +-commutative 59.9%

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

   13. Simplified 59.9%

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

   if 5.00000000000000041e-6 < (/.f64 x y) < 4e3

   1. Initial program 99.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 z around 0 99.7%

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

      1. associate-/l/ 100.0%

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

   5. Simplified 100.0%

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

Alternative 3: 64.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 5 \cdot 10^{-6}:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{elif}\;\frac{x}{y} \leq 4000:\\ \;\;\;\;\frac{2}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -5e+65)
   (/ x y)
   (if (<= (/ x y) 5e-6)
     (+ -2.0 (/ 2.0 t))
     (if (<= (/ x y) 4000.0) (/ 2.0 (* z t)) (/ x y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 5e-6) {
		tmp = -2.0 + (2.0 / t);
	} else if ((x / y) <= 4000.0) {
		tmp = 2.0 / (z * 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) <= (-5d+65)) then
        tmp = x / y
    else if ((x / y) <= 5d-6) then
        tmp = (-2.0d0) + (2.0d0 / t)
    else if ((x / y) <= 4000.0d0) then
        tmp = 2.0d0 / (z * 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) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 5e-6) {
		tmp = -2.0 + (2.0 / t);
	} else if ((x / y) <= 4000.0) {
		tmp = 2.0 / (z * t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -5e+65)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 5e-6)
		tmp = Float64(-2.0 + Float64(2.0 / t));
	elseif (Float64(x / y) <= 4000.0)
		tmp = Float64(2.0 / Float64(z * 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) <= -5e+65)
		tmp = x / y;
	elseif ((x / y) <= 5e-6)
		tmp = -2.0 + (2.0 / t);
	elseif ((x / y) <= 4000.0)
		tmp = 2.0 / (z * t);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -5e+65], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 5e-6], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 4000.0], N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -4.99999999999999973e65 or 4e3 < (/.f64 x y)

   1. Initial program 83.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 74.4%

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

   if -4.99999999999999973e65 < (/.f64 x y) < 5.00000000000000041e-6

   1. Initial program 85.3%

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

      1. +-commutative 85.3%

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

      2. remove-double-neg 85.3%

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

      3. distribute-frac-neg 85.3%

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

      4. unsub-neg 85.3%

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

      5. *-commutative 85.3%

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

      6. associate-*r* 85.3%

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

      7. distribute-rgt1-in 85.3%

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

      8. associate-/l* 85.3%

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

      9. fma-neg 85.3%

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

      10. *-commutative 85.3%

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

      11. fma-define 85.3%

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

      12. *-commutative 85.3%

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

      13. distribute-frac-neg 85.3%

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

      14. remove-double-neg 85.3%

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

   3. Simplified 85.3%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 96.1%

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

      1. sub-neg 96.1%

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

      2. metadata-eval 96.1%

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

      3. associate-*r/ 96.1%

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

      4. metadata-eval 96.1%

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

      5. associate-/l/ 96.2%

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

      6. *-rgt-identity 96.2%

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

      7. associate-*r/ 96.1%

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

      8. distribute-rgt-in 96.1%

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

      9. associate-*l/ 96.2%

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

      10. *-lft-identity 96.2%

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

      11. +-commutative 96.2%

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

   10. Simplified 96.2%

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

   11. Taylor expanded in z around inf 59.9%

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

       1. sub-neg 59.9%

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

       2. associate-*r/ 59.9%

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

       3. metadata-eval 59.9%

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

       4. metadata-eval 59.9%

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

       5. +-commutative 59.9%

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

   13. Simplified 59.9%

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

   if 5.00000000000000041e-6 < (/.f64 x y) < 4e3

   1. Initial program 99.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 z around 0 99.7%

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

4. Final simplification 66.7%

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

Alternative 4: 51.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq -5 \cdot 10^{-92}:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{elif}\;\frac{x}{y} \leq 0.02:\\ \;\;\;\;-2\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -5e+65)
   (/ x y)
   (if (<= (/ x y) -5e-92) (/ 2.0 t) (if (<= (/ x y) 0.02) -2.0 (/ x y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= -5e-92) {
		tmp = 2.0 / t;
	} else if ((x / y) <= 0.02) {
		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) <= (-5d+65)) then
        tmp = x / y
    else if ((x / y) <= (-5d-92)) then
        tmp = 2.0d0 / t
    else if ((x / y) <= 0.02d0) 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) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= -5e-92) {
		tmp = 2.0 / t;
	} else if ((x / y) <= 0.02) {
		tmp = -2.0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -5e+65:
		tmp = x / y
	elif (x / y) <= -5e-92:
		tmp = 2.0 / t
	elif (x / y) <= 0.02:
		tmp = -2.0
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -5e+65)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= -5e-92)
		tmp = Float64(2.0 / t);
	elseif (Float64(x / y) <= 0.02)
		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) <= -5e+65)
		tmp = x / y;
	elseif ((x / y) <= -5e-92)
		tmp = 2.0 / t;
	elseif ((x / y) <= 0.02)
		tmp = -2.0;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -5e+65], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], -5e-92], N[(2.0 / t), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 0.02], -2.0, N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -4.99999999999999973e65 or 0.0200000000000000004 < (/.f64 x y)

   1. Initial program 84.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 x around inf 72.4%

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

   if -4.99999999999999973e65 < (/.f64 x y) < -5.00000000000000011e-92

   1. Initial program 90.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 t around 0 78.0%

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

      1. associate-*r/ 78.0%

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

      2. metadata-eval 78.0%

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

   5. Simplified 78.0%

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

   6. Taylor expanded in z around inf 38.7%

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

   if -5.00000000000000011e-92 < (/.f64 x y) < 0.0200000000000000004

   1. Initial program 84.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 t around inf 38.1%

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

   4. Taylor expanded in x around 0 37.3%

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

Alternative 5: 88.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1 \cdot 10^{+119} \lor \neg \left(\frac{x}{y} \leq 4000\right):\\ \;\;\;\;\frac{x}{y} + \left(-2 + \frac{2}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + \frac{2}{z}}{t} + -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -1e+119) (not (<= (/ x y) 4000.0)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ (/ (+ 2.0 (/ 2.0 z)) t) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else {
		tmp = ((2.0 + (2.0 / z)) / t) + -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) <= (-1d+119)) .or. (.not. ((x / y) <= 4000.0d0))) then
        tmp = (x / y) + ((-2.0d0) + (2.0d0 / t))
    else
        tmp = ((2.0d0 + (2.0d0 / z)) / t) + (-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) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else {
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -1e+119) or not ((x / y) <= 4000.0):
		tmp = (x / y) + (-2.0 + (2.0 / t))
	else:
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -1e+119) || !(Float64(x / y) <= 4000.0))
		tmp = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)));
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(2.0 / z)) / t) + -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x / y) <= -1e+119) || ~(((x / y) <= 4000.0)))
		tmp = (x / y) + (-2.0 + (2.0 / t));
	else
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(x / y), $MachinePrecision], -1e+119], N[Not[LessEqual[N[(x / y), $MachinePrecision], 4000.0]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] + N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -9.99999999999999944e118 or 4e3 < (/.f64 x y)

   1. Initial program 83.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 88.0%

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

      1. div-sub 88.0%

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

      2. sub-neg 88.0%

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

      3. *-inverses 88.0%

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

      4. metadata-eval 88.0%

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

      5. distribute-lft-in 88.0%

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

      6. associate-*r/ 88.0%

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

      7. metadata-eval 88.0%

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

      8. metadata-eval 88.0%

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

   5. Simplified 88.0%

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

   if -9.99999999999999944e118 < (/.f64 x y) < 4e3

   1. Initial program 85.9%

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

      1. +-commutative 85.9%

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

      2. remove-double-neg 85.9%

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

      3. distribute-frac-neg 85.9%

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

      4. unsub-neg 85.9%

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

      5. *-commutative 85.9%

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

      6. associate-*r* 85.9%

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

      7. distribute-rgt1-in 85.9%

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

      8. associate-/l* 85.9%

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

      9. fma-neg 85.9%

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

      10. *-commutative 85.9%

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

      11. fma-define 85.9%

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

      12. *-commutative 85.9%

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

      13. distribute-frac-neg 85.9%

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

      14. remove-double-neg 85.9%

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

   3. Simplified 85.9%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 94.7%

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

      1. sub-neg 94.7%

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

      2. metadata-eval 94.7%

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

      3. associate-*r/ 94.7%

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

      4. metadata-eval 94.7%

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

      5. associate-/l/ 94.7%

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

      6. *-rgt-identity 94.7%

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

      7. associate-*r/ 94.6%

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

      8. distribute-rgt-in 94.7%

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

      9. associate-*l/ 94.7%

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

      10. *-lft-identity 94.7%

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

      11. +-commutative 94.7%

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

   10. Simplified 94.7%

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

4. Final simplification 92.2%

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

Alternative 6: 84.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1 \cdot 10^{+119} \lor \neg \left(\frac{x}{y} \leq 4000\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + \frac{2}{z}}{t} + -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -1e+119) (not (<= (/ x y) 4000.0)))
   (/ x y)
   (+ (/ (+ 2.0 (/ 2.0 z)) t) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = x / y;
	} else {
		tmp = ((2.0 + (2.0 / z)) / t) + -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) <= (-1d+119)) .or. (.not. ((x / y) <= 4000.0d0))) then
        tmp = x / y
    else
        tmp = ((2.0d0 + (2.0d0 / z)) / t) + (-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) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = x / y;
	} else {
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -1e+119) or not ((x / y) <= 4000.0):
		tmp = x / y
	else:
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -1e+119) || !(Float64(x / y) <= 4000.0))
		tmp = Float64(x / y);
	else
		tmp = Float64(Float64(Float64(2.0 + Float64(2.0 / z)) / t) + -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x / y) <= -1e+119) || ~(((x / y) <= 4000.0)))
		tmp = x / y;
	else
		tmp = ((2.0 + (2.0 / z)) / t) + -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(x / y), $MachinePrecision], -1e+119], N[Not[LessEqual[N[(x / y), $MachinePrecision], 4000.0]], $MachinePrecision]], N[(x / y), $MachinePrecision], N[(N[(N[(2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] + -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -9.99999999999999944e118 or 4e3 < (/.f64 x y)

   1. Initial program 83.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 x around inf 76.5%

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

   if -9.99999999999999944e118 < (/.f64 x y) < 4e3

   1. Initial program 85.9%

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

      1. +-commutative 85.9%

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

      2. remove-double-neg 85.9%

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

      3. distribute-frac-neg 85.9%

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

      4. unsub-neg 85.9%

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

      5. *-commutative 85.9%

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

      6. associate-*r* 85.9%

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

      7. distribute-rgt1-in 85.9%

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

      8. associate-/l* 85.9%

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

      9. fma-neg 85.9%

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

      10. *-commutative 85.9%

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

      11. fma-define 85.9%

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

      12. *-commutative 85.9%

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

      13. distribute-frac-neg 85.9%

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

      14. remove-double-neg 85.9%

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

   3. Simplified 85.9%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 94.7%

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

      1. sub-neg 94.7%

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

      2. metadata-eval 94.7%

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

      3. associate-*r/ 94.7%

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

      4. metadata-eval 94.7%

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

      5. associate-/l/ 94.7%

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

      6. *-rgt-identity 94.7%

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

      7. associate-*r/ 94.6%

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

      8. distribute-rgt-in 94.7%

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

      9. associate-*l/ 94.7%

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

      10. *-lft-identity 94.7%

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

      11. +-commutative 94.7%

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

   10. Simplified 94.7%

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

4. Final simplification 87.8%

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

Alternative 7: 65.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} - 2\\ \mathbf{if}\;t \leq -10600000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq -3.8 \cdot 10^{-210}:\\ \;\;\;\;\frac{\frac{2}{z}}{t}\\ \mathbf{elif}\;t \leq 8.5 \cdot 10^{-6}:\\ \;\;\;\;2 \cdot \frac{z}{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 (<= t -10600000000.0)
     t_1
     (if (<= t -3.8e-210)
       (/ (/ 2.0 z) t)
       (if (<= t 8.5e-6) (* 2.0 (/ z (* 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 (t <= -10600000000.0) {
		tmp = t_1;
	} else if (t <= -3.8e-210) {
		tmp = (2.0 / z) / t;
	} else if (t <= 8.5e-6) {
		tmp = 2.0 * (z / (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 (t <= (-10600000000.0d0)) then
        tmp = t_1
    else if (t <= (-3.8d-210)) then
        tmp = (2.0d0 / z) / t
    else if (t <= 8.5d-6) then
        tmp = 2.0d0 * (z / (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 (t <= -10600000000.0) {
		tmp = t_1;
	} else if (t <= -3.8e-210) {
		tmp = (2.0 / z) / t;
	} else if (t <= 8.5e-6) {
		tmp = 2.0 * (z / (z * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) - 2.0
	tmp = 0
	if t <= -10600000000.0:
		tmp = t_1
	elif t <= -3.8e-210:
		tmp = (2.0 / z) / t
	elif t <= 8.5e-6:
		tmp = 2.0 * (z / (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 (t <= -10600000000.0)
		tmp = t_1;
	elseif (t <= -3.8e-210)
		tmp = Float64(Float64(2.0 / z) / t);
	elseif (t <= 8.5e-6)
		tmp = Float64(2.0 * Float64(z / 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 (t <= -10600000000.0)
		tmp = t_1;
	elseif (t <= -3.8e-210)
		tmp = (2.0 / z) / t;
	elseif (t <= 8.5e-6)
		tmp = 2.0 * (z / (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[t, -10600000000.0], t$95$1, If[LessEqual[t, -3.8e-210], N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision], If[LessEqual[t, 8.5e-6], N[(2.0 * N[(z / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.06e10 or 8.4999999999999999e-6 < t

   1. Initial program 68.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 82.9%

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

   if -1.06e10 < t < -3.80000000000000003e-210

   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 z around 0 45.9%

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

      1. associate-/l/ 46.0%

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

   5. Simplified 46.0%

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

   if -3.80000000000000003e-210 < t < 8.4999999999999999e-6

   1. Initial program 99.7%

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

      1. +-commutative 99.7%

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

      2. remove-double-neg 99.7%

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

      3. distribute-frac-neg 99.7%

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

      4. unsub-neg 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-*r* 99.7%

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

      7. distribute-rgt1-in 99.7%

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

      8. associate-/l* 99.7%

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

      9. fma-neg 99.7%

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

      10. *-commutative 99.7%

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

      11. fma-define 99.7%

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

      12. *-commutative 99.7%

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

      13. distribute-frac-neg 99.7%

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

      14. remove-double-neg 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in t around 0 87.3%

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

   6. Taylor expanded in z around inf 60.0%

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

4. Final simplification 67.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -10600000000:\\ \;\;\;\;\frac{x}{y} - 2\\ \mathbf{elif}\;t \leq -3.8 \cdot 10^{-210}:\\ \;\;\;\;\frac{\frac{2}{z}}{t}\\ \mathbf{elif}\;t \leq 8.5 \cdot 10^{-6}:\\ \;\;\;\;2 \cdot \frac{z}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} - 2\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -240000 \lor \neg \left(z \leq 1\right):\\ \;\;\;\;\frac{x}{y} + \left(-2 + \frac{2}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} + \left(-2 + \frac{\frac{2}{z}}{t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -240000.0) (not (<= z 1.0)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ (/ x y) (+ -2.0 (/ (/ 2.0 z) t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -240000.0) || !(z <= 1.0)) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else {
		tmp = (x / y) + (-2.0 + ((2.0 / z) / t));
	}
	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 ((z <= (-240000.0d0)) .or. (.not. (z <= 1.0d0))) then
        tmp = (x / y) + ((-2.0d0) + (2.0d0 / t))
    else
        tmp = (x / y) + ((-2.0d0) + ((2.0d0 / z) / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -240000.0) || !(z <= 1.0)) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else {
		tmp = (x / y) + (-2.0 + ((2.0 / z) / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -240000.0) or not (z <= 1.0):
		tmp = (x / y) + (-2.0 + (2.0 / t))
	else:
		tmp = (x / y) + (-2.0 + ((2.0 / z) / t))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -240000.0) || ~((z <= 1.0)))
		tmp = (x / y) + (-2.0 + (2.0 / t));
	else
		tmp = (x / y) + (-2.0 + ((2.0 / z) / t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.4e5 or 1 < z

   1. Initial program 72.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 z around inf 99.7%

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

      1. div-sub 99.7%

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

      2. sub-neg 99.7%

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

      3. *-inverses 99.7%

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

      4. metadata-eval 99.7%

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

      5. distribute-lft-in 99.7%

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

      6. associate-*r/ 99.7%

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

      7. metadata-eval 99.7%

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

      8. metadata-eval 99.7%

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

   5. Simplified 99.7%

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

   if -2.4e5 < z < 1

   1. Initial program 98.1%

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

      1. +-commutative 98.1%

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

      2. remove-double-neg 98.1%

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

      3. distribute-frac-neg 98.1%

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

      4. unsub-neg 98.1%

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

      5. *-commutative 98.1%

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

      6. associate-*r* 98.1%

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

      7. distribute-rgt1-in 98.1%

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

      8. associate-/l* 98.1%

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

      9. fma-neg 98.1%

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

      10. *-commutative 98.1%

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

      11. fma-define 98.1%

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

      12. *-commutative 98.1%

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

      13. distribute-frac-neg 98.1%

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

      14. remove-double-neg 98.1%

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

   3. Simplified 98.1%

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

   5. Taylor expanded in t around inf 99.1%

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

      1. sub-neg 99.1%

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

      2. +-commutative 99.1%

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

      3. metadata-eval 99.1%

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

      4. associate-+l+ 99.1%

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

      5. associate-*r/ 99.1%

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

      6. distribute-lft-in 99.1%

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

      7. metadata-eval 99.1%

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

      8. associate-*r/ 99.1%

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

      9. metadata-eval 99.1%

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

   7. Simplified 99.1%

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

   8. Taylor expanded in z around 0 97.6%

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

4. Final simplification 98.7%

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

Alternative 9: 70.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1 \cdot 10^{+119} \lor \neg \left(\frac{x}{y} \leq 4000\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;-2 + \frac{\frac{2}{z}}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -1e+119) (not (<= (/ x y) 4000.0)))
   (/ x y)
   (+ -2.0 (/ (/ 2.0 z) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = x / y;
	} else {
		tmp = -2.0 + ((2.0 / z) / t);
	}
	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) <= (-1d+119)) .or. (.not. ((x / y) <= 4000.0d0))) then
        tmp = x / y
    else
        tmp = (-2.0d0) + ((2.0d0 / z) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -1e+119) || !((x / y) <= 4000.0)) {
		tmp = x / y;
	} else {
		tmp = -2.0 + ((2.0 / z) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -1e+119) or not ((x / y) <= 4000.0):
		tmp = x / y
	else:
		tmp = -2.0 + ((2.0 / z) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -1e+119) || !(Float64(x / y) <= 4000.0))
		tmp = Float64(x / y);
	else
		tmp = Float64(-2.0 + Float64(Float64(2.0 / z) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x / y) <= -1e+119) || ~(((x / y) <= 4000.0)))
		tmp = x / y;
	else
		tmp = -2.0 + ((2.0 / z) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(x / y), $MachinePrecision], -1e+119], N[Not[LessEqual[N[(x / y), $MachinePrecision], 4000.0]], $MachinePrecision]], N[(x / y), $MachinePrecision], N[(-2.0 + N[(N[(2.0 / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -9.99999999999999944e118 or 4e3 < (/.f64 x y)

   1. Initial program 83.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 x around inf 76.5%

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

   if -9.99999999999999944e118 < (/.f64 x y) < 4e3

   1. Initial program 85.9%

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

      1. +-commutative 85.9%

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

      2. remove-double-neg 85.9%

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

      3. distribute-frac-neg 85.9%

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

      4. unsub-neg 85.9%

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

      5. *-commutative 85.9%

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

      6. associate-*r* 85.9%

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

      7. distribute-rgt1-in 85.9%

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

      8. associate-/l* 85.9%

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

      9. fma-neg 85.9%

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

      10. *-commutative 85.9%

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

      11. fma-define 85.9%

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

      12. *-commutative 85.9%

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

      13. distribute-frac-neg 85.9%

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

      14. remove-double-neg 85.9%

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

   3. Simplified 85.9%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 94.7%

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

      1. sub-neg 94.7%

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

      2. metadata-eval 94.7%

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

      3. associate-*r/ 94.7%

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

      4. metadata-eval 94.7%

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

      5. associate-/l/ 94.7%

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

      6. *-rgt-identity 94.7%

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

      7. associate-*r/ 94.6%

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

      8. distribute-rgt-in 94.7%

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

      9. associate-*l/ 94.7%

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

      10. *-lft-identity 94.7%

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

      11. +-commutative 94.7%

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

   10. Simplified 94.7%

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

   11. Taylor expanded in z around 0 67.6%

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

4. Final simplification 71.0%

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

Alternative 10: 64.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65} \lor \neg \left(\frac{x}{y} \leq 0.02\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;-2 + \frac{2}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -5e+65) (not (<= (/ x y) 0.02)))
   (/ x y)
   (+ -2.0 (/ 2.0 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -5e+65) || !((x / y) <= 0.02)) {
		tmp = x / y;
	} else {
		tmp = -2.0 + (2.0 / t);
	}
	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) <= (-5d+65)) .or. (.not. ((x / y) <= 0.02d0))) then
        tmp = x / y
    else
        tmp = (-2.0d0) + (2.0d0 / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x / y) <= -5e+65) || !((x / y) <= 0.02)) {
		tmp = x / y;
	} else {
		tmp = -2.0 + (2.0 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -5e+65) or not ((x / y) <= 0.02):
		tmp = x / y
	else:
		tmp = -2.0 + (2.0 / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -5e+65) || !(Float64(x / y) <= 0.02))
		tmp = Float64(x / y);
	else
		tmp = Float64(-2.0 + Float64(2.0 / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x / y) <= -5e+65) || ~(((x / y) <= 0.02)))
		tmp = x / y;
	else
		tmp = -2.0 + (2.0 / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(x / y), $MachinePrecision], -5e+65], N[Not[LessEqual[N[(x / y), $MachinePrecision], 0.02]], $MachinePrecision]], N[(x / y), $MachinePrecision], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -4.99999999999999973e65 or 0.0200000000000000004 < (/.f64 x y)

   1. Initial program 84.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 x around inf 72.4%

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

   if -4.99999999999999973e65 < (/.f64 x y) < 0.0200000000000000004

   1. Initial program 85.6%

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

      1. +-commutative 85.6%

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

      2. remove-double-neg 85.6%

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

      3. distribute-frac-neg 85.6%

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

      4. unsub-neg 85.6%

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

      5. *-commutative 85.6%

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

      6. associate-*r* 85.6%

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

      7. distribute-rgt1-in 85.6%

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

      8. associate-/l* 85.6%

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

      9. fma-neg 85.6%

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

      10. *-commutative 85.6%

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

      11. fma-define 85.6%

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

      12. *-commutative 85.6%

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

      13. distribute-frac-neg 85.6%

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

      14. remove-double-neg 85.6%

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

   3. Simplified 85.6%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 96.2%

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

      1. sub-neg 96.2%

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

      2. metadata-eval 96.2%

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

      3. associate-*r/ 96.2%

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

      4. metadata-eval 96.2%

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

      5. associate-/l/ 96.3%

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

      6. *-rgt-identity 96.3%

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

      7. associate-*r/ 96.2%

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

      8. distribute-rgt-in 96.2%

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

      9. associate-*l/ 96.3%

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

      10. *-lft-identity 96.3%

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

      11. +-commutative 96.3%

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

   10. Simplified 96.3%

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

   11. Taylor expanded in z around inf 58.7%

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

       1. sub-neg 58.7%

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

       2. associate-*r/ 58.7%

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

       3. metadata-eval 58.7%

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

       4. metadata-eval 58.7%

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

       5. +-commutative 58.7%

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

   13. Simplified 58.7%

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

4. Final simplification 64.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65} \lor \neg \left(\frac{x}{y} \leq 0.02\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;-2 + \frac{2}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 64.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -5 \cdot 10^{+65}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 2 \cdot 10^{-37}:\\ \;\;\;\;-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) -5e+65)
   (/ x y)
   (if (<= (/ x y) 2e-37) (+ -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) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 2e-37) {
		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) <= (-5d+65)) then
        tmp = x / y
    else if ((x / y) <= 2d-37) 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) <= -5e+65) {
		tmp = x / y;
	} else if ((x / y) <= 2e-37) {
		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) <= -5e+65:
		tmp = x / y
	elif (x / y) <= 2e-37:
		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) <= -5e+65)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 2e-37)
		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) <= -5e+65)
		tmp = x / y;
	elseif ((x / y) <= 2e-37)
		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], -5e+65], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 2e-37], 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) < -4.99999999999999973e65

   1. Initial program 90.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 80.9%

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

   if -4.99999999999999973e65 < (/.f64 x y) < 2.00000000000000013e-37

   1. Initial program 87.6%

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

      1. +-commutative 87.6%

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

      2. remove-double-neg 87.6%

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

      3. distribute-frac-neg 87.6%

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

      4. unsub-neg 87.6%

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

      5. *-commutative 87.6%

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

      6. associate-*r* 87.6%

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

      7. distribute-rgt1-in 87.6%

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

      8. associate-/l* 87.6%

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

      9. fma-neg 87.6%

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

      10. *-commutative 87.6%

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

      11. fma-define 87.6%

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

      12. *-commutative 87.6%

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

      13. distribute-frac-neg 87.6%

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

      14. remove-double-neg 87.6%

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

   3. Simplified 87.6%

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

   5. Taylor expanded in t around inf 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. metadata-eval 99.9%

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

      4. associate-+l+ 99.9%

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

      5. associate-*r/ 99.9%

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

      6. distribute-lft-in 99.9%

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

      7. metadata-eval 99.9%

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

      8. associate-*r/ 99.9%

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

      9. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 96.7%

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

      1. sub-neg 96.7%

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

      2. metadata-eval 96.7%

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

      3. associate-*r/ 96.7%

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

      4. metadata-eval 96.7%

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

      5. associate-/l/ 96.7%

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

      6. *-rgt-identity 96.7%

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

      7. associate-*r/ 96.6%

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

      8. distribute-rgt-in 96.6%

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

      9. associate-*l/ 96.7%

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

      10. *-lft-identity 96.7%

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

      11. +-commutative 96.7%

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

   10. Simplified 96.7%

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

   11. Taylor expanded in z around inf 59.1%

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

       1. sub-neg 59.1%

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

       2. associate-*r/ 59.1%

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

       3. metadata-eval 59.1%

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

       4. metadata-eval 59.1%

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

       5. +-commutative 59.1%

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

   13. Simplified 59.1%

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

   if 2.00000000000000013e-37 < (/.f64 x y)

   1. Initial program 74.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 inf 64.6%

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

Alternative 12: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -180000000000 \lor \neg \left(t \leq 0.122\right):\\ \;\;\;\;\frac{x}{y} - 2\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + \frac{2}{z}}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -180000000000.0) (not (<= t 0.122)))
   (- (/ x y) 2.0)
   (/ (+ 2.0 (/ 2.0 z)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -180000000000.0) || !(t <= 0.122)) {
		tmp = (x / y) - 2.0;
	} else {
		tmp = (2.0 + (2.0 / z)) / t;
	}
	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 <= (-180000000000.0d0)) .or. (.not. (t <= 0.122d0))) then
        tmp = (x / y) - 2.0d0
    else
        tmp = (2.0d0 + (2.0d0 / z)) / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -180000000000.0) || !(t <= 0.122)) {
		tmp = (x / y) - 2.0;
	} else {
		tmp = (2.0 + (2.0 / z)) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -180000000000.0) or not (t <= 0.122):
		tmp = (x / y) - 2.0
	else:
		tmp = (2.0 + (2.0 / z)) / t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -180000000000.0) || !(t <= 0.122))
		tmp = Float64(Float64(x / y) - 2.0);
	else
		tmp = Float64(Float64(2.0 + Float64(2.0 / z)) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -180000000000.0) || ~((t <= 0.122)))
		tmp = (x / y) - 2.0;
	else
		tmp = (2.0 + (2.0 / z)) / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -180000000000.0], N[Not[LessEqual[t, 0.122]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision], N[(N[(2.0 + N[(2.0 / z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.8e11 or 0.122 < t

   1. Initial program 68.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 82.9%

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

   if -1.8e11 < t < 0.122

   1. Initial program 98.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 80.7%

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

      1. associate-*r/ 80.7%

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

      2. metadata-eval 80.7%

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

   5. Simplified 80.7%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -180000000000 \lor \neg \left(t \leq 0.122\right):\\ \;\;\;\;\frac{x}{y} - 2\\ \mathbf{else}:\\ \;\;\;\;\frac{2 + \frac{2}{z}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 37.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.16 \cdot 10^{-11}:\\ \;\;\;\;-2\\ \mathbf{elif}\;t \leq 0.95:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -1.16e-11) -2.0 (if (<= t 0.95) (/ 2.0 t) -2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -1.16e-11) {
		tmp = -2.0;
	} else if (t <= 0.95) {
		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.16d-11)) then
        tmp = -2.0d0
    else if (t <= 0.95d0) 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.16e-11) {
		tmp = -2.0;
	} else if (t <= 0.95) {
		tmp = 2.0 / t;
	} else {
		tmp = -2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -1.16e-11:
		tmp = -2.0
	elif t <= 0.95:
		tmp = 2.0 / t
	else:
		tmp = -2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -1.16e-11)
		tmp = -2.0;
	elseif (t <= 0.95)
		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.16e-11)
		tmp = -2.0;
	elseif (t <= 0.95)
		tmp = 2.0 / t;
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -1.16e-11], -2.0, If[LessEqual[t, 0.95], N[(2.0 / t), $MachinePrecision], -2.0]]

Derivation

1. Split input into 2 regimes

2. if t < -1.1600000000000001e-11 or 0.94999999999999996 < t

   1. Initial program 70.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 80.6%

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

   4. Taylor expanded in x around 0 37.1%

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

   if -1.1600000000000001e-11 < t < 0.94999999999999996

   1. Initial program 98.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 81.3%

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

      1. associate-*r/ 81.3%

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

      2. metadata-eval 81.3%

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

   5. Simplified 81.3%

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

   6. Taylor expanded in z around inf 41.7%

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

Alternative 14: 20.8% accurate, 17.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 84.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 inf 50.4%

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

4. Taylor expanded in x around 0 19.4%

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

Developer Target 1: 99.0% accurate, 1.3× 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 2024144 
(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))))