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

Percentage Accurate: 99.4% → 99.4%

Time: 4.7s

Alternatives: 15

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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.4% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. +-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lift--.f64 N/A

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

   13. lift--.f64 99.4

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

4. Applied rewrites 99.4%

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

Alternative 2: 59.8% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ (- x y) z) 60.0)) (t_2 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_2 -5e+125)
     t_1
     (if (<= t_2 -5e-126)
       (fma (/ y z) -60.0 (* 120.0 a))
       (if (<= t_2 2e+23)
         (* 120.0 a)
         (if (<= t_2 5e+103) (* (/ (- x y) t) -60.0) t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((x - y) / z) * 60.0;
	double t_2 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_2 <= -5e+125) {
		tmp = t_1;
	} else if (t_2 <= -5e-126) {
		tmp = fma((y / z), -60.0, (120.0 * a));
	} else if (t_2 <= 2e+23) {
		tmp = 120.0 * a;
	} else if (t_2 <= 5e+103) {
		tmp = ((x - y) / t) * -60.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(x - y) / z) * 60.0)
	t_2 = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t))
	tmp = 0.0
	if (t_2 <= -5e+125)
		tmp = t_1;
	elseif (t_2 <= -5e-126)
		tmp = fma(Float64(y / z), -60.0, Float64(120.0 * a));
	elseif (t_2 <= 2e+23)
		tmp = Float64(120.0 * a);
	elseif (t_2 <= 5e+103)
		tmp = Float64(Float64(Float64(x - y) / t) * -60.0);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.99999999999999962e125 or 5e103 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.3%

      \[\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 \frac{60 \cdot \left(x - y\right)}{\color{blue}{z - t}} \]

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 84.7

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

   5. Applied rewrites 84.7%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 49.2

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

   8. Applied rewrites 49.2%

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

   if -4.99999999999999962e125 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.00000000000000006e-126

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 58.4

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

   5. Applied rewrites 58.4%

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

   6. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 52.5

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

   8. Applied rewrites 52.5%

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

   if -5.00000000000000006e-126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e23

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 58.5

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

   5. Applied rewrites 58.5%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 28.0

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

   8. Applied rewrites 28.0%

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

Alternative 3: 74.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -200000000000.0)
     (/ (* (- x y) 60.0) (- z t))
     (if (<= t_1 -5e-126)
       (fma a 120.0 (/ (* -60.0 y) z))
       (if (<= t_1 2e+23) (* 120.0 a) (* (- x y) (/ 60.0 (- z t))))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.4

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

   5. Applied rewrites 75.4%

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

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

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 79.8

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

   7. Applied rewrites 79.8%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 57.5%

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

   if -5.00000000000000006e-126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e23

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

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

   1. Initial program 98.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.6

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

   5. Applied rewrites 75.6%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 76.3

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

   7. Applied rewrites 76.3%

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

Alternative 4: 74.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -200000000000.0)
     (/ (* (- x y) 60.0) (- z t))
     (if (<= t_1 -5e-126)
       (fma (/ y z) -60.0 (* 120.0 a))
       (if (<= t_1 2e+23) (* 120.0 a) (* (- x y) (/ 60.0 (- z t))))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.4

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

   5. Applied rewrites 75.4%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 61.0

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

   5. Applied rewrites 61.0%

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

   6. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 57.4

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

   8. Applied rewrites 57.4%

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

   if -5.00000000000000006e-126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e23

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

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

   1. Initial program 98.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.6

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

   5. Applied rewrites 75.6%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 76.3

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

   7. Applied rewrites 76.3%

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

Alternative 5: 74.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -2e11 or 1.9999999999999998e23 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.8%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.5

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

   5. Applied rewrites 75.5%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 76.0

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

   7. Applied rewrites 76.0%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 61.0

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

   5. Applied rewrites 61.0%

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

   6. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 57.4

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

   8. Applied rewrites 57.4%

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

   if -5.00000000000000006e-126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.9999999999999998e23

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

Alternative 6: 59.4% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = ((x - y) / z) * 60.0d0
    t_2 = (60.0d0 * (x - y)) / (z - t)
    if (t_2 <= (-5.5d+111)) then
        tmp = t_1
    else if (t_2 <= 2d+23) then
        tmp = 120.0d0 * a
    else if (t_2 <= 5d+103) then
        tmp = ((x - y) / t) * (-60.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) / z) * 60.0;
	double t_2 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_2 <= -5.5e+111) {
		tmp = t_1;
	} else if (t_2 <= 2e+23) {
		tmp = 120.0 * a;
	} else if (t_2 <= 5e+103) {
		tmp = ((x - y) / t) * -60.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.4999999999999998e111 or 5e103 < (/.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 a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 84.0

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

   5. Applied rewrites 84.0%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 48.6

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

   8. Applied rewrites 48.6%

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

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

   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 68.4

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

   5. Applied rewrites 68.4%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 58.5

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

   5. Applied rewrites 58.5%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 28.0

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

   8. Applied rewrites 28.0%

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

Alternative 7: 56.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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) / t) * (-60.0d0)
    t_2 = (60.0d0 * (x - y)) / (z - t)
    if (t_2 <= (-5.5d+111)) then
        tmp = t_1
    else if (t_2 <= 2d+23) then
        tmp = 120.0d0 * a
    else if (t_2 <= 5d+103) then
        tmp = t_1
    else
        tmp = (x * 60.0d0) / z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.4999999999999998e111 or 1.9999999999999998e23 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5e103

   1. Initial program 98.8%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 76.6

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

   5. Applied rewrites 76.6%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 43.4

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

   8. Applied rewrites 43.4%

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

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

   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 68.4

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

   5. Applied rewrites 68.4%

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

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

   1. Initial program 98.3%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.8

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

   5. Applied rewrites 57.8%

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

   6. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 26.5

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

   8. Applied rewrites 26.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 26.1

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

   10. Applied rewrites 26.1%

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

Alternative 8: 53.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 (- INFINITY))
     (* (/ x z) 60.0)
     (if (<= t_1 -5.5e+111)
       (* (/ y z) -60.0)
       (if (<= t_1 1e+90) (* 120.0 a) (/ (* x 60.0) z))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (x / z) * 60.0;
	} else if (t_1 <= -5.5e+111) {
		tmp = (y / z) * -60.0;
	} else if (t_1 <= 1e+90) {
		tmp = 120.0 * a;
	} else {
		tmp = (x * 60.0) / z;
	}
	return tmp;
}

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 <= -Double.POSITIVE_INFINITY) {
		tmp = (x / z) * 60.0;
	} else if (t_1 <= -5.5e+111) {
		tmp = (y / z) * -60.0;
	} else if (t_1 <= 1e+90) {
		tmp = 120.0 * a;
	} else {
		tmp = (x * 60.0) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if t_1 <= -math.inf:
		tmp = (x / z) * 60.0
	elif t_1 <= -5.5e+111:
		tmp = (y / z) * -60.0
	elif t_1 <= 1e+90:
		tmp = 120.0 * a
	else:
		tmp = (x * 60.0) / z
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 95.1%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 74.2

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

   5. Applied rewrites 74.2%

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

   6. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 42.3

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

   8. Applied rewrites 42.3%

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

   if -inf.0 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.4999999999999998e111

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 50.8

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

   5. Applied rewrites 50.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 22.4

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

   8. Applied rewrites 22.4%

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

   if -5.4999999999999998e111 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999966e89

   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 66.2

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

   5. Applied rewrites 66.2%

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

   if 9.99999999999999966e89 < (/.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 inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.7

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

   5. Applied rewrites 57.7%

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

   6. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 26.0

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

   8. Applied rewrites 26.0%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 25.6

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

   10. Applied rewrites 25.6%

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

Alternative 9: 53.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x / z) * 60.0;
	double t_2 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= -5.5e+111) {
		tmp = (y / z) * -60.0;
	} else if (t_2 <= 1e+90) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (x / z) * 60.0;
	double t_2 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= -5.5e+111) {
		tmp = (y / z) * -60.0;
	} else if (t_2 <= 1e+90) {
		tmp = 120.0 * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (x / z) * 60.0
	t_2 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= -5.5e+111:
		tmp = (y / z) * -60.0
	elif t_2 <= 1e+90:
		tmp = 120.0 * a
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -inf.0 or 9.99999999999999966e89 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 97.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 61.0

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

   5. Applied rewrites 61.0%

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

   6. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 29.2

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

   8. Applied rewrites 29.2%

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

   if -inf.0 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.4999999999999998e111

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 50.8

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

   5. Applied rewrites 50.8%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 22.4

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

   8. Applied rewrites 22.4%

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

   if -5.4999999999999998e111 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999966e89

   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 66.2

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

   5. Applied rewrites 66.2%

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

Alternative 10: 82.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.4999999999999998e111 or 1.9999999999999998e23 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.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 \frac{60 \cdot \left(x - y\right)}{\color{blue}{z - t}} \]

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 79.3

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

   5. Applied rewrites 79.3%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 80.0

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

   7. Applied rewrites 80.0%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 83.2

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

   5. Applied rewrites 83.2%

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

Alternative 11: 53.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    if (t_1 <= (-5d+125)) then
        tmp = (x / t) * (-60.0d0)
    else if (t_1 <= 1d+90) then
        tmp = 120.0d0 * a
    else
        tmp = (x / z) * 60.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.3%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.5

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

   5. Applied rewrites 57.5%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 38.0

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

   8. Applied rewrites 38.0%

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

   9. Taylor expanded in x around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. lift-/.f64 29.2

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

   11. Applied rewrites 29.2%

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

   if -4.99999999999999962e125 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999966e89

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 65.7

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

   5. Applied rewrites 65.7%

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

   if 9.99999999999999966e89 < (/.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 inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.7

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

   5. Applied rewrites 57.7%

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

   6. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 26.0

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

   8. Applied rewrites 26.0%

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

Alternative 12: 53.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.3%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.5

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

   5. Applied rewrites 57.5%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 38.0

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

   8. Applied rewrites 38.0%

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

   9. Taylor expanded in x around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. lift-/.f64 29.2

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

   11. Applied rewrites 29.2%

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

   if -4.99999999999999962e125 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.99999999999999993e90

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 65.7

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

   5. Applied rewrites 65.7%

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

   if 1.99999999999999993e90 < (/.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 y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 41.4

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

   5. Applied rewrites 41.4%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 24.4

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

   8. Applied rewrites 24.4%

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

Alternative 13: 53.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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 / t) * 60.0d0
    t_2 = (60.0d0 * (x - y)) / (z - t)
    if (t_2 <= (-5d+254)) then
        tmp = t_1
    else if (t_2 <= 2d+90) then
        tmp = 120.0d0 * a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.99999999999999994e254 or 1.99999999999999993e90 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 97.9%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 44.4

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

   5. Applied rewrites 44.4%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 27.4

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

   8. Applied rewrites 27.4%

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

   if -4.99999999999999994e254 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.99999999999999993e90

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.3

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

   5. Applied rewrites 61.3%

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

Alternative 14: 89.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ y (- z t)) -60.0 (* 120.0 a))))
   (if (<= y -2.1e+70)
     t_1
     (if (<= y 2.15e+71) (fma (/ x (- z t)) 60.0 (* 120.0 a)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.10000000000000008e70 or 2.14999999999999992e71 < y

   1. Initial program 99.2%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 86.7

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

   5. Applied rewrites 86.7%

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

   if -2.10000000000000008e70 < y < 2.14999999999999992e71

   1. Initial program 99.5%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 91.3

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

   5. Applied rewrites 91.3%

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

Alternative 15: 50.3% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in z around inf

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

   1. lower-*.f64 50.3

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

5. Applied rewrites 50.3%

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

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    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 2025091 
(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)))