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

Percentage Accurate: 99.3% → 99.3%

Time: 10.9s

Alternatives: 19

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(120.0 * a), $MachinePrecision] + N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $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. Final simplification 99.8%

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

Alternative 2: 74.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- x y) 60.0) (- z t))))
   (if (<= t_1 -1000.0)
     (/ (- x y) (* 0.016666666666666666 (- z t)))
     (if (<= t_1 2e-5) (* 120.0 a) (* (/ 60.0 (- z t)) (- x y))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1000.0) {
		tmp = (x - y) / (0.016666666666666666 * (z - t));
	} else if (t_1 <= 2e-5) {
		tmp = 120.0 * a;
	} else {
		tmp = (60.0 / (z - t)) * (x - y);
	}
	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 = ((x - y) * 60.0d0) / (z - t)
    if (t_1 <= (-1000.0d0)) then
        tmp = (x - y) / (0.016666666666666666d0 * (z - t))
    else if (t_1 <= 2d-5) then
        tmp = 120.0d0 * a
    else
        tmp = (60.0d0 / (z - t)) * (x - y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

   5. Applied rewrites 79.8%

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

   7. Applied rewrites 79.8%

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

   if -1e3 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000016e-5

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.8

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

   5. Applied rewrites 73.8%

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

   if 2.00000000000000016e-5 < (/.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. 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 82.2

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

   5. Applied rewrites 82.2%

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

4. Final simplification 77.6%

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

Alternative 3: 74.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ 60.0 (- z t)) (- x y))) (t_2 (/ (* (- x y) 60.0) (- z t))))
   (if (<= t_2 -1000.0) t_1 (if (<= t_2 2e-5) (* 120.0 a) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 / (z - t)) * (x - y);
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1000.0) {
		tmp = t_1;
	} else if (t_2 <= 2e-5) {
		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 = (60.0d0 / (z - t)) * (x - y)
    t_2 = ((x - y) * 60.0d0) / (z - t)
    if (t_2 <= (-1000.0d0)) then
        tmp = t_1
    else if (t_2 <= 2d-5) 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 = (60.0 / (z - t)) * (x - y);
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1000.0) {
		tmp = t_1;
	} else if (t_2 <= 2e-5) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 / Float64(z - t)) * Float64(x - y))
	t_2 = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -1000.0)
		tmp = t_1;
	elseif (t_2 <= 2e-5)
		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 = (60.0 / (z - t)) * (x - y);
	t_2 = ((x - y) * 60.0) / (z - t);
	tmp = 0.0;
	if (t_2 <= -1000.0)
		tmp = t_1;
	elseif (t_2 <= 2e-5)
		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[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(x - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1000.0], t$95$1, If[LessEqual[t$95$2, 2e-5], N[(120.0 * a), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1e3 or 2.00000000000000016e-5 < (/.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. 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 81.1

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

   5. Applied rewrites 81.1%

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

   if -1e3 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000016e-5

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.8

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

   5. Applied rewrites 73.8%

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

4. Final simplification 77.6%

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

Alternative 4: 61.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

   5. Applied rewrites 93.8%

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

   7. Applied rewrites 93.9%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 62.8%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999994e104

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 61.8

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

   5. Applied rewrites 61.8%

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

   if 9.9999999999999994e104 < (/.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 91.1

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

   5. Applied rewrites 91.1%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 56.9%

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

4. Final simplification 61.1%

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

Alternative 5: 61.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 / z) * (x - y);
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 1e+105) {
		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 = (60.0d0 / z) * (x - y)
    t_2 = ((x - y) * 60.0d0) / (z - t)
    if (t_2 <= (-1d+117)) then
        tmp = t_1
    else if (t_2 <= 1d+105) 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 = (60.0 / z) * (x - y);
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 1e+105) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 / z) * Float64(x - y))
	t_2 = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 1e+105)
		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 = (60.0 / z) * (x - y);
	t_2 = ((x - y) * 60.0) / (z - t);
	tmp = 0.0;
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 1e+105)
		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[(60.0 / z), $MachinePrecision] * N[(x - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+117], t$95$1, If[LessEqual[t$95$2, 1e+105], N[(120.0 * a), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000005e117 or 9.9999999999999994e104 < (/.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 92.3

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

   5. Applied rewrites 92.3%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 59.5%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999994e104

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 61.8

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

   5. Applied rewrites 61.8%

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

4. Final simplification 61.1%

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

Alternative 6: 61.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) / z) * 60.0;
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 1e+105) {
		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 = ((x - y) / z) * 60.0d0
    t_2 = ((x - y) * 60.0d0) / (z - t)
    if (t_2 <= (-1d+117)) then
        tmp = t_1
    else if (t_2 <= 1d+105) 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 = ((x - y) / z) * 60.0;
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 1e+105) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(x - y) / z) * 60.0)
	t_2 = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 1e+105)
		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 = ((x - y) / z) * 60.0;
	t_2 = ((x - y) * 60.0) / (z - t);
	tmp = 0.0;
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 1e+105)
		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[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * 60.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+117], t$95$1, If[LessEqual[t$95$2, 1e+105], N[(120.0 * a), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000005e117 or 9.9999999999999994e104 < (/.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 92.3

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

   5. Applied rewrites 92.3%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 59.4%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999994e104

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 61.8

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

   5. Applied rewrites 61.8%

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

4. Final simplification 61.1%

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

Alternative 7: 55.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (-60.0 * x) / -z;
	} else if (t_1 <= 4e+160) {
		tmp = 120.0 * a;
	} else {
		tmp = -y / (0.016666666666666666 * 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 = ((x - y) * 60.0d0) / (z - t)
    if (t_1 <= (-1d+117)) then
        tmp = ((-60.0d0) * x) / -z
    else if (t_1 <= 4d+160) then
        tmp = 120.0d0 * a
    else
        tmp = -y / (0.016666666666666666d0 * 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 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (-60.0 * x) / -z;
	} else if (t_1 <= 4e+160) {
		tmp = 120.0 * a;
	} else {
		tmp = -y / (0.016666666666666666 * z);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 42.8%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 4.00000000000000003e160

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 59.3

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

   5. Applied rewrites 59.3%

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

   if 4.00000000000000003e160 < (/.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 99.8

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

   5. Applied rewrites 99.8%

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

   7. Applied rewrites 99.5%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 63.5%

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

   11. Taylor expanded in y around inf

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

   13. Applied rewrites 39.4%

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

4. Final simplification 54.9%

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

Alternative 8: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 42.8%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e98

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.5

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

   5. Applied rewrites 62.5%

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

   if 2e98 < (/.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 91.5

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 41.3%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 32.3%

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

4. Final simplification 54.7%

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

Alternative 9: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (-60.0 * x) / -z;
	} else if (t_1 <= 2e+98) {
		tmp = 120.0 * a;
	} else {
		tmp = (y / 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 = ((x - y) * 60.0d0) / (z - t)
    if (t_1 <= (-1d+117)) then
        tmp = ((-60.0d0) * x) / -z
    else if (t_1 <= 2d+98) then
        tmp = 120.0d0 * a
    else
        tmp = (y / 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 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (-60.0 * x) / -z;
	} else if (t_1 <= 2e+98) {
		tmp = 120.0 * a;
	} else {
		tmp = (y / t) * 60.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+117], N[(N[(-60.0 * x), $MachinePrecision] / (-z)), $MachinePrecision], If[LessEqual[t$95$1, 2e+98], N[(120.0 * a), $MachinePrecision], N[(N[(y / t), $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)) < -1.00000000000000005e117

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 42.8%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e98

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.5

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

   5. Applied rewrites 62.5%

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

   if 2e98 < (/.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 91.5

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

   5. Applied rewrites 91.5%

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

   7. Applied rewrites 91.3%

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

   8. Taylor expanded in t around inf

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

   10. Applied rewrites 41.2%

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

   11. Taylor expanded in y around inf

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

   13. Applied rewrites 32.2%

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

4. Final simplification 54.7%

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

Alternative 10: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (x / z) * 60.0;
	} else if (t_1 <= 2e+98) {
		tmp = 120.0 * a;
	} else {
		tmp = (y / 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 = ((x - y) * 60.0d0) / (z - t)
    if (t_1 <= (-1d+117)) then
        tmp = (x / z) * 60.0d0
    else if (t_1 <= 2d+98) then
        tmp = 120.0d0 * a
    else
        tmp = (y / 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 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_1 <= -1e+117) {
		tmp = (x / z) * 60.0;
	} else if (t_1 <= 2e+98) {
		tmp = 120.0 * a;
	} else {
		tmp = (y / t) * 60.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+117], N[(N[(x / z), $MachinePrecision] * 60.0), $MachinePrecision], If[LessEqual[t$95$1, 2e+98], N[(120.0 * a), $MachinePrecision], N[(N[(y / t), $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)) < -1.00000000000000005e117

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 42.7%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e98

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.5

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

   5. Applied rewrites 62.5%

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

   if 2e98 < (/.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 91.5

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

   5. Applied rewrites 91.5%

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

   7. Applied rewrites 91.3%

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

   8. Taylor expanded in t around inf

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

   10. Applied rewrites 41.2%

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

   11. Taylor expanded in y around inf

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

   13. Applied rewrites 32.2%

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

4. Final simplification 54.7%

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

Alternative 11: 54.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x / z) * 60.0;
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 2e+98) {
		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 = (x / z) * 60.0d0
    t_2 = ((x - y) * 60.0d0) / (z - t)
    if (t_2 <= (-1d+117)) then
        tmp = t_1
    else if (t_2 <= 2d+98) 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 = (x / z) * 60.0;
	double t_2 = ((x - y) * 60.0) / (z - t);
	double tmp;
	if (t_2 <= -1e+117) {
		tmp = t_1;
	} else if (t_2 <= 2e+98) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x / z) * 60.0)
	t_2 = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 2e+98)
		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 = (x / z) * 60.0;
	t_2 = ((x - y) * 60.0) / (z - t);
	tmp = 0.0;
	if (t_2 <= -1e+117)
		tmp = t_1;
	elseif (t_2 <= 2e+98)
		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[(x / z), $MachinePrecision] * 60.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+117], t$95$1, If[LessEqual[t$95$2, 2e+98], N[(120.0 * a), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000005e117 or 2e98 < (/.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. 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.7

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 47.4

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

   7. Applied rewrites 47.4%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 34.4%

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

   if -1.00000000000000005e117 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e98

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 62.5

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

   5. Applied rewrites 62.5%

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

4. Final simplification 53.9%

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

Alternative 12: 73.3% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -9.99999999999999944e71

   1. Initial program 99.9%

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

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

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 75.6

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

   7. Applied rewrites 75.6%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 81.2%

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

   if -9.99999999999999944e71 < (*.f64 a #s(literal 120 binary64)) < 1.00000000000000001e-35

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

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

   5. Applied rewrites 78.4%

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

   if 1.00000000000000001e-35 < (*.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 a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.4

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

   5. Applied rewrites 73.4%

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

4. Final simplification 77.7%

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

Alternative 13: 57.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;120 \cdot a \leq -1.1 \cdot 10^{+21}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;120 \cdot a \leq 1.55 \cdot 10^{-139}:\\ \;\;\;\;\frac{-60 \cdot x}{t - z}\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* 120.0 a) -1.1e+21)
   (* 120.0 a)
   (if (<= (* 120.0 a) 1.55e-139) (/ (* -60.0 x) (- t z)) (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((120.0 * a) <= -1.1e+21) {
		tmp = 120.0 * a;
	} else if ((120.0 * a) <= 1.55e-139) {
		tmp = (-60.0 * x) / (t - z);
	} 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 ((120.0d0 * a) <= (-1.1d+21)) then
        tmp = 120.0d0 * a
    else if ((120.0d0 * a) <= 1.55d-139) then
        tmp = ((-60.0d0) * x) / (t - z)
    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 ((120.0 * a) <= -1.1e+21) {
		tmp = 120.0 * a;
	} else if ((120.0 * a) <= 1.55e-139) {
		tmp = (-60.0 * x) / (t - z);
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (120.0 * a) <= -1.1e+21:
		tmp = 120.0 * a
	elif (120.0 * a) <= 1.55e-139:
		tmp = (-60.0 * x) / (t - z)
	else:
		tmp = 120.0 * a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(120.0 * a) <= -1.1e+21)
		tmp = Float64(120.0 * a);
	elseif (Float64(120.0 * a) <= 1.55e-139)
		tmp = Float64(Float64(-60.0 * x) / Float64(t - z));
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((120.0 * a) <= -1.1e+21)
		tmp = 120.0 * a;
	elseif ((120.0 * a) <= 1.55e-139)
		tmp = (-60.0 * x) / (t - z);
	else
		tmp = 120.0 * a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -1.1e21 or 1.55e-139 < (*.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 a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 67.9

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

   5. Applied rewrites 67.9%

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

   if -1.1e21 < (*.f64 a #s(literal 120 binary64)) < 1.55e-139

   1. Initial program 99.7%

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

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 48.2

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

   7. Applied rewrites 48.2%

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

4. Final simplification 59.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;120 \cdot a \leq -1.1 \cdot 10^{+21}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;120 \cdot a \leq 1.55 \cdot 10^{-139}:\\ \;\;\;\;\frac{-60 \cdot x}{t - z}\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 89.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -2.8e+64)
   (fma (/ x (- z t)) 60.0 (* 120.0 a))
   (if (<= x 6.4e+50)
     (+ (/ (* -60.0 y) (- z t)) (* 120.0 a))
     (+ (/ (* x 60.0) (- z t)) (* 120.0 a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -2.8e+64) {
		tmp = fma((x / (z - t)), 60.0, (120.0 * a));
	} else if (x <= 6.4e+50) {
		tmp = ((-60.0 * y) / (z - t)) + (120.0 * a);
	} else {
		tmp = ((x * 60.0) / (z - t)) + (120.0 * a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -2.8e+64)
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	elseif (x <= 6.4e+50)
		tmp = Float64(Float64(Float64(-60.0 * y) / Float64(z - t)) + Float64(120.0 * a));
	else
		tmp = Float64(Float64(Float64(x * 60.0) / Float64(z - t)) + Float64(120.0 * a));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -2.8e+64], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 6.4e+50], N[(N[(N[(-60.0 * y), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(120.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(120.0 * a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.80000000000000024e64

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 26.7

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

   5. Applied rewrites 26.7%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t} + 120 \cdot a} \]
   7. 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. *-commutative N/A

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

      6. lower-*.f64 88.1

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

   8. Applied rewrites 88.1%

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

   if -2.80000000000000024e64 < x < 6.39999999999999966e50

   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 inf

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

      1. lower-*.f64 90.9

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

   5. Applied rewrites 90.9%

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 91.2

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

   5. Applied rewrites 91.2%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.8 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z - t}, 60, 120 \cdot a\right)\\ \mathbf{elif}\;x \leq 6.4 \cdot 10^{+50}:\\ \;\;\;\;\frac{-60 \cdot y}{z - t} + 120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 60}{z - t} + 120 \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 89.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{x}{z - t}, 60, 120 \cdot a\right)\\ \mathbf{if}\;x \leq -2.8 \cdot 10^{+64}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{+54}:\\ \;\;\;\;\frac{-60 \cdot y}{z - t} + 120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ x (- z t)) 60.0 (* 120.0 a))))
   (if (<= x -2.8e+64)
     t_1
     (if (<= x 2.4e+54) (+ (/ (* -60.0 y) (- z t)) (* 120.0 a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((x / (z - t)), 60.0, (120.0 * a));
	double tmp;
	if (x <= -2.8e+64) {
		tmp = t_1;
	} else if (x <= 2.4e+54) {
		tmp = ((-60.0 * y) / (z - t)) + (120.0 * a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a))
	tmp = 0.0
	if (x <= -2.8e+64)
		tmp = t_1;
	elseif (x <= 2.4e+54)
		tmp = Float64(Float64(Float64(-60.0 * y) / Float64(z - t)) + Float64(120.0 * a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.80000000000000024e64 or 2.39999999999999998e54 < 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 a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 31.7

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

   5. Applied rewrites 31.7%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t} + 120 \cdot a} \]
   7. 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. *-commutative N/A

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

      6. lower-*.f64 90.6

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

   8. Applied rewrites 90.6%

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

   if -2.80000000000000024e64 < x < 2.39999999999999998e54

   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 inf

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

      1. lower-*.f64 90.4

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

   5. Applied rewrites 90.4%

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

4. Final simplification 90.5%

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

Alternative 16: 53.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;120 \cdot a \leq -1.75 \cdot 10^{-189}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;120 \cdot a \leq 6.5 \cdot 10^{-220}:\\ \;\;\;\;\frac{-60}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* 120.0 a) -1.75e-189)
   (* 120.0 a)
   (if (<= (* 120.0 a) 6.5e-220) (* (/ -60.0 t) x) (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((120.0 * a) <= -1.75e-189) {
		tmp = 120.0 * a;
	} else if ((120.0 * a) <= 6.5e-220) {
		tmp = (-60.0 / t) * x;
	} 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 ((120.0d0 * a) <= (-1.75d-189)) then
        tmp = 120.0d0 * a
    else if ((120.0d0 * a) <= 6.5d-220) then
        tmp = ((-60.0d0) / t) * x
    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 ((120.0 * a) <= -1.75e-189) {
		tmp = 120.0 * a;
	} else if ((120.0 * a) <= 6.5e-220) {
		tmp = (-60.0 / t) * x;
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (120.0 * a) <= -1.75e-189:
		tmp = 120.0 * a
	elif (120.0 * a) <= 6.5e-220:
		tmp = (-60.0 / t) * x
	else:
		tmp = 120.0 * a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(120.0 * a) <= -1.75e-189)
		tmp = Float64(120.0 * a);
	elseif (Float64(120.0 * a) <= 6.5e-220)
		tmp = Float64(Float64(-60.0 / t) * x);
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((120.0 * a) <= -1.75e-189)
		tmp = 120.0 * a;
	elseif ((120.0 * a) <= 6.5e-220)
		tmp = (-60.0 / t) * x;
	else
		tmp = 120.0 * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(120.0 * a), $MachinePrecision], -1.75e-189], N[(120.0 * a), $MachinePrecision], If[LessEqual[N[(120.0 * a), $MachinePrecision], 6.5e-220], N[(N[(-60.0 / t), $MachinePrecision] * x), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -1.7500000000000001e-189 or 6.50000000000000005e-220 < (*.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 a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 54.4

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

   5. Applied rewrites 54.4%

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

   if -1.7500000000000001e-189 < (*.f64 a #s(literal 120 binary64)) < 6.50000000000000005e-220

   1. Initial program 99.7%

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

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

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

   4. Applied rewrites 99.6%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. remove-double-neg N/A

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

      3. unsub-neg N/A

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

      4. distribute-neg-in N/A

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

      5. +-commutative N/A

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

      6. sub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. sub-neg N/A

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

      13. +-commutative N/A

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

      14. distribute-neg-in N/A

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

      15. unsub-neg N/A

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

      16. remove-double-neg N/A

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

      17. lower--.f64 54.0

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

   7. Applied rewrites 54.0%

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

   8. Taylor expanded in t around inf

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

   10. Applied rewrites 34.9%

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

   12. Applied rewrites 34.9%

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

4. Final simplification 50.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;120 \cdot a \leq -1.75 \cdot 10^{-189}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;120 \cdot a \leq 6.5 \cdot 10^{-220}:\\ \;\;\;\;\frac{-60}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 82.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60}{z - t} \cdot \left(x - y\right)\\ \mathbf{if}\;y \leq -2.8 \cdot 10^{+106}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.35 \cdot 10^{+194}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z - t}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ 60.0 (- z t)) (- x y))))
   (if (<= y -2.8e+106)
     t_1
     (if (<= y 2.35e+194) (fma (/ x (- z t)) 60.0 (* 120.0 a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 / (z - t)) * (x - y);
	double tmp;
	if (y <= -2.8e+106) {
		tmp = t_1;
	} else if (y <= 2.35e+194) {
		tmp = fma((x / (z - t)), 60.0, (120.0 * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 / Float64(z - t)) * Float64(x - y))
	tmp = 0.0
	if (y <= -2.8e+106)
		tmp = t_1;
	elseif (y <= 2.35e+194)
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.79999999999999993e106 or 2.34999999999999986e194 < 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. 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.1

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

   5. Applied rewrites 84.1%

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

   if -2.79999999999999993e106 < y < 2.34999999999999986e194

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 56.3

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

   5. Applied rewrites 56.3%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{60 \cdot \frac{x}{z - t} + 120 \cdot a} \]
   7. 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. *-commutative N/A

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

      6. lower-*.f64 88.2

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

   8. Applied rewrites 88.2%

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

4. Final simplification 87.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{+106}:\\ \;\;\;\;\frac{60}{z - t} \cdot \left(x - y\right)\\ \mathbf{elif}\;y \leq 2.35 \cdot 10^{+194}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{z - t}, 60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{60}{z - t} \cdot \left(x - y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 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 19: 51.3% 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 a around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 46.0

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

5. Applied rewrites 46.0%

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

6. Final simplification 46.0%

   \[\leadsto 120 \cdot a \]
7. 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 2024254 
(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)))