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

Percentage Accurate: 97.7% → 98.6%

Time: 3.5s

Alternatives: 11

Speedup: 0.7×

• 25.8% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{x}{y} \cdot \left(z - t\right) + t \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + 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 - t)) + t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y} \cdot \left(z - t\right) + t \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((x / y) * (z - t)) + 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 - t)) + t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{y} \leq -\infty:\\ \;\;\;\;\frac{\left(z - t\right) \cdot x}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, z - t, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) (- INFINITY)) (/ (* (- z t) x) y) (fma (/ x y) (- z t) t)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 58.4

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

   6. Applied rewrites 58.4%

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

   if -inf.0 < (/.f64 x y)

   1. Initial program 97.7%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. lift--.f64 97.7

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

   3. Applied rewrites 97.7%

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

Alternative 2: 95.3% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ x y) (- z t))))
   (if (<= (/ x y) (- INFINITY))
     (/ (* (- z t) x) y)
     (if (<= (/ x y) -5e-7)
       t_1
       (if (<= (/ x y) 2e-16) (+ (/ (* x z) y) t) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -((double) INFINITY)) {
		tmp = ((z - t) * x) / y;
	} else if ((x / y) <= -5e-7) {
		tmp = t_1;
	} else if ((x / y) <= 2e-16) {
		tmp = ((x * z) / y) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -Double.POSITIVE_INFINITY) {
		tmp = ((z - t) * x) / y;
	} else if ((x / y) <= -5e-7) {
		tmp = t_1;
	} else if ((x / y) <= 2e-16) {
		tmp = ((x * z) / y) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) * (z - t)
	tmp = 0
	if (x / y) <= -math.inf:
		tmp = ((z - t) * x) / y
	elif (x / y) <= -5e-7:
		tmp = t_1
	elif (x / y) <= 2e-16:
		tmp = ((x * z) / y) + t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) * Float64(z - t))
	tmp = 0.0
	if (Float64(x / y) <= Float64(-Inf))
		tmp = Float64(Float64(Float64(z - t) * x) / y);
	elseif (Float64(x / y) <= -5e-7)
		tmp = t_1;
	elseif (Float64(x / y) <= 2e-16)
		tmp = Float64(Float64(Float64(x * z) / y) + t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) * (z - t);
	tmp = 0.0;
	if ((x / y) <= -Inf)
		tmp = ((z - t) * x) / y;
	elseif ((x / y) <= -5e-7)
		tmp = t_1;
	elseif ((x / y) <= 2e-16)
		tmp = ((x * z) / y) + t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 58.4

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

   6. Applied rewrites 58.4%

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

   if -inf.0 < (/.f64 x y) < -4.99999999999999977e-7 or 2e-16 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 61.6

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

   6. Applied rewrites 61.6%

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

   if -4.99999999999999977e-7 < (/.f64 x y) < 2e-16

   1. Initial program 97.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lower-/.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lift--.f64 92.4

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

   3. Applied rewrites 92.4%

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

   4. Taylor expanded in z around inf

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

      1. lower-*.f64 73.2

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

   6. Applied rewrites 73.2%

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

Alternative 3: 86.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ x y) (- z t))))
   (if (<= (/ x y) (- INFINITY))
     (/ (* (- z t) x) y)
     (if (<= (/ x y) -5e-5)
       t_1
       (if (<= (/ x y) 100000000000.0) (* (- 1.0 (/ x y)) t) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -((double) INFINITY)) {
		tmp = ((z - t) * x) / y;
	} else if ((x / y) <= -5e-5) {
		tmp = t_1;
	} else if ((x / y) <= 100000000000.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -Double.POSITIVE_INFINITY) {
		tmp = ((z - t) * x) / y;
	} else if ((x / y) <= -5e-5) {
		tmp = t_1;
	} else if ((x / y) <= 100000000000.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) * (z - t)
	tmp = 0
	if (x / y) <= -math.inf:
		tmp = ((z - t) * x) / y
	elif (x / y) <= -5e-5:
		tmp = t_1
	elif (x / y) <= 100000000000.0:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) * Float64(z - t))
	tmp = 0.0
	if (Float64(x / y) <= Float64(-Inf))
		tmp = Float64(Float64(Float64(z - t) * x) / y);
	elseif (Float64(x / y) <= -5e-5)
		tmp = t_1;
	elseif (Float64(x / y) <= 100000000000.0)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) * (z - t);
	tmp = 0.0;
	if ((x / y) <= -Inf)
		tmp = ((z - t) * x) / y;
	elseif ((x / y) <= -5e-5)
		tmp = t_1;
	elseif ((x / y) <= 100000000000.0)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 58.4

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

   6. Applied rewrites 58.4%

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

   if -inf.0 < (/.f64 x y) < -5.00000000000000024e-5 or 1e11 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 61.6

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

   6. Applied rewrites 61.6%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 1e11

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

Alternative 4: 86.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ x y) (- z t))))
   (if (<= (/ x y) (- INFINITY))
     (* (/ (- z t) y) x)
     (if (<= (/ x y) -5e-5)
       t_1
       (if (<= (/ x y) 100000000000.0) (* (- 1.0 (/ x y)) t) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -((double) INFINITY)) {
		tmp = ((z - t) / y) * x;
	} else if ((x / y) <= -5e-5) {
		tmp = t_1;
	} else if ((x / y) <= 100000000000.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -Double.POSITIVE_INFINITY) {
		tmp = ((z - t) / y) * x;
	} else if ((x / y) <= -5e-5) {
		tmp = t_1;
	} else if ((x / y) <= 100000000000.0) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x / y) * (z - t)
	tmp = 0
	if (x / y) <= -math.inf:
		tmp = ((z - t) / y) * x
	elif (x / y) <= -5e-5:
		tmp = t_1
	elif (x / y) <= 100000000000.0:
		tmp = (1.0 - (x / y)) * t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x / y) * Float64(z - t))
	tmp = 0.0
	if (Float64(x / y) <= Float64(-Inf))
		tmp = Float64(Float64(Float64(z - t) / y) * x);
	elseif (Float64(x / y) <= -5e-5)
		tmp = t_1;
	elseif (Float64(x / y) <= 100000000000.0)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x / y) * (z - t);
	tmp = 0.0;
	if ((x / y) <= -Inf)
		tmp = ((z - t) / y) * x;
	elseif ((x / y) <= -5e-5)
		tmp = t_1;
	elseif ((x / y) <= 100000000000.0)
		tmp = (1.0 - (x / y)) * t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -inf.0

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

   if -inf.0 < (/.f64 x y) < -5.00000000000000024e-5 or 1e11 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 61.6

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

   6. Applied rewrites 61.6%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 1e11

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

Alternative 5: 85.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -5.00000000000000024e-5 or 1e11 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.2

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

   4. Applied rewrites 59.2%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift--.f64 61.6

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

   6. Applied rewrites 61.6%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 1e11

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

Alternative 6: 73.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- 1.0 (/ x y)) t)))
   (if (<= t -1.3e-114) t_1 (if (<= t 3.6e-134) (* (/ z y) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (1.0 - (x / y)) * t;
	double tmp;
	if (t <= -1.3e-114) {
		tmp = t_1;
	} else if (t <= 3.6e-134) {
		tmp = (z / y) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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 = (1.0d0 - (x / y)) * t
    if (t <= (-1.3d-114)) then
        tmp = t_1
    else if (t <= 3.6d-134) then
        tmp = (z / y) * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (1.0 - (x / y)) * t;
	double tmp;
	if (t <= -1.3e-114) {
		tmp = t_1;
	} else if (t <= 3.6e-134) {
		tmp = (z / y) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (1.0 - (x / y)) * t
	tmp = 0
	if t <= -1.3e-114:
		tmp = t_1
	elif t <= 3.6e-134:
		tmp = (z / y) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(1.0 - Float64(x / y)) * t)
	tmp = 0.0
	if (t <= -1.3e-114)
		tmp = t_1;
	elseif (t <= 3.6e-134)
		tmp = Float64(Float64(z / y) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (1.0 - (x / y)) * t;
	tmp = 0.0;
	if (t <= -1.3e-114)
		tmp = t_1;
	elseif (t <= 3.6e-134)
		tmp = (z / y) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.30000000000000007e-114 or 3.5999999999999999e-134 < t

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

   if -1.30000000000000007e-114 < t < 3.5999999999999999e-134

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

Alternative 7: 63.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (-x / y) * t;
	double tmp;
	if ((x / y) <= -1e+199) {
		tmp = (z / y) * x;
	} else if ((x / y) <= -2e+162) {
		tmp = t_1;
	} else if ((x / y) <= -5e-5) {
		tmp = (x * z) / y;
	} else if ((x / y) <= 2e-16) {
		tmp = t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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) * t
    if ((x / y) <= (-1d+199)) then
        tmp = (z / y) * x
    else if ((x / y) <= (-2d+162)) then
        tmp = t_1
    else if ((x / y) <= (-5d-5)) then
        tmp = (x * z) / y
    else if ((x / y) <= 2d-16) then
        tmp = t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (-x / y) * t;
	double tmp;
	if ((x / y) <= -1e+199) {
		tmp = (z / y) * x;
	} else if ((x / y) <= -2e+162) {
		tmp = t_1;
	} else if ((x / y) <= -5e-5) {
		tmp = (x * z) / y;
	} else if ((x / y) <= 2e-16) {
		tmp = t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (-x / y) * t
	tmp = 0
	if (x / y) <= -1e+199:
		tmp = (z / y) * x
	elif (x / y) <= -2e+162:
		tmp = t_1
	elif (x / y) <= -5e-5:
		tmp = (x * z) / y
	elif (x / y) <= 2e-16:
		tmp = t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(-x) / y) * t)
	tmp = 0.0
	if (Float64(x / y) <= -1e+199)
		tmp = Float64(Float64(z / y) * x);
	elseif (Float64(x / y) <= -2e+162)
		tmp = t_1;
	elseif (Float64(x / y) <= -5e-5)
		tmp = Float64(Float64(x * z) / y);
	elseif (Float64(x / y) <= 2e-16)
		tmp = t;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (-x / y) * t;
	tmp = 0.0;
	if ((x / y) <= -1e+199)
		tmp = (z / y) * x;
	elseif ((x / y) <= -2e+162)
		tmp = t_1;
	elseif ((x / y) <= -5e-5)
		tmp = (x * z) / y;
	elseif ((x / y) <= 2e-16)
		tmp = t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 x y) < -1.0000000000000001e199

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

   if -1.0000000000000001e199 < (/.f64 x y) < -1.9999999999999999e162 or 2e-16 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

   5. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot \frac{x}{y}\right) \cdot t \]
   6. 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. lift-neg.f64 N/A

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

      4. lower-/.f64 29.1

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

   7. Applied rewrites 29.1%

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

   if -1.9999999999999999e162 < (/.f64 x y) < -5.00000000000000024e-5

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 38.2

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

   6. Applied rewrites 38.2%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 2e-16

   1. Initial program 97.7%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 37.9%

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

Alternative 8: 63.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -5e-5)
   (/ (* x z) y)
   (if (<= (/ x y) 2e-16) t (/ (* (- t) x) y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -5e-5) {
		tmp = (x * z) / y;
	} else if ((x / y) <= 2e-16) {
		tmp = t;
	} else {
		tmp = (-t * x) / y;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-5d-5)) then
        tmp = (x * z) / y
    else if ((x / y) <= 2d-16) then
        tmp = t
    else
        tmp = (-t * x) / y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -5e-5:
		tmp = (x * z) / y
	elif (x / y) <= 2e-16:
		tmp = t
	else:
		tmp = (-t * x) / y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -5e-5)
		tmp = Float64(Float64(x * z) / y);
	elseif (Float64(x / y) <= 2e-16)
		tmp = t;
	else
		tmp = Float64(Float64(Float64(-t) * x) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -5e-5)
		tmp = (x * z) / y;
	elseif ((x / y) <= 2e-16)
		tmp = t;
	else
		tmp = (-t * x) / y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 38.2

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

   6. Applied rewrites 38.2%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 2e-16

   1. Initial program 97.7%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 37.9%

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

   if 2e-16 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in z around 0

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

      1. *-rgt-identity N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-out N/A

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

      5. mul-1-neg N/A

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

      6. distribute-lft-out N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. *-lft-identity N/A

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

      12. lower--.f64 N/A

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

      13. lift-/.f64 64.6

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

   4. Applied rewrites 64.6%

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

   5. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. mul-1-neg N/A

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

      5. lift-neg.f64 N/A

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

      6. lower-*.f64 27.2

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

   7. Applied rewrites 27.2%

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

Alternative 9: 63.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -5e-5) (/ (* x z) y) (if (<= (/ x y) 2e-16) t (* (/ z y) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -5e-5) {
		tmp = (x * z) / y;
	} else if ((x / y) <= 2e-16) {
		tmp = t;
	} else {
		tmp = (z / y) * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x / y) <= (-5d-5)) then
        tmp = (x * z) / y
    else if ((x / y) <= 2d-16) then
        tmp = t
    else
        tmp = (z / y) * x
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (x / y) <= -5e-5:
		tmp = (x * z) / y
	elif (x / y) <= 2e-16:
		tmp = t
	else:
		tmp = (z / y) * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -5e-5)
		tmp = Float64(Float64(x * z) / y);
	elseif (Float64(x / y) <= 2e-16)
		tmp = t;
	else
		tmp = Float64(Float64(z / y) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x / y) <= -5e-5)
		tmp = (x * z) / y;
	elseif ((x / y) <= 2e-16)
		tmp = t;
	else
		tmp = (z / y) * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 38.2

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

   6. Applied rewrites 38.2%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 2e-16

   1. Initial program 97.7%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 37.9%

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

   if 2e-16 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

Alternative 10: 62.4% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / y) * x;
	double tmp;
	if ((x / y) <= -5e-5) {
		tmp = t_1;
	} else if ((x / y) <= 2e-16) {
		tmp = t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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 = (z / y) * x
    if ((x / y) <= (-5d-5)) then
        tmp = t_1
    else if ((x / y) <= 2d-16) then
        tmp = t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	t_1 = (z / y) * x
	tmp = 0
	if (x / y) <= -5e-5:
		tmp = t_1
	elif (x / y) <= 2e-16:
		tmp = t
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / y) * x;
	tmp = 0.0;
	if ((x / y) <= -5e-5)
		tmp = t_1;
	elseif ((x / y) <= 2e-16)
		tmp = t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -5.00000000000000024e-5 or 2e-16 < (/.f64 x y)

   1. Initial program 97.7%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 38.6

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

   4. Applied rewrites 38.6%

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

   if -5.00000000000000024e-5 < (/.f64 x y) < 2e-16

   1. Initial program 97.7%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 37.9%

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

Alternative 11: 37.9% accurate, 12.7× 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.7%

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

2. Taylor expanded in x around 0

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

4. Applied rewrites 37.9%

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

Reproduce

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