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

Percentage Accurate: 99.3% → 99.8%

Time: 4.6s

Alternatives: 14

Speedup: 1.0×

Specification

Math

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

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

Math

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

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. mult-flip N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. associate-*l* N/A

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

   8. fp-cancel-sign-sub-inv N/A

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

   9. distribute-lft-neg-in N/A

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

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

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

   11. fp-cancel-sub-sign-inv N/A

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

   12. lift-*.f64 N/A

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

   13. lift--.f64 N/A

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

   14. sub-negate-rev N/A

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

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

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

   16. distribute-lft-neg-out N/A

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

   17. sub-negate-rev N/A

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

   18. lift--.f64 N/A

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

   19. associate-*l* N/A

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

   20. *-commutative N/A

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

   21. lift-*.f64 N/A

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

3. Applied rewrites 99.8%

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

Alternative 2: 89.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma 60.0 (/ x (- z t)) (* 120.0 a))))
   (if (<= x -9.5e+130)
     t_1
     (if (<= x 1.08e+55) (fma a 120.0 (* -60.0 (/ y (- z t)))) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -9.5000000000000009e130 or 1.08000000000000004e55 < x

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   if -9.5000000000000009e130 < x < 1.08000000000000004e55

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. distribute-lft-neg-in N/A

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

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

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. lift-*.f64 N/A

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

      13. lift--.f64 N/A

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

      14. sub-negate-rev N/A

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

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

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

      16. distribute-lft-neg-out N/A

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

      17. sub-negate-rev N/A

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

      18. lift--.f64 N/A

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

      19. associate-*l* N/A

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

      20. *-commutative N/A

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

      21. lift-*.f64 N/A

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

   3. Applied rewrites 99.8%

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

   4. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 75.0

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

   6. Applied rewrites 75.0%

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

Alternative 3: 88.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma 60.0 (/ x (- z t)) (* 120.0 a))))
   (if (<= x -9.5e+130)
     t_1
     (if (<= x 1.08e+55) (fma -60.0 (/ y (- z t)) (* 120.0 a)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -9.5000000000000009e130 or 1.08000000000000004e55 < x

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   if -9.5000000000000009e130 < x < 1.08000000000000004e55

   1. Initial program 99.3%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.0

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

   4. Applied rewrites 75.0%

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

Alternative 4: 82.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -2.00000000000000003e100 or 9.9999999999999993e158 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   if -2.00000000000000003e100 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999993e158

   1. Initial program 99.3%

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

   2. Taylor expanded in x around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.0

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

   4. Applied rewrites 75.0%

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

Alternative 5: 73.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -2.00000000000000009e48 or 1.00000000000000003e-53 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   if -2.00000000000000009e48 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.00000000000000003e-53

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

Alternative 6: 67.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma -60.0 (/ x t) (* 120.0 a))))
   (if (<= t -9.5e+33)
     t_1
     (if (<= t -8.2e-174)
       (fma a 120.0 (* -60.0 (/ y z)))
       (if (<= t 2e+27) (fma 60.0 (/ x z) (* 120.0 a)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(-60.0, (x / t), (120.0 * a));
	double tmp;
	if (t <= -9.5e+33) {
		tmp = t_1;
	} else if (t <= -8.2e-174) {
		tmp = fma(a, 120.0, (-60.0 * (y / z)));
	} else if (t <= 2e+27) {
		tmp = fma(60.0, (x / z), (120.0 * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(-60.0, Float64(x / t), Float64(120.0 * a))
	tmp = 0.0
	if (t <= -9.5e+33)
		tmp = t_1;
	elseif (t <= -8.2e-174)
		tmp = fma(a, 120.0, Float64(-60.0 * Float64(y / z)));
	elseif (t <= 2e+27)
		tmp = fma(60.0, Float64(x / z), Float64(120.0 * a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -9.5000000000000003e33 or 2e27 < t

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   5. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 54.4

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

   7. Applied rewrites 54.4%

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

   if -9.5000000000000003e33 < t < -8.2000000000000002e-174

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. distribute-lft-neg-in N/A

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

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

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

      11. fp-cancel-sub-sign-inv N/A

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

      12. lift-*.f64 N/A

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

      13. lift--.f64 N/A

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

      14. sub-negate-rev N/A

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

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

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

      16. distribute-lft-neg-out N/A

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

      17. sub-negate-rev N/A

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

      18. lift--.f64 N/A

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

      19. associate-*l* N/A

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

      20. *-commutative N/A

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

      21. lift-*.f64 N/A

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

   3. Applied rewrites 99.8%

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

   4. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 75.0

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

   6. Applied rewrites 75.0%

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

   7. Taylor expanded in z around inf

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

      1. lower-/.f64 54.5

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

   9. Applied rewrites 54.5%

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

   if -8.2000000000000002e-174 < t < 2e27

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 55.1

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

   7. Applied rewrites 55.1%

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

Alternative 7: 66.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.0999999999999999e33 or 2e27 < t

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   5. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 54.4

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

   7. Applied rewrites 54.4%

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

   if -5.0999999999999999e33 < t < 2e27

   1. Initial program 99.3%

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

   2. Taylor expanded in y around 0

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 55.1

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

   7. Applied rewrites 55.1%

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

Alternative 8: 60.4% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   if -1e281 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000008e91

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

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

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sub-negate-rev N/A

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

      6. lift--.f64 N/A

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

      7. distribute-rgt-neg-out N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. distribute-lft-neg-in N/A

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

      13. lift--.f64 N/A

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

      14. sub-negate-rev N/A

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

      15. lower-*.f64 N/A

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

      16. lift--.f64 27.7

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

   9. Applied rewrites 27.7%

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

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 28.6

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

   7. Applied rewrites 28.6%

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

Alternative 9: 59.9% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* 60.0 (/ (- x y) z))) (t_2 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_2 -2e+283)
     t_1
     (if (<= t_2 -1e+91)
       (* -60.0 (/ (- x y) t))
       (if (<= t_2 1e+54)
         (* 120.0 a)
         (if (<= t_2 5e+127) (/ (* (- x y) -60.0) t) t_1))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 28.6

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

   7. Applied rewrites 28.6%

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

   if -1.99999999999999991e283 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000008e91

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

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

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sub-negate-rev N/A

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

      6. lift--.f64 N/A

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

      7. distribute-rgt-neg-out N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. distribute-lft-neg-in N/A

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

      13. lift--.f64 N/A

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

      14. sub-negate-rev N/A

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

      15. lower-*.f64 N/A

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

      16. lift--.f64 27.7

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

   9. Applied rewrites 27.7%

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

Alternative 10: 57.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

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

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

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

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sub-negate-rev N/A

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

      6. lift--.f64 N/A

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

      7. distribute-rgt-neg-out N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. distribute-lft-neg-in N/A

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

      13. lift--.f64 N/A

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

      14. sub-negate-rev N/A

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

      15. lower-*.f64 N/A

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

      16. lift--.f64 27.7

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

   9. Applied rewrites 27.7%

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

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

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 16.3

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

   7. Applied rewrites 16.3%

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

Alternative 11: 57.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000008e91 or 1.0000000000000001e54 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999993e158

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

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

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

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

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 16.3

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

   7. Applied rewrites 16.3%

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

Alternative 12: 54.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 16.3

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

   7. Applied rewrites 16.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 16.3

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

   9. Applied rewrites 16.3%

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

   if -1e281 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000008e91

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 50.5

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

   4. Applied rewrites 50.5%

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

   5. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.8

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

   7. Applied rewrites 27.8%

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

   8. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 15.5

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

   10. Applied rewrites 15.5%

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

   if -1.00000000000000008e91 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999993e158

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

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

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 16.3

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

   7. Applied rewrites 16.3%

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

Alternative 13: 54.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -3.9999999999999999e101 or 9.9999999999999993e158 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.3%

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

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 27.1

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

   4. Applied rewrites 27.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 16.3

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

   7. Applied rewrites 16.3%

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

   if -3.9999999999999999e101 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 9.9999999999999993e158

   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}{120 \cdot a} \]
   3. Step-by-step derivation

      1. lower-*.f64 50.9

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

   4. Applied rewrites 50.9%

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

Alternative 14: 50.9% accurate, 4.6× speedup

Math

\[120 \cdot a \]

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

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

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

4. Applied rewrites 50.9%

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

Reproduce

herbie shell --seed 2025175 
(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)))