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

Percentage Accurate: 86.3% → 99.1%

Time: 13.5s

Alternatives: 12

Speedup: 1.3×

• 23.5% 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.3% 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.1% 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 81.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 81.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 81.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 81.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 81.1%

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

   5. *-commutative 81.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* 81.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 81.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* 81.0%

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

   9. fma-neg 81.0%

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

   10. *-commutative 81.0%

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

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

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

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

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

   \[\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. Add Preprocessing

Alternative 2: 52.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -2:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;\frac{x}{y} \leq 3.5 \cdot 10^{-127}:\\ \;\;\;\;-2\\ \mathbf{elif}\;\frac{x}{y} \leq 9500000000:\\ \;\;\;\;\frac{2}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -2.0)
   (/ x y)
   (if (<= (/ x y) 3.5e-127)
     -2.0
     (if (<= (/ x y) 9500000000.0) (/ 2.0 t) (/ x y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -2.0) {
		tmp = x / y;
	} else if ((x / y) <= 3.5e-127) {
		tmp = -2.0;
	} else if ((x / y) <= 9500000000.0) {
		tmp = 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) <= (-2.0d0)) then
        tmp = x / y
    else if ((x / y) <= 3.5d-127) then
        tmp = -2.0d0
    else if ((x / y) <= 9500000000.0d0) then
        tmp = 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) <= -2.0) {
		tmp = x / y;
	} else if ((x / y) <= 3.5e-127) {
		tmp = -2.0;
	} else if ((x / y) <= 9500000000.0) {
		tmp = 2.0 / t;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -2.0)
		tmp = Float64(x / y);
	elseif (Float64(x / y) <= 3.5e-127)
		tmp = -2.0;
	elseif (Float64(x / y) <= 9500000000.0)
		tmp = 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) <= -2.0)
		tmp = x / y;
	elseif ((x / y) <= 3.5e-127)
		tmp = -2.0;
	elseif ((x / y) <= 9500000000.0)
		tmp = 2.0 / t;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x / y), $MachinePrecision], -2.0], N[(x / y), $MachinePrecision], If[LessEqual[N[(x / y), $MachinePrecision], 3.5e-127], -2.0, If[LessEqual[N[(x / y), $MachinePrecision], 9500000000.0], N[(2.0 / t), $MachinePrecision], N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 82.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 64.7%

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

   if -2 < (/.f64 x y) < 3.49999999999999989e-127

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

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

   4. Taylor expanded in x around 0 45.2%

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

   if 3.49999999999999989e-127 < (/.f64 x y) < 9.5e9

   1. Initial program 87.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 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 44.6%

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

Alternative 3: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -620000 \lor \neg \left(z \leq 0.0042\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 -620000.0) (not (<= z 0.0042)))
   (+ (/ 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 <= -620000.0) || !(z <= 0.0042)) {
		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 <= (-620000.0d0)) .or. (.not. (z <= 0.0042d0))) 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 <= -620000.0) || !(z <= 0.0042)) {
		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 <= -620000.0) or not (z <= 0.0042):
		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 <= -620000.0) || !(z <= 0.0042))
		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 <= -620000.0) || ~((z <= 0.0042)))
		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, -620000.0], N[Not[LessEqual[z, 0.0042]], $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 < -6.2e5 or 0.00419999999999999974 < z

   1. Initial program 63.2%

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

   3. Taylor expanded in z around inf 98.1%

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

      1. div-sub 98.1%

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

      2. sub-neg 98.1%

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

      3. *-inverses 98.1%

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

      4. metadata-eval 98.1%

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

      5. distribute-lft-in 98.1%

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

      6. metadata-eval 98.1%

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

      7. associate-*r/ 98.1%

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

      8. metadata-eval 98.1%

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

   5. Simplified 98.1%

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

   if -6.2e5 < z < 0.00419999999999999974

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

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

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

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

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

      2. +-commutative 99.8%

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

      3. metadata-eval 99.8%

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

      4. associate-+l+ 99.8%

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

      5. associate-*r/ 99.8%

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

      6. distribute-lft-in 99.8%

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

      7. metadata-eval 99.8%

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

      8. associate-*r/ 99.8%

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

      9. metadata-eval 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in z around 0 98.8%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -620000 \lor \neg \left(z \leq 0.0042\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 4: 72.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ x y) -1.2e+22) (not (<= (/ x y) 1.75e+94)))
   (/ x y)
   (+ -2.0 (/ (/ 2.0 t) z))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((x / y) <= -1.2e+22) or not ((x / y) <= 1.75e+94):
		tmp = x / y
	else:
		tmp = -2.0 + ((2.0 / t) / z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x / y) <= -1.2e+22) || !(Float64(x / y) <= 1.75e+94))
		tmp = Float64(x / y);
	else
		tmp = Float64(-2.0 + Float64(Float64(2.0 / t) / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x / y) <= -1.2e+22) || ~(((x / y) <= 1.75e+94)))
		tmp = x / y;
	else
		tmp = -2.0 + ((2.0 / t) / z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -1.2e22 or 1.7499999999999999e94 < (/.f64 x y)

   1. Initial program 78.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 80.8%

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

   if -1.2e22 < (/.f64 x y) < 1.7499999999999999e94

   1. Initial program 82.6%

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

   3. Taylor expanded in z around inf 99.9%

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

      1. +-commutative 99.9%

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

      2. associate-*r/ 99.9%

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

      3. metadata-eval 99.9%

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

      4. *-commutative 99.9%

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

      5. div-sub 99.9%

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

      6. sub-neg 99.9%

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

      7. *-inverses 99.9%

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

      8. metadata-eval 99.9%

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

      9. distribute-lft-in 99.9%

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

      10. metadata-eval 99.9%

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

      11. associate-+l+ 99.9%

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

      12. +-commutative 99.9%

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

      13. *-commutative 99.9%

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

      14. +-commutative 99.9%

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

      15. associate-/l/ 99.9%

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

      16. metadata-eval 99.9%

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

      17. associate-*r/ 99.9%

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

      18. *-rgt-identity 99.9%

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

      19. associate-*r/ 99.9%

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

   5. Simplified 99.9%

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

   6. Taylor expanded in z around 0 77.2%

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

   7. Taylor expanded in x around 0 72.0%

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

      1. sub-neg 72.0%

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

      2. associate-*r/ 72.0%

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

      3. metadata-eval 72.0%

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

      4. associate-/r* 72.0%

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

      5. metadata-eval 72.0%

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

   9. Simplified 72.0%

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

4. Final simplification 75.2%

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

Alternative 5: 91.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -620000 \lor \neg \left(z \leq 4.4 \cdot 10^{-72}\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 -620000.0) (not (<= z 4.4e-72)))
   (+ (/ 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 <= -620000.0) || !(z <= 4.4e-72)) {
		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 <= (-620000.0d0)) .or. (.not. (z <= 4.4d-72))) 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 <= -620000.0) || !(z <= 4.4e-72)) {
		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 <= -620000.0) or not (z <= 4.4e-72):
		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 <= -620000.0) || !(z <= 4.4e-72))
		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 <= -620000.0) || ~((z <= 4.4e-72)))
		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, -620000.0], N[Not[LessEqual[z, 4.4e-72]], $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 < -6.2e5 or 4.40000000000000005e-72 < z

   1. Initial program 67.6%

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

   3. Taylor expanded in z around inf 95.1%

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

      1. div-sub 95.1%

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

      2. sub-neg 95.1%

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

      3. *-inverses 95.1%

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

      4. metadata-eval 95.1%

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

      5. distribute-lft-in 95.1%

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

      6. metadata-eval 95.1%

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

      7. associate-*r/ 95.1%

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

      8. metadata-eval 95.1%

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

   5. Simplified 95.1%

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

   if -6.2e5 < z < 4.40000000000000005e-72

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0 93.3%

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

   4. Taylor expanded in x around 0 93.3%

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

      1. associate-*r/ 93.3%

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

      2. metadata-eval 93.3%

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

      3. associate-/r* 93.3%

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

   6. Simplified 93.3%

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

4. Final simplification 94.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -620000 \lor \neg \left(z \leq 4.4 \cdot 10^{-72}\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 6: 90.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -620000.0) (not (<= z 4.6e-71)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ (/ x y) (/ 2.0 (* z t)))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -620000.0], N[Not[LessEqual[z, 4.6e-71]], $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[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -6.2e5 or 4.5999999999999997e-71 < z

   1. Initial program 67.6%

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

   3. Taylor expanded in z around inf 95.1%

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

      1. div-sub 95.1%

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

      2. sub-neg 95.1%

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

      3. *-inverses 95.1%

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

      4. metadata-eval 95.1%

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

      5. distribute-lft-in 95.1%

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

      6. metadata-eval 95.1%

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

      7. associate-*r/ 95.1%

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

      8. metadata-eval 95.1%

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

   5. Simplified 95.1%

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

   if -6.2e5 < z < 4.5999999999999997e-71

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0 93.3%

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

4. Final simplification 94.3%

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

Alternative 7: 85.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2.8e-13) (not (<= z 8.8e-69)))
   (+ (/ x y) (+ -2.0 (/ 2.0 t)))
   (+ -2.0 (/ (/ 2.0 t) z))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2.8e-13) or not (z <= 8.8e-69):
		tmp = (x / y) + (-2.0 + (2.0 / t))
	else:
		tmp = -2.0 + ((2.0 / t) / z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2.8e-13) || !(z <= 8.8e-69))
		tmp = Float64(Float64(x / y) + Float64(-2.0 + Float64(2.0 / t)));
	else
		tmp = Float64(-2.0 + 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.8e-13) || ~((z <= 8.8e-69)))
		tmp = (x / y) + (-2.0 + (2.0 / t));
	else
		tmp = -2.0 + ((2.0 / t) / z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.8000000000000002e-13 or 8.8000000000000001e-69 < z

   1. Initial program 67.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 95.7%

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

      1. div-sub 95.7%

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

      2. sub-neg 95.7%

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

      3. *-inverses 95.7%

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

      4. metadata-eval 95.7%

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

      5. distribute-lft-in 95.7%

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

      6. metadata-eval 95.7%

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

      7. associate-*r/ 95.7%

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

      8. metadata-eval 95.7%

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

   5. Simplified 95.7%

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

   if -2.8000000000000002e-13 < z < 8.8000000000000001e-69

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf 99.8%

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

      1. +-commutative 99.8%

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

      2. associate-*r/ 99.8%

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

      3. metadata-eval 99.8%

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

      4. *-commutative 99.8%

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

      5. div-sub 99.8%

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

      6. sub-neg 99.8%

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

      7. *-inverses 99.8%

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

      8. metadata-eval 99.8%

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

      9. distribute-lft-in 99.8%

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

      10. metadata-eval 99.8%

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

      11. associate-+l+ 99.8%

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

      12. +-commutative 99.8%

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

      13. *-commutative 99.8%

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

      14. +-commutative 99.8%

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

      15. associate-/l/ 99.8%

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

      16. metadata-eval 99.8%

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

      17. associate-*r/ 99.8%

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

      18. *-rgt-identity 99.8%

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

      19. associate-*r/ 99.8%

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

   5. Simplified 99.8%

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

   6. Taylor expanded in z around 0 99.7%

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

   7. Taylor expanded in x around 0 81.6%

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

      1. sub-neg 81.6%

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

      2. associate-*r/ 81.6%

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

      3. metadata-eval 81.6%

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

      4. associate-/r* 81.6%

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

      5. metadata-eval 81.6%

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

   9. Simplified 81.6%

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

4. Final simplification 89.9%

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

Alternative 8: 80.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3300000000 \lor \neg \left(t \leq 2.7 \cdot 10^{+19}\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 -3300000000.0) (not (<= t 2.7e+19)))
   (- (/ 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 <= -3300000000.0) || !(t <= 2.7e+19)) {
		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 <= (-3300000000.0d0)) .or. (.not. (t <= 2.7d+19))) 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 <= -3300000000.0) || !(t <= 2.7e+19)) {
		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 <= -3300000000.0) or not (t <= 2.7e+19):
		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 <= -3300000000.0) || !(t <= 2.7e+19))
		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 <= -3300000000.0) || ~((t <= 2.7e+19)))
		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, -3300000000.0], N[Not[LessEqual[t, 2.7e+19]], $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 < -3.3e9 or 2.7e19 < t

   1. Initial program 61.5%

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

   3. Taylor expanded in t around inf 85.0%

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

   if -3.3e9 < t < 2.7e19

   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 t around 0 81.2%

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

      1. associate-*r/ 81.2%

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

      2. metadata-eval 81.2%

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

   5. Simplified 81.2%

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

4. Final simplification 83.0%

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

Alternative 9: 65.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.1 \cdot 10^{-70} \lor \neg \left(z \leq 8 \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 (<= z -5.1e-70) (not (<= z 8e-69))) (- (/ x y) 2.0) (/ 2.0 (* z t))))

C

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -5.1e-70) or not (z <= 8e-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 ((z <= -5.1e-70) || !(z <= 8e-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 ((z <= -5.1e-70) || ~((z <= 8e-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[z, -5.1e-70], N[Not[LessEqual[z, 8e-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 z < -5.10000000000000025e-70 or 7.9999999999999997e-69 < z

   1. Initial program 69.5%

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

   3. Taylor expanded in t around inf 68.5%

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

   if -5.10000000000000025e-70 < z < 7.9999999999999997e-69

   1. Initial program 99.8%

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

   3. Taylor expanded in t around 0 76.4%

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

      1. associate-*r/ 76.4%

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

      2. metadata-eval 76.4%

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

   5. Simplified 76.4%

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

   6. Taylor expanded in z around 0 76.4%

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

4. Final simplification 71.5%

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

Alternative 10: 59.2% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -1.02e-5) (not (<= t 8e-168))) (- (/ x y) 2.0) (/ 2.0 t)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.0200000000000001e-5 or 8.0000000000000004e-168 < t

   1. Initial program 72.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 70.4%

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

   if -1.0200000000000001e-5 < t < 8.0000000000000004e-168

   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 t around 0 88.8%

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

      1. associate-*r/ 88.8%

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

      2. metadata-eval 88.8%

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

   5. Simplified 88.8%

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

   6. Taylor expanded in z around inf 38.5%

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

4. Final simplification 60.1%

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

Alternative 11: 36.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -0.0039)
		tmp = -2.0;
	elseif (t <= 0.98)
		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 <= -0.0039)
		tmp = -2.0;
	elseif (t <= 0.98)
		tmp = 2.0 / t;
	else
		tmp = -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -0.0038999999999999998 or 0.97999999999999998 < t

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

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

   4. Taylor expanded in x around 0 37.1%

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

   if -0.0038999999999999998 < t < 0.97999999999999998

   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 t around 0 81.9%

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

      1. associate-*r/ 81.9%

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

      2. metadata-eval 81.9%

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

   5. Simplified 81.9%

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

   6. Taylor expanded in z around inf 34.6%

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

Alternative 12: 20.6% 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 81.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 52.3%

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

4. Taylor expanded in x around 0 20.8%

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

Developer Target 1: 99.1% 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 2024118 
(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))))