Data.Colour.RGB:hslsv from colour-2.3.3, B

Percentage Accurate: 99.2% → 99.2%

Time: 13.9s

Alternatives: 16

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t)) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t)) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return ((60.0 * (x - y)) / (z - t)) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t)) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((60.0 * (x - y)) / (z - t)) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

Alternative 2: 74.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -4 \cdot 10^{+140}:\\ \;\;\;\;a \cdot 120 + y \cdot \frac{-60}{z}\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{-6}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{y}{t}\\ \mathbf{elif}\;a \cdot 120 \leq 100:\\ \;\;\;\;\frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -4e+140)
   (+ (* a 120.0) (* y (/ -60.0 z)))
   (if (<= (* a 120.0) -2e-6)
     (+ (* a 120.0) (* 60.0 (/ y t)))
     (if (<= (* a 120.0) 100.0) (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+140) {
		tmp = (a * 120.0) + (y * (-60.0 / z));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = (60.0 * (x - y)) / (z - t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a * 120.0d0) <= (-4d+140)) then
        tmp = (a * 120.0d0) + (y * ((-60.0d0) / z))
    else if ((a * 120.0d0) <= (-2d-6)) then
        tmp = (a * 120.0d0) + (60.0d0 * (y / t))
    else if ((a * 120.0d0) <= 100.0d0) then
        tmp = (60.0d0 * (x - y)) / (z - t)
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+140) {
		tmp = (a * 120.0) + (y * (-60.0 / z));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = (60.0 * (x - y)) / (z - t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a * 120.0) <= -4e+140:
		tmp = (a * 120.0) + (y * (-60.0 / z))
	elif (a * 120.0) <= -2e-6:
		tmp = (a * 120.0) + (60.0 * (y / t))
	elif (a * 120.0) <= 100.0:
		tmp = (60.0 * (x - y)) / (z - t)
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -4e+140)
		tmp = Float64(Float64(a * 120.0) + Float64(y * Float64(-60.0 / z)));
	elseif (Float64(a * 120.0) <= -2e-6)
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(y / t)));
	elseif (Float64(a * 120.0) <= 100.0)
		tmp = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a * 120.0) <= -4e+140)
		tmp = (a * 120.0) + (y * (-60.0 / z));
	elseif ((a * 120.0) <= -2e-6)
		tmp = (a * 120.0) + (60.0 * (y / t));
	elseif ((a * 120.0) <= 100.0)
		tmp = (60.0 * (x - y)) / (z - t);
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(a * 120.0), $MachinePrecision], -4e+140], N[(N[(a * 120.0), $MachinePrecision] + N[(y * N[(-60.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], -2e-6], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], 100.0], N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -4.00000000000000024e140

   1. Initial program 99.9%

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

      1. associate-/l* 100.0%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 87.2%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 87.1%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 87.1%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 87.1%

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

      4. times-frac 87.2%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 87.2%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 87.2%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   8. Taylor expanded in z around inf 81.2%

      \[\leadsto y \cdot \color{blue}{\frac{-60}{z}} + a \cdot 120 \]

   if -4.00000000000000024e140 < (*.f64 a #s(literal 120 binary64)) < -1.99999999999999991e-6

   1. Initial program 100.0%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 86.7%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 87.0%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 87.0%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 87.0%

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

      4. times-frac 86.7%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 86.7%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 86.7%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   8. Taylor expanded in z around 0 75.8%

      \[\leadsto \color{blue}{60 \cdot \frac{y}{t}} + a \cdot 120 \]

   if -1.99999999999999991e-6 < (*.f64 a #s(literal 120 binary64)) < 100

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{a \cdot 120 + 60 \cdot \frac{x - y}{z - t}} \]

      2. fma-define 99.7%

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

      3. clear-num 99.5%

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

      4. un-div-inv 99.6%

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

   6. Applied egg-rr 99.6%

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

   7. Taylor expanded in a around 0 77.6%

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

      1. associate-*r/ 77.7%

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

   9. Simplified 77.7%

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

   if 100 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-/l* 99.7%

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

      3. fma-define 99.7%

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

      4. sub-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate-+l- 99.7%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.7%

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

      9. distribute-frac-neg2 99.7%

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

      10. distribute-neg-frac 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in t around inf 81.0%

      \[\leadsto \color{blue}{120 \cdot a} \]
3. Recombined 4 regimes into one program.

4. Final simplification 78.8%

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

Alternative 3: 75.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -4 \cdot 10^{+140}:\\ \;\;\;\;a \cdot 120 + y \cdot \frac{-60}{z}\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{-6}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{y}{t}\\ \mathbf{elif}\;a \cdot 120 \leq 100:\\ \;\;\;\;60 \cdot \frac{x - y}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -4e+140)
   (+ (* a 120.0) (* y (/ -60.0 z)))
   (if (<= (* a 120.0) -2e-6)
     (+ (* a 120.0) (* 60.0 (/ y t)))
     (if (<= (* a 120.0) 100.0) (* 60.0 (/ (- x y) (- z t))) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+140) {
		tmp = (a * 120.0) + (y * (-60.0 / z));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = 60.0 * ((x - y) / (z - t));
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a * 120.0d0) <= (-4d+140)) then
        tmp = (a * 120.0d0) + (y * ((-60.0d0) / z))
    else if ((a * 120.0d0) <= (-2d-6)) then
        tmp = (a * 120.0d0) + (60.0d0 * (y / t))
    else if ((a * 120.0d0) <= 100.0d0) then
        tmp = 60.0d0 * ((x - y) / (z - t))
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+140) {
		tmp = (a * 120.0) + (y * (-60.0 / z));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = 60.0 * ((x - y) / (z - t));
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a * 120.0) <= -4e+140:
		tmp = (a * 120.0) + (y * (-60.0 / z))
	elif (a * 120.0) <= -2e-6:
		tmp = (a * 120.0) + (60.0 * (y / t))
	elif (a * 120.0) <= 100.0:
		tmp = 60.0 * ((x - y) / (z - t))
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -4e+140)
		tmp = Float64(Float64(a * 120.0) + Float64(y * Float64(-60.0 / z)));
	elseif (Float64(a * 120.0) <= -2e-6)
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(y / t)));
	elseif (Float64(a * 120.0) <= 100.0)
		tmp = Float64(60.0 * Float64(Float64(x - y) / Float64(z - t)));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a * 120.0) <= -4e+140)
		tmp = (a * 120.0) + (y * (-60.0 / z));
	elseif ((a * 120.0) <= -2e-6)
		tmp = (a * 120.0) + (60.0 * (y / t));
	elseif ((a * 120.0) <= 100.0)
		tmp = 60.0 * ((x - y) / (z - t));
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(a * 120.0), $MachinePrecision], -4e+140], N[(N[(a * 120.0), $MachinePrecision] + N[(y * N[(-60.0 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], -2e-6], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], 100.0], N[(60.0 * N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -4.00000000000000024e140

   1. Initial program 99.9%

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

      1. associate-/l* 100.0%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 87.2%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 87.1%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 87.1%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 87.1%

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

      4. times-frac 87.2%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 87.2%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 87.2%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   8. Taylor expanded in z around inf 81.2%

      \[\leadsto y \cdot \color{blue}{\frac{-60}{z}} + a \cdot 120 \]

   if -4.00000000000000024e140 < (*.f64 a #s(literal 120 binary64)) < -1.99999999999999991e-6

   1. Initial program 100.0%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 86.7%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 87.0%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 87.0%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 87.0%

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

      4. times-frac 86.7%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 86.7%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 86.7%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   8. Taylor expanded in z around 0 75.8%

      \[\leadsto \color{blue}{60 \cdot \frac{y}{t}} + a \cdot 120 \]

   if -1.99999999999999991e-6 < (*.f64 a #s(literal 120 binary64)) < 100

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 77.6%

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

   if 100 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-/l* 99.7%

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

      3. fma-define 99.7%

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

      4. sub-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate-+l- 99.7%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.7%

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

      9. distribute-frac-neg2 99.7%

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

      10. distribute-neg-frac 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in t around inf 81.0%

      \[\leadsto \color{blue}{120 \cdot a} \]
3. Recombined 4 regimes into one program.

4. Final simplification 78.8%

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

Alternative 4: 74.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -4 \cdot 10^{+124}:\\ \;\;\;\;a \cdot 120 + -60 \cdot \frac{x}{t}\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{-6}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{y}{t}\\ \mathbf{elif}\;a \cdot 120 \leq 100:\\ \;\;\;\;60 \cdot \frac{x - y}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -4e+124)
   (+ (* a 120.0) (* -60.0 (/ x t)))
   (if (<= (* a 120.0) -2e-6)
     (+ (* a 120.0) (* 60.0 (/ y t)))
     (if (<= (* a 120.0) 100.0) (* 60.0 (/ (- x y) (- z t))) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+124) {
		tmp = (a * 120.0) + (-60.0 * (x / t));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = 60.0 * ((x - y) / (z - t));
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a * 120.0d0) <= (-4d+124)) then
        tmp = (a * 120.0d0) + ((-60.0d0) * (x / t))
    else if ((a * 120.0d0) <= (-2d-6)) then
        tmp = (a * 120.0d0) + (60.0d0 * (y / t))
    else if ((a * 120.0d0) <= 100.0d0) then
        tmp = 60.0d0 * ((x - y) / (z - t))
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -4e+124) {
		tmp = (a * 120.0) + (-60.0 * (x / t));
	} else if ((a * 120.0) <= -2e-6) {
		tmp = (a * 120.0) + (60.0 * (y / t));
	} else if ((a * 120.0) <= 100.0) {
		tmp = 60.0 * ((x - y) / (z - t));
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a * 120.0) <= -4e+124:
		tmp = (a * 120.0) + (-60.0 * (x / t))
	elif (a * 120.0) <= -2e-6:
		tmp = (a * 120.0) + (60.0 * (y / t))
	elif (a * 120.0) <= 100.0:
		tmp = 60.0 * ((x - y) / (z - t))
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -4e+124)
		tmp = Float64(Float64(a * 120.0) + Float64(-60.0 * Float64(x / t)));
	elseif (Float64(a * 120.0) <= -2e-6)
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(y / t)));
	elseif (Float64(a * 120.0) <= 100.0)
		tmp = Float64(60.0 * Float64(Float64(x - y) / Float64(z - t)));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a * 120.0) <= -4e+124)
		tmp = (a * 120.0) + (-60.0 * (x / t));
	elseif ((a * 120.0) <= -2e-6)
		tmp = (a * 120.0) + (60.0 * (y / t));
	elseif ((a * 120.0) <= 100.0)
		tmp = 60.0 * ((x - y) / (z - t));
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(a * 120.0), $MachinePrecision], -4e+124], N[(N[(a * 120.0), $MachinePrecision] + N[(-60.0 * N[(x / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], -2e-6], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 120.0), $MachinePrecision], 100.0], N[(60.0 * N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -3.99999999999999979e124

   1. Initial program 99.9%

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

      1. associate-/l* 99.9%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 87.9%

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t}} + a \cdot 120 \]

   6. Taylor expanded in z around 0 73.3%

      \[\leadsto \color{blue}{-60 \cdot \frac{x}{t}} + a \cdot 120 \]

   if -3.99999999999999979e124 < (*.f64 a #s(literal 120 binary64)) < -1.99999999999999991e-6

   1. Initial program 100.0%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 88.7%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 88.8%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 88.8%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 88.8%

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

      4. times-frac 88.7%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 88.7%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 88.7%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   8. Taylor expanded in z around 0 84.3%

      \[\leadsto \color{blue}{60 \cdot \frac{y}{t}} + a \cdot 120 \]

   if -1.99999999999999991e-6 < (*.f64 a #s(literal 120 binary64)) < 100

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 77.6%

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

   if 100 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-/l* 99.7%

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

      3. fma-define 99.7%

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

      4. sub-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate-+l- 99.7%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.7%

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

      9. distribute-frac-neg2 99.7%

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

      10. distribute-neg-frac 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in t around inf 81.0%

      \[\leadsto \color{blue}{120 \cdot a} \]
3. Recombined 4 regimes into one program.

4. Final simplification 78.0%

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

Alternative 5: 56.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z - t \leq -5 \cdot 10^{+62}:\\ \;\;\;\;a \cdot 120\\ \mathbf{elif}\;z - t \leq 10^{-6}:\\ \;\;\;\;\frac{60 \cdot \left(x - y\right)}{z}\\ \mathbf{elif}\;z - t \leq 2 \cdot 10^{+34}:\\ \;\;\;\;-60 \cdot \frac{x - y}{t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (- z t) -5e+62)
   (* a 120.0)
   (if (<= (- z t) 1e-6)
     (/ (* 60.0 (- x y)) z)
     (if (<= (- z t) 2e+34) (* -60.0 (/ (- x y) t)) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z - t) <= -5e+62) {
		tmp = a * 120.0;
	} else if ((z - t) <= 1e-6) {
		tmp = (60.0 * (x - y)) / z;
	} else if ((z - t) <= 2e+34) {
		tmp = -60.0 * ((x - y) / t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z - t) <= (-5d+62)) then
        tmp = a * 120.0d0
    else if ((z - t) <= 1d-6) then
        tmp = (60.0d0 * (x - y)) / z
    else if ((z - t) <= 2d+34) then
        tmp = (-60.0d0) * ((x - y) / t)
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z - t) <= -5e+62) {
		tmp = a * 120.0;
	} else if ((z - t) <= 1e-6) {
		tmp = (60.0 * (x - y)) / z;
	} else if ((z - t) <= 2e+34) {
		tmp = -60.0 * ((x - y) / t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z - t) <= -5e+62:
		tmp = a * 120.0
	elif (z - t) <= 1e-6:
		tmp = (60.0 * (x - y)) / z
	elif (z - t) <= 2e+34:
		tmp = -60.0 * ((x - y) / t)
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(z - t) <= -5e+62)
		tmp = Float64(a * 120.0);
	elseif (Float64(z - t) <= 1e-6)
		tmp = Float64(Float64(60.0 * Float64(x - y)) / z);
	elseif (Float64(z - t) <= 2e+34)
		tmp = Float64(-60.0 * Float64(Float64(x - y) / t));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z - t) <= -5e+62)
		tmp = a * 120.0;
	elseif ((z - t) <= 1e-6)
		tmp = (60.0 * (x - y)) / z;
	elseif ((z - t) <= 2e+34)
		tmp = -60.0 * ((x - y) / t);
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(z - t), $MachinePrecision], -5e+62], N[(a * 120.0), $MachinePrecision], If[LessEqual[N[(z - t), $MachinePrecision], 1e-6], N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[N[(z - t), $MachinePrecision], 2e+34], N[(-60.0 * N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 z t) < -5.00000000000000029e62 or 1.99999999999999989e34 < (-.f64 z t)

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 65.7%

      \[\leadsto \color{blue}{120 \cdot a} \]

   if -5.00000000000000029e62 < (-.f64 z t) < 9.99999999999999955e-7

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 88.3%

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

   6. Taylor expanded in z around inf 56.1%

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

      1. associate-*r/ 56.1%

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

   8. Applied egg-rr 56.1%

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

   if 9.99999999999999955e-7 < (-.f64 z t) < 1.99999999999999989e34

   1. Initial program 100.0%

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

      1. associate-/l* 99.5%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 71.0%

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

   6. Taylor expanded in z around 0 71.0%

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

4. Final simplification 63.1%

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

Alternative 6: 56.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (- z t) -5e+62)
   (* a 120.0)
   (if (<= (- z t) 1e-6)
     (* 60.0 (/ (- x y) z))
     (if (<= (- z t) 2e+34) (* -60.0 (/ (- x y) t)) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z - t) <= -5e+62) {
		tmp = a * 120.0;
	} else if ((z - t) <= 1e-6) {
		tmp = 60.0 * ((x - y) / z);
	} else if ((z - t) <= 2e+34) {
		tmp = -60.0 * ((x - y) / t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((z - t) <= (-5d+62)) then
        tmp = a * 120.0d0
    else if ((z - t) <= 1d-6) then
        tmp = 60.0d0 * ((x - y) / z)
    else if ((z - t) <= 2d+34) then
        tmp = (-60.0d0) * ((x - y) / t)
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z - t) <= -5e+62) {
		tmp = a * 120.0;
	} else if ((z - t) <= 1e-6) {
		tmp = 60.0 * ((x - y) / z);
	} else if ((z - t) <= 2e+34) {
		tmp = -60.0 * ((x - y) / t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z - t) <= -5e+62:
		tmp = a * 120.0
	elif (z - t) <= 1e-6:
		tmp = 60.0 * ((x - y) / z)
	elif (z - t) <= 2e+34:
		tmp = -60.0 * ((x - y) / t)
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(z - t) <= -5e+62)
		tmp = Float64(a * 120.0);
	elseif (Float64(z - t) <= 1e-6)
		tmp = Float64(60.0 * Float64(Float64(x - y) / z));
	elseif (Float64(z - t) <= 2e+34)
		tmp = Float64(-60.0 * Float64(Float64(x - y) / t));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z - t) <= -5e+62)
		tmp = a * 120.0;
	elseif ((z - t) <= 1e-6)
		tmp = 60.0 * ((x - y) / z);
	elseif ((z - t) <= 2e+34)
		tmp = -60.0 * ((x - y) / t);
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(z - t), $MachinePrecision], -5e+62], N[(a * 120.0), $MachinePrecision], If[LessEqual[N[(z - t), $MachinePrecision], 1e-6], N[(60.0 * N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z - t), $MachinePrecision], 2e+34], N[(-60.0 * N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 z t) < -5.00000000000000029e62 or 1.99999999999999989e34 < (-.f64 z t)

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 65.7%

      \[\leadsto \color{blue}{120 \cdot a} \]

   if -5.00000000000000029e62 < (-.f64 z t) < 9.99999999999999955e-7

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 88.3%

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

   6. Taylor expanded in z around inf 56.1%

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

   if 9.99999999999999955e-7 < (-.f64 z t) < 1.99999999999999989e34

   1. Initial program 100.0%

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

      1. associate-/l* 99.5%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 71.0%

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

   6. Taylor expanded in z around 0 71.0%

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

4. Final simplification 63.1%

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

Alternative 7: 82.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* a 120.0) -1e-6) (not (<= (* a 120.0) 1e-69)))
   (+ (* a 120.0) (* 60.0 (/ x (- z t))))
   (/ (* 60.0 (- x y)) (- z t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a * 120.0) <= -1e-6) || !((a * 120.0) <= 1e-69)) {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	} else {
		tmp = (60.0 * (x - y)) / (z - t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (((a * 120.0d0) <= (-1d-6)) .or. (.not. ((a * 120.0d0) <= 1d-69))) then
        tmp = (a * 120.0d0) + (60.0d0 * (x / (z - t)))
    else
        tmp = (60.0d0 * (x - y)) / (z - t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a * 120.0) <= -1e-6) || !((a * 120.0) <= 1e-69)) {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	} else {
		tmp = (60.0 * (x - y)) / (z - t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((a * 120.0) <= -1e-6) or not ((a * 120.0) <= 1e-69):
		tmp = (a * 120.0) + (60.0 * (x / (z - t)))
	else:
		tmp = (60.0 * (x - y)) / (z - t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(a * 120.0) <= -1e-6) || !(Float64(a * 120.0) <= 1e-69))
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(x / Float64(z - t))));
	else
		tmp = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((a * 120.0) <= -1e-6) || ~(((a * 120.0) <= 1e-69)))
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	else
		tmp = (60.0 * (x - y)) / (z - t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(a * 120.0), $MachinePrecision], -1e-6], N[Not[LessEqual[N[(a * 120.0), $MachinePrecision], 1e-69]], $MachinePrecision]], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.99999999999999955e-7 or 9.9999999999999996e-70 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 88.4%

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t}} + a \cdot 120 \]

   if -9.99999999999999955e-7 < (*.f64 a #s(literal 120 binary64)) < 9.9999999999999996e-70

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{a \cdot 120 + 60 \cdot \frac{x - y}{z - t}} \]

      2. fma-define 99.7%

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

      3. clear-num 99.5%

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

      4. un-div-inv 99.6%

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

   6. Applied egg-rr 99.6%

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

   7. Taylor expanded in a around 0 81.1%

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

      1. associate-*r/ 81.2%

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

   9. Simplified 81.2%

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

4. Final simplification 85.3%

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

Alternative 8: 76.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -1 \cdot 10^{-6} \lor \neg \left(a \cdot 120 \leq 100\right):\\ \;\;\;\;a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;60 \cdot \frac{x - y}{z - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (* a 120.0) -1e-6) (not (<= (* a 120.0) 100.0)))
   (* a 120.0)
   (* 60.0 (/ (- x y) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a * 120.0) <= -1e-6) || !((a * 120.0) <= 100.0)) {
		tmp = a * 120.0;
	} else {
		tmp = 60.0 * ((x - y) / (z - t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (((a * 120.0d0) <= (-1d-6)) .or. (.not. ((a * 120.0d0) <= 100.0d0))) then
        tmp = a * 120.0d0
    else
        tmp = 60.0d0 * ((x - y) / (z - t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((a * 120.0) <= -1e-6) || !((a * 120.0) <= 100.0)) {
		tmp = a * 120.0;
	} else {
		tmp = 60.0 * ((x - y) / (z - t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((a * 120.0) <= -1e-6) or not ((a * 120.0) <= 100.0):
		tmp = a * 120.0
	else:
		tmp = 60.0 * ((x - y) / (z - t))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(a * 120.0) <= -1e-6) || !(Float64(a * 120.0) <= 100.0))
		tmp = Float64(a * 120.0);
	else
		tmp = Float64(60.0 * Float64(Float64(x - y) / Float64(z - t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((a * 120.0) <= -1e-6) || ~(((a * 120.0) <= 100.0)))
		tmp = a * 120.0;
	else
		tmp = 60.0 * ((x - y) / (z - t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(a * 120.0), $MachinePrecision], -1e-6], N[Not[LessEqual[N[(a * 120.0), $MachinePrecision], 100.0]], $MachinePrecision]], N[(a * 120.0), $MachinePrecision], N[(60.0 * N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.99999999999999955e-7 or 100 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 74.4%

      \[\leadsto \color{blue}{120 \cdot a} \]

   if -9.99999999999999955e-7 < (*.f64 a #s(literal 120 binary64)) < 100

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 78.2%

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

4. Final simplification 76.3%

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

Alternative 9: 88.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+99} \lor \neg \left(y \leq 1.45 \cdot 10^{+96}\right):\\ \;\;\;\;a \cdot 120 + \frac{y \cdot -60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + \frac{60 \cdot x}{z - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= y -2.6e+99) (not (<= y 1.45e+96)))
   (+ (* a 120.0) (/ (* y -60.0) (- z t)))
   (+ (* a 120.0) (/ (* 60.0 x) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -2.6e+99) || !(y <= 1.45e+96)) {
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	} else {
		tmp = (a * 120.0) + ((60.0 * x) / (z - t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((y <= (-2.6d+99)) .or. (.not. (y <= 1.45d+96))) then
        tmp = (a * 120.0d0) + ((y * (-60.0d0)) / (z - t))
    else
        tmp = (a * 120.0d0) + ((60.0d0 * x) / (z - t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -2.6e+99) || !(y <= 1.45e+96)) {
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	} else {
		tmp = (a * 120.0) + ((60.0 * x) / (z - t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (y <= -2.6e+99) or not (y <= 1.45e+96):
		tmp = (a * 120.0) + ((y * -60.0) / (z - t))
	else:
		tmp = (a * 120.0) + ((60.0 * x) / (z - t))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((y <= -2.6e+99) || !(y <= 1.45e+96))
		tmp = Float64(Float64(a * 120.0) + Float64(Float64(y * -60.0) / Float64(z - t)));
	else
		tmp = Float64(Float64(a * 120.0) + Float64(Float64(60.0 * x) / Float64(z - t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((y <= -2.6e+99) || ~((y <= 1.45e+96)))
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	else
		tmp = (a * 120.0) + ((60.0 * x) / (z - t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -2.6e+99], N[Not[LessEqual[y, 1.45e+96]], $MachinePrecision]], N[(N[(a * 120.0), $MachinePrecision] + N[(N[(y * -60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a * 120.0), $MachinePrecision] + N[(N[(60.0 * x), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.6e99 or 1.44999999999999989e96 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 95.4%

      \[\leadsto \frac{\color{blue}{-60 \cdot y}}{z - t} + a \cdot 120 \]

   if -2.6e99 < y < 1.44999999999999989e96

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 89.0%

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 89.1%

         \[\leadsto \color{blue}{\frac{60 \cdot x}{z - t}} + a \cdot 120 \]

   7. Simplified 89.1%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+99} \lor \neg \left(y \leq 1.45 \cdot 10^{+96}\right):\\ \;\;\;\;a \cdot 120 + \frac{y \cdot -60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + \frac{60 \cdot x}{z - t}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 89.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.1 \cdot 10^{+98} \lor \neg \left(y \leq 1.65 \cdot 10^{+95}\right):\\ \;\;\;\;a \cdot 120 + \frac{y \cdot -60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{x}{z - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= y -5.1e+98) (not (<= y 1.65e+95)))
   (+ (* a 120.0) (/ (* y -60.0) (- z t)))
   (+ (* a 120.0) (* 60.0 (/ x (- z t))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -5.1e+98) || !(y <= 1.65e+95)) {
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	} else {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((y <= (-5.1d+98)) .or. (.not. (y <= 1.65d+95))) then
        tmp = (a * 120.0d0) + ((y * (-60.0d0)) / (z - t))
    else
        tmp = (a * 120.0d0) + (60.0d0 * (x / (z - t)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -5.1e+98) || !(y <= 1.65e+95)) {
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	} else {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (y <= -5.1e+98) or not (y <= 1.65e+95):
		tmp = (a * 120.0) + ((y * -60.0) / (z - t))
	else:
		tmp = (a * 120.0) + (60.0 * (x / (z - t)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((y <= -5.1e+98) || !(y <= 1.65e+95))
		tmp = Float64(Float64(a * 120.0) + Float64(Float64(y * -60.0) / Float64(z - t)));
	else
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(x / Float64(z - t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((y <= -5.1e+98) || ~((y <= 1.65e+95)))
		tmp = (a * 120.0) + ((y * -60.0) / (z - t));
	else
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -5.1e+98], N[Not[LessEqual[y, 1.65e+95]], $MachinePrecision]], N[(N[(a * 120.0), $MachinePrecision] + N[(N[(y * -60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -5.09999999999999988e98 or 1.6499999999999999e95 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 95.4%

      \[\leadsto \frac{\color{blue}{-60 \cdot y}}{z - t} + a \cdot 120 \]

   if -5.09999999999999988e98 < y < 1.6499999999999999e95

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 89.0%

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

4. Final simplification 91.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.1 \cdot 10^{+98} \lor \neg \left(y \leq 1.65 \cdot 10^{+95}\right):\\ \;\;\;\;a \cdot 120 + \frac{y \cdot -60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{x}{z - t}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 89.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+98} \lor \neg \left(y \leq 2.3 \cdot 10^{+95}\right):\\ \;\;\;\;a \cdot 120 + y \cdot \frac{-60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{x}{z - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= y -3.2e+98) (not (<= y 2.3e+95)))
   (+ (* a 120.0) (* y (/ -60.0 (- z t))))
   (+ (* a 120.0) (* 60.0 (/ x (- z t))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -3.2e+98) || !(y <= 2.3e+95)) {
		tmp = (a * 120.0) + (y * (-60.0 / (z - t)));
	} else {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((y <= (-3.2d+98)) .or. (.not. (y <= 2.3d+95))) then
        tmp = (a * 120.0d0) + (y * ((-60.0d0) / (z - t)))
    else
        tmp = (a * 120.0d0) + (60.0d0 * (x / (z - t)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -3.2e+98) || !(y <= 2.3e+95)) {
		tmp = (a * 120.0) + (y * (-60.0 / (z - t)));
	} else {
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (y <= -3.2e+98) or not (y <= 2.3e+95):
		tmp = (a * 120.0) + (y * (-60.0 / (z - t)))
	else:
		tmp = (a * 120.0) + (60.0 * (x / (z - t)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((y <= -3.2e+98) || !(y <= 2.3e+95))
		tmp = Float64(Float64(a * 120.0) + Float64(y * Float64(-60.0 / Float64(z - t))));
	else
		tmp = Float64(Float64(a * 120.0) + Float64(60.0 * Float64(x / Float64(z - t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((y <= -3.2e+98) || ~((y <= 2.3e+95)))
		tmp = (a * 120.0) + (y * (-60.0 / (z - t)));
	else
		tmp = (a * 120.0) + (60.0 * (x / (z - t)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[y, -3.2e+98], N[Not[LessEqual[y, 2.3e+95]], $MachinePrecision]], N[(N[(a * 120.0), $MachinePrecision] + N[(y * N[(-60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.2000000000000002e98 or 2.29999999999999997e95 < y

   1. Initial program 99.8%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 95.3%

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} + a \cdot 120 \]
   6. Step-by-step derivation

      1. associate-*r/ 95.4%

         \[\leadsto \color{blue}{\frac{-60 \cdot y}{z - t}} + a \cdot 120 \]

      2. *-commutative 95.4%

         \[\leadsto \frac{\color{blue}{y \cdot -60}}{z - t} + a \cdot 120 \]

      3. *-lft-identity 95.4%

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

      4. times-frac 95.3%

         \[\leadsto \color{blue}{\frac{y}{1} \cdot \frac{-60}{z - t}} + a \cdot 120 \]

      5. /-rgt-identity 95.3%

         \[\leadsto \color{blue}{y} \cdot \frac{-60}{z - t} + a \cdot 120 \]

   7. Simplified 95.3%

      \[\leadsto \color{blue}{y \cdot \frac{-60}{z - t}} + a \cdot 120 \]

   if -3.2000000000000002e98 < y < 2.29999999999999997e95

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 89.0%

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

4. Final simplification 91.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+98} \lor \neg \left(y \leq 2.3 \cdot 10^{+95}\right):\\ \;\;\;\;a \cdot 120 + y \cdot \frac{-60}{z - t}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120 + 60 \cdot \frac{x}{z - t}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 54.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= (- z t) -5e+117) (not (<= (- z t) 2e+34)))
   (* a 120.0)
   (* -60.0 (/ (- x y) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) <= -5e+117) || !((z - t) <= 2e+34)) {
		tmp = a * 120.0;
	} else {
		tmp = -60.0 * ((x - y) / t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (((z - t) <= (-5d+117)) .or. (.not. ((z - t) <= 2d+34))) then
        tmp = a * 120.0d0
    else
        tmp = (-60.0d0) * ((x - y) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) <= -5e+117) || !((z - t) <= 2e+34)) {
		tmp = a * 120.0;
	} else {
		tmp = -60.0 * ((x - y) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) <= -5e+117) or not ((z - t) <= 2e+34):
		tmp = a * 120.0
	else:
		tmp = -60.0 * ((x - y) / t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((Float64(z - t) <= -5e+117) || !(Float64(z - t) <= 2e+34))
		tmp = Float64(a * 120.0);
	else
		tmp = Float64(-60.0 * Float64(Float64(x - y) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((z - t) <= -5e+117) || ~(((z - t) <= 2e+34)))
		tmp = a * 120.0;
	else
		tmp = -60.0 * ((x - y) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[N[(z - t), $MachinePrecision], -5e+117], N[Not[LessEqual[N[(z - t), $MachinePrecision], 2e+34]], $MachinePrecision]], N[(a * 120.0), $MachinePrecision], N[(-60.0 * N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 z t) < -4.99999999999999983e117 or 1.99999999999999989e34 < (-.f64 z t)

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 68.4%

      \[\leadsto \color{blue}{120 \cdot a} \]

   if -4.99999999999999983e117 < (-.f64 z t) < 1.99999999999999989e34

   1. Initial program 99.8%

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

      1. associate-/l* 99.8%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing

   5. Taylor expanded in a around 0 82.3%

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

   6. Taylor expanded in z around 0 48.4%

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

4. Final simplification 60.5%

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

Alternative 13: 58.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.8 \cdot 10^{-21} \lor \neg \left(a \leq 2.7 \cdot 10^{-71}\right):\\ \;\;\;\;a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;60 \cdot \frac{y}{t - z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -3.8e-21) (not (<= a 2.7e-71)))
   (* a 120.0)
   (* 60.0 (/ y (- t z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -3.8e-21) || !(a <= 2.7e-71)) {
		tmp = a * 120.0;
	} else {
		tmp = 60.0 * (y / (t - z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-3.8d-21)) .or. (.not. (a <= 2.7d-71))) then
        tmp = a * 120.0d0
    else
        tmp = 60.0d0 * (y / (t - z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -3.8e-21) || !(a <= 2.7e-71)) {
		tmp = a * 120.0;
	} else {
		tmp = 60.0 * (y / (t - z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -3.8e-21) or not (a <= 2.7e-71):
		tmp = a * 120.0
	else:
		tmp = 60.0 * (y / (t - z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -3.8e-21) || !(a <= 2.7e-71))
		tmp = Float64(a * 120.0);
	else
		tmp = Float64(60.0 * Float64(y / Float64(t - z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -3.8e-21) || ~((a <= 2.7e-71)))
		tmp = a * 120.0;
	else
		tmp = 60.0 * (y / (t - z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -3.8e-21], N[Not[LessEqual[a, 2.7e-71]], $MachinePrecision]], N[(a * 120.0), $MachinePrecision], N[(60.0 * N[(y / N[(t - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -3.7999999999999998e-21 or 2.7000000000000001e-71 < a

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 69.9%

      \[\leadsto \color{blue}{120 \cdot a} \]

   if -3.7999999999999998e-21 < a < 2.7000000000000001e-71

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.7%

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

      3. fma-define 99.7%

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

      4. sub-neg 99.7%

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

      5. +-commutative 99.7%

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

      6. neg-sub0 99.7%

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

      7. associate-+l- 99.7%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.7%

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

      9. distribute-frac-neg2 99.7%

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

      10. distribute-neg-frac 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in y around inf 49.7%

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

4. Final simplification 61.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -3.8 \cdot 10^{-21} \lor \neg \left(a \leq 2.7 \cdot 10^{-71}\right):\\ \;\;\;\;a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;60 \cdot \frac{y}{t - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ a \cdot 120 + 60 \cdot \frac{x - y}{z - t} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (* a 120.0) (* 60.0 (/ (- x y) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	return (a * 120.0) + (60.0 * ((x - y) / (z - t)));
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	return (a * 120.0) + (60.0 * ((x - y) / (z - t)));
}

Python

def code(x, y, z, t, a):
	return (a * 120.0) + (60.0 * ((x - y) / (z - t)))

Julia

function code(x, y, z, t, a)
	return Float64(Float64(a * 120.0) + Float64(60.0 * Float64(Float64(x - y) / Float64(z - t))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (a * 120.0) + (60.0 * ((x - y) / (z - t)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(a * 120.0), $MachinePrecision] + N[(60.0 * N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   1. associate-/l* 99.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto a \cdot 120 + 60 \cdot \frac{x - y}{z - t} \]
6. Add Preprocessing

Alternative 15: 50.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+145}:\\ \;\;\;\;60 \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -2.6e+145) (* 60.0 (/ x z)) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -2.6e+145) {
		tmp = 60.0 * (x / z);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (x <= (-2.6d+145)) then
        tmp = 60.0d0 * (x / z)
    else
        tmp = a * 120.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -2.6e+145) {
		tmp = 60.0 * (x / z);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if x <= -2.6e+145:
		tmp = 60.0 * (x / z)
	else:
		tmp = a * 120.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -2.6e+145)
		tmp = Float64(60.0 * Float64(x / z));
	else
		tmp = Float64(a * 120.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (x <= -2.6e+145)
		tmp = 60.0 * (x / z);
	else
		tmp = a * 120.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -2.6e+145], N[(60.0 * N[(x / z), $MachinePrecision]), $MachinePrecision], N[(a * 120.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.60000000000000003e145

   1. Initial program 99.7%

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

      1. associate-/l* 99.7%

         \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t}} + a \cdot 120 \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z - t} + a \cdot 120} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 99.7%

         \[\leadsto \color{blue}{a \cdot 120 + 60 \cdot \frac{x - y}{z - t}} \]

      2. fma-define 99.7%

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

      3. clear-num 99.7%

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

      4. un-div-inv 99.7%

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

   6. Applied egg-rr 99.7%

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

   7. Taylor expanded in x around inf 61.8%

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t}} \]

   8. Taylor expanded in z around inf 48.4%

      \[\leadsto 60 \cdot \frac{x}{\color{blue}{z}} \]

   if -2.60000000000000003e145 < x

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

      3. fma-define 99.8%

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

      4. sub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. neg-sub0 99.8%

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

      7. associate-+l- 99.8%

         \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

      8. sub0-neg 99.8%

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

      9. distribute-frac-neg2 99.8%

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

      10. distribute-neg-frac 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in t around inf 51.9%

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

4. Final simplification 51.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+145}:\\ \;\;\;\;60 \cdot \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;a \cdot 120\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 49.9% accurate, 4.3× speedup

Math

\[\begin{array}{l} \\ a \cdot 120 \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (* a 120.0))

C

double code(double x, double y, double z, double t, double a) {
	return a * 120.0;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = a * 120.0d0
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return a * 120.0;
}

Python

def code(x, y, z, t, a):
	return a * 120.0

Julia

function code(x, y, z, t, a)
	return Float64(a * 120.0)
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = a * 120.0;
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(a * 120.0), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. associate-/l* 99.7%

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

   3. fma-define 99.7%

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

   4. sub-neg 99.7%

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

   5. +-commutative 99.7%

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

   6. neg-sub0 99.7%

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

   7. associate-+l- 99.7%

      \[\leadsto \mathsf{fma}\left(x - y, \frac{60}{\color{blue}{0 - \left(t - z\right)}}, a \cdot 120\right) \]

   8. sub0-neg 99.7%

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

   9. distribute-frac-neg2 99.7%

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

   10. distribute-neg-frac 99.7%

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

   11. metadata-eval 99.7%

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

3. Simplified 99.7%

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

5. Taylor expanded in t around inf 48.4%

   \[\leadsto \color{blue}{120 \cdot a} \]

6. Final simplification 48.4%

   \[\leadsto a \cdot 120 \]
7. Add Preprocessing

Developer Target 1: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{60}{\frac{z - t}{x - y}} + a \cdot 120 \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (+ (/ 60.0 (/ (- z t) (- x y))) (* a 120.0)))

C

double code(double x, double y, double z, double t, double a) {
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a) {
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0);
}

Python

def code(x, y, z, t, a):
	return (60.0 / ((z - t) / (x - y))) + (a * 120.0)

Julia

function code(x, y, z, t, a)
	return Float64(Float64(60.0 / Float64(Float64(z - t) / Float64(x - y))) + Float64(a * 120.0))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = (60.0 / ((z - t) / (x - y))) + (a * 120.0);
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(60.0 / N[(N[(z - t), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024170 
(FPCore (x y z t a)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, B"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (/ 60 (/ (- z t) (- x y))) (* a 120)))

  (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))