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

Percentage Accurate: 94.5% → 98.3%

Time: 6.4s

Alternatives: 11

Speedup: 0.9×

• 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.5% 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: 98.3% 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 -4 \cdot 10^{+299}:\\ \;\;\;\;\frac{x}{z} \cdot y\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+267}:\\ \;\;\;\;x \cdot t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \left(y - t \cdot z\right)}{z}\\ \end{array} \end{array} \]

FPCore

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

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 <= -4e+299) {
		tmp = (x / z) * y;
	} else if (t_1 <= 2e+267) {
		tmp = x * t_1;
	} else {
		tmp = (x * (y - (t * z))) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (y / z) - (t / (1.0d0 - z))
    if (t_1 <= (-4d+299)) then
        tmp = (x / z) * y
    else if (t_1 <= 2d+267) then
        tmp = x * t_1
    else
        tmp = (x * (y - (t * z))) / z
    end if
    code = tmp
end function

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 <= -4e+299) {
		tmp = (x / z) * y;
	} else if (t_1 <= 2e+267) {
		tmp = x * t_1;
	} else {
		tmp = (x * (y - (t * z))) / z;
	}
	return tmp;
}

Python

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 74.9%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. *-lft-identity N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-neg-out N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-neg-out N/A

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

      8. mul-1-neg N/A

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

      9. distribute-rgt-in N/A

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

      10. +-commutative N/A

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

      11. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 99.9%

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

   if -4.0000000000000002e299 < (-.f64 (/.f64 y z) (/.f64 t (-.f64 #s(literal 1 binary64) z))) < 1.9999999999999999e267

   1. Initial program 98.8%

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

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

   1. Initial program 77.3%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

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

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

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

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

      10. fp-cancel-sub-sign N/A

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

      11. mul-1-neg N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. fp-cancel-sub-sign N/A

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

      17. lower--.f64 N/A

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

      18. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

Alternative 2: 95.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -0.86)
   (* x (- (/ y z) (/ t (- z))))
   (if (<= z 1.85e-10) (/ (* x (- y (* t z))) z) (* x (/ (+ t y) z)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -0.86) {
		tmp = x * ((y / z) - (t / -z));
	} else if (z <= 1.85e-10) {
		tmp = (x * (y - (t * z))) / z;
	} else {
		tmp = x * ((t + y) / z);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-0.86d0)) then
        tmp = x * ((y / z) - (t / -z))
    else if (z <= 1.85d-10) then
        tmp = (x * (y - (t * z))) / z
    else
        tmp = x * ((t + y) / z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -0.86:
		tmp = x * ((y / z) - (t / -z))
	elif z <= 1.85e-10:
		tmp = (x * (y - (t * z))) / z
	else:
		tmp = x * ((t + y) / z)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -0.859999999999999987

   1. Initial program 96.5%

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

   3. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 96.5

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

   5. Applied rewrites 96.5%

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

   if -0.859999999999999987 < z < 1.85000000000000007e-10

   1. Initial program 92.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

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

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

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

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

      10. fp-cancel-sub-sign N/A

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

      11. mul-1-neg N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. fp-cancel-sub-sign N/A

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

      17. lower--.f64 N/A

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

      18. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if 1.85000000000000007e-10 < z

   1. Initial program 99.3%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

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

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 98.4

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

   5. Applied rewrites 98.4%

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

Alternative 3: 95.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -0.86) (not (<= z 1.85e-10)))
   (* x (/ (+ t y) z))
   (/ (* x (- y (* t z))) z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -0.86) || !(z <= 1.85e-10)) {
		tmp = x * ((t + y) / z);
	} else {
		tmp = (x * (y - (t * z))) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -0.86) || !(z <= 1.85e-10)) {
		tmp = x * ((t + y) / z);
	} else {
		tmp = (x * (y - (t * z))) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -0.86) or not (z <= 1.85e-10):
		tmp = x * ((t + y) / z)
	else:
		tmp = (x * (y - (t * z))) / z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -0.86) || !(z <= 1.85e-10))
		tmp = Float64(x * Float64(Float64(t + y) / z));
	else
		tmp = Float64(Float64(x * Float64(y - Float64(t * z))) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -0.86) || ~((z <= 1.85e-10)))
		tmp = x * ((t + y) / z);
	else
		tmp = (x * (y - (t * z))) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -0.86], N[Not[LessEqual[z, 1.85e-10]], $MachinePrecision]], N[(x * N[(N[(t + y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(y - N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -0.859999999999999987 or 1.85000000000000007e-10 < z

   1. Initial program 97.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

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

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 97.4

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

   5. Applied rewrites 97.4%

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

   if -0.859999999999999987 < z < 1.85000000000000007e-10

   1. Initial program 92.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

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

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

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

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

      10. fp-cancel-sub-sign N/A

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

      11. mul-1-neg N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. fp-cancel-sub-sign N/A

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

      17. lower--.f64 N/A

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

      18. lower-*.f64 96.7

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

   5. Applied rewrites 96.7%

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

4. Final simplification 97.1%

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

Alternative 4: 93.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.0) (not (<= z 1.85e-10)))
   (* x (/ (+ t y) z))
   (* x (- (/ y z) t))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1 or 1.85000000000000007e-10 < z

   1. Initial program 97.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

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

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 97.4

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

   5. Applied rewrites 97.4%

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

   if -1 < z < 1.85000000000000007e-10

   1. Initial program 92.7%

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

   3. Taylor expanded in z around 0

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

      1. div-add N/A

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

      2. associate-*r* N/A

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

      3. associate-/l* N/A

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

      4. mul-1-neg N/A

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

      5. fp-cancel-sub-sign N/A

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

      6. *-inverses N/A

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

      7. *-rgt-identity N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 92.7

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

   5. Applied rewrites 92.7%

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

4. Final simplification 95.0%

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

Alternative 5: 88.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1 or 3.99999999999999982e-6 < z

   1. Initial program 97.9%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 84.8

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

   5. Applied rewrites 84.8%

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

   7. Applied rewrites 89.2%

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

   if -1 < z < 3.99999999999999982e-6

   1. Initial program 92.7%

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

   3. Taylor expanded in z around 0

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

      1. div-add N/A

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

      2. associate-*r* N/A

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

      3. associate-/l* N/A

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

      4. mul-1-neg N/A

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

      5. fp-cancel-sub-sign N/A

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

      6. *-inverses N/A

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

      7. *-rgt-identity N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 92.7

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

   5. Applied rewrites 92.7%

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

4. Final simplification 91.0%

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

Alternative 6: 78.1% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -4.7e-63) (not (<= z 4e-6))) (* (/ x z) (+ t y)) (/ (* y x) z)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -4.7e-63) || !(z <= 4e-6)) {
		tmp = (x / z) * (t + y);
	} else {
		tmp = (y * x) / z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -4.7e-63) or not (z <= 4e-6):
		tmp = (x / z) * (t + y)
	else:
		tmp = (y * x) / z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -4.7e-63) || !(z <= 4e-6))
		tmp = Float64(Float64(x / z) * Float64(t + y));
	else
		tmp = Float64(Float64(y * x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -4.7e-63) || ~((z <= 4e-6)))
		tmp = (x / z) * (t + y);
	else
		tmp = (y * x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -4.7000000000000001e-63 or 3.99999999999999982e-6 < z

   1. Initial program 98.1%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 82.5

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

   5. Applied rewrites 82.5%

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

   7. Applied rewrites 86.4%

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

   if -4.7000000000000001e-63 < z < 3.99999999999999982e-6

   1. Initial program 91.7%

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

   3. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 69.6

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

   5. Applied rewrites 69.6%

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

   7. Applied rewrites 75.8%

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

4. Final simplification 81.6%

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

Alternative 7: 64.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{-204} \lor \neg \left(y \leq 1.95 \cdot 10^{-87}\right):\\ \;\;\;\;\frac{x}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z} \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -2.3e-204) (not (<= y 1.95e-87))) (* (/ x z) y) (* (/ x z) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.3e-204) || !(y <= 1.95e-87)) {
		tmp = (x / z) * y;
	} else {
		tmp = (x / z) * t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y <= (-2.3d-204)) .or. (.not. (y <= 1.95d-87))) then
        tmp = (x / z) * y
    else
        tmp = (x / z) * t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.3e-204) || !(y <= 1.95e-87)) {
		tmp = (x / z) * y;
	} else {
		tmp = (x / z) * t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -2.3e-204) or not (y <= 1.95e-87):
		tmp = (x / z) * y
	else:
		tmp = (x / z) * t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -2.3e-204) || !(y <= 1.95e-87))
		tmp = Float64(Float64(x / z) * y);
	else
		tmp = Float64(Float64(x / z) * t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -2.3e-204) || ~((y <= 1.95e-87)))
		tmp = (x / z) * y;
	else
		tmp = (x / z) * t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -2.3e-204], N[Not[LessEqual[y, 1.95e-87]], $MachinePrecision]], N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.2999999999999999e-204 or 1.9499999999999999e-87 < y

   1. Initial program 94.8%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. *-commutative N/A

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

      3. *-lft-identity N/A

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

      4. metadata-eval N/A

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

      5. distribute-lft-neg-out N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-neg-out N/A

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

      8. mul-1-neg N/A

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

      9. distribute-rgt-in N/A

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

      10. +-commutative N/A

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

      11. lower-*.f64 N/A

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

   5. Applied rewrites 89.0%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 73.9%

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

   if -2.2999999999999999e-204 < y < 1.9499999999999999e-87

   1. Initial program 96.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 62.8

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

   5. Applied rewrites 62.8%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 57.5%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 55.7%

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

4. Final simplification 69.7%

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

Alternative 8: 41.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+23} \lor \neg \left(z \leq 11000\right):\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{else}:\\ \;\;\;\;\left(-t\right) \cdot \mathsf{fma}\left(x, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -3.8e+23) (not (<= z 11000.0)))
   (* (/ x z) t)
   (* (- t) (fma x z x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -3.8e+23) || !(z <= 11000.0)) {
		tmp = (x / z) * t;
	} else {
		tmp = -t * fma(x, z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -3.8e+23) || !(z <= 11000.0))
		tmp = Float64(Float64(x / z) * t);
	else
		tmp = Float64(Float64(-t) * fma(x, z, x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -3.8e+23], N[Not[LessEqual[z, 11000.0]], $MachinePrecision]], N[(N[(x / z), $MachinePrecision] * t), $MachinePrecision], N[((-t) * N[(x * z + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.79999999999999975e23 or 11000 < z

   1. Initial program 97.8%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 83.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 81.2%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 55.4%

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

   if -3.79999999999999975e23 < z < 11000

   1. Initial program 93.1%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-lft-identity N/A

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

      6. metadata-eval N/A

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

      7. cancel-sign-sub N/A

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

      8. mul-1-neg N/A

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. remove-double-neg N/A

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

      12. metadata-eval N/A

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

      13. metadata-eval N/A

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

      14. metadata-eval N/A

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

      15. fp-cancel-sub-sign N/A

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

      16. metadata-eval N/A

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

      17. lower--.f64 34.9

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

   5. Applied rewrites 34.9%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 35.0%

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

4. Final simplification 44.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{+23} \lor \neg \left(z \leq 11000\right):\\ \;\;\;\;\frac{x}{z} \cdot t\\ \mathbf{else}:\\ \;\;\;\;\left(-t\right) \cdot \mathsf{fma}\left(x, z, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 66.3% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -2.5e+79)
   (* x (/ t z))
   (if (<= t 1.15e+225) (* (/ y z) x) (* (- t) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -2.5e+79) {
		tmp = x * (t / z);
	} else if (t <= 1.15e+225) {
		tmp = (y / z) * x;
	} 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.5d+79)) then
        tmp = x * (t / z)
    else if (t <= 1.15d+225) then
        tmp = (y / z) * x
    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.5e+79) {
		tmp = x * (t / z);
	} else if (t <= 1.15e+225) {
		tmp = (y / z) * x;
	} else {
		tmp = -t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -2.5e+79:
		tmp = x * (t / z)
	elif t <= 1.15e+225:
		tmp = (y / z) * x
	else:
		tmp = -t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -2.5e+79)
		tmp = Float64(x * Float64(t / z));
	elseif (t <= 1.15e+225)
		tmp = Float64(Float64(y / z) * x);
	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.5e+79)
		tmp = x * (t / z);
	elseif (t <= 1.15e+225)
		tmp = (y / z) * x;
	else
		tmp = -t * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -2.5e79

   1. Initial program 95.0%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

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

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

      3. metadata-eval N/A

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

      4. *-lft-identity N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 63.7

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

   5. Applied rewrites 63.7%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 51.8%

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

   if -2.5e79 < t < 1.15e225

   1. Initial program 95.3%

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

   3. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 76.5

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

   5. Applied rewrites 76.5%

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

   if 1.15e225 < t

   1. Initial program 94.5%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

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

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

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

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

      10. fp-cancel-sub-sign N/A

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

      11. mul-1-neg N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. fp-cancel-sub-sign N/A

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

      17. lower--.f64 N/A

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

      18. lower-*.f64 67.6

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

   5. Applied rewrites 67.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 56.9%

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

Alternative 10: 64.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -2.5e+79)
   (* (/ x z) t)
   (if (<= t 1.15e+225) (* (/ y z) x) (* (- t) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -2.5e+79) {
		tmp = (x / z) * t;
	} else if (t <= 1.15e+225) {
		tmp = (y / z) * x;
	} 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.5d+79)) then
        tmp = (x / z) * t
    else if (t <= 1.15d+225) then
        tmp = (y / z) * x
    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.5e+79) {
		tmp = (x / z) * t;
	} else if (t <= 1.15e+225) {
		tmp = (y / z) * x;
	} else {
		tmp = -t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -2.5e+79:
		tmp = (x / z) * t
	elif t <= 1.15e+225:
		tmp = (y / z) * x
	else:
		tmp = -t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -2.5e+79)
		tmp = Float64(Float64(x / z) * t);
	elseif (t <= 1.15e+225)
		tmp = Float64(Float64(y / z) * x);
	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.5e+79)
		tmp = (x / z) * t;
	elseif (t <= 1.15e+225)
		tmp = (y / z) * x;
	else
		tmp = -t * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -2.5e79

   1. Initial program 95.0%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

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

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

      5. metadata-eval N/A

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

      6. *-lft-identity N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 57.0

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

   5. Applied rewrites 57.0%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 59.2%

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

   9. Taylor expanded in y around 0

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

   11. Applied rewrites 49.5%

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

   if -2.5e79 < t < 1.15e225

   1. Initial program 95.3%

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

   3. Taylor expanded in y around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 76.5

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

   5. Applied rewrites 76.5%

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

   if 1.15e225 < t

   1. Initial program 94.5%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

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

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

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

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

      10. fp-cancel-sub-sign N/A

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

      11. mul-1-neg N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. associate-*r* N/A

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

      15. mul-1-neg N/A

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

      16. fp-cancel-sub-sign N/A

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

      17. lower--.f64 N/A

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

      18. lower-*.f64 67.6

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

   5. Applied rewrites 67.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 56.9%

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

Alternative 11: 22.9% accurate, 4.3× 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 95.2%

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

3. Taylor expanded in z around 0

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

   1. lower-/.f64 N/A

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

   2. +-commutative N/A

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

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

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

   4. metadata-eval N/A

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

   5. *-lft-identity N/A

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

   6. associate-*r* N/A

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

   7. *-commutative N/A

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

   8. associate-*l* N/A

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

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

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

   10. fp-cancel-sub-sign N/A

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

   11. mul-1-neg N/A

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

   12. associate-*r* N/A

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

   13. lower-*.f64 N/A

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

   14. associate-*r* N/A

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

   15. mul-1-neg N/A

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

   16. fp-cancel-sub-sign N/A

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

   17. lower--.f64 N/A

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

   18. lower-*.f64 68.3

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

5. Applied rewrites 68.3%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 24.0%

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

Developer Target 1: 94.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \left(\frac{y}{z} - t \cdot \frac{1}{1 - z}\right)\\ t_2 := x \cdot \left(\frac{y}{z} - \frac{t}{1 - z}\right)\\ \mathbf{if}\;t\_2 < -7.623226303312042 \cdot 10^{-196}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 < 1.4133944927702302 \cdot 10^{-211}:\\ \;\;\;\;\frac{y \cdot x}{z} + \left(-\frac{t \cdot x}{1 - z}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (- (/ y z) (* t (/ 1.0 (- 1.0 z))))))
        (t_2 (* x (- (/ y z) (/ t (- 1.0 z))))))
   (if (< t_2 -7.623226303312042e-196)
     t_1
     (if (< t_2 1.4133944927702302e-211)
       (+ (/ (* y x) z) (- (/ (* t x) (- 1.0 z))))
       t_1))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x * ((y / z) - (t * (1.0 / (1.0 - z))));
	double t_2 = x * ((y / z) - (t / (1.0 - z)));
	double tmp;
	if (t_2 < -7.623226303312042e-196) {
		tmp = t_1;
	} else if (t_2 < 1.4133944927702302e-211) {
		tmp = ((y * x) / z) + -((t * x) / (1.0 - z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x * ((y / z) - (t * (1.0 / (1.0 - z))))
	t_2 = x * ((y / z) - (t / (1.0 - z)))
	tmp = 0
	if t_2 < -7.623226303312042e-196:
		tmp = t_1
	elif t_2 < 1.4133944927702302e-211:
		tmp = ((y * x) / z) + -((t * x) / (1.0 - z))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * Float64(Float64(y / z) - Float64(t * Float64(1.0 / Float64(1.0 - z)))))
	t_2 = Float64(x * Float64(Float64(y / z) - Float64(t / Float64(1.0 - z))))
	tmp = 0.0
	if (t_2 < -7.623226303312042e-196)
		tmp = t_1;
	elseif (t_2 < 1.4133944927702302e-211)
		tmp = Float64(Float64(Float64(y * x) / z) + Float64(-Float64(Float64(t * x) / Float64(1.0 - z))));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * ((y / z) - (t * (1.0 / (1.0 - z))));
	t_2 = x * ((y / z) - (t / (1.0 - z)));
	tmp = 0.0;
	if (t_2 < -7.623226303312042e-196)
		tmp = t_1;
	elseif (t_2 < 1.4133944927702302e-211)
		tmp = ((y * x) / z) + -((t * x) / (1.0 - z));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(N[(y / z), $MachinePrecision] - N[(t * N[(1.0 / N[(1.0 - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(y / z), $MachinePrecision] - N[(t / N[(1.0 - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$2, -7.623226303312042e-196], t$95$1, If[Less[t$95$2, 1.4133944927702302e-211], N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] + (-N[(N[(t * x), $MachinePrecision] / N[(1.0 - z), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], t$95$1]]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (* x (- (/ y z) (/ t (- 1 z)))) -3811613151656021/5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* x (- (/ y z) (* t (/ 1 (- 1 z))))) (if (< (* x (- (/ y z) (/ t (- 1 z)))) 7066972463851151/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (/ (* y x) z) (- (/ (* t x) (- 1 z)))) (* x (- (/ y z) (* t (/ 1 (- 1 z))))))))

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