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

Percentage Accurate: 99.5% → 99.8%

Time: 9.7s

Alternatives: 15

Speedup: 1.1×

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.5% 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.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a, 120, \frac{x - y}{\mathsf{fma}\left(0.016666666666666666, z, -0.016666666666666666 \cdot t\right)}\right) \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (fma
  a
  120.0
  (/ (- x y) (fma 0.016666666666666666 z (* -0.016666666666666666 t)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 99.4

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

   5. lift-/.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. associate-/l* N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. frac-2neg N/A

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

   12. lower-/.f64 N/A

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

   13. metadata-eval N/A

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

   14. neg-sub0 N/A

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

   15. lift--.f64 N/A

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

   16. sub-neg N/A

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

   17. +-commutative N/A

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

   18. associate--r+ N/A

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

   19. neg-sub0 N/A

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

   20. remove-double-neg N/A

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

   21. lower--.f64 99.8

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

4. Applied rewrites 99.8%

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

   1. lift-/.f64 N/A

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

   2. clear-num N/A

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

   3. lower-/.f64 N/A

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

   4. div-inv N/A

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

   5. lower-*.f64 N/A

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

   6. metadata-eval 99.7

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

6. Applied rewrites 99.7%

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

7. Taylor expanded in z around 0

   \[\leadsto \mathsf{fma}\left(a, 120, \frac{1}{\color{blue}{\frac{-1}{60} \cdot t + \frac{1}{60} \cdot z}} \cdot \left(x - y\right)\right) \]
8. Step-by-step derivation

   1. +-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. lower-*.f64 99.7

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

9. Applied rewrites 99.7%

   \[\leadsto \mathsf{fma}\left(a, 120, \frac{1}{\color{blue}{\mathsf{fma}\left(0.016666666666666666, z, -0.016666666666666666 \cdot t\right)}} \cdot \left(x - y\right)\right) \]
10. Step-by-step derivation

    1. lift--.f64 N/A

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

    2. lift-*.f64 N/A

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

    3. *-commutative N/A

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

    4. lift-/.f64 N/A

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

    5. un-div-inv N/A

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

    6. lower-/.f64 N/A

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

    7. lift--.f64 99.8

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

11. Applied rewrites 99.8%

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

Alternative 2: 60.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+233}:\\ \;\;\;\;\frac{y}{z - t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+87}:\\ \;\;\;\;x \cdot \frac{60}{z - t}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+138}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(x - y\right) \cdot 60}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -2e+233)
     (* (/ y (- z t)) -60.0)
     (if (<= t_1 -1e+87)
       (* x (/ 60.0 (- z t)))
       (if (<= t_1 5e+138) (* 120.0 a) (/ (* (- x y) 60.0) z))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -2e+233) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= -1e+87) {
		tmp = x * (60.0 / (z - t));
	} else if (t_1 <= 5e+138) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) * 60.0) / 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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-2d+233)) then
        tmp = (y / (z - t)) * (-60.0d0)
    else if (t_1 <= (-1d+87)) then
        tmp = x * (60.0d0 / (z - t))
    else if (t_1 <= 5d+138) then
        tmp = 120.0d0 * a
    else
        tmp = ((x - y) * 60.0d0) / z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+233], N[(N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, -1e+87], N[(x * N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+138], N[(120.0 * a), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / z), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.99999999999999995e233

   1. Initial program 94.7%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 89.8

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

   5. Applied rewrites 89.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 62.9%

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

   if -1.99999999999999995e233 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e86

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 58.5

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

   5. Applied rewrites 58.5%

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

   7. Applied rewrites 58.4%

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

   if -9.9999999999999996e86 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000016e138

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 75.1

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

   5. Applied rewrites 75.1%

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

   if 5.00000000000000016e138 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 57.7

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

   5. Applied rewrites 57.7%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 57.8%

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

   9. Taylor expanded in z around 0

      \[\leadsto \frac{60 \cdot \left(x - y\right)}{z} \]
   10. Step-by-step derivation

   11. Applied rewrites 54.5%

       \[\leadsto \frac{\left(x - y\right) \cdot 60}{z} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 73.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (or (<= t_1 -1e+87) (not (<= t_1 4e+52)))
     (* (- x y) (/ 60.0 (- z t)))
     (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if ((t_1 <= -1e+87) || !(t_1 <= 4e+52)) {
		tmp = (x - y) * (60.0 / (z - t));
	} else {
		tmp = 120.0 * a;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if ((t_1 <= (-1d+87)) .or. (.not. (t_1 <= 4d+52))) then
        tmp = (x - y) * (60.0d0 / (z - t))
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+87], N[Not[LessEqual[t$95$1, 4e+52]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e86 or 4e52 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.7%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 84.0

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

   5. Applied rewrites 84.0%

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

   7. Applied rewrites 84.0%

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

   if -9.9999999999999996e86 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 4e52

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

4. Final simplification 80.5%

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

Alternative 4: 73.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+87}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+52}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{60}{z - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -1e+87)
     (* (/ (- x y) (- z t)) 60.0)
     (if (<= t_1 4e+52) (* 120.0 a) (* (- x y) (/ 60.0 (- z t)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -1e+87) {
		tmp = ((x - y) / (z - t)) * 60.0;
	} else if (t_1 <= 4e+52) {
		tmp = 120.0 * a;
	} else {
		tmp = (x - y) * (60.0 / (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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-1d+87)) then
        tmp = ((x - y) / (z - t)) * 60.0d0
    else if (t_1 <= 4d+52) then
        tmp = 120.0d0 * a
    else
        tmp = (x - y) * (60.0d0 / (z - t))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if t_1 <= -1e+87:
		tmp = ((x - y) / (z - t)) * 60.0
	elif t_1 <= 4e+52:
		tmp = 120.0 * a
	else:
		tmp = (x - y) * (60.0 / (z - t))
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t))
	tmp = 0.0
	if (t_1 <= -1e+87)
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	elseif (t_1 <= 4e+52)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if (t_1 <= -1e+87)
		tmp = ((x - y) / (z - t)) * 60.0;
	elseif (t_1 <= 4e+52)
		tmp = 120.0 * a;
	else
		tmp = (x - y) * (60.0 / (z - t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+87], N[(N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0), $MachinePrecision], If[LessEqual[t$95$1, 4e+52], N[(120.0 * a), $MachinePrecision], N[(N[(x - y), $MachinePrecision] * N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e86

   1. Initial program 97.7%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 85.4

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

   5. Applied rewrites 85.4%

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

   if -9.9999999999999996e86 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 4e52

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

   if 4e52 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.7%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 82.6

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

   5. Applied rewrites 82.6%

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

   7. Applied rewrites 82.6%

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

Alternative 5: 61.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (or (<= t_1 -1e+87) (not (<= t_1 5e+138)))
     (* (/ (- y x) t) 60.0)
     (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if ((t_1 <= -1e+87) || !(t_1 <= 5e+138)) {
		tmp = ((y - x) / t) * 60.0;
	} else {
		tmp = 120.0 * a;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if ((t_1 <= (-1d+87)) .or. (.not. (t_1 <= 5d+138))) then
        tmp = ((y - x) / t) * 60.0d0
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+87], N[Not[LessEqual[t$95$1, 5e+138]], $MachinePrecision]], N[(N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision] * 60.0), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e86 or 5.00000000000000016e138 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.5%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 88.5

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

   5. Applied rewrites 88.5%

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

   6. Taylor expanded in z around 0

      \[\leadsto \left(-1 \cdot \frac{x - y}{t}\right) \cdot 60 \]
   7. Step-by-step derivation

   8. Applied rewrites 58.4%

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

   if -9.9999999999999996e86 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000016e138

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 75.1

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

   5. Applied rewrites 75.1%

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

4. Final simplification 70.1%

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

Alternative 6: 60.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (or (<= t_1 -1e+162) (not (<= t_1 2e+147)))
     (* (/ y (- z t)) -60.0)
     (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if ((t_1 <= -1e+162) || !(t_1 <= 2e+147)) {
		tmp = (y / (z - t)) * -60.0;
	} else {
		tmp = 120.0 * a;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if ((t_1 <= (-1d+162)) .or. (.not. (t_1 <= 2d+147))) then
        tmp = (y / (z - t)) * (-60.0d0)
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+162], N[Not[LessEqual[t$95$1, 2e+147]], $MachinePrecision]], N[(N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision] * -60.0), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999994e161 or 2e147 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.2%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 92.0

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

   5. Applied rewrites 92.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 50.9%

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

   if -9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e147

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 71.5

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

   5. Applied rewrites 71.5%

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

4. Final simplification 66.6%

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

Alternative 7: 60.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+162}:\\ \;\;\;\;\frac{y}{z - t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+138}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(x - y\right) \cdot 60}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -1e+162)
     (* (/ y (- z t)) -60.0)
     (if (<= t_1 5e+138) (* 120.0 a) (/ (* (- x y) 60.0) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -1e+162) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= 5e+138) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) * 60.0) / 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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-1d+162)) then
        tmp = (y / (z - t)) * (-60.0d0)
    else if (t_1 <= 5d+138) then
        tmp = 120.0d0 * a
    else
        tmp = ((x - y) * 60.0d0) / z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+162], N[(N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+138], N[(120.0 * a), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999994e161

   1. Initial program 96.9%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 91.5

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 50.3%

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

   if -9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000016e138

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.2

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

   5. Applied rewrites 72.2%

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

   if 5.00000000000000016e138 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 57.7

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

   5. Applied rewrites 57.7%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 57.8%

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

   9. Taylor expanded in z around 0

      \[\leadsto \frac{60 \cdot \left(x - y\right)}{z} \]
   10. Step-by-step derivation

   11. Applied rewrites 54.5%

       \[\leadsto \frac{\left(x - y\right) \cdot 60}{z} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 55.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (or (<= t_1 -1e+162) (not (<= t_1 5e+138)))
     (* x (/ -60.0 t))
     (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if ((t_1 <= -1e+162) || !(t_1 <= 5e+138)) {
		tmp = x * (-60.0 / t);
	} else {
		tmp = 120.0 * a;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if ((t_1 <= (-1d+162)) .or. (.not. (t_1 <= 5d+138))) then
        tmp = x * ((-60.0d0) / t)
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e+162], N[Not[LessEqual[t$95$1, 5e+138]], $MachinePrecision]], N[(x * N[(-60.0 / t), $MachinePrecision]), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999994e161 or 5.00000000000000016e138 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.2%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 47.0

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

   5. Applied rewrites 47.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 38.4%

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

   10. Applied rewrites 38.4%

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

   if -9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000016e138

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.2

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

   5. Applied rewrites 72.2%

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

4. Final simplification 63.9%

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

Alternative 9: 55.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+162}:\\ \;\;\;\;\frac{x}{t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+138}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{-60}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -1e+162)
     (* (/ x t) -60.0)
     (if (<= t_1 5e+138) (* 120.0 a) (* x (/ -60.0 t))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -1e+162) {
		tmp = (x / t) * -60.0;
	} else if (t_1 <= 5e+138) {
		tmp = 120.0 * a;
	} else {
		tmp = x * (-60.0 / 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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-1d+162)) then
        tmp = (x / t) * (-60.0d0)
    else if (t_1 <= 5d+138) then
        tmp = 120.0d0 * a
    else
        tmp = x * ((-60.0d0) / t)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+162], N[(N[(x / t), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+138], N[(120.0 * a), $MachinePrecision], N[(x * N[(-60.0 / t), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999994e161

   1. Initial program 96.9%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 46.5

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

   5. Applied rewrites 46.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 35.0%

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

   if -9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000016e138

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{120 \cdot a} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.2

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

   5. Applied rewrites 72.2%

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

   if 5.00000000000000016e138 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 47.6

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

   5. Applied rewrites 47.6%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 42.1%

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

   10. Applied rewrites 42.1%

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

Alternative 10: 88.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -1.52e-18) (not (<= x 4.6e-42)))
   (+ (/ (* 60.0 x) (- z t)) (* a 120.0))
   (+ (* (/ -60.0 (- z t)) y) (* a 120.0))))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if (x <= -1.52e-18) or not (x <= 4.6e-42):
		tmp = ((60.0 * x) / (z - t)) + (a * 120.0)
	else:
		tmp = ((-60.0 / (z - t)) * y) + (a * 120.0)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.52e-18 or 4.60000000000000008e-42 < x

   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 inf

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

      1. lower-*.f64 92.2

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

   5. Applied rewrites 92.2%

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

   if -1.52e-18 < x < 4.60000000000000008e-42

   1. Initial program 99.0%

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

   3. Taylor expanded in x around 0

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

      1. associate-*r/ N/A

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

      2. associate-*l/ N/A

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

      3. metadata-eval N/A

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

      4. distribute-neg-frac N/A

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

      5. metadata-eval N/A

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

      6. associate-*r/ N/A

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

      7. lower-*.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 95.8

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

   5. Applied rewrites 95.8%

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

4. Final simplification 93.9%

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

Alternative 11: 83.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+35} \lor \neg \left(z \leq 7 \cdot 10^{+19}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 120, \frac{x - y}{t} \cdot -60\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.1e+35) (not (<= z 7e+19)))
   (fma (/ (- x y) z) 60.0 (* 120.0 a))
   (fma a 120.0 (* (/ (- x y) t) -60.0))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.1e+35) || !(z <= 7e+19)) {
		tmp = fma(((x - y) / z), 60.0, (120.0 * a));
	} else {
		tmp = fma(a, 120.0, (((x - y) / t) * -60.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.1e+35) || !(z <= 7e+19))
		tmp = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a));
	else
		tmp = fma(a, 120.0, Float64(Float64(Float64(x - y) / t) * -60.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.0999999999999999e35 or 7e19 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 91.5

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

   5. Applied rewrites 91.5%

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

   if -1.0999999999999999e35 < z < 7e19

   1. Initial program 99.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 99.2

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. frac-2neg N/A

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

      12. lower-/.f64 N/A

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

      13. metadata-eval N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(a, 120, \color{blue}{-60 \cdot \frac{x - y}{t}}\right) \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 86.3

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

   7. Applied rewrites 86.3%

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

4. Final simplification 88.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+35} \lor \neg \left(z \leq 7 \cdot 10^{+19}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 120, \frac{x - y}{t} \cdot -60\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 83.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+35} \lor \neg \left(z \leq 7 \cdot 10^{+19}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{t}, -60, 120 \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.1e+35) (not (<= z 7e+19)))
   (fma (/ (- x y) z) 60.0 (* 120.0 a))
   (fma (/ (- x y) t) -60.0 (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.1e+35) || !(z <= 7e+19)) {
		tmp = fma(((x - y) / z), 60.0, (120.0 * a));
	} else {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.1e+35) || !(z <= 7e+19))
		tmp = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a));
	else
		tmp = fma(Float64(Float64(x - y) / t), -60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.0999999999999999e35 or 7e19 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 91.5

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

   5. Applied rewrites 91.5%

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

   if -1.0999999999999999e35 < z < 7e19

   1. Initial program 99.2%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.3

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

   5. Applied rewrites 86.3%

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

4. Final simplification 88.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+35} \lor \neg \left(z \leq 7 \cdot 10^{+19}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{t}, -60, 120 \cdot a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 77.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.1 \cdot 10^{+35} \lor \neg \left(z \leq 3.2 \cdot 10^{+20}\right):\\ \;\;\;\;\mathsf{fma}\left(a, 120, \frac{x}{z} \cdot 60\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{t}, -60, 120 \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.1e+35) (not (<= z 3.2e+20)))
   (fma a 120.0 (* (/ x z) 60.0))
   (fma (/ (- x y) t) -60.0 (* 120.0 a))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.0999999999999999e35 or 3.2e20 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 91.5

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(\frac{x}{z}, 60, 120 \cdot a\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 83.8%

      \[\leadsto \mathsf{fma}\left(\frac{x}{z}, 60, 120 \cdot a\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 83.8%

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

   if -1.0999999999999999e35 < z < 3.2e20

   1. Initial program 99.2%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.3

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

   5. Applied rewrites 86.3%

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

4. Final simplification 85.2%

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

Alternative 14: 99.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 99.4

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

   5. lift-/.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. associate-/l* N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. frac-2neg N/A

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

   12. lower-/.f64 N/A

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

   13. metadata-eval N/A

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

   14. neg-sub0 N/A

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

   15. lift--.f64 N/A

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

   16. sub-neg N/A

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

   17. +-commutative N/A

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

   18. associate--r+ N/A

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

   19. neg-sub0 N/A

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

   20. remove-double-neg N/A

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

   21. lower--.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 15: 51.8% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

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 = 120.0d0 * a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in z around inf

   \[\leadsto \color{blue}{120 \cdot a} \]
4. Step-by-step derivation

   1. lower-*.f64 56.6

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

5. Applied rewrites 56.6%

   \[\leadsto \color{blue}{120 \cdot a} \]
6. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.8× 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 2024302 
(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)))