Numeric.Signal.Multichannel:$cput from hsignal-0.2.7.1

Percentage Accurate: 97.0% → 97.0%

Time: 4.6s

Alternatives: 12

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (* (/ (- x y) (- z y)) t))

C

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

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x - y) / (z - y)) * t
end function

Java

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

Python

def code(x, y, z, t):
	return ((x - y) / (z - y)) * t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x - y) / Float64(z - y)) * t)
end

MATLAB

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

Wolfram

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

Initial Program: 97.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (* (/ (- x y) (- z y)) t))

C

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

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x - y) / (z - y)) * t
end function

Java

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

Python

def code(x, y, z, t):
	return ((x - y) / (z - y)) * t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x - y) / Float64(z - y)) * t)
end

MATLAB

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

Wolfram

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

Alternative 1: 97.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (* (/ (- x y) (- z y)) t))

C

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

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x - y) / (z - y)) * t
end function

Java

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

Python

def code(x, y, z, t):
	return ((x - y) / (z - y)) * t

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x - y) / Float64(z - y)) * t)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.0%

   \[\frac{x - y}{z - y} \cdot t \]
2. Add Preprocessing

Alternative 2: 94.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+18}:\\ \;\;\;\;\frac{x}{z - y} \cdot t\\ \mathbf{elif}\;t\_1 \leq 0.0005:\\ \;\;\;\;\frac{x - y}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 10^{+71}:\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot x}{z - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 -2e+18)
     (* (/ x (- z y)) t)
     (if (<= t_1 0.0005)
       (* (/ (- x y) z) t)
       (if (<= t_1 1e+71) (* (- 1.0 (/ x y)) t) (/ (* t x) (- z y)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = (x / (z - y)) * t;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 1e+71) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / (z - y);
	}
	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)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= (-2d+18)) then
        tmp = (x / (z - y)) * t
    else if (t_1 <= 0.0005d0) then
        tmp = ((x - y) / z) * t
    else if (t_1 <= 1d+71) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (t * x) / (z - y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = (x / (z - y)) * t;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 1e+71) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / (z - y);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= -2e+18:
		tmp = (x / (z - y)) * t
	elif t_1 <= 0.0005:
		tmp = ((x - y) / z) * t
	elif t_1 <= 1e+71:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (t * x) / (z - y)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= -2e+18)
		tmp = Float64(Float64(x / Float64(z - y)) * t);
	elseif (t_1 <= 0.0005)
		tmp = Float64(Float64(Float64(x - y) / z) * t);
	elseif (t_1 <= 1e+71)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(t * x) / Float64(z - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= -2e+18)
		tmp = (x / (z - y)) * t;
	elseif (t_1 <= 0.0005)
		tmp = ((x - y) / z) * t;
	elseif (t_1 <= 1e+71)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (t * x) / (z - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+18], N[(N[(x / N[(z - y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 0.0005], N[(N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 1e+71], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(t * x), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < -2e18

   1. Initial program 97.0%

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

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lift--.f64 53.7

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

   4. Applied rewrites 53.7%

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

   if -2e18 < (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 50.7%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1e71

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

   if 1e71 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

      \[\frac{x - y}{z - y} \cdot t \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lift--.f64 82.9

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

   3. Applied rewrites 82.9%

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

   4. Taylor expanded in x around inf

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

      1. lower-*.f64 50.3

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

   6. Applied rewrites 50.3%

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

Alternative 3: 92.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (* (/ x (- z y)) t)))
   (if (<= t_1 -2e+18)
     t_2
     (if (<= t_1 0.0005)
       (* (/ (- x y) z) t)
       (if (<= t_1 2.0) (* (- 1.0 (/ x y)) t) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_2;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	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)
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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (x / (z - y)) * t
    if (t_1 <= (-2d+18)) then
        tmp = t_2
    else if (t_1 <= 0.0005d0) then
        tmp = ((x - y) / z) * t
    else if (t_1 <= 2.0d0) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -2e+18) {
		tmp = t_2;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	t_2 = (x / (z - y)) * t
	tmp = 0
	if t_1 <= -2e+18:
		tmp = t_2
	elif t_1 <= 0.0005:
		tmp = ((x - y) / z) * t
	elif t_1 <= 2.0:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	t_2 = Float64(Float64(x / Float64(z - y)) * t)
	tmp = 0.0
	if (t_1 <= -2e+18)
		tmp = t_2;
	elseif (t_1 <= 0.0005)
		tmp = Float64(Float64(Float64(x - y) / z) * t);
	elseif (t_1 <= 2.0)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	t_2 = (x / (z - y)) * t;
	tmp = 0.0;
	if (t_1 <= -2e+18)
		tmp = t_2;
	elseif (t_1 <= 0.0005)
		tmp = ((x - y) / z) * t;
	elseif (t_1 <= 2.0)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / N[(z - y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+18], t$95$2, If[LessEqual[t$95$1, 0.0005], N[(N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < -2e18 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lift--.f64 53.7

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

   4. Applied rewrites 53.7%

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

   if -2e18 < (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 50.7%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

Alternative 4: 92.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ t_2 := \frac{x}{z - y} \cdot t\\ \mathbf{if}\;t\_1 \leq -0.0001:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.0005:\\ \;\;\;\;\frac{\left(x - y\right) \cdot t}{z}\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (* (/ x (- z y)) t)))
   (if (<= t_1 -0.0001)
     t_2
     (if (<= t_1 0.0005)
       (/ (* (- x y) t) z)
       (if (<= t_1 2.0) (* (- 1.0 (/ x y)) t) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -0.0001) {
		tmp = t_2;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	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)
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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (x / (z - y)) * t
    if (t_1 <= (-0.0001d0)) then
        tmp = t_2
    else if (t_1 <= 0.0005d0) then
        tmp = ((x - y) * t) / z
    else if (t_1 <= 2.0d0) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -0.0001) {
		tmp = t_2;
	} else if (t_1 <= 0.0005) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	t_2 = (x / (z - y)) * t
	tmp = 0
	if t_1 <= -0.0001:
		tmp = t_2
	elif t_1 <= 0.0005:
		tmp = ((x - y) * t) / z
	elif t_1 <= 2.0:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	t_2 = Float64(Float64(x / Float64(z - y)) * t)
	tmp = 0.0
	if (t_1 <= -0.0001)
		tmp = t_2;
	elseif (t_1 <= 0.0005)
		tmp = Float64(Float64(Float64(x - y) * t) / z);
	elseif (t_1 <= 2.0)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	t_2 = (x / (z - y)) * t;
	tmp = 0.0;
	if (t_1 <= -0.0001)
		tmp = t_2;
	elseif (t_1 <= 0.0005)
		tmp = ((x - y) * t) / z;
	elseif (t_1 <= 2.0)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x / N[(z - y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -0.0001], t$95$2, If[LessEqual[t$95$1, 0.0005], N[(N[(N[(x - y), $MachinePrecision] * t), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < -1.00000000000000005e-4 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. lift--.f64 53.7

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

   4. Applied rewrites 53.7%

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

   if -1.00000000000000005e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 47.5

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

   4. Applied rewrites 47.5%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

Alternative 5: 80.2% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 0.0005)
     (/ (* (- x y) t) z)
     (if (<= t_1 1e+183) (* (- 1.0 (/ x y)) t) (/ (* t x) z)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= 0.0005d0) then
        tmp = ((x - y) * t) / z
    else if (t_1 <= 1d+183) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (t * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 0.0005:
		tmp = ((x - y) * t) / z
	elif t_1 <= 1e+183:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (t * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = Float64(Float64(Float64(x - y) * t) / z);
	elseif (t_1 <= 1e+183)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(t * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = ((x - y) * t) / z;
	elseif (t_1 <= 1e+183)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (t * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], N[(N[(N[(x - y), $MachinePrecision] * t), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e+183], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 47.5

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

   4. Applied rewrites 47.5%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999947e182

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

   if 9.99999999999999947e182 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

Alternative 6: 79.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 0.0005)
     (* (- x y) (/ t z))
     (if (<= t_1 1e+183) (* (- 1.0 (/ x y)) t) (/ (* t x) z)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= 0.0005d0) then
        tmp = (x - y) * (t / z)
    else if (t_1 <= 1d+183) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (t * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 0.0005:
		tmp = (x - y) * (t / z)
	elif t_1 <= 1e+183:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (t * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = Float64(Float64(x - y) * Float64(t / z));
	elseif (t_1 <= 1e+183)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(t * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = (x - y) * (t / z);
	elseif (t_1 <= 1e+183)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (t * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], N[(N[(x - y), $MachinePrecision] * N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+183], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 47.5

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

   4. Applied rewrites 47.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lower-/.f64 48.2

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

   6. Applied rewrites 48.2%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999947e182

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

   if 9.99999999999999947e182 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

Alternative 7: 71.7% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 0.0005)
     (* (/ x z) t)
     (if (<= t_1 1e+183) (* (- 1.0 (/ x y)) t) (/ (* t x) z)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= 0.0005d0) then
        tmp = (x / z) * t
    else if (t_1 <= 1d+183) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (t * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 1e+183) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 0.0005:
		tmp = (x / z) * t
	elif t_1 <= 1e+183:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (t * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = Float64(Float64(x / z) * t);
	elseif (t_1 <= 1e+183)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(t * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = (x / z) * t;
	elseif (t_1 <= 1e+183)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (t * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 1e+183], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 40.1

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

   4. Applied rewrites 40.1%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999947e182

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

   if 9.99999999999999947e182 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

Alternative 8: 70.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ \mathbf{if}\;t\_1 \leq 0.0005:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 2000:\\ \;\;\;\;t\\ \mathbf{elif}\;t\_1 \leq 10^{+183}:\\ \;\;\;\;\frac{-x}{y} \cdot t\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 0.0005)
     (* (/ x z) t)
     (if (<= t_1 2000.0)
       t
       (if (<= t_1 1e+183) (* (/ (- x) y) t) (/ (* t x) z))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 2000.0) {
		tmp = t;
	} else if (t_1 <= 1e+183) {
		tmp = (-x / y) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= 0.0005d0) then
        tmp = (x / z) * t
    else if (t_1 <= 2000.0d0) then
        tmp = t
    else if (t_1 <= 1d+183) then
        tmp = (-x / y) * t
    else
        tmp = (t * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 2000.0) {
		tmp = t;
	} else if (t_1 <= 1e+183) {
		tmp = (-x / y) * t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 0.0005:
		tmp = (x / z) * t
	elif t_1 <= 2000.0:
		tmp = t
	elif t_1 <= 1e+183:
		tmp = (-x / y) * t
	else:
		tmp = (t * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = Float64(Float64(x / z) * t);
	elseif (t_1 <= 2000.0)
		tmp = t;
	elseif (t_1 <= 1e+183)
		tmp = Float64(Float64(Float64(-x) / y) * t);
	else
		tmp = Float64(Float64(t * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = (x / z) * t;
	elseif (t_1 <= 2000.0)
		tmp = t;
	elseif (t_1 <= 1e+183)
		tmp = (-x / y) * t;
	else
		tmp = (t * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 2000.0], t, If[LessEqual[t$95$1, 1e+183], N[(N[((-x) / y), $MachinePrecision] * t), $MachinePrecision], N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 40.1

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

   4. Applied rewrites 40.1%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2e3

   1. Initial program 97.0%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{t} \]
   3. Step-by-step derivation

   4. Applied rewrites 34.4%

      \[\leadsto \color{blue}{t} \]

   if 2e3 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999947e182

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in t around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 51.9

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

   7. Applied rewrites 51.9%

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

   8. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot \frac{x}{y}\right) \cdot t \]
   9. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 22.6

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

   10. Applied rewrites 22.6%

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

   if 9.99999999999999947e182 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

Alternative 9: 69.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ \mathbf{if}\;t\_1 \leq 0.0005:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\frac{t \cdot x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (<= t_1 0.0005) (* (/ x z) t) (if (<= t_1 2.0) t (/ (* t x) z)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if (t_1 <= 0.0005d0) then
        tmp = (x / z) * t
    else if (t_1 <= 2.0d0) then
        tmp = t
    else
        tmp = (t * x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = (x / z) * t;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else {
		tmp = (t * x) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 0.0005:
		tmp = (x / z) * t
	elif t_1 <= 2.0:
		tmp = t
	else:
		tmp = (t * x) / z
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = Float64(Float64(x / z) * t);
	elseif (t_1 <= 2.0)
		tmp = t;
	else
		tmp = Float64(Float64(t * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = (x / z) * t;
	elseif (t_1 <= 2.0)
		tmp = t;
	else
		tmp = (t * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 2.0], t, N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 40.1

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

   4. Applied rewrites 40.1%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2

   1. Initial program 97.0%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{t} \]
   3. Step-by-step derivation

   4. Applied rewrites 34.4%

      \[\leadsto \color{blue}{t} \]

   if 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

Alternative 10: 68.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ t_2 := \frac{t \cdot x}{z}\\ \mathbf{if}\;t\_1 \leq 0.0005:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (/ (* t x) z)))
   (if (<= t_1 0.0005) t_2 (if (<= t_1 2.0) t t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (t * x) / z;
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else {
		tmp = t_2;
	}
	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)
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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (t * x) / z
    if (t_1 <= 0.0005d0) then
        tmp = t_2
    else if (t_1 <= 2.0d0) then
        tmp = t
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (t * x) / z;
	double tmp;
	if (t_1 <= 0.0005) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	t_2 = (t * x) / z
	tmp = 0
	if t_1 <= 0.0005:
		tmp = t_2
	elif t_1 <= 2.0:
		tmp = t
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	t_2 = Float64(Float64(t * x) / z)
	tmp = 0.0
	if (t_1 <= 0.0005)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = t;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	t_2 = (t * x) / z;
	tmp = 0.0;
	if (t_1 <= 0.0005)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = t;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * x), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0005], t$95$2, If[LessEqual[t$95$1, 2.0], t, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 5.0000000000000001e-4 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 37.9

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

   4. Applied rewrites 37.9%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2

   1. Initial program 97.0%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{t} \]
   3. Step-by-step derivation

   4. Applied rewrites 34.4%

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

Alternative 11: 37.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x - y}{z - y} \leq 10^{-174}:\\ \;\;\;\;\frac{t \cdot y}{y}\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (- x y) (- z y)) 1e-174) (/ (* t y) y) t))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x - y) / (z - y)) <= 1e-174) {
		tmp = (t * y) / y;
	} else {
		tmp = 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)
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) :: tmp
    if (((x - y) / (z - y)) <= 1d-174) then
        tmp = (t * y) / y
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x - y) / (z - y)) <= 1e-174) {
		tmp = (t * y) / y;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x - y) / (z - y)) <= 1e-174:
		tmp = (t * y) / y
	else:
		tmp = t
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x - y) / (z - y)) <= 1e-174)
		tmp = (t * y) / y;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(x - y), $MachinePrecision] / N[(z - y), $MachinePrecision]), $MachinePrecision], 1e-174], N[(N[(t * y), $MachinePrecision] / y), $MachinePrecision], t]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 1e-174

   1. Initial program 97.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 43.5

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

   4. Applied rewrites 43.5%

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

   5. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. distribute-lft-out-- N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 43.5

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

   7. Applied rewrites 43.5%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 29.1%

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

   if 1e-174 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 97.0%

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

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{t} \]
   3. Step-by-step derivation

   4. Applied rewrites 34.4%

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

Alternative 12: 34.4% accurate, 12.6× speedup

Math

\[\begin{array}{l} \\ t \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 t)

C

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

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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t
end function

Java

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

Python

def code(x, y, z, t):
	return t

Julia

function code(x, y, z, t)
	return t
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := t

Derivation

1. Initial program 97.0%

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

2. Taylor expanded in y around inf

   \[\leadsto \color{blue}{t} \]
3. Step-by-step derivation

4. Applied rewrites 34.4%

   \[\leadsto \color{blue}{t} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025139 
(FPCore (x y z t)
  :name "Numeric.Signal.Multichannel:$cput from hsignal-0.2.7.1"
  :precision binary64
  (* (/ (- x y) (- z y)) t))