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

Percentage Accurate: 99.5% → 99.5%

Time: 4.2s

Alternatives: 16

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.5%

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

   1. lift-+.f64 N/A

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

   2. lift--.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. +-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 N/A

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

   12. lift--.f64 N/A

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

   13. lift--.f64 99.5

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

3. Applied rewrites 99.5%

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

Alternative 2: 57.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 99.2%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 68.0

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

   4. Applied rewrites 68.0%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 38.3

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

   7. Applied rewrites 38.3%

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

   if -1.00000000000000001e-50 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000009e42

   1. Initial program 99.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 74.1

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

   4. Applied rewrites 74.1%

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

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

   1. Initial program 99.7%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 65.7

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

   4. Applied rewrites 65.7%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 32.1

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

   7. Applied rewrites 32.1%

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

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

   1. Initial program 98.2%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 90.5

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

   4. Applied rewrites 90.5%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 91.4

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

   6. Applied rewrites 91.4%

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

   7. Taylor expanded in z around inf

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

      1. lower-/.f64 55.6

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

   9. Applied rewrites 55.6%

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

Alternative 3: 57.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -1.00000000000000001e-50 or 2e173 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 73.7

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

   4. Applied rewrites 73.7%

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

   5. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 42.7

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

   7. Applied rewrites 42.7%

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

   if -1.00000000000000001e-50 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000009e42

   1. Initial program 99.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 74.1

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

   4. Applied rewrites 74.1%

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

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

   1. Initial program 99.7%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 65.7

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

   4. Applied rewrites 65.7%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 32.1

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

   7. Applied rewrites 32.1%

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

Alternative 4: 73.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^{-71}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{60}{z - t}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+22}:\\ \;\;\;\;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
 (let* ((t_1 (/ (* 60.0 (- x y)) (- z t))))
   (if (<= t_1 -5e-71)
     (* (- x y) (/ 60.0 (- z t)))
     (if (<= t_1 2e+22) (* 120.0 a) (/ (* (- x y) 60.0) (- z t))))))

C

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

Python

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

Julia

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 99.2%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 66.7

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

   4. Applied rewrites 66.7%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 67.1

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

   6. Applied rewrites 67.1%

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

   if -4.99999999999999998e-71 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e22

   1. Initial program 99.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 76.3

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

   4. Applied rewrites 76.3%

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

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

   1. Initial program 99.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 76.0

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

   4. Applied rewrites 76.0%

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

Alternative 5: 73.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -4.99999999999999998e-71 or 2e22 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.2%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 70.5

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

   4. Applied rewrites 70.5%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 70.9

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

   6. Applied rewrites 70.9%

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

   if -4.99999999999999998e-71 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2e22

   1. Initial program 99.9%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 76.3

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

   4. Applied rewrites 76.3%

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

Alternative 6: 58.1% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < -5.00000000000000018e-11 or 2.00000000000000009e42 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t))

   1. Initial program 99.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 74.5

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

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 41.6

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

   7. Applied rewrites 41.6%

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

   if -5.00000000000000018e-11 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 2.00000000000000009e42

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 72.9

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

   4. Applied rewrites 72.9%

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

Alternative 7: 55.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 -5 \cdot 10^{+185}:\\ \;\;\;\;x \cdot \frac{60}{z}\\ \mathbf{elif}\;t\_1 \leq 10^{+167}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{-60 \cdot y}{z}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.9%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.8

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

   4. Applied rewrites 89.8%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 50.0%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 33.9%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-/l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-/.f64 34.7

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

   12. Applied rewrites 34.7%

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

   if -4.9999999999999999e185 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1e167

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.8

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

   4. Applied rewrites 60.8%

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

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

   1. Initial program 98.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.6

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

   4. Applied rewrites 89.6%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 45.9%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 29.0%

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

   11. Taylor expanded in x around 0

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

       1. lower-*.f64 31.2

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

   13. Applied rewrites 31.2%

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

Alternative 8: 55.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 -5 \cdot 10^{+185}:\\ \;\;\;\;x \cdot \frac{60}{z}\\ \mathbf{elif}\;t\_1 \leq 10^{+167}:\\ \;\;\;\;120 \cdot a\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot -60\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.9%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.8

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

   4. Applied rewrites 89.8%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 50.0%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 33.9%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-/l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-/.f64 34.7

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

   12. Applied rewrites 34.7%

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

   if -4.9999999999999999e185 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1e167

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.8

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

   4. Applied rewrites 60.8%

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

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

   1. Initial program 98.3%

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

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 48.8

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

   4. Applied rewrites 48.8%

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

   5. Taylor expanded in z around inf

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

   7. Applied rewrites 31.6%

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

Alternative 9: 55.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.1%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 90.4

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

   4. Applied rewrites 90.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 48.1%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 31.6%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. associate-/l* N/A

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

       4. lower-*.f64 N/A

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

       5. lower-/.f64 32.1

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

   12. Applied rewrites 32.1%

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

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

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

Alternative 10: 54.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 86.8

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

   4. Applied rewrites 86.8%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 47.0%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. metadata-eval N/A

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

      6. associate-*r/ N/A

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

      7. lower-*.f64 N/A

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

      8. associate-*r/ N/A

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

      9. metadata-eval N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 47.7

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

   9. Applied rewrites 47.7%

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

   10. Taylor expanded in z around 0

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

       1. lower-/.f64 29.8

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

   12. Applied rewrites 29.8%

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

   if -2.00000000000000003e151 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1e167

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 61.7

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

   4. Applied rewrites 61.7%

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

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

   1. Initial program 98.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.6

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

   4. Applied rewrites 89.6%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.5

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

   7. Applied rewrites 54.5%

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

   8. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 31.5

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

   10. Applied rewrites 31.5%

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

Alternative 11: 54.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 86.8

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

   4. Applied rewrites 86.8%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 51.4

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

   7. Applied rewrites 51.4%

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

   8. Taylor expanded in x around inf

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

      1. lower-/.f64 29.8

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

   10. Applied rewrites 29.8%

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

   if -2.00000000000000003e151 < (/.f64 (*.f64 #s(literal 60 binary64) (-.f64 x y)) (-.f64 z t)) < 1e167

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 61.7

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

   4. Applied rewrites 61.7%

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

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

   1. Initial program 98.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.6

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

   4. Applied rewrites 89.6%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 54.5

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

   7. Applied rewrites 54.5%

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

   8. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 31.5

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

   10. Applied rewrites 31.5%

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

Alternative 12: 54.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.1%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 89.9

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

   4. Applied rewrites 89.9%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 55.3

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

   7. Applied rewrites 55.3%

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

   8. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 30.6

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

   10. Applied rewrites 30.6%

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

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

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-*.f64 60.6

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

   4. Applied rewrites 60.6%

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

Alternative 13: 60.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ y t) 60.0 (* 120.0 a))))
   (if (<= t -5.6e-67)
     t_1
     (if (<= t 8e-117)
       (* (- x y) (/ 60.0 z))
       (if (<= t 3700000.0) (/ (* x 60.0) (- z t)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y / t), 60.0, (120.0 * a));
	double tmp;
	if (t <= -5.6e-67) {
		tmp = t_1;
	} else if (t <= 8e-117) {
		tmp = (x - y) * (60.0 / z);
	} else if (t <= 3700000.0) {
		tmp = (x * 60.0) / (z - t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y / t), 60.0, Float64(120.0 * a))
	tmp = 0.0
	if (t <= -5.6e-67)
		tmp = t_1;
	elseif (t <= 8e-117)
		tmp = Float64(Float64(x - y) * Float64(60.0 / z));
	elseif (t <= 3700000.0)
		tmp = Float64(Float64(x * 60.0) / Float64(z - t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -5.60000000000000021e-67 or 3.7e6 < t

   1. Initial program 99.5%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 85.5

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

   4. Applied rewrites 85.5%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 72.6

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

   7. Applied rewrites 72.6%

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

   if -5.60000000000000021e-67 < t < 8.00000000000000024e-117

   1. Initial program 99.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 62.5

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

   4. Applied rewrites 62.5%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lift--.f64 62.8

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

   6. Applied rewrites 62.8%

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

   7. Taylor expanded in z around inf

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

      1. lower-/.f64 51.4

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

   9. Applied rewrites 51.4%

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

   if 8.00000000000000024e-117 < t < 3.7e6

   1. Initial program 99.6%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 59.1

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

   4. Applied rewrites 59.1%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 30.4%

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

Alternative 14: 83.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- x y) z)))
   (if (<= z -7.2e+45)
     (fma t_1 60.0 (* 120.0 a))
     (if (<= z 1.05e-41)
       (fma (/ (- x y) t) -60.0 (* 120.0 a))
       (fma a 120.0 (* t_1 60.0))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x - y) / z;
	double tmp;
	if (z <= -7.2e+45) {
		tmp = fma(t_1, 60.0, (120.0 * a));
	} else if (z <= 1.05e-41) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = fma(a, 120.0, (t_1 * 60.0));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x - y) / z)
	tmp = 0.0
	if (z <= -7.2e+45)
		tmp = fma(t_1, 60.0, Float64(120.0 * a));
	elseif (z <= 1.05e-41)
		tmp = fma(Float64(Float64(x - y) / t), -60.0, Float64(120.0 * a));
	else
		tmp = fma(a, 120.0, Float64(t_1 * 60.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -7.2e45

   1. Initial program 99.1%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 89.4

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

   4. Applied rewrites 89.4%

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

   if -7.2e45 < z < 1.05000000000000006e-41

   1. Initial program 99.6%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 80.5

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

   4. Applied rewrites 80.5%

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

   if 1.05000000000000006e-41 < z

   1. Initial program 99.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. lift--.f64 99.4

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

   3. Applied rewrites 99.4%

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

   4. Taylor expanded in x around inf

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

   6. Applied rewrites 78.1%

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

   7. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 84.5

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

   9. Applied rewrites 84.5%

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

Alternative 15: 83.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- x y) z) 60.0 (* 120.0 a))))
   (if (<= z -7.2e+45)
     t_1
     (if (<= z 1.05e-41) (fma (/ (- x y) t) -60.0 (* 120.0 a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((x - y) / z), 60.0, (120.0 * a));
	double tmp;
	if (z <= -7.2e+45) {
		tmp = t_1;
	} else if (z <= 1.05e-41) {
		tmp = fma(((x - y) / t), -60.0, (120.0 * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(x - y) / z), 60.0, Float64(120.0 * a))
	tmp = 0.0
	if (z <= -7.2e+45)
		tmp = t_1;
	elseif (z <= 1.05e-41)
		tmp = fma(Float64(Float64(x - y) / t), -60.0, Float64(120.0 * a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -7.2e45 or 1.05000000000000006e-41 < z

   1. Initial program 99.3%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 86.6

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

   4. Applied rewrites 86.6%

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

   if -7.2e45 < z < 1.05000000000000006e-41

   1. Initial program 99.6%

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

   2. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-*.f64 80.5

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

   4. Applied rewrites 80.5%

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

Alternative 16: 50.8% 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.5%

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

2. Taylor expanded in z around inf

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

   1. lower-*.f64 50.8

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

4. Applied rewrites 50.8%

   \[\leadsto \color{blue}{120 \cdot a} \]
5. 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 2025093 
(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)))