Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, C

Percentage Accurate: 94.8% → 97.5%

Time: 3.2s

Alternatives: 12

Speedup: 0.3×

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

Specification

Math

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

FPCore

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

C

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

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 / (1.0d0 - z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 / (1.0d0 - z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < -inf.0

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l/ N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 61.1

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

      8. lift-*.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 61.2

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

   6. Applied rewrites 61.2%

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

   if -inf.0 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < 4.00000000000000027e265

   1. Initial program 94.8%

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

   if 4.00000000000000027e265 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z)))

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l/ N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 61.1

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

      8. lift-*.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 61.2

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

   6. Applied rewrites 61.2%

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

      1. lift-/.f64 N/A

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

      2. div-flip N/A

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

      3. lower-unsound-/.f64 N/A

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

      4. lower-unsound-/.f64 60.8

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

   8. Applied rewrites 60.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip-rev N/A

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

      5. lower-/.f64 60.9

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

   10. Applied rewrites 60.9%

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

Alternative 2: 94.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1 < z

   1. Initial program 94.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-*.f64 74.0

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

   4. Applied rewrites 74.0%

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

   if -1 < z < 1

   1. Initial program 94.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.5%

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

Alternative 3: 88.9% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -0.0290000000000000015 or 1 < z

   1. Initial program 94.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 71.3

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

   4. Applied rewrites 71.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 71.3

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. mul-1-neg N/A

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

      7. add-flip-rev N/A

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

      8. lower-+.f64 71.3

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

   6. Applied rewrites 71.3%

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

   if -0.0290000000000000015 < z < 1

   1. Initial program 94.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.5%

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

Alternative 4: 88.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -0.0290000000000000015 or 1 < z

   1. Initial program 94.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 71.3

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

   4. Applied rewrites 71.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. mult-flip-rev N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lower-*.f64 71.2

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

      9. lift--.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. mul-1-neg N/A

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

      12. add-flip-rev N/A

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

      13. lower-+.f64 71.2

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

      14. lift-*.f64 N/A

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

      15. lift-/.f64 N/A

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

      16. mult-flip-rev N/A

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

      17. lower-/.f64 71.3

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

   6. Applied rewrites 71.3%

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

   if -0.0290000000000000015 < z < 1

   1. Initial program 94.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.5%

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

Alternative 5: 74.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.05e+159)
   (* x (/ t z))
   (if (<= z 1.0) (* x (- (/ y z) t)) (* (/ y z) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.05e+159) {
		tmp = x * (t / z);
	} else if (z <= 1.0) {
		tmp = x * ((y / z) - t);
	} else {
		tmp = (y / z) * 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 (z <= (-1.05d+159)) then
        tmp = x * (t / z)
    else if (z <= 1.0d0) then
        tmp = x * ((y / z) - t)
    else
        tmp = (y / z) * x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1.04999999999999994e159

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around inf

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

      1. lower-/.f64 35.9

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

   9. Applied rewrites 35.9%

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

   if -1.04999999999999994e159 < z < 1

   1. Initial program 94.8%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 64.5%

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

   if 1 < z

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lower-*.f64 61.1

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

   6. Applied rewrites 61.1%

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

Alternative 6: 73.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot y}{z}\\ \mathbf{if}\;y \leq -2.15 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{-36}:\\ \;\;\;\;x \cdot \frac{t}{z - 1}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x y) z)))
   (if (<= y -2.15e-13) t_1 (if (<= y 6.5e-36) (* x (/ t (- z 1.0))) t_1))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
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
    if (y <= (-2.15d-13)) then
        tmp = t_1
    else if (y <= 6.5d-36) then
        tmp = x * (t / (z - 1.0d0))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * y) / z;
	double tmp;
	if (y <= -2.15e-13) {
		tmp = t_1;
	} else if (y <= 6.5e-36) {
		tmp = x * (t / (z - 1.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.1499999999999999e-13 or 6.50000000000000012e-36 < y

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

   if -2.1499999999999999e-13 < y < 6.50000000000000012e-36

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

Alternative 7: 67.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -5.4 \cdot 10^{+255}:\\ \;\;\;\;\frac{x \cdot t}{z}\\ \mathbf{elif}\;t \leq 3.5 \cdot 10^{-174}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{elif}\;t \leq 2.8 \cdot 10^{+141}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(-t\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -5.4e+255)
   (/ (* x t) z)
   (if (<= t 3.5e-174)
     (* (/ y z) x)
     (if (<= t 2.8e+141) (/ (* x y) z) (* (- t) x)))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -5.4e+255) {
		tmp = (x * t) / z;
	} else if (t <= 3.5e-174) {
		tmp = (y / z) * x;
	} else if (t <= 2.8e+141) {
		tmp = (x * y) / z;
	} else {
		tmp = -t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -5.4e+255:
		tmp = (x * t) / z
	elif t <= 3.5e-174:
		tmp = (y / z) * x
	elif t <= 2.8e+141:
		tmp = (x * y) / z
	else:
		tmp = -t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -5.4e+255)
		tmp = Float64(Float64(x * t) / z);
	elseif (t <= 3.5e-174)
		tmp = Float64(Float64(y / z) * x);
	elseif (t <= 2.8e+141)
		tmp = Float64(Float64(x * y) / z);
	else
		tmp = Float64(Float64(-t) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -5.4e+255)
		tmp = (x * t) / z;
	elseif (t <= 3.5e-174)
		tmp = (y / z) * x;
	elseif (t <= 2.8e+141)
		tmp = (x * y) / z;
	else
		tmp = -t * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -5.4e+255], N[(N[(x * t), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t, 3.5e-174], N[(N[(y / z), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t, 2.8e+141], N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision], N[((-t) * x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if t < -5.4000000000000002e255

   1. Initial program 94.8%

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

   2. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-*.f64 71.3

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

   4. Applied rewrites 71.3%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 33.2%

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

   if -5.4000000000000002e255 < t < 3.49999999999999987e-174

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lower-*.f64 61.1

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

   6. Applied rewrites 61.1%

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

   if 3.49999999999999987e-174 < t < 2.79999999999999991e141

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

   if 2.79999999999999991e141 < t

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 23.0

         \[\leadsto x \cdot \left(-1 \cdot t\right) \]

   9. Applied rewrites 23.0%

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

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 23.0

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

       4. lift-*.f64 N/A

          \[\leadsto \left(-1 \cdot t\right) \cdot x \]

       5. mul-1-neg N/A

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

       6. lift-neg.f64 23.0

          \[\leadsto \left(-t\right) \cdot x \]

   11. Applied rewrites 23.0%

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

Alternative 8: 63.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-t\right) \cdot x\\ t_2 := \frac{y}{z} - \frac{t}{1 - z}\\ t_3 := \frac{x}{z} \cdot y\\ \mathbf{if}\;t\_2 \leq -2 \cdot 10^{+292}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{+226}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+194}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+216}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t) x))
        (t_2 (- (/ y z) (/ t (- 1.0 z))))
        (t_3 (* (/ x z) y)))
   (if (<= t_2 -2e+292)
     t_3
     (if (<= t_2 -1e+226)
       t_1
       (if (<= t_2 5e+194) (* (/ y z) x) (if (<= t_2 4e+216) t_1 t_3))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = -t * x;
	double t_2 = (y / z) - (t / (1.0 - z));
	double t_3 = (x / z) * y;
	double tmp;
	if (t_2 <= -2e+292) {
		tmp = t_3;
	} else if (t_2 <= -1e+226) {
		tmp = t_1;
	} else if (t_2 <= 5e+194) {
		tmp = (y / z) * x;
	} else if (t_2 <= 4e+216) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	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) :: t_3
    real(8) :: tmp
    t_1 = -t * x
    t_2 = (y / z) - (t / (1.0d0 - z))
    t_3 = (x / z) * y
    if (t_2 <= (-2d+292)) then
        tmp = t_3
    else if (t_2 <= (-1d+226)) then
        tmp = t_1
    else if (t_2 <= 5d+194) then
        tmp = (y / z) * x
    else if (t_2 <= 4d+216) then
        tmp = t_1
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = -t * x;
	double t_2 = (y / z) - (t / (1.0 - z));
	double t_3 = (x / z) * y;
	double tmp;
	if (t_2 <= -2e+292) {
		tmp = t_3;
	} else if (t_2 <= -1e+226) {
		tmp = t_1;
	} else if (t_2 <= 5e+194) {
		tmp = (y / z) * x;
	} else if (t_2 <= 4e+216) {
		tmp = t_1;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = -t * x
	t_2 = (y / z) - (t / (1.0 - z))
	t_3 = (x / z) * y
	tmp = 0
	if t_2 <= -2e+292:
		tmp = t_3
	elif t_2 <= -1e+226:
		tmp = t_1
	elif t_2 <= 5e+194:
		tmp = (y / z) * x
	elif t_2 <= 4e+216:
		tmp = t_1
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(-t) * x)
	t_2 = Float64(Float64(y / z) - Float64(t / Float64(1.0 - z)))
	t_3 = Float64(Float64(x / z) * y)
	tmp = 0.0
	if (t_2 <= -2e+292)
		tmp = t_3;
	elseif (t_2 <= -1e+226)
		tmp = t_1;
	elseif (t_2 <= 5e+194)
		tmp = Float64(Float64(y / z) * x);
	elseif (t_2 <= 4e+216)
		tmp = t_1;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = -t * x;
	t_2 = (y / z) - (t / (1.0 - z));
	t_3 = (x / z) * y;
	tmp = 0.0;
	if (t_2 <= -2e+292)
		tmp = t_3;
	elseif (t_2 <= -1e+226)
		tmp = t_1;
	elseif (t_2 <= 5e+194)
		tmp = (y / z) * x;
	elseif (t_2 <= 4e+216)
		tmp = t_1;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[((-t) * x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / z), $MachinePrecision] - N[(t / N[(1.0 - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+292], t$95$3, If[LessEqual[t$95$2, -1e+226], t$95$1, If[LessEqual[t$95$2, 5e+194], N[(N[(y / z), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t$95$2, 4e+216], t$95$1, t$95$3]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < -2e292 or 4.0000000000000001e216 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z)))

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l/ N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 61.1

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

      8. lift-*.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 61.2

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

   6. Applied rewrites 61.2%

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

   if -2e292 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < -9.99999999999999961e225 or 4.99999999999999989e194 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < 4.0000000000000001e216

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 23.0

         \[\leadsto x \cdot \left(-1 \cdot t\right) \]

   9. Applied rewrites 23.0%

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

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 23.0

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

       4. lift-*.f64 N/A

          \[\leadsto \left(-1 \cdot t\right) \cdot x \]

       5. mul-1-neg N/A

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

       6. lift-neg.f64 23.0

          \[\leadsto \left(-t\right) \cdot x \]

   11. Applied rewrites 23.0%

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

   if -9.99999999999999961e225 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < 4.99999999999999989e194

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lower-*.f64 61.1

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

   6. Applied rewrites 61.1%

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

Alternative 9: 63.3% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (/ t z))))
   (if (<= t -5.4e+255) t_1 (if (<= t 1.95e+120) (* (/ y z) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * (t / z);
	double tmp;
	if (t <= -5.4e+255) {
		tmp = t_1;
	} else if (t <= 1.95e+120) {
		tmp = (y / z) * 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 = x * (t / z)
    if (t <= (-5.4d+255)) then
        tmp = t_1
    else if (t <= 1.95d+120) then
        tmp = (y / z) * 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 = x * (t / z);
	double tmp;
	if (t <= -5.4e+255) {
		tmp = t_1;
	} else if (t <= 1.95e+120) {
		tmp = (y / z) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x * (t / z)
	tmp = 0
	if t <= -5.4e+255:
		tmp = t_1
	elif t <= 1.95e+120:
		tmp = (y / z) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * Float64(t / z))
	tmp = 0.0
	if (t <= -5.4e+255)
		tmp = t_1;
	elseif (t <= 1.95e+120)
		tmp = Float64(Float64(y / z) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * (t / z);
	tmp = 0.0;
	if (t <= -5.4e+255)
		tmp = t_1;
	elseif (t <= 1.95e+120)
		tmp = (y / z) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.4000000000000002e255 or 1.9499999999999999e120 < t

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around inf

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

      1. lower-/.f64 35.9

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

   9. Applied rewrites 35.9%

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

   if -5.4000000000000002e255 < t < 1.9499999999999999e120

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lower-*.f64 61.1

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

   6. Applied rewrites 61.1%

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

Alternative 10: 62.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 3.5 \cdot 10^{-174}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{elif}\;t \leq 2.8 \cdot 10^{+141}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(-t\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t 3.5e-174)
   (* (/ y z) x)
   (if (<= t 2.8e+141) (/ (* x y) z) (* (- t) x))))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if t <= 3.5e-174:
		tmp = (y / z) * x
	elif t <= 2.8e+141:
		tmp = (x * y) / z
	else:
		tmp = -t * x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= 3.5e-174)
		tmp = (y / z) * x;
	elseif (t <= 2.8e+141)
		tmp = (x * y) / z;
	else
		tmp = -t * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < 3.49999999999999987e-174

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*l/ N/A

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

      5. lift-/.f64 N/A

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

      6. lower-*.f64 61.1

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

   6. Applied rewrites 61.1%

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

   if 3.49999999999999987e-174 < t < 2.79999999999999991e141

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

   if 2.79999999999999991e141 < t

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 23.0

         \[\leadsto x \cdot \left(-1 \cdot t\right) \]

   9. Applied rewrites 23.0%

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

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 23.0

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

       4. lift-*.f64 N/A

          \[\leadsto \left(-1 \cdot t\right) \cdot x \]

       5. mul-1-neg N/A

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

       6. lift-neg.f64 23.0

          \[\leadsto \left(-t\right) \cdot x \]

   11. Applied rewrites 23.0%

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

Alternative 11: 62.3% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t 2.8e+141) (* (/ x z) y) (* (- t) x)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 2.79999999999999991e141

   1. Initial program 94.8%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 60.7

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

   4. Applied rewrites 60.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l/ N/A

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

      4. mult-flip-rev N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lower-*.f64 61.1

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

      8. lift-*.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 61.2

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

   6. Applied rewrites 61.2%

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

   if 2.79999999999999991e141 < t

   1. Initial program 94.8%

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

      1. lift--.f64 N/A

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

      2. sub-negate-rev N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. sub-to-fraction N/A

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

      6. distribute-neg-frac2 N/A

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

      7. remove-double-neg N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 83.3%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 46.0

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

   6. Applied rewrites 46.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 23.0

         \[\leadsto x \cdot \left(-1 \cdot t\right) \]

   9. Applied rewrites 23.0%

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

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 23.0

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

       4. lift-*.f64 N/A

          \[\leadsto \left(-1 \cdot t\right) \cdot x \]

       5. mul-1-neg N/A

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

       6. lift-neg.f64 23.0

          \[\leadsto \left(-t\right) \cdot x \]

   11. Applied rewrites 23.0%

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

Alternative 12: 23.0% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

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 * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.8%

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

   1. lift--.f64 N/A

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

   2. sub-negate-rev N/A

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

   3. lift-/.f64 N/A

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

   4. frac-2neg N/A

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

   5. sub-to-fraction N/A

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

   6. distribute-neg-frac2 N/A

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

   7. remove-double-neg N/A

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

   8. lower-/.f64 N/A

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

3. Applied rewrites 83.3%

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

4. Taylor expanded in y around 0

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

   1. lower-/.f64 N/A

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

   2. lower--.f64 46.0

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

6. Applied rewrites 46.0%

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

7. Taylor expanded in z around 0

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

   1. lower-*.f64 23.0

      \[\leadsto x \cdot \left(-1 \cdot t\right) \]

9. Applied rewrites 23.0%

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

    1. lift-*.f64 N/A

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

    2. *-commutative N/A

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

    3. lower-*.f64 23.0

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

    4. lift-*.f64 N/A

       \[\leadsto \left(-1 \cdot t\right) \cdot x \]

    5. mul-1-neg N/A

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

    6. lift-neg.f64 23.0

       \[\leadsto \left(-t\right) \cdot x \]

11. Applied rewrites 23.0%

    \[\leadsto \color{blue}{\left(-t\right) \cdot x} \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2025155 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, C"
  :precision binary64
  (* x (- (/ y z) (/ t (- 1.0 z)))))