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

Percentage Accurate: 99.4% → 99.4%

Time: 4.4s

Alternatives: 13

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. +-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lift--.f64 N/A

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

   13. lift--.f64 99.5

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

4. Applied rewrites 99.5%

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

Alternative 2: 82.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (or (<= t_1 -5e+194) (not (<= t_1 5e+46)))
     (* (- x y) (/ 60.0 (- z t)))
     (fma (/ x (- z t)) 60.0 (* 120.0 a)))))

C

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

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(60.0 * Float64(x - y)) / Float64(z - t))
	tmp = 0.0
	if ((t_1 <= -5e+194) || !(t_1 <= 5e+46))
		tmp = Float64(Float64(x - y) * Float64(60.0 / Float64(z - t)));
	else
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.99999999999999989e194 or 5.0000000000000002e46 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.3%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 82.2

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

   5. Applied rewrites 82.2%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 82.3

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

   7. Applied rewrites 82.3%

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

   if -4.99999999999999989e194 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.0000000000000002e46

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around 0

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 87.9

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

   7. Applied rewrites 87.9%

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

4. Final simplification 86.3%

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

Alternative 3: 74.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if (t_1 <= -2e+29) or not (t_1 <= 100000000000.0):
		tmp = (x - y) * (60.0 / (z - t))
	else:
		tmp = 120.0 * a
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if ((t_1 <= -2e+29) || ~((t_1 <= 100000000000.0)))
		tmp = (x - y) * (60.0 / (z - t));
	else
		tmp = 120.0 * a;
	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[Or[LessEqual[t$95$1, -2e+29], N[Not[LessEqual[t$95$1, 100000000000.0]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.8%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 75.5

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

   5. Applied rewrites 75.5%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 75.6

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

   7. Applied rewrites 75.6%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 82.1

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

   5. Applied rewrites 82.1%

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

4. Final simplification 79.4%

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

Alternative 4: 60.0% accurate, 0.4× speedup

Math

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

FPCore

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

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+217) || !(t_1 <= 5e+46)) {
		tmp = ((x - y) / t) * -60.0;
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if (t_1 <= -1e+217) or not (t_1 <= 5e+46):
		tmp = ((x - y) / t) * -60.0
	else:
		tmp = 120.0 * a
	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+217) || !(t_1 <= 5e+46))
		tmp = Float64(Float64(Float64(x - y) / t) * -60.0);
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (60.0 * (x - y)) / (z - t);
	tmp = 0.0;
	if ((t_1 <= -1e+217) || ~((t_1 <= 5e+46)))
		tmp = ((x - y) / t) * -60.0;
	else
		tmp = 120.0 * a;
	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[Or[LessEqual[t$95$1, -1e+217], N[Not[LessEqual[t$95$1, 5e+46]], $MachinePrecision]], N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e216 or 5.0000000000000002e46 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 82.9

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

   5. Applied rewrites 82.9%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.5

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

   8. Applied rewrites 54.5%

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

   if -9.9999999999999996e216 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.0000000000000002e46

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 72.6

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

   5. Applied rewrites 72.6%

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

4. Final simplification 67.9%

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

Alternative 5: 59.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 79.3%

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

   6. Taylor expanded in x around inf

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 49.1

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

   8. Applied rewrites 49.1%

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

   if -1.9999999999999999e35 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.0000000000000002e46

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

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

   1. Initial program 97.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 78.8

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

   5. Applied rewrites 78.8%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.4

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

   8. Applied rewrites 54.4%

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

Alternative 6: 61.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 78.7

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

   5. Applied rewrites 78.7%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 47.6

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

   8. Applied rewrites 47.6%

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

   if -1.9999999999999999e61 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.0000000000000002e46

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 77.2

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

   5. Applied rewrites 77.2%

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

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

   1. Initial program 97.9%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 78.8

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

   5. Applied rewrites 78.8%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.4

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

   8. Applied rewrites 54.4%

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

Alternative 7: 53.5% accurate, 0.4× speedup

Math

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

FPCore

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

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+217) || !(t_1 <= 5e+46)) {
		tmp = 60.0 * (y / t);
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t, a):
	t_1 = (60.0 * (x - y)) / (z - t)
	tmp = 0
	if (t_1 <= -1e+217) or not (t_1 <= 5e+46):
		tmp = 60.0 * (y / t)
	else:
		tmp = 120.0 * a
	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+217) || !(t_1 <= 5e+46))
		tmp = Float64(60.0 * Float64(y / t));
	else
		tmp = Float64(120.0 * a);
	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+217) || ~((t_1 <= 5e+46)))
		tmp = 60.0 * (y / t);
	else
		tmp = 120.0 * a;
	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[Or[LessEqual[t$95$1, -1e+217], N[Not[LessEqual[t$95$1, 5e+46]], $MachinePrecision]], N[(60.0 * N[(y / t), $MachinePrecision]), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -9.9999999999999996e216 or 5.0000000000000002e46 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 82.9

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

   5. Applied rewrites 82.9%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.5

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

   8. Applied rewrites 54.5%

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

   9. Taylor expanded in x around 0

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 34.3

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

   11. Applied rewrites 34.3%

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

   if -9.9999999999999996e216 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 5.0000000000000002e46

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 72.6

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

   5. Applied rewrites 72.6%

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

4. Final simplification 62.6%

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

Alternative 8: 55.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 55.2

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

   8. Applied rewrites 55.2%

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

   9. Taylor expanded in x around 0

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 40.1

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

   11. Applied rewrites 40.1%

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

   if -9.9999999999999996e216 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1.00000000000000004e201

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 65.9

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

   5. Applied rewrites 65.9%

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

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

   1. Initial program 95.3%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 90.5

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

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 72.2

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

   8. Applied rewrites 72.2%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 44.4%

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

Alternative 9: 83.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.65 \cdot 10^{-68} \lor \neg \left(t \leq 5.8 \cdot 10^{+61}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{t}, -60, 120 \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - y}{z}, 60, 120 \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -1.65e-68) (not (<= t 5.8e+61)))
   (fma (/ (- x y) t) -60.0 (* 120.0 a))
   (fma (/ (- x y) z) 60.0 (* 120.0 a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -1.65e-68) || !(t <= 5.8e+61)) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = fma(((x - y) / z), 60.0, (120.0 * a));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -1.65e-68) || !(t <= 5.8e+61))
		tmp = fma(Float64(Float64(x - y) / t), -60.0, Float64(120.0 * a));
	else
		tmp = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -1.65e-68], N[Not[LessEqual[t, 5.8e+61]], $MachinePrecision]], N[(N[(N[(x - y), $MachinePrecision] / t), $MachinePrecision] * -60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * 60.0 + N[(120.0 * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.6499999999999999e-68 or 5.8000000000000001e61 < t

   1. Initial program 99.1%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 93.2

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

   5. Applied rewrites 93.2%

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

   if -1.6499999999999999e-68 < t < 5.8000000000000001e61

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 82.2

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

   5. Applied rewrites 82.2%

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

4. Final simplification 87.9%

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

Alternative 10: 83.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- x y) t)))
   (if (<= t -1.65e-68)
     (fma a 120.0 (* t_1 -60.0))
     (if (<= t 5.8e+61)
       (fma a 120.0 (* (/ (- x y) z) 60.0))
       (fma t_1 -60.0 (* 120.0 a))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -1.6499999999999999e-68

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 90.3

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

   7. Applied rewrites 90.3%

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

   if -1.6499999999999999e-68 < t < 5.8000000000000001e61

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 82.2

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

   7. Applied rewrites 82.2%

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

   if 5.8000000000000001e61 < t

   1. Initial program 98.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

Alternative 11: 83.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- x y) t)))
   (if (<= t -1.65e-68)
     (fma a 120.0 (* t_1 -60.0))
     (if (<= t 5.8e+61)
       (fma (/ (- x y) z) 60.0 (* 120.0 a))
       (fma t_1 -60.0 (* 120.0 a))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -1.6499999999999999e-68

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 90.3

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

   7. Applied rewrites 90.3%

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

   if -1.6499999999999999e-68 < t < 5.8000000000000001e61

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 82.2

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

   5. Applied rewrites 82.2%

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

   if 5.8000000000000001e61 < t

   1. Initial program 98.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

Alternative 12: 81.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= y -2.8e+146)
   (* (- x y) (/ 60.0 (- z t)))
   (if (<= y 1.02e+117)
     (fma (/ x (- z t)) 60.0 (* 120.0 a))
     (fma (/ (- x y) t) -60.0 (* 120.0 a)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -2.8000000000000001e146

   1. Initial program 99.8%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 71.8

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

   5. Applied rewrites 71.8%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 71.8

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

   7. Applied rewrites 71.8%

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

   if -2.8000000000000001e146 < y < 1.02e117

   1. Initial program 99.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around 0

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 N/A

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

      9. lift-*.f64 92.4

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

   7. Applied rewrites 92.4%

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

   if 1.02e117 < y

   1. Initial program 97.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 71.9

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

   5. Applied rewrites 71.9%

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

Alternative 13: 51.2% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

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

3. Taylor expanded in z around inf

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

   1. lower-*.f64 58.2

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

5. Applied rewrites 58.2%

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

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025084 
(FPCore (x y z t a)
  :name "Data.Colour.RGB:hslsv from colour-2.3.3, B"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (/ 60 (/ (- z t) (- x y))) (* a 120)))

  (+ (/ (* 60.0 (- x y)) (- z t)) (* a 120.0)))