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

Percentage Accurate: 97.0% → 97.0%

Time: 3.2s

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: 70.3% accurate, 0.2× speedup

Math

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 96.1%

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

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

   4. Applied rewrites 56.8%

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

   if -1e-22 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 62.2

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

   4. Applied rewrites 62.2%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 61.8%

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

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

   1. Initial program 100.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 95.5%

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

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

   1. Initial program 99.6%

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

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

   4. Applied rewrites 42.8%

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

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

   7. Applied rewrites 50.5%

      \[\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. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lift-neg.f64 47.8

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

   10. Applied rewrites 47.8%

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

   if 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 89.9%

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

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

   4. Applied rewrites 58.4%

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

Alternative 3: 94.8% 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 -1 \cdot 10^{+14}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;\frac{x - y}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 2000:\\ \;\;\;\;\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 -1e+14)
     t_2
     (if (<= t_1 1e-5)
       (* (/ (- x y) z) t)
       (if (<= t_1 2000.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 <= -1e+14) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 2000.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 <= (-1d+14)) then
        tmp = t_2
    else if (t_1 <= 1d-5) then
        tmp = ((x - y) / z) * t
    else if (t_1 <= 2000.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 <= -1e+14) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 2000.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 <= -1e+14:
		tmp = t_2
	elif t_1 <= 1e-5:
		tmp = ((x - y) / z) * t
	elif t_1 <= 2000.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 <= -1e+14)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = Float64(Float64(Float64(x - y) / z) * t);
	elseif (t_1 <= 2000.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 <= -1e+14)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = ((x - y) / z) * t;
	elseif (t_1 <= 2000.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, -1e+14], t$95$2, If[LessEqual[t$95$1, 1e-5], N[(N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 2000.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)) < -1e14 or 2e3 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 95.4%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 94.9%

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

   if -1e14 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.8%

      \[\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 92.8%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2e3

   1. Initial program 100.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 70.9

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

   4. Applied rewrites 70.9%

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

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

   7. Applied rewrites 96.8%

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

Alternative 4: 92.8% 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 -1 \cdot 10^{-29}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{t}{z}\\ \mathbf{elif}\;t\_1 \leq 2000:\\ \;\;\;\;\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 -1e-29)
     t_2
     (if (<= t_1 1e-5)
       (* (- x y) (/ t z))
       (if (<= t_1 2000.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 <= -1e-29) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 2000.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 <= (-1d-29)) then
        tmp = t_2
    else if (t_1 <= 1d-5) then
        tmp = (x - y) * (t / z)
    else if (t_1 <= 2000.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 <= -1e-29) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 2000.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 <= -1e-29:
		tmp = t_2
	elif t_1 <= 1e-5:
		tmp = (x - y) * (t / z)
	elif t_1 <= 2000.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 <= -1e-29)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = Float64(Float64(x - y) * Float64(t / z));
	elseif (t_1 <= 2000.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 <= -1e-29)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = (x - y) * (t / z);
	elseif (t_1 <= 2000.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, -1e-29], t$95$2, If[LessEqual[t$95$1, 1e-5], N[(N[(x - y), $MachinePrecision] * N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2000.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)) < -9.99999999999999943e-30 or 2e3 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 95.8%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 91.5%

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

   if -9.99999999999999943e-30 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.3%

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

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

   4. Applied rewrites 90.5%

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

      1. associate-*l/ 90.5

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 90.1

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

   6. Applied rewrites 90.1%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2e3

   1. Initial program 100.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 70.9

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

   4. Applied rewrites 70.9%

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

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

   7. Applied rewrites 96.8%

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

Alternative 5: 91.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ t_2 := x \cdot \frac{t}{z - y}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+14}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;\left(x - y\right) \cdot \frac{t}{z}\\ \mathbf{elif}\;t\_1 \leq 200000000000:\\ \;\;\;\;\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 (/ t (- z y)))))
   (if (<= t_1 -1e+14)
     t_2
     (if (<= t_1 1e-5)
       (* (- x y) (/ t z))
       (if (<= t_1 200000000000.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 * (t / (z - y));
	double tmp;
	if (t_1 <= -1e+14) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 200000000000.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 * (t / (z - y))
    if (t_1 <= (-1d+14)) then
        tmp = t_2
    else if (t_1 <= 1d-5) then
        tmp = (x - y) * (t / z)
    else if (t_1 <= 200000000000.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 * (t / (z - y));
	double tmp;
	if (t_1 <= -1e+14) {
		tmp = t_2;
	} else if (t_1 <= 1e-5) {
		tmp = (x - y) * (t / z);
	} else if (t_1 <= 200000000000.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 * (t / (z - y))
	tmp = 0
	if t_1 <= -1e+14:
		tmp = t_2
	elif t_1 <= 1e-5:
		tmp = (x - y) * (t / z)
	elif t_1 <= 200000000000.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(x * Float64(t / Float64(z - y)))
	tmp = 0.0
	if (t_1 <= -1e+14)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = Float64(Float64(x - y) * Float64(t / z));
	elseif (t_1 <= 200000000000.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 * (t / (z - y));
	tmp = 0.0;
	if (t_1 <= -1e+14)
		tmp = t_2;
	elseif (t_1 <= 1e-5)
		tmp = (x - y) * (t / z);
	elseif (t_1 <= 200000000000.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[(x * N[(t / N[(z - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+14], t$95$2, If[LessEqual[t$95$1, 1e-5], N[(N[(x - y), $MachinePrecision] * N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 200000000000.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)) < -1e14 or 2e11 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 95.3%

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

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

   3. Applied rewrites 91.0%

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

   4. Taylor expanded in x around inf

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

   6. Applied rewrites 90.9%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 90.6

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

   8. Applied rewrites 90.6%

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

   if -1e14 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.8%

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

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

   4. Applied rewrites 87.5%

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

      1. associate-*l/ 87.5

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 86.8

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

   6. Applied rewrites 86.8%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2e11

   1. Initial program 99.9%

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

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

   4. Applied rewrites 70.2%

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

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

   7. Applied rewrites 95.8%

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

Alternative 6: 71.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-22}:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;\frac{-y}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+148}:\\ \;\;\;\;\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 -1e-22)
     (* (/ x z) t)
     (if (<= t_1 1e-5)
       (* (/ (- y) z) t)
       (if (<= t_1 2e+148) (* (- 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 <= -1e-22) {
		tmp = (x / z) * t;
	} else if (t_1 <= 1e-5) {
		tmp = (-y / z) * t;
	} else if (t_1 <= 2e+148) {
		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 <= (-1d-22)) then
        tmp = (x / z) * t
    else if (t_1 <= 1d-5) then
        tmp = (-y / z) * t
    else if (t_1 <= 2d+148) 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 <= -1e-22) {
		tmp = (x / z) * t;
	} else if (t_1 <= 1e-5) {
		tmp = (-y / z) * t;
	} else if (t_1 <= 2e+148) {
		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 <= -1e-22:
		tmp = (x / z) * t
	elif t_1 <= 1e-5:
		tmp = (-y / z) * t
	elif t_1 <= 2e+148:
		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 <= -1e-22)
		tmp = Float64(Float64(x / z) * t);
	elseif (t_1 <= 1e-5)
		tmp = Float64(Float64(Float64(-y) / z) * t);
	elseif (t_1 <= 2e+148)
		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 <= -1e-22)
		tmp = (x / z) * t;
	elseif (t_1 <= 1e-5)
		tmp = (-y / z) * t;
	elseif (t_1 <= 2e+148)
		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, -1e-22], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 1e-5], N[(N[((-y) / z), $MachinePrecision] * t), $MachinePrecision], If[LessEqual[t$95$1, 2e+148], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $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)) < -1e-22

   1. Initial program 96.1%

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

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

   4. Applied rewrites 56.8%

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

   if -1e-22 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 62.2

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

   4. Applied rewrites 62.2%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 61.8%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2.0000000000000001e148

   1. Initial program 99.9%

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

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

   4. Applied rewrites 64.6%

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

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

   7. Applied rewrites 86.5%

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

   if 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 89.9%

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

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

   4. Applied rewrites 58.4%

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

Alternative 7: 71.1% accurate, 0.3× speedup

Math

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

   1. Initial program 96.1%

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

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

   4. Applied rewrites 56.8%

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

   if -1e-22 < (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-5

   1. Initial program 95.4%

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

   2. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 62.2

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

   4. Applied rewrites 62.2%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 61.8%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2.0000000000000001e148

   1. Initial program 99.9%

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

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

   4. Applied rewrites 64.6%

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

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

   7. Applied rewrites 86.5%

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

   8. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 86.5

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

   10. Applied rewrites 86.5%

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

   if 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 89.9%

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

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

   4. Applied rewrites 58.4%

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

Alternative 8: 69.0% accurate, 0.3× 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 2 \cdot 10^{-7}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;t\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+148}:\\ \;\;\;\;\frac{-x}{y} \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 (/ (* t x) z)))
   (if (<= t_1 2e-7)
     t_2
     (if (<= t_1 2.0) t (if (<= t_1 2e+148) (* (/ (- 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 = (t * x) / z;
	double tmp;
	if (t_1 <= 2e-7) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else if (t_1 <= 2e+148) {
		tmp = (-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 = (t * x) / z
    if (t_1 <= 2d-7) then
        tmp = t_2
    else if (t_1 <= 2.0d0) then
        tmp = t
    else if (t_1 <= 2d+148) then
        tmp = (-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 = (t * x) / z;
	double tmp;
	if (t_1 <= 2e-7) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = t;
	} else if (t_1 <= 2e+148) {
		tmp = (-x / y) * 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 <= 2e-7:
		tmp = t_2
	elif t_1 <= 2.0:
		tmp = t
	elif t_1 <= 2e+148:
		tmp = (-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(t * x) / z)
	tmp = 0.0
	if (t_1 <= 2e-7)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = t;
	elseif (t_1 <= 2e+148)
		tmp = Float64(Float64(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 = (t * x) / z;
	tmp = 0.0;
	if (t_1 <= 2e-7)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = t;
	elseif (t_1 <= 2e+148)
		tmp = (-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[(t * x), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-7], t$95$2, If[LessEqual[t$95$1, 2.0], t, If[LessEqual[t$95$1, 2e+148], N[(N[((-x) / y), $MachinePrecision] * t), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 1.9999999999999999e-7 or 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 94.9%

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

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

   4. Applied rewrites 57.5%

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

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

   1. Initial program 100.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 95.2%

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

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

   1. Initial program 99.6%

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

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

   4. Applied rewrites 42.8%

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

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

   7. Applied rewrites 50.5%

      \[\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. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lift-neg.f64 47.8

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

   10. Applied rewrites 47.8%

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

Alternative 9: 79.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if (t_1 <= 1e-5) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2e+148) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (x - y) * (t / 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 <= 1d-5) then
        tmp = ((x - y) * t) / z
    else if (t_1 <= 2d+148) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (x - y) * (t / 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 <= 1e-5) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2e+148) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (x - y) * (t / z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	tmp = 0
	if t_1 <= 1e-5:
		tmp = ((x - y) * t) / z
	elif t_1 <= 2e+148:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (x - y) * (t / 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 <= 1e-5)
		tmp = Float64(Float64(Float64(x - y) * t) / z);
	elseif (t_1 <= 2e+148)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(x - y) * Float64(t / 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 <= 1e-5)
		tmp = ((x - y) * t) / z;
	elseif (t_1 <= 2e+148)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (x - y) * (t / 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, 1e-5], N[(N[(N[(x - y), $MachinePrecision] * t), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 2e+148], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(x - y), $MachinePrecision] * N[(t / z), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 95.7%

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

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

   4. Applied rewrites 77.4%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2.0000000000000001e148

   1. Initial program 99.9%

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

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

   4. Applied rewrites 64.6%

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

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

   7. Applied rewrites 86.5%

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

   if 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 89.9%

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

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

   4. Applied rewrites 58.4%

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

      1. associate-*l/ 58.4

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower-/.f64 59.0

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

   6. Applied rewrites 59.0%

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

Alternative 10: 79.8% accurate, 0.3× speedup

Math

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

   1. Initial program 95.7%

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

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

   4. Applied rewrites 77.4%

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

   if 1.00000000000000008e-5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2.0000000000000001e148

   1. Initial program 99.9%

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

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

   4. Applied rewrites 64.6%

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

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

   7. Applied rewrites 86.5%

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

   if 2.0000000000000001e148 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 89.9%

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

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

   4. Applied rewrites 58.4%

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

Alternative 11: 69.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 2 \cdot 10^{-7}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2000:\\ \;\;\;\;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 2e-7) t_2 (if (<= t_1 2000.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 <= 2e-7) {
		tmp = t_2;
	} else if (t_1 <= 2000.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 <= 2d-7) then
        tmp = t_2
    else if (t_1 <= 2000.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 <= 2e-7) {
		tmp = t_2;
	} else if (t_1 <= 2000.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 <= 2e-7:
		tmp = t_2
	elif t_1 <= 2000.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 <= 2e-7)
		tmp = t_2;
	elseif (t_1 <= 2000.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 <= 2e-7)
		tmp = t_2;
	elseif (t_1 <= 2000.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, 2e-7], t$95$2, If[LessEqual[t$95$1, 2000.0], t, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 1.9999999999999999e-7 or 2e3 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 95.6%

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

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

   4. Applied rewrites 56.4%

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

   if 1.9999999999999999e-7 < (/.f64 (-.f64 x y) (-.f64 z y)) < 2e3

   1. Initial program 99.9%

      \[\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 94.5%

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

Alternative 12: 34.1% accurate, 23.0× 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.1%

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

Developer Target 1: 97.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

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 / ((z - y) / (x - y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (/ t (/ (- z y) (- x y))))

  (* (/ (- x y) (- z y)) t))