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

Percentage Accurate: 99.4% → 99.8%

Time: 13.0s

Alternatives: 20

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. lift-+.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. associate-/l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 99.8

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

4. Applied rewrites 99.8%

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

Alternative 2: 82.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+105], t$95$1, If[LessEqual[t$95$1, 1e+162], N[(60.0 * N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] + N[(a * 120.0), $MachinePrecision]), $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.9999999999999999e105 or 9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.1%

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

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 87.2

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

   5. Applied rewrites 87.2%

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

4. Final simplification 88.2%

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

Alternative 3: 59.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.0%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   7. Applied rewrites 56.7%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   7. Applied rewrites 56.7%

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

4. Final simplification 69.0%

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

Alternative 4: 59.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(60.0 * N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+105], t$95$1, If[LessEqual[t$95$2, 1e+162], N[(a * 120.0), $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.9999999999999999e105 or 9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.1%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   7. Applied rewrites 56.7%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

4. Final simplification 69.0%

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

Alternative 5: 59.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60}{z - t} \cdot x\\ t_2 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_2 \leq -2 \cdot 10^{+105}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 10^{+162}:\\ \;\;\;\;a \cdot 120\\ \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)) (t_2 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_2 -2e+105) t_1 (if (<= t_2 1e+162) (* a 120.0) t_1))))

C

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

Python

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 / Float64(z - t)) * x)
	t_2 = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -2e+105)
		tmp = t_1;
	elseif (t_2 <= 1e+162)
		tmp = Float64(a * 120.0);
	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;
	t_2 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if (t_2 <= -2e+105)
		tmp = t_1;
	elseif (t_2 <= 1e+162)
		tmp = a * 120.0;
	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] * x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+105], t$95$1, If[LessEqual[t$95$2, 1e+162], N[(a * 120.0), $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.9999999999999999e105 or 9.9999999999999994e161 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.1%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   7. Applied rewrites 56.6%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

4. Final simplification 68.9%

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

Alternative 6: 60.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = ((x - y) * -60.0) / t;
	t_2 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if (t_2 <= -2e+105)
		tmp = t_1;
	elseif (t_2 <= 2e+94)
		tmp = a * 120.0;
	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] * -60.0), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+105], t$95$1, If[LessEqual[t$95$2, 2e+94], N[(a * 120.0), $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.9999999999999999e105 or 2e94 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.4%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 53.5

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

   5. Applied rewrites 53.5%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 46.2%

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

   if -1.9999999999999999e105 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e94

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 74.5

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

   5. Applied rewrites 74.5%

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

4. Final simplification 66.3%

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

Alternative 7: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

   1. Initial program 97.0%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 33.2%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 33.2%

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

   13. Applied rewrites 33.4%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   7. Applied rewrites 56.6%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 37.5%

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

4. Final simplification 63.7%

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

Alternative 8: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.0%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 33.2%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 33.2%

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

   13. Applied rewrites 33.4%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 56.6

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

   5. Applied rewrites 56.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 37.4%

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

4. Final simplification 63.7%

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

Alternative 9: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x / N[(t * -0.016666666666666666), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+105], t$95$1, If[LessEqual[t$95$2, 2e+165], N[(a * 120.0), $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.9999999999999999e105 or 1.9999999999999998e165 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.1%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 55.9

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

   5. Applied rewrites 55.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 32.7%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 32.7%

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

   13. Applied rewrites 32.8%

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

   if -1.9999999999999999e105 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e165

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 72.6

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

   5. Applied rewrites 72.6%

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

4. Final simplification 63.0%

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

Alternative 10: 54.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(-60.0 * N[(x / t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+105], t$95$1, If[LessEqual[t$95$2, 2e+165], N[(a * 120.0), $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.9999999999999999e105 or 1.9999999999999998e165 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.1%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 55.9

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

   5. Applied rewrites 55.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 32.7%

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

   if -1.9999999999999999e105 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e165

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 72.6

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

   5. Applied rewrites 72.6%

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

4. Final simplification 62.9%

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

Alternative 11: 55.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

   1. Initial program 96.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 65.1

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

   5. Applied rewrites 65.1%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 34.6%

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

   if -1.99999999999999992e135 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e165

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 70.9

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

   5. Applied rewrites 70.9%

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

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

   1. Initial program 99.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 8.6

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

   5. Applied rewrites 8.6%

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

   6. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 37.5

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

   8. Applied rewrites 37.5%

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

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 26.2%

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

4. Final simplification 62.0%

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

Alternative 12: 55.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * -60.0), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(60.0 * N[(x - y), $MachinePrecision]), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+135], t$95$1, If[LessEqual[t$95$2, 2e+165], N[(a * 120.0), $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.99999999999999992e135 or 1.9999999999999998e165 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.0%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 66.7

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

   5. Applied rewrites 66.7%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 30.7%

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

   if -1.99999999999999992e135 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e165

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 70.9

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

   5. Applied rewrites 70.9%

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

4. Final simplification 62.0%

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

Alternative 13: 72.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (* a 120.0) -2e-113)
   (* a 120.0)
   (if (<= (* a 120.0) 1e-21) (/ (* 60.0 (- x y)) (- z t)) (* a 120.0))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a * 120.0) <= -2e-113) {
		tmp = a * 120.0;
	} else if ((a * 120.0) <= 1e-21) {
		tmp = (60.0 * (x - y)) / (z - t);
	} else {
		tmp = a * 120.0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 a #s(literal 120 binary64)) < -1.99999999999999996e-113 or 9.99999999999999908e-22 < (*.f64 a #s(literal 120 binary64))

   1. Initial program 99.2%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 78.1

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

   5. Applied rewrites 78.1%

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

   if -1.99999999999999996e-113 < (*.f64 a #s(literal 120 binary64)) < 9.99999999999999908e-22

   1. Initial program 99.6%

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

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower--.f64 78.0

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

   5. Applied rewrites 78.0%

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

4. Final simplification 78.1%

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

Alternative 14: 82.4% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ -60.0 t) (- x y) (* a 120.0))))
   (if (<= t -6000000000.0)
     t_1
     (if (<= t 4.2e+97) (fma a 120.0 (* 60.0 (/ (- x y) z))) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6e9 or 4.20000000000000023e97 < t

   1. Initial program 98.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. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 93.2

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

   7. Applied rewrites 93.2%

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

   if -6e9 < t < 4.20000000000000023e97

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 85.1

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

   5. Applied rewrites 85.1%

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

   7. Applied rewrites 85.2%

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

Alternative 15: 82.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma -60.0 (/ (- x y) t) (* a 120.0))))
   (if (<= t -6000000000.0)
     t_1
     (if (<= t 1.52e+113) (fma a 120.0 (* 60.0 (/ (- x y) z))) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6e9 or 1.52000000000000003e113 < t

   1. Initial program 98.9%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 93.9

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

   5. Applied rewrites 93.9%

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

   if -6e9 < t < 1.52000000000000003e113

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

   7. Applied rewrites 84.7%

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

4. Final simplification 88.8%

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

Alternative 16: 81.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma -60.0 (/ (- x y) t) (* a 120.0))))
   (if (<= t -6000000000.0)
     t_1
     (if (<= t 1.52e+113) (fma 60.0 (/ (- x y) z) (* a 120.0)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6e9 or 1.52000000000000003e113 < t

   1. Initial program 98.9%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 93.9

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

   5. Applied rewrites 93.9%

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

   if -6e9 < t < 1.52000000000000003e113

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

4. Final simplification 88.7%

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

Alternative 17: 77.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -7e-30)
   (fma -60.0 (/ y z) (* a 120.0))
   (if (<= z 1.6e+24)
     (fma -60.0 (/ (- x y) t) (* a 120.0))
     (fma 60.0 (/ x z) (* a 120.0)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -7e-30) {
		tmp = fma(-60.0, (y / z), (a * 120.0));
	} else if (z <= 1.6e+24) {
		tmp = fma(-60.0, ((x - y) / t), (a * 120.0));
	} else {
		tmp = fma(60.0, (x / z), (a * 120.0));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -7.0000000000000006e-30

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 83.3

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

   5. Applied rewrites 83.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 76.7%

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

   if -7.0000000000000006e-30 < z < 1.5999999999999999e24

   1. Initial program 98.8%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 87.1

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

   5. Applied rewrites 87.1%

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

   if 1.5999999999999999e24 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 90.6

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

   5. Applied rewrites 90.6%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 83.3%

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

4. Final simplification 82.6%

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

Alternative 18: 99.4% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 99.4

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

   5. lift-/.f64 N/A

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

   6. frac-2neg N/A

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

   7. lower-/.f64 N/A

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

   8. lift-*.f64 N/A

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

   9. *-commutative N/A

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

   10. distribute-rgt-neg-in N/A

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

   11. lower-*.f64 N/A

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

   12. metadata-eval N/A

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

   13. neg-sub0 N/A

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

   14. lift--.f64 N/A

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

   15. sub-neg N/A

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

   16. +-commutative N/A

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

   17. associate--r+ N/A

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

   18. neg-sub0 N/A

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

   19. remove-double-neg N/A

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

   20. lower--.f64 99.4

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

4. Applied rewrites 99.4%

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

Alternative 19: 51.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.4 \cdot 10^{+290}:\\ \;\;\;\;a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;60 \cdot \frac{y}{t}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[y, 2.4e+290], N[(a * 120.0), $MachinePrecision], N[(60.0 * N[(y / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.4000000000000001e290

   1. Initial program 99.4%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 58.7

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

   5. Applied rewrites 58.7%

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

   if 2.4000000000000001e290 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 84.0%

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

   10. Applied rewrites 84.2%

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

4. Final simplification 59.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.4 \cdot 10^{+290}:\\ \;\;\;\;a \cdot 120\\ \mathbf{else}:\\ \;\;\;\;60 \cdot \frac{y}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 20: 50.9% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in z around inf

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

   1. lower-*.f64 57.4

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

5. Applied rewrites 57.4%

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

6. Final simplification 57.4%

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