Diagrams.Trail:splitAtParam from diagrams-lib-1.3.0.3, A

Percentage Accurate: 88.7% → 95.2%

Time: 4.0s

Alternatives: 14

Speedup: 0.3×

Specification

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 95.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot z - x\\ t_2 := \frac{x + \frac{y \cdot z - x}{t\_1}}{x + 1}\\ \mathbf{if}\;t\_2 \leq -4 \cdot 10^{+46}:\\ \;\;\;\;\frac{y}{1 + x} \cdot \frac{z}{t\_1}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+254}:\\ \;\;\;\;\frac{x + \frac{\mathsf{fma}\left(z, y, -x\right)}{t\_1}}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{y}{t \cdot \left(1 + x\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x)) (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0))))
   (if (<= t_2 -4e+46)
     (* (/ y (+ 1.0 x)) (/ z t_1))
     (if (<= t_2 5e+254)
       (/ (+ x (/ (fma z y (- x)) t_1)) (+ x 1.0))
       (+ 1.0 (/ y (* t (+ 1.0 x))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double tmp;
	if (t_2 <= -4e+46) {
		tmp = (y / (1.0 + x)) * (z / t_1);
	} else if (t_2 <= 5e+254) {
		tmp = (x + (fma(z, y, -x) / t_1)) / (x + 1.0);
	} else {
		tmp = 1.0 + (y / (t * (1.0 + x)));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4e46

   1. Initial program 74.3%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if -4e46 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.0%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-neg.f64 99.0

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

   5. Applied rewrites 99.0%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 2: 91.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot z - x\\ t_2 := \frac{x + \frac{y \cdot z - x}{t\_1}}{x + 1}\\ t_3 := \frac{x + \frac{\mathsf{fma}\left(z, y, -x\right)}{t\_1}}{1}\\ \mathbf{if}\;t\_2 \leq -5000000000:\\ \;\;\;\;\frac{y}{1 + x} \cdot \frac{z}{t\_1}\\ \mathbf{elif}\;t\_2 \leq 10^{-77}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 1.000002:\\ \;\;\;\;\frac{x - \frac{x}{t\_1}}{x + 1}\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+254}:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{y}{t \cdot \left(1 + x\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x))
        (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0)))
        (t_3 (/ (+ x (/ (fma z y (- x)) t_1)) 1.0)))
   (if (<= t_2 -5000000000.0)
     (* (/ y (+ 1.0 x)) (/ z t_1))
     (if (<= t_2 1e-77)
       t_3
       (if (<= t_2 1.000002)
         (/ (- x (/ x t_1)) (+ x 1.0))
         (if (<= t_2 5e+254) t_3 (+ 1.0 (/ y (* t (+ 1.0 x))))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double t_3 = (x + (fma(z, y, -x) / t_1)) / 1.0;
	double tmp;
	if (t_2 <= -5000000000.0) {
		tmp = (y / (1.0 + x)) * (z / t_1);
	} else if (t_2 <= 1e-77) {
		tmp = t_3;
	} else if (t_2 <= 1.000002) {
		tmp = (x - (x / t_1)) / (x + 1.0);
	} else if (t_2 <= 5e+254) {
		tmp = t_3;
	} else {
		tmp = 1.0 + (y / (t * (1.0 + x)));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t * z) - x)
	t_2 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_1)) / Float64(x + 1.0))
	t_3 = Float64(Float64(x + Float64(fma(z, y, Float64(-x)) / t_1)) / 1.0)
	tmp = 0.0
	if (t_2 <= -5000000000.0)
		tmp = Float64(Float64(y / Float64(1.0 + x)) * Float64(z / t_1));
	elseif (t_2 <= 1e-77)
		tmp = t_3;
	elseif (t_2 <= 1.000002)
		tmp = Float64(Float64(x - Float64(x / t_1)) / Float64(x + 1.0));
	elseif (t_2 <= 5e+254)
		tmp = t_3;
	else
		tmp = Float64(1.0 + Float64(y / Float64(t * Float64(1.0 + x))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -5e9

   1. Initial program 79.0%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -5e9 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 9.9999999999999993e-78 or 1.00000200000000006 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 97.1%

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

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-neg.f64 97.1

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

   5. Applied rewrites 97.1%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 97.1%

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

   if 9.9999999999999993e-78 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.00000200000000006

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 3: 90.3% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x)) (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0))))
   (if (<= t_2 -5000000000.0)
     (* (/ z (* (+ 1.0 x) t_1)) y)
     (if (<= t_2 0.99998)
       (/ (+ x (/ y t)) (+ x 1.0))
       (if (<= t_2 2.0)
         1.0
         (if (<= t_2 5e+254)
           (* y (/ z t_1))
           (+ 1.0 (/ y (* t (+ 1.0 x))))))))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double tmp;
	if (t_2 <= -5000000000.0) {
		tmp = (z / ((1.0 + x) * t_1)) * y;
	} else if (t_2 <= 0.99998) {
		tmp = (x + (y / t)) / (x + 1.0);
	} else if (t_2 <= 2.0) {
		tmp = 1.0;
	} else if (t_2 <= 5e+254) {
		tmp = y * (z / t_1);
	} else {
		tmp = 1.0 + (y / (t * (1.0 + x)));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (t * z) - x
	t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0)
	tmp = 0
	if t_2 <= -5000000000.0:
		tmp = (z / ((1.0 + x) * t_1)) * y
	elif t_2 <= 0.99998:
		tmp = (x + (y / t)) / (x + 1.0)
	elif t_2 <= 2.0:
		tmp = 1.0
	elif t_2 <= 5e+254:
		tmp = y * (z / t_1)
	else:
		tmp = 1.0 + (y / (t * (1.0 + x)))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t * z) - x)
	t_2 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_1)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_2 <= -5000000000.0)
		tmp = Float64(Float64(z / Float64(Float64(1.0 + x) * t_1)) * y);
	elseif (t_2 <= 0.99998)
		tmp = Float64(Float64(x + Float64(y / t)) / Float64(x + 1.0));
	elseif (t_2 <= 2.0)
		tmp = 1.0;
	elseif (t_2 <= 5e+254)
		tmp = Float64(y * Float64(z / t_1));
	else
		tmp = Float64(1.0 + Float64(y / Float64(t * Float64(1.0 + x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (t * z) - x;
	t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	tmp = 0.0;
	if (t_2 <= -5000000000.0)
		tmp = (z / ((1.0 + x) * t_1)) * y;
	elseif (t_2 <= 0.99998)
		tmp = (x + (y / t)) / (x + 1.0);
	elseif (t_2 <= 2.0)
		tmp = 1.0;
	elseif (t_2 <= 5e+254)
		tmp = y * (z / t_1);
	else
		tmp = 1.0 + (y / (t * (1.0 + x)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 5 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -5e9

   1. Initial program 79.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 91.8

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

   8. Applied rewrites 91.8%

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

   if -5e9 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99997999999999998

   1. Initial program 96.1%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 87.4

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

   5. Applied rewrites 87.4%

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

   if 0.99997999999999998 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.0%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.6%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 4: 87.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x))
        (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0)))
        (t_3 (/ z t_1)))
   (if (<= t_2 -5e-20)
     (* (/ y (+ 1.0 x)) t_3)
     (if (<= t_2 2.0)
       (/ (- x (/ x t_1)) (+ x 1.0))
       (if (<= t_2 5e+254) (* y t_3) (+ 1.0 (/ y (* t (+ 1.0 x)))))))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double t_3 = z / t_1;
	double tmp;
	if (t_2 <= -5e-20) {
		tmp = (y / (1.0 + x)) * t_3;
	} else if (t_2 <= 2.0) {
		tmp = (x - (x / t_1)) / (x + 1.0);
	} else if (t_2 <= 5e+254) {
		tmp = y * t_3;
	} else {
		tmp = 1.0 + (y / (t * (1.0 + x)));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (t * z) - x
	t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0)
	t_3 = z / t_1
	tmp = 0
	if t_2 <= -5e-20:
		tmp = (y / (1.0 + x)) * t_3
	elif t_2 <= 2.0:
		tmp = (x - (x / t_1)) / (x + 1.0)
	elif t_2 <= 5e+254:
		tmp = y * t_3
	else:
		tmp = 1.0 + (y / (t * (1.0 + x)))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t * z) - x)
	t_2 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_1)) / Float64(x + 1.0))
	t_3 = Float64(z / t_1)
	tmp = 0.0
	if (t_2 <= -5e-20)
		tmp = Float64(Float64(y / Float64(1.0 + x)) * t_3);
	elseif (t_2 <= 2.0)
		tmp = Float64(Float64(x - Float64(x / t_1)) / Float64(x + 1.0));
	elseif (t_2 <= 5e+254)
		tmp = Float64(y * t_3);
	else
		tmp = Float64(1.0 + Float64(y / Float64(t * Float64(1.0 + x))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (t * z) - x;
	t_2 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	t_3 = z / t_1;
	tmp = 0.0;
	if (t_2 <= -5e-20)
		tmp = (y / (1.0 + x)) * t_3;
	elseif (t_2 <= 2.0)
		tmp = (x - (x / t_1)) / (x + 1.0);
	elseif (t_2 <= 5e+254)
		tmp = y * t_3;
	else
		tmp = 1.0 + (y / (t * (1.0 + x)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20

   1. Initial program 80.2%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 98.9%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 95.8

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

   5. Applied rewrites 95.8%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.6%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 5: 86.9% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x)) (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0))))
   (if (<= t_2 -5e-20)
     (* (/ z (* (+ 1.0 x) t_1)) y)
     (if (<= t_2 2.0)
       (/ (- x (/ x t_1)) (+ x 1.0))
       (if (<= t_2 5e+254) (* y (/ z t_1)) (+ 1.0 (/ y (* t (+ 1.0 x)))))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20

   1. Initial program 80.2%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 98.5%

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

   6. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 92.2

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

   8. Applied rewrites 92.2%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 98.9%

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

   3. Taylor expanded in y around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 95.8

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

   5. Applied rewrites 95.8%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.6%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 6: 86.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x)) (t_2 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0))))
   (if (<= t_2 0.99998)
     (/ (+ x (/ y t)) (+ x 1.0))
     (if (<= t_2 2.0)
       1.0
       (if (<= t_2 5e+254) (* y (/ z t_1)) (+ 1.0 (/ y (* t (+ 1.0 x)))))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99997999999999998

   1. Initial program 89.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 81.7

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

   5. Applied rewrites 81.7%

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

   if 0.99997999999999998 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.0%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.6%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 7: 84.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ y (* t (+ 1.0 x))))
        (t_2 (- (* t z) x))
        (t_3 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_3 5e-26)
     (+ x t_1)
     (if (<= t_3 2.0) 1.0 (if (<= t_3 5e+254) (* y (/ z t_2)) (+ 1.0 t_1))))))

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = y / (t * (1.0 + x));
	double t_2 = (t * z) - x;
	double t_3 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_3 <= 5e-26) {
		tmp = x + t_1;
	} else if (t_3 <= 2.0) {
		tmp = 1.0;
	} else if (t_3 <= 5e+254) {
		tmp = y * (z / t_2);
	} else {
		tmp = 1.0 + t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = y / (t * (1.0 + x))
	t_2 = (t * z) - x
	t_3 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_3 <= 5e-26:
		tmp = x + t_1
	elif t_3 <= 2.0:
		tmp = 1.0
	elif t_3 <= 5e+254:
		tmp = y * (z / t_2)
	else:
		tmp = 1.0 + t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(y / Float64(t * Float64(1.0 + x)))
	t_2 = Float64(Float64(t * z) - x)
	t_3 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_3 <= 5e-26)
		tmp = Float64(x + t_1);
	elseif (t_3 <= 2.0)
		tmp = 1.0;
	elseif (t_3 <= 5e+254)
		tmp = Float64(y * Float64(z / t_2));
	else
		tmp = Float64(1.0 + t_1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = y / (t * (1.0 + x));
	t_2 = (t * z) - x;
	t_3 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_3 <= 5e-26)
		tmp = x + t_1;
	elseif (t_3 <= 2.0)
		tmp = 1.0;
	elseif (t_3 <= 5e+254)
		tmp = y * (z / t_2);
	else
		tmp = 1.0 + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 5.00000000000000019e-26

   1. Initial program 89.2%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 89.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 81.4

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

   7. Applied rewrites 81.4%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 80.2%

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

   if 5.00000000000000019e-26 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 98.5%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.99999999999999994e254

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 99.6

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

   5. Applied rewrites 99.6%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 99.6%

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

   if 4.99999999999999994e254 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 25.3%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 25.3%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 86.9

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

   7. Applied rewrites 86.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 86.9%

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

Alternative 8: 77.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ y (* t (+ 1.0 x))))
        (t_2 (/ (+ x (/ (- (* y z) x) (- (* t z) x))) (+ x 1.0))))
   (if (<= t_2 -5e-20)
     t_1
     (if (<= t_2 0.99998) (/ x (+ x 1.0)) (if (<= t_2 2.0) 1.0 (+ 1.0 t_1))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20

   1. Initial program 80.2%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 97.8

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

   5. Applied rewrites 97.8%

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

   6. Taylor expanded in z around inf

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-/.f64 74.5

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

   8. Applied rewrites 74.5%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99997999999999998

   1. Initial program 95.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.9%

      \[\leadsto \frac{\color{blue}{x}}{x + 1} \]

   if 0.99997999999999998 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.0%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 64.8%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 64.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 69.2

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

   7. Applied rewrites 69.2%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 68.3%

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

Alternative 9: 76.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ y (* t (+ 1.0 x))))
        (t_2 (/ (+ x (/ (- (* y z) x) (- (* t z) x))) (+ x 1.0))))
   (if (<= t_2 -5e-20)
     t_1
     (if (<= t_2 0.99998) (/ x (+ x 1.0)) (if (<= t_2 2.0) 1.0 t_1)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 71.3%

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

   3. Taylor expanded in y around inf

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

      1. times-frac N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 89.4

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

   5. Applied rewrites 89.4%

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

   6. Taylor expanded in z around inf

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-/.f64 65.5

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

   8. Applied rewrites 65.5%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99997999999999998

   1. Initial program 95.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.9%

      \[\leadsto \frac{\color{blue}{x}}{x + 1} \]

   if 0.99997999999999998 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.0%

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

Alternative 10: 74.2% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0d0)
    if (t_1 <= (-5d-20)) then
        tmp = y / t
    else if (t_1 <= 0.99998d0) then
        tmp = x / (x + 1.0d0)
    else if (t_1 <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = y / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	double tmp;
	if (t_1 <= -5e-20) {
		tmp = y / t;
	} else if (t_1 <= 0.99998) {
		tmp = x / (x + 1.0);
	} else if (t_1 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = y / t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 71.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 57.0

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

   5. Applied rewrites 57.0%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99997999999999998

   1. Initial program 95.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.9%

      \[\leadsto \frac{\color{blue}{x}}{x + 1} \]

   if 0.99997999999999998 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 99.0%

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

Alternative 11: 73.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0d0)
    if (t_1 <= (-5d-20)) then
        tmp = y / t
    else if (t_1 <= 5d-26) then
        tmp = x / 1.0d0
    else if (t_1 <= 2.0d0) then
        tmp = 1.0d0
    else
        tmp = y / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	double tmp;
	if (t_1 <= -5e-20) {
		tmp = y / t;
	} else if (t_1 <= 5e-26) {
		tmp = x / 1.0;
	} else if (t_1 <= 2.0) {
		tmp = 1.0;
	} else {
		tmp = y / t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < -4.9999999999999999e-20 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 71.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 57.0

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

   5. Applied rewrites 57.0%

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

   if -4.9999999999999999e-20 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 5.00000000000000019e-26

   1. Initial program 95.9%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 72.3%

      \[\leadsto \frac{\color{blue}{x}}{x + 1} \]

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 72.3%

      \[\leadsto \frac{x}{\color{blue}{1}} \]

   if 5.00000000000000019e-26 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 98.5%

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

Alternative 12: 82.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 5.00000000000000019e-26

   1. Initial program 89.2%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 89.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 81.4

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

   7. Applied rewrites 81.4%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 80.2%

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

   if 5.00000000000000019e-26 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 98.5%

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

   if 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 64.8%

      \[\frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 64.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift-+.f64 69.2

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

   7. Applied rewrites 69.2%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 68.3%

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

Alternative 13: 69.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 9.9999999999999993e-78 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 79.5%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 44.5

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

   5. Applied rewrites 44.5%

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

   if 9.9999999999999993e-78 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 95.8%

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

4. Final simplification 71.1%

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

Alternative 14: 53.5% accurate, 45.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 1.0)

C

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

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 = 1.0d0
end function

Java

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

Python

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

Julia

function code(x, y, z, t)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := 1.0

Derivation

1. Initial program 90.1%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 53.3%

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

Developer Target 1: 99.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025084 
(FPCore (x y z t)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, A"
  :precision binary64

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

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