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

Percentage Accurate: 99.2% → 99.8%

Time: 8.8s

Alternatives: 14

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(a * 120.0 + N[(N[(60.0 / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(x - y), $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)}{z - t} + \color{blue}{a \cdot 120} \]

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

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

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

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

   5. +-commutative N/A

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

   6. remove-double-neg N/A

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

   7. lower-fma.f64 99.4

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

   8. lift-/.f64 N/A

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

   9. lift-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{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. associate-/l* N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

   14. lower-/.f64 99.7

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

4. Applied rewrites 99.7%

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

Alternative 2: 59.2% 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^{+122} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+75}\right):\\ \;\;\;\;\frac{x \cdot 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 -5e+122) (not (<= t_1 5e+75)))
     (/ (* x 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 <= -5e+122) || !(t_1 <= 5e+75)) {
		tmp = (x * 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 <= (-5d+122)) .or. (.not. (t_1 <= 5d+75))) then
        tmp = (x * 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 <= -5e+122) || !(t_1 <= 5e+75)) {
		tmp = (x * 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 <= -5e+122) or not (t_1 <= 5e+75):
		tmp = (x * 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 <= -5e+122) || !(t_1 <= 5e+75))
		tmp = Float64(Float64(x * 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 <= -5e+122) || ~((t_1 <= 5e+75)))
		tmp = (x * 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, -5e+122], N[Not[LessEqual[t$95$1, 5e+75]], $MachinePrecision]], N[(N[(x * 60.0), $MachinePrecision] / N[(z - 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)) < -4.99999999999999989e122 or 5.0000000000000002e75 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 51.5

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

   5. Applied rewrites 51.5%

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

   7. Applied rewrites 51.6%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.4

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

   5. Applied rewrites 61.4%

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

4. Final simplification 58.2%

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

Alternative 3: 59.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 -5 \cdot 10^{+122} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+75}\right):\\ \;\;\;\;x \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 -5e+122) (not (<= t_1 5e+75)))
     (* x (/ 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 <= -5e+122) || !(t_1 <= 5e+75)) {
		tmp = x * (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 <= (-5d+122)) .or. (.not. (t_1 <= 5d+75))) then
        tmp = x * (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 <= -5e+122) || !(t_1 <= 5e+75)) {
		tmp = x * (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 <= -5e+122) or not (t_1 <= 5e+75):
		tmp = x * (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 <= -5e+122) || !(t_1 <= 5e+75))
		tmp = Float64(x * 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 <= -5e+122) || ~((t_1 <= 5e+75)))
		tmp = x * (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, -5e+122], N[Not[LessEqual[t$95$1, 5e+75]], $MachinePrecision]], N[(x * 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)) < -4.99999999999999989e122 or 5.0000000000000002e75 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 51.5

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

   5. Applied rewrites 51.5%

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

   7. Applied rewrites 51.6%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.4

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

   5. Applied rewrites 61.4%

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

4. Final simplification 58.2%

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

Alternative 4: 54.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{60 \cdot \left(x - y\right)}{z - t}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+126} \lor \neg \left(t\_1 \leq 5 \cdot 10^{+75}\right):\\ \;\;\;\;x \cdot \frac{-60}{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+126) (not (<= t_1 5e+75)))
     (* x (/ -60.0 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+126) || !(t_1 <= 5e+75)) {
		tmp = x * (-60.0 / 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+126)) .or. (.not. (t_1 <= 5d+75))) then
        tmp = x * ((-60.0d0) / 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+126) || !(t_1 <= 5e+75)) {
		tmp = x * (-60.0 / 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+126) or not (t_1 <= 5e+75):
		tmp = x * (-60.0 / 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+126) || !(t_1 <= 5e+75))
		tmp = Float64(x * Float64(-60.0 / 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+126) || ~((t_1 <= 5e+75)))
		tmp = x * (-60.0 / 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+126], N[Not[LessEqual[t$95$1, 5e+75]], $MachinePrecision]], N[(x * N[(-60.0 / 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.99999999999999925e125 or 5.0000000000000002e75 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 98.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 51.5

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

   5. Applied rewrites 51.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 28.7%

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

   10. Applied rewrites 28.7%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.3

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

   5. Applied rewrites 61.3%

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

4. Final simplification 51.0%

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

Alternative 5: 54.3% 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^{+175}:\\ \;\;\;\;\frac{x}{z} \cdot 60\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+75}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{-60 \cdot x}{t}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.2%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 52.7

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

   5. Applied rewrites 52.7%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 38.2%

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

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

   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 57.8

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

   5. Applied rewrites 57.8%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 56.3

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

   5. Applied rewrites 56.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 32.2%

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

   10. Applied rewrites 32.2%

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

4. Final simplification 51.7%

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

Alternative 6: 54.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 45.5

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

   5. Applied rewrites 45.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 24.4%

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

   10. Applied rewrites 24.4%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.3

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

   5. Applied rewrites 61.3%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 56.3

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

   5. Applied rewrites 56.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 32.2%

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

   10. Applied rewrites 32.2%

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

4. Final simplification 51.0%

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

Alternative 7: 54.1% accurate, 0.4× speedup

Math

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

   1. Initial program 97.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 45.5

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

   5. Applied rewrites 45.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 24.4%

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

   10. Applied rewrites 24.4%

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

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

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 61.3

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

   5. Applied rewrites 61.3%

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

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

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 56.3

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

   5. Applied rewrites 56.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 32.2%

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

4. Final simplification 51.0%

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

Alternative 8: 73.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.8 \cdot 10^{+100}:\\ \;\;\;\;120 \cdot a\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-32}:\\ \;\;\;\;\frac{\left(x - y\right) \cdot 60}{z - t}\\ \mathbf{elif}\;a \leq 4.4 \cdot 10^{+119}:\\ \;\;\;\;\mathsf{fma}\left(120, a, \frac{y}{z} \cdot -60\right)\\ \mathbf{else}:\\ \;\;\;\;120 \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -3.8e+100)
   (* 120.0 a)
   (if (<= a 2.2e-32)
     (/ (* (- x y) 60.0) (- z t))
     (if (<= a 4.4e+119) (fma 120.0 a (* (/ y z) -60.0)) (* 120.0 a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -3.8e+100) {
		tmp = 120.0 * a;
	} else if (a <= 2.2e-32) {
		tmp = ((x - y) * 60.0) / (z - t);
	} else if (a <= 4.4e+119) {
		tmp = fma(120.0, a, ((y / z) * -60.0));
	} else {
		tmp = 120.0 * a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -3.8e+100)
		tmp = Float64(120.0 * a);
	elseif (a <= 2.2e-32)
		tmp = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t));
	elseif (a <= 4.4e+119)
		tmp = fma(120.0, a, Float64(Float64(y / z) * -60.0));
	else
		tmp = Float64(120.0 * a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -3.8e+100], N[(120.0 * a), $MachinePrecision], If[LessEqual[a, 2.2e-32], N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 4.4e+119], N[(120.0 * a + N[(N[(y / z), $MachinePrecision] * -60.0), $MachinePrecision]), $MachinePrecision], N[(120.0 * a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -3.79999999999999963e100 or 4.4000000000000003e119 < a

   1. Initial program 98.5%

      \[\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 89.3

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

   5. Applied rewrites 89.3%

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

   if -3.79999999999999963e100 < a < 2.2e-32

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-*r/ N/A

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

      5. times-frac N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower--.f64 85.6

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

   5. Applied rewrites 85.6%

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

   7. Applied rewrites 83.7%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 77.9%

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

   if 2.2e-32 < a < 4.4000000000000003e119

   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 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 76.8

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

   5. Applied rewrites 76.8%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 68.1%

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

4. Final simplification 79.6%

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

Alternative 9: 89.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -2.2e-13) (not (<= x 3.7e+91)))
   (fma (/ x (- z t)) 60.0 (* 120.0 a))
   (fma a 120.0 (/ (* -60.0 y) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x <= -2.2e-13) || !(x <= 3.7e+91)) {
		tmp = fma((x / (z - t)), 60.0, (120.0 * a));
	} else {
		tmp = fma(a, 120.0, ((-60.0 * y) / (z - t)));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((x <= -2.2e-13) || !(x <= 3.7e+91))
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	else
		tmp = fma(a, 120.0, Float64(Float64(-60.0 * y) / Float64(z - t)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.19999999999999997e-13 or 3.69999999999999984e91 < x

   1. Initial program 98.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. lower-fma.f64 98.9

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{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. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 99.7

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

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 120, \frac{60}{z - t} \cdot \left(x - y\right)\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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.4

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

   7. Applied rewrites 86.4%

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

   if -2.19999999999999997e-13 < x < 3.69999999999999984e91

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 93.6

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

   5. Applied rewrites 93.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 93.6

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

   7. Applied rewrites 93.6%

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

4. Final simplification 90.5%

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

Alternative 10: 89.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= x -2.2e-13) (not (<= x 3.7e+91)))
   (fma (/ x (- z t)) 60.0 (* 120.0 a))
   (fma 120.0 a (* (/ y (- z t)) -60.0))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((x <= -2.2e-13) || !(x <= 3.7e+91)) {
		tmp = fma((x / (z - t)), 60.0, (120.0 * a));
	} else {
		tmp = fma(120.0, a, ((y / (z - t)) * -60.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((x <= -2.2e-13) || !(x <= 3.7e+91))
		tmp = fma(Float64(x / Float64(z - t)), 60.0, Float64(120.0 * a));
	else
		tmp = fma(120.0, a, Float64(Float64(y / Float64(z - t)) * -60.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.19999999999999997e-13 or 3.69999999999999984e91 < x

   1. Initial program 98.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. lower-fma.f64 98.9

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{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. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 99.7

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

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 120, \frac{60}{z - t} \cdot \left(x - y\right)\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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 86.4

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

   7. Applied rewrites 86.4%

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

   if -2.19999999999999997e-13 < x < 3.69999999999999984e91

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 93.6

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

   5. Applied rewrites 93.6%

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

4. Final simplification 90.4%

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

Alternative 11: 81.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+101} \lor \neg \left(y \leq 2.55 \cdot 10^{+73}\right):\\ \;\;\;\;\frac{\left(x - y\right) \cdot 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
 (if (or (<= y -5e+101) (not (<= y 2.55e+73)))
   (/ (* (- 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 tmp;
	if ((y <= -5e+101) || !(y <= 2.55e+73)) {
		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)
	tmp = 0.0
	if ((y <= -5e+101) || !(y <= 2.55e+73))
		tmp = Float64(Float64(Float64(x - y) * 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_] := If[Or[LessEqual[y, -5e+101], N[Not[LessEqual[y, 2.55e+73]], $MachinePrecision]], N[(N[(N[(x - y), $MachinePrecision] * 60.0), $MachinePrecision] / N[(z - t), $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 y < -4.99999999999999989e101 or 2.55000000000000012e73 < y

   1. Initial program 98.7%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-*r/ N/A

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

      5. times-frac N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower--.f64 87.4

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

   5. Applied rewrites 87.4%

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

   7. Applied rewrites 87.3%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 80.8%

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

   if -4.99999999999999989e101 < y < 2.55000000000000012e73

   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)}{z - t} + \color{blue}{a \cdot 120} \]

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. lower-fma.f64 99.8

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{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. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 99.8

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

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 120, \frac{60}{z - t} \cdot \left(x - y\right)\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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 89.9

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

   7. Applied rewrites 89.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.7%

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

Alternative 12: 89.6% accurate, 0.8× speedup

Math

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

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -2.2e-13)
		tmp = fma(a, 120.0, Float64(Float64(x * 60.0) / Float64(z - t)));
	elseif (x <= 3.7e+91)
		tmp = fma(a, 120.0, Float64(Float64(-60.0 * y) / 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_] := If[LessEqual[x, -2.2e-13], N[(a * 120.0 + N[(N[(x * 60.0), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.7e+91], N[(a * 120.0 + N[(N[(-60.0 * y), $MachinePrecision] / 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 3 regimes

2. if x < -2.19999999999999997e-13

   1. Initial program 98.4%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 85.8

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

   5. Applied rewrites 85.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 85.8

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

   7. Applied rewrites 85.8%

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

   if -2.19999999999999997e-13 < x < 3.69999999999999984e91

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 93.6

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

   5. Applied rewrites 93.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 93.6

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

   7. Applied rewrites 93.6%

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

   if 3.69999999999999984e91 < x

   1. Initial program 99.6%

      \[\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)}{z - t} + \color{blue}{a \cdot 120} \]

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

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

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

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

      5. +-commutative N/A

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

      6. remove-double-neg N/A

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

      7. lower-fma.f64 99.7

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(a, 120, \frac{\color{blue}{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. associate-/l* N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 99.6

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

   4. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 120, \frac{60}{z - t} \cdot \left(x - y\right)\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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 87.6

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

   7. Applied rewrites 87.6%

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

Alternative 13: 72.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -3.8e+100) (not (<= a 8.5e+64)))
   (* 120.0 a)
   (/ (* (- x y) 60.0) (- z t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -3.8e+100) || !(a <= 8.5e+64)) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) * 60.0) / (z - t);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -3.8e+100) || !(a <= 8.5e+64)) {
		tmp = 120.0 * a;
	} else {
		tmp = ((x - y) * 60.0) / (z - t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -3.8e+100) or not (a <= 8.5e+64):
		tmp = 120.0 * a
	else:
		tmp = ((x - y) * 60.0) / (z - t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -3.8e+100) || !(a <= 8.5e+64))
		tmp = Float64(120.0 * a);
	else
		tmp = Float64(Float64(Float64(x - y) * 60.0) / Float64(z - t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -3.8e+100) || ~((a <= 8.5e+64)))
		tmp = 120.0 * a;
	else
		tmp = ((x - y) * 60.0) / (z - t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.79999999999999963e100 or 8.4999999999999998e64 < a

   1. Initial program 98.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 84.0

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

   5. Applied rewrites 84.0%

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

   if -3.79999999999999963e100 < a < 8.4999999999999998e64

   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 inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-*r/ N/A

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

      5. times-frac N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. lower--.f64 87.2

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

   5. Applied rewrites 87.2%

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

   7. Applied rewrites 85.4%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 75.2%

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

4. Final simplification 78.0%

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

Alternative 14: 50.7% 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 44.3

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

5. Applied rewrites 44.3%

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

6. Final simplification 44.3%

   \[\leadsto 120 \cdot a \]
7. Add Preprocessing

Developer Target 1: 99.8% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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 2024364 
(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)))