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

Percentage Accurate: 99.4% → 99.8%

Time: 9.4s

Alternatives: 17

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.4% 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.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.8%

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

      \[\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 2: 60.1% 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 -1 \cdot 10^{+267}:\\ \;\;\;\;\frac{y}{z - t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq -5 \cdot 10^{+104}:\\ \;\;\;\;\frac{x}{z - t} \cdot 60\\ \mathbf{elif}\;t\_1 \leq 10^{+128}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{-60 \cdot y}{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+267)
     (* (/ y (- z t)) -60.0)
     (if (<= t_1 -5e+104)
       (* (/ x (- z t)) 60.0)
       (if (<= t_1 1e+128) (* 120.0 a) (/ (* -60.0 y) (- 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+267) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= -5e+104) {
		tmp = (x / (z - t)) * 60.0;
	} else if (t_1 <= 1e+128) {
		tmp = 120.0 * a;
	} else {
		tmp = (-60.0 * 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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-1d+267)) then
        tmp = (y / (z - t)) * (-60.0d0)
    else if (t_1 <= (-5d+104)) then
        tmp = (x / (z - t)) * 60.0d0
    else if (t_1 <= 1d+128) then
        tmp = 120.0d0 * a
    else
        tmp = ((-60.0d0) * 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 t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -1e+267) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= -5e+104) {
		tmp = (x / (z - t)) * 60.0;
	} else if (t_1 <= 1e+128) {
		tmp = 120.0 * a;
	} else {
		tmp = (-60.0 * y) / (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+267:
		tmp = (y / (z - t)) * -60.0
	elif t_1 <= -5e+104:
		tmp = (x / (z - t)) * 60.0
	elif t_1 <= 1e+128:
		tmp = 120.0 * a
	else:
		tmp = (-60.0 * y) / (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+267)
		tmp = Float64(Float64(y / Float64(z - t)) * -60.0);
	elseif (t_1 <= -5e+104)
		tmp = Float64(Float64(x / Float64(z - t)) * 60.0);
	elseif (t_1 <= 1e+128)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(-60.0 * y) / 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+267)
		tmp = (y / (z - t)) * -60.0;
	elseif (t_1 <= -5e+104)
		tmp = (x / (z - t)) * 60.0;
	elseif (t_1 <= 1e+128)
		tmp = 120.0 * a;
	else
		tmp = (-60.0 * y) / (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+267], N[(N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, -5e+104], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+128], N[(120.0 * a), $MachinePrecision], N[(N[(-60.0 * y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

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

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

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

   5. Applied rewrites 94.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 65.9%

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

   if -9.9999999999999997e266 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.9999999999999997e104

   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} \]

   if -4.9999999999999997e104 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.0000000000000001e128

   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 65.8

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

   5. Applied rewrites 65.8%

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

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

   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 12.4

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

   5. Applied rewrites 12.4%

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

   6. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 87.6

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

   8. Applied rewrites 87.6%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 52.4%

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

Alternative 3: 60.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999997e266 or 1.0000000000000001e128 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.8%

      \[\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.6

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

   5. Applied rewrites 89.6%

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

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

   if -9.9999999999999997e266 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.9999999999999997e104

   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} \]

   if -4.9999999999999997e104 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.0000000000000001e128

   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 65.8

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

   5. Applied rewrites 65.8%

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

Alternative 4: 83.8% 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^{+114}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{elif}\;t\_1 \leq 10^{+128}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z - t}, 60, 120 \cdot a\right)\\ \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+114)
     (* (/ (- x y) (- z t)) 60.0)
     (if (<= t_1 1e+128)
       (fma (/ x (- z t)) 60.0 (* 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+114) {
		tmp = ((x - y) / (z - t)) * 60.0;
	} else if (t_1 <= 1e+128) {
		tmp = fma((x / (z - t)), 60.0, (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+114)
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	elseif (t_1 <= 1e+128)
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	else
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	end
	return 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+114], N[(N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0), $MachinePrecision], If[LessEqual[t$95$1, 1e+128], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0 + N[(120.0 * a), $MachinePrecision]), $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)) < -1e114

   1. Initial program 99.8%

      \[\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.3

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

   5. Applied rewrites 89.3%

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

   if -1e114 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.0000000000000001e128

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 84.6

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

   5. Applied rewrites 84.6%

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

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

   1. Initial program 99.8%

      \[\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 87.6

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

   5. Applied rewrites 87.6%

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

   7. Applied rewrites 87.7%

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

Alternative 5: 74.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 -5 \cdot 10^{-43} \lor \neg \left(t\_1 \leq 2 \cdot 10^{-58}\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 -5e-43) (not (<= t_1 2e-58)))
     (* (- 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 <= -5e-43) || !(t_1 <= 2e-58)) {
		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 <= (-5d-43)) .or. (.not. (t_1 <= 2d-58))) 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 <= -5e-43) || !(t_1 <= 2e-58)) {
		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 <= -5e-43) or not (t_1 <= 2e-58):
		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 <= -5e-43) || !(t_1 <= 2e-58))
		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 <= -5e-43) || ~((t_1 <= 2e-58)))
		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, -5e-43], N[Not[LessEqual[t$95$1, 2e-58]], $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)) < -5.00000000000000019e-43 or 2.0000000000000001e-58 < (/.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 71.7

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

   5. Applied rewrites 71.7%

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

   7. Applied rewrites 71.6%

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

   if -5.00000000000000019e-43 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.0000000000000001e-58

   1. Initial program 99.9%

      \[\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 81.3

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

   5. Applied rewrites 81.3%

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

4. Final simplification 75.5%

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

Alternative 6: 74.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 -5 \cdot 10^{-43}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{60}{z - t}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-58}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \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 -5e-43)
     (* (- x y) (/ 60.0 (- z t)))
     (if (<= t_1 2e-58) (* 120.0 a) (* (/ (- x y) (- z t)) 60.0)))))

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 <= -5e-43) {
		tmp = (x - y) * (60.0 / (z - t));
	} else if (t_1 <= 2e-58) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) / (z - t)) * 60.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) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-5d-43)) then
        tmp = (x - y) * (60.0d0 / (z - t))
    else if (t_1 <= 2d-58) then
        tmp = 120.0d0 * a
    else
        tmp = ((x - y) / (z - t)) * 60.0d0
    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 <= -5e-43) {
		tmp = (x - y) * (60.0 / (z - t));
	} else if (t_1 <= 2e-58) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) / (z - t)) * 60.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if t_1 <= -5e-43:
		tmp = (x - y) * (60.0 / (z - t))
	elif t_1 <= 2e-58:
		tmp = 120.0 * a
	else:
		tmp = ((x - y) / (z - t)) * 60.0
	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 <= -5e-43)
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	elseif (t_1 <= 2e-58)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	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 <= -5e-43)
		tmp = (x - y) * (60.0 / (z - t));
	elseif (t_1 <= 2e-58)
		tmp = 120.0 * a;
	else
		tmp = ((x - y) / (z - t)) * 60.0;
	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, -5e-43], N[(N[(x - y), $MachinePrecision] * N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-58], N[(120.0 * a), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.00000000000000019e-43

   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 72.1

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

   5. Applied rewrites 72.1%

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

   7. Applied rewrites 72.1%

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

   if -5.00000000000000019e-43 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.0000000000000001e-58

   1. Initial program 99.9%

      \[\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 81.3

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

   5. Applied rewrites 81.3%

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

   if 2.0000000000000001e-58 < (/.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 71.3

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

   5. Applied rewrites 71.3%

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

Alternative 7: 61.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 -5 \cdot 10^{+104} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+155}\right):\\ \;\;\;\;\frac{x - y}{-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 -5e+104) (not (<= t_1 5e+155)))
     (* (/ (- x y) (- 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 <= -5e+104) || !(t_1 <= 5e+155)) {
		tmp = ((x - y) / -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 <= (-5d+104)) .or. (.not. (t_1 <= 5d+155))) then
        tmp = ((x - y) / -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 <= -5e+104) || !(t_1 <= 5e+155)) {
		tmp = ((x - y) / -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 <= -5e+104) or not (t_1 <= 5e+155):
		tmp = ((x - y) / -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 <= -5e+104) || !(t_1 <= 5e+155))
		tmp = Float64(Float64(Float64(x - y) / Float64(-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 <= -5e+104) || ~((t_1 <= 5e+155)))
		tmp = ((x - y) / -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, -5e+104], N[Not[LessEqual[t$95$1, 5e+155]], $MachinePrecision]], N[(N[(N[(x - y), $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)) < -4.9999999999999997e104 or 4.9999999999999999e155 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.8%

      \[\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.5

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

   5. Applied rewrites 89.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 61.6%

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

   if -4.9999999999999997e104 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 4.9999999999999999e155

   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 65.0

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

   5. Applied rewrites 65.0%

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

4. Final simplification 64.1%

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

Alternative 8: 59.9% 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 -5 \cdot 10^{+60} \lor \neg \left(t\_1 \leq 10^{+128}\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 -5e+60) (not (<= t_1 1e+128)))
     (* (/ 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 <= -5e+60) || !(t_1 <= 1e+128)) {
		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 <= (-5d+60)) .or. (.not. (t_1 <= 1d+128))) 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 <= -5e+60) || !(t_1 <= 1e+128)) {
		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 <= -5e+60) or not (t_1 <= 1e+128):
		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 <= -5e+60) || !(t_1 <= 1e+128))
		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 <= -5e+60) || ~((t_1 <= 1e+128)))
		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, -5e+60], N[Not[LessEqual[t$95$1, 1e+128]], $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)) < -4.99999999999999975e60 or 1.0000000000000001e128 < (/.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 84.6

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

   5. Applied rewrites 84.6%

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

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

   if -4.99999999999999975e60 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.0000000000000001e128

   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 67.3

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

   5. Applied rewrites 67.3%

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

4. Final simplification 61.3%

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

Alternative 9: 55.3% 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 -5 \cdot 10^{+104} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+191}\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 -5e+104) (not (<= t_1 2e+191)))
     (* 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 <= -5e+104) || !(t_1 <= 2e+191)) {
		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 <= (-5d+104)) .or. (.not. (t_1 <= 2d+191))) 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 <= -5e+104) || !(t_1 <= 2e+191)) {
		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 <= -5e+104) or not (t_1 <= 2e+191):
		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 <= -5e+104) || !(t_1 <= 2e+191))
		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 <= -5e+104) || ~((t_1 <= 2e+191)))
		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, -5e+104], N[Not[LessEqual[t$95$1, 2e+191]], $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)) < -4.9999999999999997e104 or 2.00000000000000015e191 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   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 \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 50.3

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

   5. Applied rewrites 50.3%

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

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

   10. Applied rewrites 43.1%

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

   if -4.9999999999999997e104 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000015e191

   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 62.8

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

   5. Applied rewrites 62.8%

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

4. Final simplification 58.2%

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

Alternative 10: 55.3% 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 -5 \cdot 10^{+104}:\\ \;\;\;\;\frac{x}{t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+191}:\\ \;\;\;\;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 -5e+104)
     (* (/ x t) -60.0)
     (if (<= t_1 2e+191) (* 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 <= -5e+104) {
		tmp = (x / t) * -60.0;
	} else if (t_1 <= 2e+191) {
		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 <= (-5d+104)) then
        tmp = (x / t) * (-60.0d0)
    else if (t_1 <= 2d+191) 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 <= -5e+104) {
		tmp = (x / t) * -60.0;
	} else if (t_1 <= 2e+191) {
		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 <= -5e+104:
		tmp = (x / t) * -60.0
	elif t_1 <= 2e+191:
		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 <= -5e+104)
		tmp = Float64(Float64(x / t) * -60.0);
	elseif (t_1 <= 2e+191)
		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 <= -5e+104)
		tmp = (x / t) * -60.0;
	elseif (t_1 <= 2e+191)
		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, -5e+104], N[(N[(x / t), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, 2e+191], 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)) < -4.9999999999999997e104

   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 48.2

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

   5. Applied rewrites 48.2%

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

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

   if -4.9999999999999997e104 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000015e191

   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 62.8

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

   5. Applied rewrites 62.8%

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

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

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

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

   5. Applied rewrites 53.3%

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

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

   10. Applied rewrites 53.2%

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

Alternative 11: 72.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -1 \cdot 10^{+90}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{t}, -60, 120 \cdot a\right)\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{+16} \lor \neg \left(a \cdot 120 \leq 4 \cdot 10^{-103}\right):\\ \;\;\;\;\frac{-60}{z} \cdot y + a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -1e+90)
   (fma (/ x t) -60.0 (* 120.0 a))
   (if (or (<= (* a 120.0) -2e+16) (not (<= (* a 120.0) 4e-103)))
     (+ (* (/ -60.0 z) y) (* a 120.0))
     (* (/ (- x y) (- z t)) 60.0))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -1e+90) {
		tmp = fma((x / t), -60.0, (120.0 * a));
	} else if (((a * 120.0) <= -2e+16) || !((a * 120.0) <= 4e-103)) {
		tmp = ((-60.0 / z) * y) + (a * 120.0);
	} else {
		tmp = ((x - y) / (z - t)) * 60.0;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -1e+90)
		tmp = fma(Float64(x / t), -60.0, Float64(120.0 * a));
	elseif ((Float64(a * 120.0) <= -2e+16) || !(Float64(a * 120.0) <= 4e-103))
		tmp = Float64(Float64(Float64(-60.0 / z) * y) + Float64(a * 120.0));
	else
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.99999999999999966e89

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 89.8

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

   5. Applied rewrites 89.8%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 82.0%

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

   if -9.99999999999999966e89 < (*.f64 a #s(literal 120 binary64)) < -2e16 or 3.99999999999999983e-103 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.9%

      \[\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 88.2

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

   5. Applied rewrites 88.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 79.2%

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

   if -2e16 < (*.f64 a #s(literal 120 binary64)) < 3.99999999999999983e-103

   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 78.8

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

   5. Applied rewrites 78.8%

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

4. Final simplification 79.5%

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

Alternative 12: 72.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -1 \cdot 10^{+90}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{t}, -60, 120 \cdot a\right)\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{+16}:\\ \;\;\;\;\frac{-60}{z} \cdot y + a \cdot 120\\ \mathbf{elif}\;a \cdot 120 \leq 4 \cdot 10^{-103}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{-0.016666666666666666 \cdot z} + a \cdot 120\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -1e+90)
   (fma (/ x t) -60.0 (* 120.0 a))
   (if (<= (* a 120.0) -2e+16)
     (+ (* (/ -60.0 z) y) (* a 120.0))
     (if (<= (* a 120.0) 4e-103)
       (* (/ (- x y) (- z t)) 60.0)
       (+ (/ y (* -0.016666666666666666 z)) (* a 120.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -1e+90) {
		tmp = fma((x / t), -60.0, (120.0 * a));
	} else if ((a * 120.0) <= -2e+16) {
		tmp = ((-60.0 / z) * y) + (a * 120.0);
	} else if ((a * 120.0) <= 4e-103) {
		tmp = ((x - y) / (z - t)) * 60.0;
	} else {
		tmp = (y / (-0.016666666666666666 * z)) + (a * 120.0);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -1e+90)
		tmp = fma(Float64(x / t), -60.0, Float64(120.0 * a));
	elseif (Float64(a * 120.0) <= -2e+16)
		tmp = Float64(Float64(Float64(-60.0 / z) * y) + Float64(a * 120.0));
	elseif (Float64(a * 120.0) <= 4e-103)
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	else
		tmp = Float64(Float64(y / Float64(-0.016666666666666666 * z)) + Float64(a * 120.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.99999999999999966e89

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 89.8

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

   5. Applied rewrites 89.8%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 82.0%

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

   if -9.99999999999999966e89 < (*.f64 a #s(literal 120 binary64)) < -2e16

   1. Initial program 99.9%

      \[\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.5

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

   5. Applied rewrites 95.5%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 89.8%

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

   if -2e16 < (*.f64 a #s(literal 120 binary64)) < 3.99999999999999983e-103

   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 78.8

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

   5. Applied rewrites 78.8%

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

   if 3.99999999999999983e-103 < (*.f64 a #s(literal 120 binary64))

   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

      \[\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 86.2

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

   5. Applied rewrites 86.2%

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

   7. Applied rewrites 86.2%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 76.1%

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

4. Final simplification 79.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -1 \cdot 10^{+90}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{t}, -60, 120 \cdot a\right)\\ \mathbf{elif}\;a \cdot 120 \leq -2 \cdot 10^{+16}:\\ \;\;\;\;\frac{-60}{z} \cdot y + a \cdot 120\\ \mathbf{elif}\;a \cdot 120 \leq 4 \cdot 10^{-103}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{-0.016666666666666666 \cdot z} + a \cdot 120\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 72.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -5 \cdot 10^{-49}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{t}, -60, 120 \cdot a\right)\\ \mathbf{elif}\;a \cdot 120 \leq 4 \cdot 10^{-103}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z}, 60, 120 \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -5e-49)
   (fma (/ x t) -60.0 (* 120.0 a))
   (if (<= (* a 120.0) 4e-103)
     (* (/ (- x y) (- z t)) 60.0)
     (fma (/ x z) 60.0 (* 120.0 a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -5e-49) {
		tmp = fma((x / t), -60.0, (120.0 * a));
	} else if ((a * 120.0) <= 4e-103) {
		tmp = ((x - y) / (z - t)) * 60.0;
	} else {
		tmp = fma((x / z), 60.0, (120.0 * a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -5e-49)
		tmp = fma(Float64(x / t), -60.0, Float64(120.0 * a));
	elseif (Float64(a * 120.0) <= 4e-103)
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	else
		tmp = fma(Float64(x / z), 60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -4.9999999999999999e-49

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 74.5%

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

   if -4.9999999999999999e-49 < (*.f64 a #s(literal 120 binary64)) < 3.99999999999999983e-103

   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 81.5

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

   5. Applied rewrites 81.5%

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

   if 3.99999999999999983e-103 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 82.2

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

   5. Applied rewrites 82.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 70.8%

      \[\leadsto \mathsf{fma}\left(\frac{x}{z}, 60, 120 \cdot a\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 14: 72.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \cdot 120 \leq -5 \cdot 10^{-49}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{t}, -60, 120 \cdot a\right)\\ \mathbf{elif}\;a \cdot 120 \leq 4 \cdot 10^{-103}:\\ \;\;\;\;\frac{x - y}{z - t} \cdot 60\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 120, \frac{x}{z} \cdot 60\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -5e-49)
   (fma (/ x t) -60.0 (* 120.0 a))
   (if (<= (* a 120.0) 4e-103)
     (* (/ (- x y) (- z t)) 60.0)
     (fma a 120.0 (* (/ x z) 60.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -5e-49) {
		tmp = fma((x / t), -60.0, (120.0 * a));
	} else if ((a * 120.0) <= 4e-103) {
		tmp = ((x - y) / (z - t)) * 60.0;
	} else {
		tmp = fma(a, 120.0, ((x / z) * 60.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -5e-49)
		tmp = fma(Float64(x / t), -60.0, Float64(120.0 * a));
	elseif (Float64(a * 120.0) <= 4e-103)
		tmp = Float64(Float64(Float64(x - y) / Float64(z - t)) * 60.0);
	else
		tmp = fma(a, 120.0, Float64(Float64(x / z) * 60.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -4.9999999999999999e-49

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 74.5%

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

   if -4.9999999999999999e-49 < (*.f64 a #s(literal 120 binary64)) < 3.99999999999999983e-103

   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 81.5

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

   5. Applied rewrites 81.5%

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

   if 3.99999999999999983e-103 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 82.2

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

   5. Applied rewrites 82.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 70.8%

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

   10. Applied rewrites 70.8%

       \[\leadsto \mathsf{fma}\left(a, \color{blue}{120}, \frac{x}{z} \cdot 60\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 15: 90.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -5.9e+16) (not (<= x 4.6e+24)))
   (fma (/ x (- z t)) 60.0 (* 120.0 a))
   (fma (/ y (- z t)) -60.0 (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x <= -5.9e+16) || !(x <= 4.6e+24)) {
		tmp = fma((x / (z - t)), 60.0, (120.0 * a));
	} else {
		tmp = fma((y / (z - t)), -60.0, (120.0 * a));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -5.9e16 or 4.5999999999999998e24 < 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 y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 87.7

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

   5. Applied rewrites 87.7%

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

   if -5.9e16 < x < 4.5999999999999998e24

   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

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 93.2

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

   5. Applied rewrites 93.2%

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

4. Final simplification 91.0%

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

Alternative 16: 62.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= y -1.35e+143) (not (<= y 1.36e+166)))
   (* (/ y (- z t)) -60.0)
   (fma (/ x t) -60.0 (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((y <= -1.35e+143) || !(y <= 1.36e+166)) {
		tmp = (y / (z - t)) * -60.0;
	} else {
		tmp = fma((x / t), -60.0, (120.0 * a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((y <= -1.35e+143) || !(y <= 1.36e+166))
		tmp = Float64(Float64(y / Float64(z - t)) * -60.0);
	else
		tmp = fma(Float64(x / t), -60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.3500000000000001e143 or 1.36000000000000004e166 < 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 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 73.4

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

   5. Applied rewrites 73.4%

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

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

   if -1.3500000000000001e143 < y < 1.36000000000000004e166

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 88.3

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

   5. Applied rewrites 88.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 63.2%

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

4. Final simplification 64.6%

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

Alternative 17: 50.9% 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.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 50.1

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

5. Applied rewrites 50.1%

   \[\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 2024325 
(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)))