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

Percentage Accurate: 97.1% → 97.1%

Time: 3.5s

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.1% 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.1% 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.5%

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

Alternative 2: 70.4% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x - y}{z - y}\\ t_2 := \frac{x}{z} \cdot t\\ \mathbf{if}\;t\_1 \leq 10^{-217}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-96}:\\ \;\;\;\;\left(-y\right) \cdot \frac{t}{z}\\ \mathbf{elif}\;t\_1 \leq 10^{-11} \lor \neg \left(t\_1 \leq 2\right):\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (* (/ x z) t)))
   (if (<= t_1 1e-217)
     t_2
     (if (<= t_1 1e-96)
       (* (- y) (/ t z))
       (if (or (<= t_1 1e-11) (not (<= t_1 2.0))) t_2 t)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / z) * t;
	double tmp;
	if (t_1 <= 1e-217) {
		tmp = t_2;
	} else if (t_1 <= 1e-96) {
		tmp = -y * (t / z);
	} else if ((t_1 <= 1e-11) || !(t_1 <= 2.0)) {
		tmp = t_2;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (x / z) * t
    if (t_1 <= 1d-217) then
        tmp = t_2
    else if (t_1 <= 1d-96) then
        tmp = -y * (t / z)
    else if ((t_1 <= 1d-11) .or. (.not. (t_1 <= 2.0d0))) then
        tmp = t_2
    else
        tmp = t
    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) * t;
	double tmp;
	if (t_1 <= 1e-217) {
		tmp = t_2;
	} else if (t_1 <= 1e-96) {
		tmp = -y * (t / z);
	} else if ((t_1 <= 1e-11) || !(t_1 <= 2.0)) {
		tmp = t_2;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	t_2 = (x / z) * t
	tmp = 0
	if t_1 <= 1e-217:
		tmp = t_2
	elif t_1 <= 1e-96:
		tmp = -y * (t / z)
	elif (t_1 <= 1e-11) or not (t_1 <= 2.0):
		tmp = t_2
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	t_2 = Float64(Float64(x / z) * t)
	tmp = 0.0
	if (t_1 <= 1e-217)
		tmp = t_2;
	elseif (t_1 <= 1e-96)
		tmp = Float64(Float64(-y) * Float64(t / z));
	elseif ((t_1 <= 1e-11) || !(t_1 <= 2.0))
		tmp = t_2;
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	t_2 = (x / z) * t;
	tmp = 0.0;
	if (t_1 <= 1e-217)
		tmp = t_2;
	elseif (t_1 <= 1e-96)
		tmp = -y * (t / z);
	elseif ((t_1 <= 1e-11) || ~((t_1 <= 2.0)))
		tmp = t_2;
	else
		tmp = t;
	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 / z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-217], t$95$2, If[LessEqual[t$95$1, 1e-96], N[((-y) * N[(t / z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$1, 1e-11], N[Not[LessEqual[t$95$1, 2.0]], $MachinePrecision]], t$95$2, t]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 1.00000000000000008e-217 or 9.9999999999999991e-97 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 96.2%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 66.0

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

   5. Applied rewrites 66.0%

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

   if 1.00000000000000008e-217 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.9999999999999991e-97

   1. Initial program 99.6%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t \cdot \left(x - y\right)}{z}} \]
   4. 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 83.1

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

   5. Applied rewrites 83.1%

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

   6. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 65.5

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

   8. Applied rewrites 65.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lower-*.f64 N/A

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

      5. lift-/.f64 69.7

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

   10. Applied rewrites 69.7%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 96.6%

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

4. Final simplification 74.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - y}{z - y} \leq 10^{-217}:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{elif}\;\frac{x - y}{z - y} \leq 10^{-96}:\\ \;\;\;\;\left(-y\right) \cdot \frac{t}{z}\\ \mathbf{elif}\;\frac{x - y}{z - y} \leq 10^{-11} \lor \neg \left(\frac{x - y}{z - y} \leq 2\right):\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \]
5. Add Preprocessing

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 94.4%

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

   if -5e5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12

   1. Initial program 96.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 96.8%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{-1 \cdot y}}{z - y} \cdot t \]
   4. 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 98.7

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

   5. Applied rewrites 98.7%

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

Alternative 4: 95.0% 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 -500000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-11}:\\ \;\;\;\;\frac{x - y}{z} \cdot t\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (* (/ x (- z y)) t)))
   (if (<= t_1 -500000.0)
     t_2
     (if (<= t_1 1e-11)
       (* (/ (- x y) z) t)
       (if (<= t_1 2.0) (* (- 1.0 (/ x y)) t) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -500000.0) {
		tmp = t_2;
	} else if (t_1 <= 1e-11) {
		tmp = ((x - y) / z) * t;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (x / (z - y)) * t
    if (t_1 <= (-500000.0d0)) then
        tmp = t_2
    else if (t_1 <= 1d-11) then
        tmp = ((x - y) / z) * t
    else if (t_1 <= 2.0d0) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 96.3%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 94.4%

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

   if -5e5 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12

   1. Initial program 96.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 96.8%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot \left(x - y\right)}{y}} \]
   4. 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.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in t around 0

      \[\leadsto t \cdot \color{blue}{\left(1 - \frac{x}{y}\right)} \]
   7. 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 97.9

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

   8. Applied rewrites 97.9%

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

Alternative 5: 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.5 \cdot 10^{-28}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-11}:\\ \;\;\;\;\frac{\left(x - y\right) \cdot t}{z}\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))) (t_2 (* (/ x (- z y)) t)))
   (if (<= t_1 -1.5e-28)
     t_2
     (if (<= t_1 1e-11)
       (/ (* (- x y) t) z)
       (if (<= t_1 2.0) (* (- 1.0 (/ x y)) t) t_2)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -1.5e-28) {
		tmp = t_2;
	} else if (t_1 <= 1e-11) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    t_2 = (x / (z - y)) * t
    if (t_1 <= (-1.5d-28)) then
        tmp = t_2
    else if (t_1 <= 1d-11) then
        tmp = ((x - y) * t) / z
    else if (t_1 <= 2.0d0) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double t_2 = (x / (z - y)) * t;
	double tmp;
	if (t_1 <= -1.5e-28) {
		tmp = t_2;
	} else if (t_1 <= 1e-11) {
		tmp = ((x - y) * t) / z;
	} else if (t_1 <= 2.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x - y) / (z - y)
	t_2 = (x / (z - y)) * t
	tmp = 0
	if t_1 <= -1.5e-28:
		tmp = t_2
	elif t_1 <= 1e-11:
		tmp = ((x - y) * t) / z
	elif t_1 <= 2.0:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - y) / Float64(z - y))
	t_2 = Float64(Float64(x / Float64(z - y)) * t)
	tmp = 0.0
	if (t_1 <= -1.5e-28)
		tmp = t_2;
	elseif (t_1 <= 1e-11)
		tmp = Float64(Float64(Float64(x - y) * t) / z);
	elseif (t_1 <= 2.0)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x - y) / (z - y);
	t_2 = (x / (z - y)) * t;
	tmp = 0.0;
	if (t_1 <= -1.5e-28)
		tmp = t_2;
	elseif (t_1 <= 1e-11)
		tmp = ((x - y) * t) / z;
	elseif (t_1 <= 2.0)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < -1.50000000000000001e-28 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 96.6%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 94.8%

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

   if -1.50000000000000001e-28 < (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12

   1. Initial program 96.6%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t \cdot \left(x - y\right)}{z}} \]
   4. 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 91.9

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

   5. Applied rewrites 91.9%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot \left(x - y\right)}{y}} \]
   4. 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.1

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

   5. Applied rewrites 70.1%

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

   6. Taylor expanded in t around 0

      \[\leadsto t \cdot \color{blue}{\left(1 - \frac{x}{y}\right)} \]
   7. 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 97.9

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

   8. Applied rewrites 97.9%

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

Alternative 6: 70.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (or (<= t_1 1e-11) (not (<= t_1 2.0))) (* (/ x z) t) t)))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if ((t_1 <= 1e-11) || !(t_1 <= 2.0)) {
		tmp = (x / z) * t;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if ((t_1 <= 1d-11) .or. (.not. (t_1 <= 2.0d0))) then
        tmp = (x / z) * t
    else
        tmp = t
    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-11) || !(t_1 <= 2.0)) {
		tmp = (x / z) * t;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 96.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 62.1

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

   5. Applied rewrites 62.1%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 96.6%

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

4. Final simplification 71.4%

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

Alternative 7: 68.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (or (<= t_1 1e-11) (not (<= t_1 2.0))) (/ (* t x) z) t)))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if ((t_1 <= 1e-11) || !(t_1 <= 2.0)) {
		tmp = (t * x) / z;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if ((t_1 <= 1d-11) .or. (.not. (t_1 <= 2.0d0))) then
        tmp = (t * x) / z
    else
        tmp = t
    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-11) || !(t_1 <= 2.0)) {
		tmp = (t * x) / z;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 96.6%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.2

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

   5. Applied rewrites 60.2%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 96.6%

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

4. Final simplification 70.0%

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

Alternative 8: 68.3% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (- x y) (- z y))))
   (if (or (<= t_1 1e-11) (not (<= t_1 2.0))) (* x (/ t z)) t)))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - y) / (z - y);
	double tmp;
	if ((t_1 <= 1e-11) || !(t_1 <= 2.0)) {
		tmp = x * (t / z);
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x - y) / (z - y)
    if ((t_1 <= 1d-11) .or. (.not. (t_1 <= 2.0d0))) then
        tmp = x * (t / z)
    else
        tmp = t
    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-11) || !(t_1 <= 2.0)) {
		tmp = x * (t / z);
	} else {
		tmp = t;
	}
	return tmp;
}

Python

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 x y) (-.f64 z y)) < 9.99999999999999939e-12 or 2 < (/.f64 (-.f64 x y) (-.f64 z y))

   1. Initial program 96.6%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t \cdot \left(x - y\right)}{z}} \]
   4. 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 75.5

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

   5. Applied rewrites 75.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 60.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lower-*.f64 N/A

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

      5. lift-/.f64 58.4

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

   10. Applied rewrites 58.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 96.6%

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

4. Final simplification 68.7%

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

Alternative 9: 73.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.4 \cdot 10^{+59} \lor \neg \left(y \leq 3.9 \cdot 10^{+16}\right):\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(x - y\right) \cdot t}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -1.4e+59) (not (<= y 3.9e+16)))
   (* (- 1.0 (/ x y)) t)
   (/ (* (- x y) t) z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -1.4e+59) || !(y <= 3.9e+16)) {
		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) :: tmp
    if ((y <= (-1.4d+59)) .or. (.not. (y <= 3.9d+16))) 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 tmp;
	if ((y <= -1.4e+59) || !(y <= 3.9e+16)) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = ((x - y) * t) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -1.4e+59) or not (y <= 3.9e+16):
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = ((x - y) * t) / z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -1.4e+59) || !(y <= 3.9e+16))
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(Float64(x - y) * t) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -1.4e+59) || ~((y <= 3.9e+16)))
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = ((x - y) * t) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -1.4e+59], N[Not[LessEqual[y, 3.9e+16]], $MachinePrecision]], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(N[(x - y), $MachinePrecision] * t), $MachinePrecision] / z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3999999999999999e59 or 3.9e16 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot \left(x - y\right)}{y}} \]
   4. 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 60.0

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

   5. Applied rewrites 60.0%

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

   6. Taylor expanded in t around 0

      \[\leadsto t \cdot \color{blue}{\left(1 - \frac{x}{y}\right)} \]
   7. 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 80.6

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

   8. Applied rewrites 80.6%

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

   if -1.3999999999999999e59 < y < 3.9e16

   1. Initial program 95.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t \cdot \left(x - y\right)}{z}} \]
   4. 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 83.0

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

   5. Applied rewrites 83.0%

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

4. Final simplification 82.0%

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

Alternative 10: 74.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+56} \lor \neg \left(y \leq 5.2 \cdot 10^{+16}\right):\\ \;\;\;\;\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
 (if (or (<= y -8e+56) (not (<= y 5.2e+16)))
   (* (- 1.0 (/ x y)) t)
   (* (- x y) (/ t z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -8e+56) || !(y <= 5.2e+16)) {
		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) :: tmp
    if ((y <= (-8d+56)) .or. (.not. (y <= 5.2d+16))) 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 tmp;
	if ((y <= -8e+56) || !(y <= 5.2e+16)) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (x - y) * (t / z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -8e+56) or not (y <= 5.2e+16):
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (x - y) * (t / z)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -8e+56) || !(y <= 5.2e+16))
		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)
	tmp = 0.0;
	if ((y <= -8e+56) || ~((y <= 5.2e+16)))
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (x - y) * (t / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -8e+56], N[Not[LessEqual[y, 5.2e+16]], $MachinePrecision]], 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 2 regimes

2. if y < -8.00000000000000074e56 or 5.2e16 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot \left(x - y\right)}{y}} \]
   4. 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 60.0

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

   5. Applied rewrites 60.0%

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

   6. Taylor expanded in t around 0

      \[\leadsto t \cdot \color{blue}{\left(1 - \frac{x}{y}\right)} \]
   7. 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 80.6

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

   8. Applied rewrites 80.6%

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

   if -8.00000000000000074e56 < y < 5.2e16

   1. Initial program 95.8%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t \cdot \left(x - y\right)}{z}} \]
   4. 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 83.0

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

   5. Applied rewrites 83.0%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lower-/.f64 82.0

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

   7. Applied rewrites 82.0%

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

4. Final simplification 81.4%

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

Alternative 11: 69.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+56} \lor \neg \left(y \leq 2.2 \cdot 10^{-31}\right):\\ \;\;\;\;\left(1 - \frac{x}{y}\right) \cdot t\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -6e+56) (not (<= y 2.2e-31)))
   (* (- 1.0 (/ x y)) t)
   (* (/ x z) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -6e+56) || !(y <= 2.2e-31)) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (x / z) * t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y <= (-6d+56)) .or. (.not. (y <= 2.2d-31))) then
        tmp = (1.0d0 - (x / y)) * t
    else
        tmp = (x / z) * t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -6e+56) || !(y <= 2.2e-31)) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = (x / z) * t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -6e+56) or not (y <= 2.2e-31):
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = (x / z) * t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -6e+56) || !(y <= 2.2e-31))
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = Float64(Float64(x / z) * t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -6e+56) || ~((y <= 2.2e-31)))
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = (x / z) * t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -6e+56], N[Not[LessEqual[y, 2.2e-31]], $MachinePrecision]], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000012e56 or 2.2000000000000001e-31 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot \left(x - y\right)}{y}} \]
   4. 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 59.2

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

   5. Applied rewrites 59.2%

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

   6. Taylor expanded in t around 0

      \[\leadsto t \cdot \color{blue}{\left(1 - \frac{x}{y}\right)} \]
   7. 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 78.9

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

   8. Applied rewrites 78.9%

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

   if -6.00000000000000012e56 < y < 2.2000000000000001e-31

   1. Initial program 95.7%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 73.6

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

   5. Applied rewrites 73.6%

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

4. Final simplification 75.9%

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

Alternative 12: 34.3% 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.5%

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

3. Taylor expanded in y around inf

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

5. Applied rewrites 29.0%

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

Reproduce

herbie shell --seed 2025085 
(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))