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

Percentage Accurate: 87.1% → 99.2%

Time: 10.0s

Alternatives: 14

Speedup: 1.3×

• 24.0% 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: 87.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.2% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

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) + (x / y)) + ((2.0d0 + (2.0d0 / z)) / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.8%

   \[\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.8%

      \[\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.8%

      \[\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.8%

      \[\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.8%

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

   5. *-commutative 85.8%

      \[\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.8%

      \[\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.8%

      \[\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.8%

      \[\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.8%

      \[\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.8%

       \[\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.8%

       \[\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.8%

       \[\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.8%

       \[\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.8%

       \[\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.8%

   \[\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. associate--l+ 99.5%

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

   2. +-commutative 99.5%

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

   3. sub-neg 99.5%

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

   4. metadata-eval 99.5%

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

   5. +-commutative 99.5%

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

   6. associate-*r/ 99.5%

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

   7. distribute-lft-in 99.5%

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

   8. metadata-eval 99.5%

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

   9. associate-*r/ 99.5%

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

   10. metadata-eval 99.5%

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

7. Simplified 99.5%

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

8. Final simplification 99.5%

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

Alternative 2: 91.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -8.0) (not (<= (/ x y) 4.1e+80)))
   (+ (/ x y) (/ (/ 2.0 t) z))
   (+ (/ 2.0 (* z t)) (+ -2.0 (/ 2.0 t)))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -8.0) or not ((x / y) <= 4.1e+80):
		tmp = (x / y) + ((2.0 / t) / z)
	else:
		tmp = (2.0 / (z * t)) + (-2.0 + (2.0 / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -8.0) || !(Float64(x / y) <= 4.1e+80))
		tmp = Float64(Float64(x / y) + Float64(Float64(2.0 / t) / z));
	else
		tmp = Float64(Float64(2.0 / Float64(z * t)) + 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) <= -8.0) || ~(((x / y) <= 4.1e+80)))
		tmp = (x / y) + ((2.0 / t) / z);
	else
		tmp = (2.0 / (z * t)) + (-2.0 + (2.0 / t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -8 or 4.10000000000000001e80 < (/.f64 x y)

   1. Initial program 84.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 89.3%

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

      1. associate-/r* 89.3%

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

   5. Simplified 89.3%

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

   if -8 < (/.f64 x y) < 4.10000000000000001e80

   1. Initial program 86.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 86.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 86.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 86.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 86.9%

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

      5. *-commutative 86.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* 86.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 86.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* 86.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 86.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 86.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 86.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 86.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 86.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 86.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 86.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. associate--l+ 99.9%

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

      2. +-commutative 99.9%

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

      3. sub-neg 99.9%

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

      4. metadata-eval 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-*r/ 99.9%

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

      7. distribute-lft-in 99.9%

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

      8. metadata-eval 99.9%

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

      9. associate-*r/ 99.9%

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

      10. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 97.5%

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

      1. associate--l+ 97.5%

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

      2. associate-*r/ 97.5%

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

      3. metadata-eval 97.5%

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

      4. sub-neg 97.5%

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

      5. metadata-eval 97.5%

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

      6. associate-+l+ 97.5%

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

      7. +-commutative 97.5%

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

      8. associate-+l+ 97.5%

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

      9. associate-*r/ 97.5%

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

      10. metadata-eval 97.5%

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

   10. Simplified 97.5%

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

4. Final simplification 93.8%

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

Alternative 3: 70.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1.1 \cdot 10^{+62}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 1.85 \cdot 10^{+70}:\\ \;\;\;\;-2 + \frac{2}{z \cdot t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} - 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -1.1e+62)
   (/ x y)
   (if (<= (/ x y) 1.85e+70) (+ -2.0 (/ 2.0 (* z t))) (- (/ x y) 2.0))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.1e+62) {
		tmp = x / y;
	} else if ((x / y) <= 1.85e+70) {
		tmp = -2.0 + (2.0 / (z * t));
	} else {
		tmp = (x / y) - 2.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-1.1d+62)) then
        tmp = x / y
    else if ((x / y) <= 1.85d+70) then
        tmp = (-2.0d0) + (2.0d0 / (z * t))
    else
        tmp = (x / y) - 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.1e+62) {
		tmp = x / y;
	} else if ((x / y) <= 1.85e+70) {
		tmp = -2.0 + (2.0 / (z * t));
	} else {
		tmp = (x / y) - 2.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -1.1e+62:
		tmp = x / y
	elif (x / y) <= 1.85e+70:
		tmp = -2.0 + (2.0 / (z * t))
	else:
		tmp = (x / y) - 2.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -1.1e+62)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 1.85e+70)
		tmp = Float64(-2.0 + Float64(2.0 / Float64(z * t)));
	else
		tmp = Float64(Float64(x / y) - 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -1.1e+62)
		tmp = x / y;
	elseif ((x / y) <= 1.85e+70)
		tmp = -2.0 + (2.0 / (z * t));
	else
		tmp = (x / y) - 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -1.1e+62], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 1.85e+70], N[(-2.0 + N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -1.10000000000000007e62

   1. Initial program 84.8%

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

   3. Taylor expanded in x around inf 75.0%

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

   if -1.10000000000000007e62 < (/.f64 x y) < 1.84999999999999994e70

   1. Initial program 86.0%

      \[\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 86.0%

         \[\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 86.0%

         \[\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 86.0%

         \[\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 86.0%

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

      5. *-commutative 86.0%

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

      6. associate-*r* 86.0%

         \[\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 86.0%

         \[\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. associate--l+ 99.9%

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

      2. +-commutative 99.9%

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

      3. sub-neg 99.9%

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

      4. metadata-eval 99.9%

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

      5. +-commutative 99.9%

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

      6. associate-*r/ 99.9%

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

      7. distribute-lft-in 99.9%

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

      8. metadata-eval 99.9%

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

      9. associate-*r/ 99.9%

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

      10. metadata-eval 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 93.3%

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

      1. associate--l+ 93.3%

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

      2. associate-*r/ 93.3%

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

      3. metadata-eval 93.3%

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

      4. sub-neg 93.3%

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

      5. metadata-eval 93.3%

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

      6. associate-+l+ 93.3%

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

      7. +-commutative 93.3%

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

      8. associate-+l+ 93.3%

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

      9. associate-*r/ 93.3%

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

      10. metadata-eval 93.3%

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

   10. Simplified 93.3%

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

   11. Taylor expanded in t around inf 74.2%

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

   if 1.84999999999999994e70 < (/.f64 x y)

   1. Initial program 86.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 84.2%

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

4. Final simplification 76.4%

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

Alternative 4: 63.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -0.25 \lor \neg \left(\frac{x}{y} \leq 4.4 \cdot 10^{+80}\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) -0.25) (not (<= (/ x y) 4.4e+80)))
   (/ x y)
   (+ -2.0 (/ 2.0 t))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -0.25) or not ((x / y) <= 4.4e+80):
		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) <= -0.25) || !(Float64(x / y) <= 4.4e+80))
		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) <= -0.25) || ~(((x / y) <= 4.4e+80)))
		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], -0.25], N[Not[LessEqual[N[(x / y), $MachinePrecision], 4.4e+80]], $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) < -0.25 or 4.40000000000000005e80 < (/.f64 x y)

   1. Initial program 84.6%

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

   3. Taylor expanded in x around inf 72.0%

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

   if -0.25 < (/.f64 x y) < 4.40000000000000005e80

   1. Initial program 86.8%

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

   3. Taylor expanded in z around inf 61.6%

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

      1. div-sub 61.6%

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

      2. sub-neg 61.6%

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

      3. *-inverses 61.6%

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

      4. metadata-eval 61.6%

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

      5. distribute-lft-in 61.6%

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

      6. associate-*r/ 61.6%

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

      7. metadata-eval 61.6%

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

      8. metadata-eval 61.6%

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

   5. Simplified 61.6%

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

   6. Taylor expanded in x around 0 59.2%

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

      1. sub-neg 59.2%

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

      2. associate-*r/ 59.2%

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

      3. metadata-eval 59.2%

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

      4. metadata-eval 59.2%

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

   8. Simplified 59.2%

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

4. Final simplification 65.0%

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

Alternative 5: 79.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -4300000000.0) (not (<= t 3.7e+26)))
   (- (/ x y) 2.0)
   (* (+ 2.0 (/ 2.0 z)) (/ 1.0 t))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.3e9 or 3.69999999999999988e26 < t

   1. Initial program 71.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 88.5%

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

   if -4.3e9 < t < 3.69999999999999988e26

   1. Initial program 99.1%

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

   3. Taylor expanded in t around 0 76.0%

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

      1. associate-*r/ 76.0%

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

      2. metadata-eval 76.0%

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

   5. Simplified 76.0%

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

      1. div-inv 76.0%

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

   7. Applied egg-rr 76.0%

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

4. Final simplification 81.9%

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

Alternative 6: 79.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -7.9) (not (<= t 3.7e+26)))
   (- (/ x y) 2.0)
   (+ (/ 2.0 t) (/ 2.0 (* z t)))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -7.9) or not (t <= 3.7e+26):
		tmp = (x / y) - 2.0
	else:
		tmp = (2.0 / t) + (2.0 / (z * t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -7.9) || !(t <= 3.7e+26))
		tmp = Float64(Float64(x / y) - 2.0);
	else
		tmp = Float64(Float64(2.0 / t) + Float64(2.0 / Float64(z * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -7.9) || ~((t <= 3.7e+26)))
		tmp = (x / y) - 2.0;
	else
		tmp = (2.0 / t) + (2.0 / (z * t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -7.9000000000000004 or 3.69999999999999988e26 < t

   1. Initial program 71.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 88.5%

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

   if -7.9000000000000004 < t < 3.69999999999999988e26

   1. Initial program 99.1%

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

   3. Taylor expanded in t around 0 76.0%

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

      1. associate-*r/ 76.0%

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

      2. metadata-eval 76.0%

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

   5. Simplified 76.0%

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

   6. Taylor expanded in z around inf 76.1%

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

      1. associate-*r/ 76.1%

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

      2. metadata-eval 76.1%

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

      3. +-commutative 76.1%

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

      4. associate-*r/ 76.1%

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

      5. metadata-eval 76.1%

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

   8. Simplified 76.1%

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

4. Final simplification 81.9%

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

Alternative 7: 85.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2e-23) (not (<= z 1.95e-43)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ -2.0 (/ 2.0 (* z t)))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2e-23) or not (z <= 1.95e-43):
		tmp = (x / y) + (-2.0 + (2.0 / t))
	else:
		tmp = -2.0 + (2.0 / (z * t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2e-23) || !(z <= 1.95e-43))
		tmp = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)));
	else
		tmp = Float64(-2.0 + Float64(2.0 / Float64(z * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -2e-23) || ~((z <= 1.95e-43)))
		tmp = (x / y) + (-2.0 + (2.0 / t));
	else
		tmp = -2.0 + (2.0 / (z * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -2e-23], N[Not[LessEqual[z, 1.95e-43]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] + N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 + N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.99999999999999992e-23 or 1.95e-43 < z

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

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

      1. div-sub 98.0%

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

      2. sub-neg 98.0%

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

      3. *-inverses 98.0%

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

      4. metadata-eval 98.0%

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

      5. distribute-lft-in 98.0%

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

      6. associate-*r/ 98.0%

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

      7. metadata-eval 98.0%

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

      8. metadata-eval 98.0%

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

   5. Simplified 98.0%

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

   if -1.99999999999999992e-23 < z < 1.95e-43

   1. Initial program 99.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 99.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 99.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 99.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 99.1%

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

      5. *-commutative 99.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* 99.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 99.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* 99.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 99.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 99.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 99.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 99.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 99.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 99.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 99.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.0%

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

      1. associate--l+ 99.0%

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

      2. +-commutative 99.0%

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

      3. sub-neg 99.0%

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

      4. metadata-eval 99.0%

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

      5. +-commutative 99.0%

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

      6. associate-*r/ 99.0%

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

      7. distribute-lft-in 99.0%

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

      8. metadata-eval 99.0%

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

      9. associate-*r/ 99.0%

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

      10. metadata-eval 99.0%

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

   7. Simplified 99.0%

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

   8. Taylor expanded in x around 0 74.9%

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

      1. associate--l+ 74.9%

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

      2. associate-*r/ 74.9%

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

      3. metadata-eval 74.9%

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

      4. sub-neg 74.9%

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

      5. metadata-eval 74.9%

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

      6. associate-+l+ 74.9%

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

      7. +-commutative 74.9%

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

      8. associate-+l+ 74.9%

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

      9. associate-*r/ 74.9%

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

      10. metadata-eval 74.9%

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

   10. Simplified 74.9%

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

   11. Taylor expanded in t around inf 74.9%

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

4. Final simplification 86.7%

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

Alternative 8: 91.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2.5e-25) (not (<= z 6.6e-41)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ (/ x y) (/ (/ 2.0 t) z))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.5e-25) || !(z <= 6.6e-41)) {
		tmp = (x / y) + (-2.0 + (2.0 / t));
	} else {
		tmp = (x / y) + ((2.0 / t) / z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2.5e-25) or not (z <= 6.6e-41):
		tmp = (x / y) + (-2.0 + (2.0 / t))
	else:
		tmp = (x / y) + ((2.0 / t) / z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2.5e-25) || !(z <= 6.6e-41))
		tmp = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)));
	else
		tmp = Float64(Float64(x / y) + Float64(Float64(2.0 / t) / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -2.5e-25) || ~((z <= 6.6e-41)))
		tmp = (x / y) + (-2.0 + (2.0 / t));
	else
		tmp = (x / y) + ((2.0 / t) / z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.49999999999999981e-25 or 6.60000000000000047e-41 < z

   1. Initial program 73.1%

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

   3. Taylor expanded in z around inf 98.0%

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

      1. div-sub 98.0%

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

      2. sub-neg 98.0%

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

      3. *-inverses 98.0%

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

      4. metadata-eval 98.0%

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

      5. distribute-lft-in 98.0%

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

      6. associate-*r/ 98.0%

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

      7. metadata-eval 98.0%

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

      8. metadata-eval 98.0%

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

   5. Simplified 98.0%

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

   if -2.49999999999999981e-25 < z < 6.60000000000000047e-41

   1. Initial program 99.1%

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

   3. Taylor expanded in z around 0 86.7%

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

      1. associate-/r* 86.7%

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

   5. Simplified 86.7%

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

4. Final simplification 92.5%

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

Alternative 9: 63.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -1.65 \cdot 10^{-15}:\\ \;\;\;\;\frac{x}{y} - 2\\ \mathbf{elif}\;\frac{x}{y} \leq 4.1 \cdot 10^{+80}:\\ \;\;\;\;-2 + \frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -1.65e-15)
   (- (/ x y) 2.0)
   (if (<= (/ x y) 4.1e+80) (+ -2.0 (/ 2.0 t)) (/ x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.65e-15) {
		tmp = (x / y) - 2.0;
	} else if ((x / y) <= 4.1e+80) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-1.65d-15)) then
        tmp = (x / y) - 2.0d0
    else if ((x / y) <= 4.1d+80) then
        tmp = (-2.0d0) + (2.0d0 / t)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -1.65e-15) {
		tmp = (x / y) - 2.0;
	} else if ((x / y) <= 4.1e+80) {
		tmp = -2.0 + (2.0 / t);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -1.65e-15:
		tmp = (x / y) - 2.0
	elif (x / y) <= 4.1e+80:
		tmp = -2.0 + (2.0 / t)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -1.65e-15)
		tmp = Float64(Float64(x / y) - 2.0);
	elseif (Float64(x / y) <= 4.1e+80)
		tmp = Float64(-2.0 + Float64(2.0 / t));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -1.65e-15)
		tmp = (x / y) - 2.0;
	elseif ((x / y) <= 4.1e+80)
		tmp = -2.0 + (2.0 / t);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -1.65e-15], N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 4.1e+80], N[(-2.0 + N[(2.0 / t), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -1.65e-15

   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 t around inf 64.2%

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

   if -1.65e-15 < (/.f64 x y) < 4.10000000000000001e80

   1. Initial program 86.7%

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

   3. Taylor expanded in z around inf 61.4%

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

      1. div-sub 61.4%

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

      2. sub-neg 61.4%

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

      3. *-inverses 61.4%

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

      4. metadata-eval 61.4%

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

      5. distribute-lft-in 61.4%

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

      6. associate-*r/ 61.4%

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

      7. metadata-eval 61.4%

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

      8. metadata-eval 61.4%

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

   5. Simplified 61.4%

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

   6. Taylor expanded in x around 0 59.4%

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

      1. sub-neg 59.4%

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

      2. associate-*r/ 59.4%

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

      3. metadata-eval 59.4%

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

      4. metadata-eval 59.4%

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

   8. Simplified 59.4%

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

   if 4.10000000000000001e80 < (/.f64 x y)

   1. Initial program 85.7%

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

   3. Taylor expanded in x around inf 85.5%

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

4. Final simplification 65.7%

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

Alternative 10: 52.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -0.25 or 2 < (/.f64 x y)

   1. Initial program 85.7%

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

   3. Taylor expanded in x around inf 68.5%

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

   if -0.25 < (/.f64 x y) < 2

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

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

      1. div-sub 60.7%

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

      2. sub-neg 60.7%

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

      3. *-inverses 60.7%

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

      4. metadata-eval 60.7%

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

      5. distribute-lft-in 60.7%

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

      6. associate-*r/ 60.7%

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

      7. metadata-eval 60.7%

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

      8. metadata-eval 60.7%

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

   5. Simplified 60.7%

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

   6. Taylor expanded in x around 0 59.6%

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

      1. sub-neg 59.6%

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

      2. associate-*r/ 59.6%

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

      3. metadata-eval 59.6%

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

      4. metadata-eval 59.6%

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

   8. Simplified 59.6%

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

   9. Taylor expanded in t around inf 41.8%

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

4. Final simplification 55.0%

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

Alternative 11: 79.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -720 \lor \neg \left(t \leq 3.7 \cdot 10^{+26}\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 -720.0) (not (<= t 3.7e+26)))
   (- (/ 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 <= -720.0) || !(t <= 3.7e+26)) {
		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 <= (-720.0d0)) .or. (.not. (t <= 3.7d+26))) 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 <= -720.0) || !(t <= 3.7e+26)) {
		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 <= -720.0) or not (t <= 3.7e+26):
		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 <= -720.0) || !(t <= 3.7e+26))
		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 <= -720.0) || ~((t <= 3.7e+26)))
		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, -720.0], N[Not[LessEqual[t, 3.7e+26]], $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 < -720 or 3.69999999999999988e26 < t

   1. Initial program 71.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 88.5%

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

   if -720 < t < 3.69999999999999988e26

   1. Initial program 99.1%

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

   3. Taylor expanded in t around 0 76.0%

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

      1. associate-*r/ 76.0%

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

      2. metadata-eval 76.0%

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

   5. Simplified 76.0%

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

4. Final simplification 81.9%

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

Alternative 12: 63.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.85 \cdot 10^{-31} \lor \neg \left(t \leq 1.1 \cdot 10^{-69}\right):\\ \;\;\;\;\frac{x}{y} - 2\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{z \cdot t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -1.85e-31) (not (<= t 1.1e-69)))
   (- (/ x y) 2.0)
   (/ 2.0 (* z t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -1.85e-31) || !(t <= 1.1e-69)) {
		tmp = (x / y) - 2.0;
	} else {
		tmp = 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 <= (-1.85d-31)) .or. (.not. (t <= 1.1d-69))) then
        tmp = (x / y) - 2.0d0
    else
        tmp = 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 <= -1.85e-31) || !(t <= 1.1e-69)) {
		tmp = (x / y) - 2.0;
	} else {
		tmp = 2.0 / (z * t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -1.85e-31) or not (t <= 1.1e-69):
		tmp = (x / y) - 2.0
	else:
		tmp = 2.0 / (z * t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -1.85e-31) || !(t <= 1.1e-69))
		tmp = Float64(Float64(x / y) - 2.0);
	else
		tmp = Float64(2.0 / Float64(z * t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -1.85e-31) || ~((t <= 1.1e-69)))
		tmp = (x / y) - 2.0;
	else
		tmp = 2.0 / (z * t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -1.85e-31], N[Not[LessEqual[t, 1.1e-69]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] - 2.0), $MachinePrecision], N[(2.0 / N[(z * t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.8499999999999999e-31 or 1.1e-69 < t

   1. Initial program 76.1%

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

   3. Taylor expanded in t around inf 80.5%

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

   if -1.8499999999999999e-31 < t < 1.1e-69

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

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

      5. *-commutative 98.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* 98.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 98.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* 98.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 98.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 98.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 98.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 98.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 98.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 98.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 98.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 98.9%

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

      1. associate--l+ 98.9%

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

      2. +-commutative 98.9%

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

      3. sub-neg 98.9%

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

      4. metadata-eval 98.9%

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

      5. +-commutative 98.9%

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

      6. associate-*r/ 98.9%

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

      7. distribute-lft-in 98.9%

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

      8. metadata-eval 98.9%

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

      9. associate-*r/ 98.9%

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

      10. metadata-eval 98.9%

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

   7. Simplified 98.9%

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

   8. Taylor expanded in z around 0 51.6%

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

4. Final simplification 68.2%

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

Alternative 13: 36.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1 or 1 < t

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

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

      1. div-sub 85.5%

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

      2. sub-neg 85.5%

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

      3. *-inverses 85.5%

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

      4. metadata-eval 85.5%

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

      5. distribute-lft-in 85.5%

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

      6. associate-*r/ 85.5%

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

      7. metadata-eval 85.5%

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

      8. metadata-eval 85.5%

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

   5. Simplified 85.5%

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

   6. Taylor expanded in x around 0 42.8%

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

      1. sub-neg 42.8%

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

      2. associate-*r/ 42.8%

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

      3. metadata-eval 42.8%

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

      4. metadata-eval 42.8%

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

   8. Simplified 42.8%

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

   9. Taylor expanded in t around inf 42.3%

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

   if -1 < t < 1

   1. Initial program 99.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 0 77.4%

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

      1. associate-*r/ 77.4%

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

      2. metadata-eval 77.4%

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

   5. Simplified 77.4%

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

   6. Taylor expanded in z around inf 31.0%

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

4. Final simplification 36.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1:\\ \;\;\;\;-2\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;-2\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 19.3% 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 85.8%

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

3. Taylor expanded in z around inf 70.8%

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

   1. div-sub 70.8%

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

   2. sub-neg 70.8%

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

   3. *-inverses 70.8%

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

   4. metadata-eval 70.8%

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

   5. distribute-lft-in 70.8%

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

   6. associate-*r/ 70.8%

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

   7. metadata-eval 70.8%

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

   8. metadata-eval 70.8%

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

5. Simplified 70.8%

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

6. Taylor expanded in x around 0 37.6%

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

   1. sub-neg 37.6%

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

   2. associate-*r/ 37.6%

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

   3. metadata-eval 37.6%

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

   4. metadata-eval 37.6%

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

8. Simplified 37.6%

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

9. Taylor expanded in t around inf 22.5%

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

10. Final simplification 22.5%

    \[\leadsto -2 \]
11. Add Preprocessing

Developer target: 99.2% 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 2024077 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64

  :alt
  (- (/ (+ (/ 2.0 z) 2.0) t) (- 2.0 (/ x y)))

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