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

Percentage Accurate: 99.3% → 99.8%

Time: 8.1s

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.3% 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}{z - t} \cdot \left(x - y\right)\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.1%

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

      \[\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. lower-/.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 2: 60.1% 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 -2 \cdot 10^{+142} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+93}\right):\\ \;\;\;\;\left(x - y\right) \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 -2e+142) (not (<= t_1 2e+93)))
     (* (- x y) (/ -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 <= -2e+142) || !(t_1 <= 2e+93)) {
		tmp = (x - y) * (-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 <= (-2d+142)) .or. (.not. (t_1 <= 2d+93))) then
        tmp = (x - y) * ((-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 <= -2e+142) || !(t_1 <= 2e+93)) {
		tmp = (x - y) * (-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 <= -2e+142) or not (t_1 <= 2e+93):
		tmp = (x - y) * (-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 <= -2e+142) || !(t_1 <= 2e+93))
		tmp = Float64(Float64(x - y) * 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 <= -2e+142) || ~((t_1 <= 2e+93)))
		tmp = (x - y) * (-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, -2e+142], N[Not[LessEqual[t$95$1, 2e+93]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * 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)) < -2.0000000000000001e142 or 2.00000000000000009e93 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 97.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 79.7

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

   5. Applied rewrites 79.7%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 45.8%

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

   if -2.0000000000000001e142 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000009e93

   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 68.8

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

   5. Applied rewrites 68.8%

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

4. Final simplification 61.8%

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

Alternative 3: 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 -2 \cdot 10^{+142}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{-60}{t}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+118}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{60}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -2e+142)
     (* (- x y) (/ -60.0 t))
     (if (<= t_1 2e+118) (* 120.0 a) (* (- x y) (/ 60.0 z))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 94.0%

      \[\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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 78.7

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

   5. Applied rewrites 78.7%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 49.5%

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

   if -2.0000000000000001e142 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.99999999999999993e118

   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 67.4

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

   5. Applied rewrites 67.4%

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

   if 1.99999999999999993e118 < (/.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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 57.9%

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

Alternative 4: 54.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+227} \lor \neg \left(t\_1 \leq 10^{+238}\right):\\ \;\;\;\;\frac{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 -1e+227) (not (<= t_1 1e+238)))
     (* (/ 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 <= -1e+227) || !(t_1 <= 1e+238)) {
		tmp = (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 <= (-1d+227)) .or. (.not. (t_1 <= 1d+238))) then
        tmp = (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 <= -1e+227) || !(t_1 <= 1e+238)) {
		tmp = (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 <= -1e+227) or not (t_1 <= 1e+238):
		tmp = (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 <= -1e+227) || !(t_1 <= 1e+238))
		tmp = Float64(Float64(y / t) * 60.0);
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if ((t_1 <= -1e+227) || ~((t_1 <= 1e+238)))
		tmp = (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, -1e+227], N[Not[LessEqual[t$95$1, 1e+238]], $MachinePrecision]], N[(N[(y / 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)) < -1.0000000000000001e227 or 1e238 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 61.5

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

   5. Applied rewrites 61.5%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 43.9%

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

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

   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 61.0

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

   5. Applied rewrites 61.0%

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

4. Final simplification 58.8%

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

Alternative 5: 53.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 -4 \cdot 10^{+272}:\\ \;\;\;\;\left(-y\right) \cdot \frac{60}{z}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+159}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \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 -4e+272)
     (* (- y) (/ 60.0 z))
     (if (<= t_1 5e+159) (* 120.0 a) (* (/ x z) 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 <= -4e+272) {
		tmp = -y * (60.0 / z);
	} else if (t_1 <= 5e+159) {
		tmp = 120.0 * a;
	} else {
		tmp = (x / z) * 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 <= (-4d+272)) then
        tmp = -y * (60.0d0 / z)
    else if (t_1 <= 5d+159) then
        tmp = 120.0d0 * a
    else
        tmp = (x / z) * 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 <= -4e+272) {
		tmp = -y * (60.0 / z);
	} else if (t_1 <= 5e+159) {
		tmp = 120.0 * a;
	} else {
		tmp = (x / z) * 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 <= -4e+272:
		tmp = -y * (60.0 / z)
	elif t_1 <= 5e+159:
		tmp = 120.0 * a
	else:
		tmp = (x / z) * 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 <= -4e+272)
		tmp = Float64(Float64(-y) * Float64(60.0 / z));
	elseif (t_1 <= 5e+159)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(x / z) * 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 <= -4e+272)
		tmp = -y * (60.0 / z);
	elseif (t_1 <= 5e+159)
		tmp = 120.0 * a;
	else
		tmp = (x / z) * 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, -4e+272], N[((-y) * N[(60.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+159], N[(120.0 * a), $MachinePrecision], N[(N[(x / z), $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)) < -4.0000000000000003e272

   1. Initial program 85.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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 89.2

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

   5. Applied rewrites 89.2%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 56.8%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 42.7%

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

   if -4.0000000000000003e272 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000003e159

   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.7

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

   5. Applied rewrites 62.7%

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

   if 5.00000000000000003e159 < (/.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}{60 \cdot \frac{x - y}{z} + 120 \cdot a} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 70.9

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

   5. Applied rewrites 70.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.7%

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

Alternative 6: 53.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 -4 \cdot 10^{+272}:\\ \;\;\;\;\frac{y}{z} \cdot -60\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+159}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \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 -4e+272)
     (* (/ y z) -60.0)
     (if (<= t_1 5e+159) (* 120.0 a) (* (/ x z) 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 <= -4e+272) {
		tmp = (y / z) * -60.0;
	} else if (t_1 <= 5e+159) {
		tmp = 120.0 * a;
	} else {
		tmp = (x / z) * 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 <= (-4d+272)) then
        tmp = (y / z) * (-60.0d0)
    else if (t_1 <= 5d+159) then
        tmp = 120.0d0 * a
    else
        tmp = (x / z) * 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 <= -4e+272) {
		tmp = (y / z) * -60.0;
	} else if (t_1 <= 5e+159) {
		tmp = 120.0 * a;
	} else {
		tmp = (x / z) * 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 <= -4e+272:
		tmp = (y / z) * -60.0
	elif t_1 <= 5e+159:
		tmp = 120.0 * a
	else:
		tmp = (x / z) * 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 <= -4e+272)
		tmp = Float64(Float64(y / z) * -60.0);
	elseif (t_1 <= 5e+159)
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(x / z) * 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 <= -4e+272)
		tmp = (y / z) * -60.0;
	elseif (t_1 <= 5e+159)
		tmp = 120.0 * a;
	else
		tmp = (x / z) * 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, -4e+272], N[(N[(y / z), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, 5e+159], N[(120.0 * a), $MachinePrecision], N[(N[(x / z), $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)) < -4.0000000000000003e272

   1. Initial program 85.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 57.9

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

   5. Applied rewrites 57.9%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 42.6%

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

   if -4.0000000000000003e272 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.00000000000000003e159

   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.7

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

   5. Applied rewrites 62.7%

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

   if 5.00000000000000003e159 < (/.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}{60 \cdot \frac{x - y}{z} + 120 \cdot a} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 70.9

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

   5. Applied rewrites 70.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 43.7%

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

Alternative 7: 74.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -1e+23)
   (* 120.0 a)
   (if (<= (* a 120.0) 50000000000000.0)
     (* (- x y) (/ 60.0 (- z t)))
     (if (<= (* a 120.0) 1e+128)
       (fma (/ x z) 60.0 (* 120.0 a))
       (fma a 120.0 (* (/ y t) 60.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -1e+23) {
		tmp = 120.0 * a;
	} else if ((a * 120.0) <= 50000000000000.0) {
		tmp = (x - y) * (60.0 / (z - t));
	} else if ((a * 120.0) <= 1e+128) {
		tmp = fma((x / z), 60.0, (120.0 * a));
	} else {
		tmp = fma(a, 120.0, ((y / t) * 60.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(a * 120.0) <= -1e+23)
		tmp = Float64(120.0 * a);
	elseif (Float64(a * 120.0) <= 50000000000000.0)
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	elseif (Float64(a * 120.0) <= 1e+128)
		tmp = fma(Float64(x / z), 60.0, Float64(120.0 * a));
	else
		tmp = fma(a, 120.0, Float64(Float64(y / t) * 60.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.9999999999999992e22

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 75.3

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

   5. Applied rewrites 75.3%

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

   if -9.9999999999999992e22 < (*.f64 a #s(literal 120 binary64)) < 5e13

   1. Initial program 98.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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 73.5

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

   5. Applied rewrites 73.5%

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

   if 5e13 < (*.f64 a #s(literal 120 binary64)) < 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}{60 \cdot \frac{x - y}{z} + 120 \cdot a} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 81.0

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

   5. Applied rewrites 81.0%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 77.8%

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

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

   1. Initial program 97.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 92.2%

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

   10. Applied rewrites 92.2%

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

Alternative 8: 75.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.9999999999999992e22 or 4e15 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.1%

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

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

   5. Applied rewrites 77.3%

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

   if -9.9999999999999992e22 < (*.f64 a #s(literal 120 binary64)) < 4e15

   1. Initial program 99.0%

      \[\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. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. metadata-eval N/A

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

      5. associate-*r/ N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 73.7

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

   5. Applied rewrites 73.7%

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

4. Final simplification 75.6%

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

Alternative 9: 89.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -6.2e+59) (not (<= x 2e+119)))
   (fma a 120.0 (/ (* x 60.0) (- z t)))
   (fma 120.0 a (* (/ y (- z t)) -60.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -6.20000000000000029e59 or 1.99999999999999989e119 < x

   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 \frac{\color{blue}{60 \cdot x}}{z - t} + a \cdot 120 \]
   4. Step-by-step derivation

      1. lower-*.f64 94.2

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

   5. Applied rewrites 94.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 94.2

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

   7. Applied rewrites 94.2%

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

   if -6.20000000000000029e59 < x < 1.99999999999999989e119

   1. Initial program 98.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}{120 \cdot a + -60 \cdot \frac{y}{z - t}} \]

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 92.5

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

   5. Applied rewrites 92.5%

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

4. Final simplification 93.0%

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

Alternative 10: 82.9% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4e52 or 2.00000000000000015e-43 < t

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 90.3

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

   5. Applied rewrites 90.3%

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

   if -4e52 < t < 2.00000000000000015e-43

   1. Initial program 99.1%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

4. Final simplification 88.3%

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

Alternative 11: 82.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4e52 or 2.00000000000000015e-43 < t

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 90.3

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

   5. Applied rewrites 90.3%

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

   if -4e52 < t < 2.00000000000000015e-43

   1. Initial program 99.1%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 85.8%

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

4. Final simplification 87.9%

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

Alternative 12: 81.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2.1e-61) (not (<= t 9.2e-52)))
   (fma 120.0 a (* (/ y (- z t)) -60.0))
   (fma 120.0 a (/ (* -60.0 (- y x)) z))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2.1e-61) || !(t <= 9.2e-52)) {
		tmp = fma(120.0, a, ((y / (z - t)) * -60.0));
	} else {
		tmp = fma(120.0, a, ((-60.0 * (y - x)) / z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2.1e-61) || !(t <= 9.2e-52))
		tmp = fma(120.0, a, Float64(Float64(y / Float64(z - t)) * -60.0));
	else
		tmp = fma(120.0, a, Float64(Float64(-60.0 * Float64(y - x)) / z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.0999999999999999e-61 or 9.19999999999999977e-52 < t

   1. Initial program 99.1%

      \[\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}{120 \cdot a + -60 \cdot \frac{y}{z - t}} \]

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 82.4

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

   5. Applied rewrites 82.4%

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

   if -2.0999999999999999e-61 < t < 9.19999999999999977e-52

   1. Initial program 99.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 90.3

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

   5. Applied rewrites 90.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 89.5%

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

4. Final simplification 85.5%

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

Alternative 13: 76.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -6.5e+55) (not (<= t 4.5e-41)))
   (fma a 120.0 (* (/ y t) 60.0))
   (fma 120.0 a (/ (* -60.0 (- y x)) z))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -6.5e+55) || !(t <= 4.5e-41)) {
		tmp = fma(a, 120.0, ((y / t) * 60.0));
	} else {
		tmp = fma(120.0, a, ((-60.0 * (y - x)) / z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -6.5e+55) || !(t <= 4.5e-41))
		tmp = fma(a, 120.0, Float64(Float64(y / t) * 60.0));
	else
		tmp = fma(120.0, a, Float64(Float64(-60.0 * Float64(y - x)) / z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6.50000000000000027e55 or 4.5e-41 < t

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 90.3

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

   5. Applied rewrites 90.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 79.6%

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

   10. Applied rewrites 79.7%

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

   if -6.50000000000000027e55 < t < 4.5e-41

   1. Initial program 99.1%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.5

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 85.8%

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

4. Final simplification 83.0%

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

Alternative 14: 66.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -5.5e+55) (not (<= t 2.4e-57)))
   (fma a 120.0 (* (/ y t) 60.0))
   (fma (/ y z) -60.0 (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -5.5e+55) || !(t <= 2.4e-57)) {
		tmp = fma(a, 120.0, ((y / t) * 60.0));
	} else {
		tmp = fma((y / z), -60.0, (120.0 * a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -5.5e+55) || !(t <= 2.4e-57))
		tmp = fma(a, 120.0, Float64(Float64(y / t) * 60.0));
	else
		tmp = fma(Float64(y / z), -60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -5.5e+55], N[Not[LessEqual[t, 2.4e-57]], $MachinePrecision]], N[(a * 120.0 + N[(N[(y / t), $MachinePrecision] * 60.0), $MachinePrecision]), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -5.5000000000000004e55 or 2.40000000000000006e-57 < t

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 89.6

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

   5. Applied rewrites 89.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 79.0%

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

   10. Applied rewrites 79.0%

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

   if -5.5000000000000004e55 < t < 2.40000000000000006e-57

   1. Initial program 99.1%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.4

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

   5. Applied rewrites 86.4%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 66.4%

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

4. Final simplification 72.2%

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

Alternative 15: 60.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.5e20 or 7.99999999999999987e-45 < z

   1. Initial program 99.1%

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

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

   5. Applied rewrites 62.4%

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

   if -5.5e20 < z < 7.99999999999999987e-45

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 80.7

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

   5. Applied rewrites 80.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 66.2%

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

   10. Applied rewrites 66.2%

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

4. Final simplification 64.2%

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

Alternative 16: 50.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{+234} \lor \neg \left(x \leq 3.7 \cdot 10^{+141}\right):\\ \;\;\;\;\frac{x}{z} \cdot 60\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -4.7e+234) (not (<= x 3.7e+141))) (* (/ x z) 60.0) (* 120.0 a)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x <= -4.7e+234) || !(x <= 3.7e+141)) {
		tmp = (x / z) * 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) :: tmp
    if ((x <= (-4.7d+234)) .or. (.not. (x <= 3.7d+141))) then
        tmp = (x / z) * 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 tmp;
	if ((x <= -4.7e+234) || !(x <= 3.7e+141)) {
		tmp = (x / z) * 60.0;
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (x <= -4.7e+234) or not (x <= 3.7e+141):
		tmp = (x / z) * 60.0
	else:
		tmp = 120.0 * a
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[x, -4.7e+234], N[Not[LessEqual[x, 3.7e+141]], $MachinePrecision]], N[(N[(x / z), $MachinePrecision] * 60.0), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.6999999999999999e234 or 3.7000000000000003e141 < 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 z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 70.3

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

   5. Applied rewrites 70.3%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 55.2%

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

   if -4.6999999999999999e234 < x < 3.7000000000000003e141

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

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

   5. Applied rewrites 59.9%

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

4. Final simplification 59.1%

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

Alternative 17: 49.6% 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.1%

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

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

5. Applied rewrites 54.1%

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

Developer Target 1: 99.7% 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 2024320 
(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)))