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

Percentage Accurate: 99.4% → 99.4%

Time: 4.0s

Alternatives: 15

Speedup: 1.0×

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.0× 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. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{60 \cdot \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. lift--.f64 N/A

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

   7. +-commutative 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) \]

3. Applied rewrites 99.4%

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

Alternative 2: 83.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.85e-28)
   (fma (/ (- x y) z) 60.0 (* 120.0 a))
   (if (<= z 8.6e-51)
     (fma (/ (- x y) t) -60.0 (* 120.0 a))
     (fma a 120.0 (/ (* (- x y) 60.0) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.85e-28) {
		tmp = fma(((x - y) / z), 60.0, (120.0 * a));
	} else if (z <= 8.6e-51) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = fma(a, 120.0, (((x - y) * 60.0) / z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3.85e-28)
		tmp = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a));
	elseif (z <= 8.6e-51)
		tmp = fma(Float64(Float64(x - y) / t), -60.0, Float64(120.0 * a));
	else
		tmp = fma(a, 120.0, Float64(Float64(Float64(x - y) * 60.0) / z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -3.85e-28

   1. Initial program 99.4%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z} + 120 \cdot a} \]
   3. 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 84.6

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

   4. Applied rewrites 84.6%

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

   if -3.85e-28 < z < 8.5999999999999995e-51

   1. Initial program 99.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 83.7

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

   4. Applied rewrites 83.7%

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

   if 8.5999999999999995e-51 < z

   1. Initial program 99.3%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{60 \cdot \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. lift--.f64 N/A

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

      7. +-commutative 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.3

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

   3. Applied rewrites 99.3%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 82.7%

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

Alternative 3: 83.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \mathbf{if}\;z \leq -3.85 \cdot 10^{-28}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{-51}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{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 (/ (- x y) z) 60.0 (* 120.0 a))))
   (if (<= z -3.85e-28)
     t_1
     (if (<= z 8.6e-51) (fma (/ (- x y) 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(((x - y) / z), 60.0, (120.0 * a));
	double tmp;
	if (z <= -3.85e-28) {
		tmp = t_1;
	} else if (z <= 8.6e-51) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a))
	tmp = 0.0
	if (z <= -3.85e-28)
		tmp = t_1;
	elseif (z <= 8.6e-51)
		tmp = fma(Float64(Float64(x - y) / 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[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * 60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.85e-28], t$95$1, If[LessEqual[z, 8.6e-51], N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.85e-28 or 8.5999999999999995e-51 < z

   1. Initial program 99.3%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{60 \cdot \frac{x - y}{z} + 120 \cdot a} \]
   3. 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 83.7

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

   4. Applied rewrites 83.7%

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

   if -3.85e-28 < z < 8.5999999999999995e-51

   1. Initial program 99.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 83.7

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

   4. Applied rewrites 83.7%

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

Alternative 4: 77.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, 120, \frac{-60 \cdot y}{z}\right)\\ \mathbf{if}\;z \leq -0.00136:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 470000:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{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 a 120.0 (/ (* -60.0 y) z))))
   (if (<= z -0.00136)
     t_1
     (if (<= z 470000.0) (fma (/ (- x y) 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(a, 120.0, ((-60.0 * y) / z));
	double tmp;
	if (z <= -0.00136) {
		tmp = t_1;
	} else if (z <= 470000.0) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Derivation

1. Split input into 2 regimes

2. if z < -0.00136 or 4.7e5 < z

   1. Initial program 99.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{60 \cdot \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. lift--.f64 N/A

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

      7. +-commutative 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) \]

   3. Applied rewrites 99.4%

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

   4. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{-60 \cdot y}}{z - t}\right) \]
   5. 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 80.6

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

   6. Applied rewrites 80.6%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 73.3%

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

   if -0.00136 < z < 4.7e5

   1. Initial program 99.4%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 80.8

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

   4. Applied rewrites 80.8%

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

Alternative 5: 73.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -7.2e-73)
   (* 120.0 a)
   (if (<= a 3.7e+76) (* (- x y) (/ 60.0 (- z t))) (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -7.2e-73) {
		tmp = 120.0 * a;
	} else if (a <= 3.7e+76) {
		tmp = (x - y) * (60.0 / (z - t));
	} else {
		tmp = 120.0 * a;
	}
	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) :: tmp
    if (a <= (-7.2d-73)) then
        tmp = 120.0d0 * a
    else if (a <= 3.7d+76) then
        tmp = (x - y) * (60.0d0 / (z - t))
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -7.2e-73) {
		tmp = 120.0 * a;
	} else if (a <= 3.7e+76) {
		tmp = (x - y) * (60.0 / (z - t));
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -7.2e-73:
		tmp = 120.0 * a
	elif a <= 3.7e+76:
		tmp = (x - y) * (60.0 / (z - t))
	else:
		tmp = 120.0 * a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -7.2e-73)
		tmp = Float64(120.0 * a);
	elseif (a <= 3.7e+76)
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -7.2e-73)
		tmp = 120.0 * a;
	elseif (a <= 3.7e+76)
		tmp = (x - y) * (60.0 / (z - t));
	else
		tmp = 120.0 * a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -7.1999999999999999e-73 or 3.6999999999999999e76 < a

   1. Initial program 99.4%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 73.2

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

   4. Applied rewrites 73.2%

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

   if -7.1999999999999999e-73 < a < 3.6999999999999999e76

   1. Initial program 99.4%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{60 \cdot \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. lift--.f64 N/A

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

      7. +-commutative 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) \]

   3. Applied rewrites 99.4%

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

   4. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-*r/ N/A

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

      4. *-commutative 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. lift-/.f64 N/A

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

      13. lift--.f64 74.1

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

   6. Applied rewrites 74.1%

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

Alternative 6: 66.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -42000 or 1e-82 < t

   1. Initial program 99.3%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 84.4

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

   4. Applied rewrites 84.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 71.0%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 71.0

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

   9. Applied rewrites 71.0%

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

   if -42000 < t < 1e-82

   1. Initial program 99.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{60 \cdot \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. lift--.f64 N/A

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

      7. +-commutative 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.6

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

   3. Applied rewrites 99.6%

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

   4. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{-60 \cdot y}}{z - t}\right) \]
   5. 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 68.6

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

   6. Applied rewrites 68.6%

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

   7. Taylor expanded in z around inf

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

   9. Applied rewrites 60.8%

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

Alternative 7: 59.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ t_2 := \frac{x}{z - t} \cdot 60\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+68}:\\ \;\;\;\;\frac{y}{z - t} \cdot -60\\ \mathbf{elif}\;t\_1 \leq -1 \cdot 10^{+23}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{+127}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;t\_1 \leq 10^{+225}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{x - 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))) (t_2 (* (/ x (- z t)) 60.0)))
   (if (<= t_1 -2e+68)
     (* (/ y (- z t)) -60.0)
     (if (<= t_1 -1e+23)
       t_2
       (if (<= t_1 1e+127)
         (* 120.0 a)
         (if (<= t_1 1e+225) t_2 (* (/ (- x 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 t_2 = (x / (z - t)) * 60.0;
	double tmp;
	if (t_1 <= -2e+68) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= -1e+23) {
		tmp = t_2;
	} else if (t_1 <= 1e+127) {
		tmp = 120.0 * a;
	} else if (t_1 <= 1e+225) {
		tmp = t_2;
	} else {
		tmp = ((x - 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) :: t_2
    real(8) :: tmp
    t_1 = (60.0d0 * (x - y)) / (z - t)
    t_2 = (x / (z - t)) * 60.0d0
    if (t_1 <= (-2d+68)) then
        tmp = (y / (z - t)) * (-60.0d0)
    else if (t_1 <= (-1d+23)) then
        tmp = t_2
    else if (t_1 <= 1d+127) then
        tmp = 120.0d0 * a
    else if (t_1 <= 1d+225) then
        tmp = t_2
    else
        tmp = ((x - 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 t_2 = (x / (z - t)) * 60.0;
	double tmp;
	if (t_1 <= -2e+68) {
		tmp = (y / (z - t)) * -60.0;
	} else if (t_1 <= -1e+23) {
		tmp = t_2;
	} else if (t_1 <= 1e+127) {
		tmp = 120.0 * a;
	} else if (t_1 <= 1e+225) {
		tmp = t_2;
	} else {
		tmp = ((x - y) / t) * -60.0;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	t_2 = (x / (z - t)) * 60.0
	tmp = 0
	if t_1 <= -2e+68:
		tmp = (y / (z - t)) * -60.0
	elif t_1 <= -1e+23:
		tmp = t_2
	elif t_1 <= 1e+127:
		tmp = 120.0 * a
	elif t_1 <= 1e+225:
		tmp = t_2
	else:
		tmp = ((x - 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))
	t_2 = Float64(Float64(x / Float64(z - t)) * 60.0)
	tmp = 0.0
	if (t_1 <= -2e+68)
		tmp = Float64(Float64(y / Float64(z - t)) * -60.0);
	elseif (t_1 <= -1e+23)
		tmp = t_2;
	elseif (t_1 <= 1e+127)
		tmp = Float64(120.0 * a);
	elseif (t_1 <= 1e+225)
		tmp = t_2;
	else
		tmp = Float64(Float64(Float64(x - 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);
	t_2 = (x / (z - t)) * 60.0;
	tmp = 0.0;
	if (t_1 <= -2e+68)
		tmp = (y / (z - t)) * -60.0;
	elseif (t_1 <= -1e+23)
		tmp = t_2;
	elseif (t_1 <= 1e+127)
		tmp = 120.0 * a;
	elseif (t_1 <= 1e+225)
		tmp = t_2;
	else
		tmp = ((x - 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]}, Block[{t$95$2 = N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * 60.0), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+68], N[(N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision] * -60.0), $MachinePrecision], If[LessEqual[t$95$1, -1e+23], t$95$2, If[LessEqual[t$95$1, 1e+127], N[(120.0 * a), $MachinePrecision], If[LessEqual[t$95$1, 1e+225], t$95$2, N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.4%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{-60 \cdot \frac{y}{z - t}} \]
   3. 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.6

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

   4. Applied rewrites 41.6%

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

   if -1.99999999999999991e68 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999992e22 or 9.99999999999999955e126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999928e224

   1. Initial program 99.6%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 36.5

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

   4. Applied rewrites 36.5%

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

   if -9.9999999999999992e22 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999955e126

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 67.9

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

   4. Applied rewrites 67.9%

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

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

   1. Initial program 97.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 61.2

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

   4. Applied rewrites 61.2%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 58.8

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

   7. Applied rewrites 58.8%

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

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.8%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 57.8

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

   4. Applied rewrites 57.8%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 42.3%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 42.3

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

   9. Applied rewrites 42.3%

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

   if -0.050000000000000003 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999955e126

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 68.7

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

   4. Applied rewrites 68.7%

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

   if 9.99999999999999955e126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999928e224

   1. Initial program 99.6%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 38.7

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

   4. Applied rewrites 38.7%

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

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

   1. Initial program 97.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 61.2

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

   4. Applied rewrites 61.2%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 58.8

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

   7. Applied rewrites 58.8%

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

Alternative 9: 59.2% 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 -2 \cdot 10^{+17}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 10^{+127}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;t\_2 \leq 10^{+225}:\\ \;\;\;\;\frac{x}{z - 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) t) -60.0)) (t_2 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_2 -2e+17)
     t_1
     (if (<= t_2 1e+127)
       (* 120.0 a)
       (if (<= t_2 1e+225) (* (/ x (- z t)) 60.0) t_1)))))

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 <= -2e+17) {
		tmp = t_1;
	} else if (t_2 <= 1e+127) {
		tmp = 120.0 * a;
	} else if (t_2 <= 1e+225) {
		tmp = (x / (z - 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) / t) * (-60.0d0)
    t_2 = (60.0d0 * (x - y)) / (z - t)
    if (t_2 <= (-2d+17)) then
        tmp = t_1
    else if (t_2 <= 1d+127) then
        tmp = 120.0d0 * a
    else if (t_2 <= 1d+225) then
        tmp = (x / (z - 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) / t) * -60.0;
	double t_2 = (60.0 * (x - y)) / (z - t);
	double tmp;
	if (t_2 <= -2e+17) {
		tmp = t_1;
	} else if (t_2 <= 1e+127) {
		tmp = 120.0 * a;
	} else if (t_2 <= 1e+225) {
		tmp = (x / (z - t)) * 60.0;
	} else {
		tmp = t_1;
	}
	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 <= -2e+17:
		tmp = t_1
	elif t_2 <= 1e+127:
		tmp = 120.0 * a
	elif t_2 <= 1e+225:
		tmp = (x / (z - t)) * 60.0
	else:
		tmp = t_1
	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 <= -2e+17)
		tmp = t_1;
	elseif (t_2 <= 1e+127)
		tmp = Float64(120.0 * a);
	elseif (t_2 <= 1e+225)
		tmp = Float64(Float64(x / Float64(z - 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) / t) * -60.0;
	t_2 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if (t_2 <= -2e+17)
		tmp = t_1;
	elseif (t_2 <= 1e+127)
		tmp = 120.0 * a;
	elseif (t_2 <= 1e+225)
		tmp = (x / (z - 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] / 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, -2e+17], t$95$1, If[LessEqual[t$95$2, 1e+127], N[(120.0 * a), $MachinePrecision], If[LessEqual[t$95$2, 1e+225], N[(N[(x / N[(z - t), $MachinePrecision]), $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)) < -2e17 or 9.99999999999999928e224 < (/.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. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 58.5

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

   4. Applied rewrites 58.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 46.4

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

   7. Applied rewrites 46.4%

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

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

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 68.1

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

   4. Applied rewrites 68.1%

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

   if 9.99999999999999955e126 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999928e224

   1. Initial program 99.6%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 38.7

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

   4. Applied rewrites 38.7%

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

Alternative 10: 59.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.55 \cdot 10^{-78}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;a \leq 2.15 \cdot 10^{-30}:\\ \;\;\;\;\frac{x - y}{t} \cdot -60\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.55e-78)
   (* 120.0 a)
   (if (<= a 2.15e-30) (* (/ (- x y) t) -60.0) (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.55e-78) {
		tmp = 120.0 * a;
	} else if (a <= 2.15e-30) {
		tmp = ((x - y) / t) * -60.0;
	} else {
		tmp = 120.0 * a;
	}
	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) :: tmp
    if (a <= (-1.55d-78)) then
        tmp = 120.0d0 * a
    else if (a <= 2.15d-30) then
        tmp = ((x - y) / t) * (-60.0d0)
    else
        tmp = 120.0d0 * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.55e-78) {
		tmp = 120.0 * a;
	} else if (a <= 2.15e-30) {
		tmp = ((x - y) / t) * -60.0;
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -1.55e-78:
		tmp = 120.0 * a
	elif a <= 2.15e-30:
		tmp = ((x - y) / t) * -60.0
	else:
		tmp = 120.0 * a
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -1.55e-78)
		tmp = 120.0 * a;
	elseif (a <= 2.15e-30)
		tmp = ((x - y) / t) * -60.0;
	else
		tmp = 120.0 * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -1.55e-78], N[(120.0 * a), $MachinePrecision], If[LessEqual[a, 2.15e-30], N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -1.55000000000000009e-78 or 2.14999999999999983e-30 < a

   1. Initial program 99.4%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 70.2

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

   4. Applied rewrites 70.2%

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

   if -1.55000000000000009e-78 < a < 2.14999999999999983e-30

   1. Initial program 99.4%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 55.2

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

   4. Applied rewrites 55.2%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 43.1

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

   7. Applied rewrites 43.1%

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

Alternative 11: 54.4% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 95.9%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 68.1

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

   4. Applied rewrites 68.1%

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

   5. Taylor expanded in y around inf

      \[\leadsto 60 \cdot \color{blue}{\frac{y}{t}} \]
   6. 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 37.3

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

   7. Applied rewrites 37.3%

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

   if -1.00000000000000007e260 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999955e126

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.2

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

   4. Applied rewrites 60.2%

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

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

   1. Initial program 99.6%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 38.9

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

   4. Applied rewrites 38.9%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 21.6%

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

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

   1. Initial program 97.4%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 62.3

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

   4. Applied rewrites 62.3%

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

   5. Taylor expanded in x around inf

      \[\leadsto -60 \cdot \color{blue}{\frac{x}{t}} \]
   6. 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. lower-/.f64 36.1

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

   7. Applied rewrites 36.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 35.6

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

   9. Applied rewrites 35.6%

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

Alternative 12: 54.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.9%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 68.1

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

   4. Applied rewrites 68.1%

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

   5. Taylor expanded in y around inf

      \[\leadsto 60 \cdot \color{blue}{\frac{y}{t}} \]
   6. 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 37.3

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

   7. Applied rewrites 37.3%

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

   if -1.00000000000000007e260 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999955e126

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.2

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

   4. Applied rewrites 60.2%

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

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

   1. Initial program 98.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 58.2

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

   4. Applied rewrites 58.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto -60 \cdot \color{blue}{\frac{x}{t}} \]
   6. 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. lower-/.f64 28.0

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

   7. Applied rewrites 28.0%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 27.8

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

   9. Applied rewrites 27.8%

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

Alternative 13: 54.3% accurate, 0.5× speedup

Math

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.9%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 68.1

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

   4. Applied rewrites 68.1%

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

   5. Taylor expanded in y around inf

      \[\leadsto 60 \cdot \color{blue}{\frac{y}{t}} \]
   6. 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 37.3

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

   7. Applied rewrites 37.3%

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

   if -1.00000000000000007e260 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.99999999999999955e126

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.2

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

   4. Applied rewrites 60.2%

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

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

   1. Initial program 98.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 58.2

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

   4. Applied rewrites 58.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto -60 \cdot \color{blue}{\frac{x}{t}} \]
   6. 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. lower-/.f64 28.0

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

   7. Applied rewrites 28.0%

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

Alternative 14: 52.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.5%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 56.5

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

   4. Applied rewrites 56.5%

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

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

   1. Initial program 98.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 58.2

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

   4. Applied rewrites 58.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto -60 \cdot \color{blue}{\frac{x}{t}} \]
   6. 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. lower-/.f64 28.0

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

   7. Applied rewrites 28.0%

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

Alternative 15: 50.6% accurate, 4.6× 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. Taylor expanded in z around inf

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

   1. lower-*.f64 50.6

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

4. Applied rewrites 50.6%

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

Reproduce

herbie shell --seed 2025112 
(FPCore (x y z t a)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, B"
  :precision binary64
  (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))