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

Percentage Accurate: 88.9% → 96.2%

Time: 4.5s

Alternatives: 15

Speedup: 0.3×

Specification

Math

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

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.9% accurate, 1.0× speedup

Math

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

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: 96.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} t_1 := y \cdot z - x\\ t_2 := t \cdot z - x\\ t_3 := \frac{z}{t\_2 \cdot \left(x - -1\right)} \cdot y\\ t_4 := \frac{x + \frac{t\_1}{t\_2}}{x + 1}\\ \mathbf{if}\;t\_4 \leq -1000000000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_4 \leq 0.95:\\ \;\;\;\;\frac{x + \frac{t\_1}{\mathsf{fma}\left(z, t, -x\right)}}{1}\\ \mathbf{elif}\;t\_4 \leq 2:\\ \;\;\;\;\frac{x - \frac{x}{t\_2}}{x - -1}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;\frac{x + \frac{y}{t}}{x - -1}\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* y z) x))
        (t_2 (- (* t z) x))
        (t_3 (* (/ z (* t_2 (- x -1.0))) y))
        (t_4 (/ (+ x (/ t_1 t_2)) (+ x 1.0))))
   (if (<= t_4 -1000000000000.0)
     t_3
     (if (<= t_4 0.95)
       (/ (+ x (/ t_1 (fma z t (- x)))) 1.0)
       (if (<= t_4 2.0)
         (/ (- x (/ x t_2)) (- x -1.0))
         (if (<= t_4 INFINITY) t_3 (/ (+ x (/ y t)) (- x -1.0))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y * z) - x;
	double t_2 = (t * z) - x;
	double t_3 = (z / (t_2 * (x - -1.0))) * y;
	double t_4 = (x + (t_1 / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -1000000000000.0) {
		tmp = t_3;
	} else if (t_4 <= 0.95) {
		tmp = (x + (t_1 / fma(z, t, -x))) / 1.0;
	} else if (t_4 <= 2.0) {
		tmp = (x - (x / t_2)) / (x - -1.0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(y * z) - x)
	t_2 = Float64(Float64(t * z) - x)
	t_3 = Float64(Float64(z / Float64(t_2 * Float64(x - -1.0))) * y)
	t_4 = Float64(Float64(x + Float64(t_1 / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_4 <= -1000000000000.0)
		tmp = t_3;
	elseif (t_4 <= 0.95)
		tmp = Float64(Float64(x + Float64(t_1 / fma(z, t, Float64(-x)))) / 1.0);
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(x - Float64(x / t_2)) / Float64(x - -1.0));
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(N[(z / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(x + N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -1000000000000.0], t$95$3, If[LessEqual[t$95$4, 0.95], N[(N[(x + N[(t$95$1 / N[(z * t + (-x)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision], If[LessEqual[t$95$4, 2.0], N[(N[(x - N[(x / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$3, N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $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))) < -1e12 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

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

   1. Initial program 88.9%

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

      1. lift--.f64 N/A

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

      2. sub-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-neg.f64 88.9%

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

   3. Applied rewrites 88.9%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 45.7%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

Alternative 2: 96.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} t_1 := t \cdot z - x\\ t_2 := \frac{z}{t\_1 \cdot \left(x - -1\right)} \cdot y\\ t_3 := x + \frac{y \cdot z - x}{t\_1}\\ t_4 := \frac{t\_3}{x + 1}\\ \mathbf{if}\;t\_4 \leq -1000000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_4 \leq 0.95:\\ \;\;\;\;\frac{t\_3}{1}\\ \mathbf{elif}\;t\_4 \leq 2:\\ \;\;\;\;\frac{x - \frac{x}{t\_1}}{x - -1}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{x + \frac{y}{t}}{x - -1}\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x))
        (t_2 (* (/ z (* t_1 (- x -1.0))) y))
        (t_3 (+ x (/ (- (* y z) x) t_1)))
        (t_4 (/ t_3 (+ x 1.0))))
   (if (<= t_4 -1000000000000.0)
     t_2
     (if (<= t_4 0.95)
       (/ t_3 1.0)
       (if (<= t_4 2.0)
         (/ (- x (/ x t_1)) (- x -1.0))
         (if (<= t_4 INFINITY) t_2 (/ (+ x (/ y t)) (- x -1.0))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (z / (t_1 * (x - -1.0))) * y;
	double t_3 = x + (((y * z) - x) / t_1);
	double t_4 = t_3 / (x + 1.0);
	double tmp;
	if (t_4 <= -1000000000000.0) {
		tmp = t_2;
	} else if (t_4 <= 0.95) {
		tmp = t_3 / 1.0;
	} else if (t_4 <= 2.0) {
		tmp = (x - (x / t_1)) / (x - -1.0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (z / (t_1 * (x - -1.0))) * y;
	double t_3 = x + (((y * z) - x) / t_1);
	double t_4 = t_3 / (x + 1.0);
	double tmp;
	if (t_4 <= -1000000000000.0) {
		tmp = t_2;
	} else if (t_4 <= 0.95) {
		tmp = t_3 / 1.0;
	} else if (t_4 <= 2.0) {
		tmp = (x - (x / t_1)) / (x - -1.0);
	} else if (t_4 <= Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (t * z) - x
	t_2 = (z / (t_1 * (x - -1.0))) * y
	t_3 = x + (((y * z) - x) / t_1)
	t_4 = t_3 / (x + 1.0)
	tmp = 0
	if t_4 <= -1000000000000.0:
		tmp = t_2
	elif t_4 <= 0.95:
		tmp = t_3 / 1.0
	elif t_4 <= 2.0:
		tmp = (x - (x / t_1)) / (x - -1.0)
	elif t_4 <= math.inf:
		tmp = t_2
	else:
		tmp = (x + (y / t)) / (x - -1.0)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t * z) - x)
	t_2 = Float64(Float64(z / Float64(t_1 * Float64(x - -1.0))) * y)
	t_3 = Float64(x + Float64(Float64(Float64(y * z) - x) / t_1))
	t_4 = Float64(t_3 / Float64(x + 1.0))
	tmp = 0.0
	if (t_4 <= -1000000000000.0)
		tmp = t_2;
	elseif (t_4 <= 0.95)
		tmp = Float64(t_3 / 1.0);
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(x - Float64(x / t_1)) / Float64(x - -1.0));
	elseif (t_4 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (t * z) - x;
	t_2 = (z / (t_1 * (x - -1.0))) * y;
	t_3 = x + (((y * z) - x) / t_1);
	t_4 = t_3 / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -1000000000000.0)
		tmp = t_2;
	elseif (t_4 <= 0.95)
		tmp = t_3 / 1.0;
	elseif (t_4 <= 2.0)
		tmp = (x - (x / t_1)) / (x - -1.0);
	elseif (t_4 <= Inf)
		tmp = t_2;
	else
		tmp = (x + (y / t)) / (x - -1.0);
	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[(z / N[(t$95$1 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$3 = N[(x + N[(N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, -1000000000000.0], t$95$2, If[LessEqual[t$95$4, 0.95], N[(t$95$3 / 1.0), $MachinePrecision], If[LessEqual[t$95$4, 2.0], N[(N[(x - N[(x / t$95$1), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$2, N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $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))) < -1e12 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 45.7%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

Alternative 3: 96.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* y z) x))
        (t_2 (- (* t z) x))
        (t_3 (/ (+ x (/ t_1 t_2)) (+ x 1.0))))
   (if (<= t_3 (- INFINITY))
     (* (/ z (* t_2 (- x -1.0))) y)
     (if (<= t_3 2e+251)
       (/ (+ x (/ t_1 (fma z t (- x)))) (+ x 1.0))
       (-
        (+ (/ x (+ 1.0 x)) (/ y (* t (+ 1.0 x))))
        (/ x (* t (* z (+ 1.0 x)))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y * z) - x;
	double t_2 = (t * z) - x;
	double t_3 = (x + (t_1 / t_2)) / (x + 1.0);
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = (z / (t_2 * (x - -1.0))) * y;
	} else if (t_3 <= 2e+251) {
		tmp = (x + (t_1 / fma(z, t, -x))) / (x + 1.0);
	} else {
		tmp = ((x / (1.0 + x)) + (y / (t * (1.0 + x)))) - (x / (t * (z * (1.0 + x))));
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x + N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(z / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$3, 2e+251], N[(N[(x + N[(t$95$1 / N[(z * t + (-x)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] + N[(y / N[(t * N[(1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x / N[(t * N[(z * N[(1.0 + x), $MachinePrecision]), $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))) < -inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2.0000000000000001e251

   1. Initial program 88.9%

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

      1. lift--.f64 N/A

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

      2. sub-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-neg.f64 88.9%

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

   3. Applied rewrites 88.9%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower--.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-+.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 60.4%

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

   4. Applied rewrites 60.4%

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

Alternative 4: 95.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* y z) x))
        (t_2 (- (* t z) x))
        (t_3 (/ (+ x (/ t_1 t_2)) (+ x 1.0))))
   (if (<= t_3 (- INFINITY))
     (* (/ z (* t_2 (- x -1.0))) y)
     (if (<= t_3 2e+251)
       (/ (+ x (/ t_1 (fma z t (- x)))) (+ x 1.0))
       (/ (+ x (/ y t)) (- x -1.0))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y * z) - x;
	double t_2 = (t * z) - x;
	double t_3 = (x + (t_1 / t_2)) / (x + 1.0);
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = (z / (t_2 * (x - -1.0))) * y;
	} else if (t_3 <= 2e+251) {
		tmp = (x + (t_1 / fma(z, t, -x))) / (x + 1.0);
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	return tmp;
}

Julia

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x + N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(z / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$3, 2e+251], N[(N[(x + N[(t$95$1 / N[(z * t + (-x)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $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))) < -inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2.0000000000000001e251

   1. Initial program 88.9%

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

      1. lift--.f64 N/A

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

      2. sub-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-neg.f64 88.9%

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

   3. Applied rewrites 88.9%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

Alternative 5: 95.8% accurate, 0.3× speedup

Math

\[\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 -\infty:\\ \;\;\;\;\frac{z}{t\_1 \cdot \left(x - -1\right)} \cdot y\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+251}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{x + \frac{y}{t}}{x - -1}\\ \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 (- INFINITY))
     (* (/ z (* t_1 (- x -1.0))) y)
     (if (<= t_2 2e+251) t_2 (/ (+ x (/ y t)) (- x -1.0))))))

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 <= -((double) INFINITY)) {
		tmp = (z / (t_1 * (x - -1.0))) * y;
	} else if (t_2 <= 2e+251) {
		tmp = t_2;
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	return tmp;
}

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 <= -Double.POSITIVE_INFINITY) {
		tmp = (z / (t_1 * (x - -1.0))) * y;
	} else if (t_2 <= 2e+251) {
		tmp = t_2;
	} else {
		tmp = (x + (y / t)) / (x - -1.0);
	}
	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 <= -math.inf:
		tmp = (z / (t_1 * (x - -1.0))) * y
	elif t_2 <= 2e+251:
		tmp = t_2
	else:
		tmp = (x + (y / t)) / (x - -1.0)
	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 <= Float64(-Inf))
		tmp = Float64(Float64(z / Float64(t_1 * Float64(x - -1.0))) * y);
	elseif (t_2 <= 2e+251)
		tmp = t_2;
	else
		tmp = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0));
	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 <= -Inf)
		tmp = (z / (t_1 * (x - -1.0))) * y;
	elseif (t_2 <= 2e+251)
		tmp = t_2;
	else
		tmp = (x + (y / t)) / (x - -1.0);
	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, (-Infinity)], N[(N[(z / N[(t$95$1 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[t$95$2, 2e+251], t$95$2, N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $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))) < -inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

   if -inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 2.0000000000000001e251

   1. Initial program 88.9%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

Alternative 6: 93.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ y t)) (- x -1.0)))
        (t_2 (- (* t z) x))
        (t_3 (* (/ z (* t_2 (- x -1.0))) y))
        (t_4 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_4 -100000000.0)
     t_3
     (if (<= t_4 1e-223)
       t_1
       (if (<= t_4 2.0)
         (/ (- x (/ x t_2)) (- x -1.0))
         (if (<= t_4 INFINITY) t_3 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = (z / (t_2 * (x - -1.0))) * y;
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 1e-223) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (x - (x / t_2)) / (x - -1.0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = (z / (t_2 * (x - -1.0))) * y;
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 1e-223) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (x - (x / t_2)) / (x - -1.0);
	} else if (t_4 <= Double.POSITIVE_INFINITY) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + (y / t)) / (x - -1.0)
	t_2 = (t * z) - x
	t_3 = (z / (t_2 * (x - -1.0))) * y
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_4 <= -100000000.0:
		tmp = t_3
	elif t_4 <= 1e-223:
		tmp = t_1
	elif t_4 <= 2.0:
		tmp = (x - (x / t_2)) / (x - -1.0)
	elif t_4 <= math.inf:
		tmp = t_3
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0))
	t_2 = Float64(Float64(t * z) - x)
	t_3 = Float64(Float64(z / Float64(t_2 * Float64(x - -1.0))) * y)
	t_4 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 1e-223)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(x - Float64(x / t_2)) / Float64(x - -1.0));
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x + (y / t)) / (x - -1.0);
	t_2 = (t * z) - x;
	t_3 = (z / (t_2 * (x - -1.0))) * y;
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 1e-223)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = (x - (x / t_2)) / (x - -1.0);
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(N[(z / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = 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$4, -100000000.0], t$95$3, If[LessEqual[t$95$4, 1e-223], t$95$1, If[LessEqual[t$95$4, 2.0], N[(N[(x - N[(x / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$3, 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))) < -1e8 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

   if -1e8 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 9.9999999999999997e-224 or +inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

Alternative 7: 92.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x - -1}\\ t_2 := t \cdot z - x\\ t_3 := \frac{z}{t\_2 \cdot \left(x - -1\right)} \cdot y\\ t_4 := \frac{x + \frac{y \cdot z - x}{t\_2}}{x + 1}\\ \mathbf{if}\;t\_4 \leq -100000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_4 \leq 0.9999999999999948:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_4 \leq 2:\\ \;\;\;\;\frac{-1 \cdot \left(1 + x\right)}{-1 - x}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ y t)) (- x -1.0)))
        (t_2 (- (* t z) x))
        (t_3 (* (/ z (* t_2 (- x -1.0))) y))
        (t_4 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_4 -100000000.0)
     t_3
     (if (<= t_4 0.9999999999999948)
       t_1
       (if (<= t_4 2.0)
         (/ (* -1.0 (+ 1.0 x)) (- -1.0 x))
         (if (<= t_4 INFINITY) t_3 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = (z / (t_2 * (x - -1.0))) * y;
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 0.9999999999999948) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = (z / (t_2 * (x - -1.0))) * y;
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 0.9999999999999948) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_4 <= Double.POSITIVE_INFINITY) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + (y / t)) / (x - -1.0)
	t_2 = (t * z) - x
	t_3 = (z / (t_2 * (x - -1.0))) * y
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_4 <= -100000000.0:
		tmp = t_3
	elif t_4 <= 0.9999999999999948:
		tmp = t_1
	elif t_4 <= 2.0:
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x)
	elif t_4 <= math.inf:
		tmp = t_3
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0))
	t_2 = Float64(Float64(t * z) - x)
	t_3 = Float64(Float64(z / Float64(t_2 * Float64(x - -1.0))) * y)
	t_4 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 0.9999999999999948)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(-1.0 * Float64(1.0 + x)) / Float64(-1.0 - x));
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x + (y / t)) / (x - -1.0);
	t_2 = (t * z) - x;
	t_3 = (z / (t_2 * (x - -1.0))) * y;
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 0.9999999999999948)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(N[(z / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = 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$4, -100000000.0], t$95$3, If[LessEqual[t$95$4, 0.9999999999999948], t$95$1, If[LessEqual[t$95$4, 2.0], N[(N[(-1.0 * N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$3, 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))) < -1e8 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 31.9%

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. lower-*.f64 31.9%

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

      13. lift-+.f64 N/A

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

      14. add-flip N/A

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

      15. metadata-eval N/A

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

      16. lower--.f64 31.9%

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

   6. Applied rewrites 31.9%

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

   if -1e8 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99999999999999478 or +inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 78.0%

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

   4. Applied rewrites 78.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lower-/.f64 N/A

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

   6. Applied rewrites 78.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 53.4%

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

   9. Applied rewrites 53.4%

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

Alternative 8: 91.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x - -1}\\ t_2 := t \cdot z - x\\ t_3 := z \cdot \frac{y}{t\_2 \cdot \left(x - -1\right)}\\ t_4 := \frac{x + \frac{y \cdot z - x}{t\_2}}{x + 1}\\ \mathbf{if}\;t\_4 \leq -100000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_4 \leq 0.9999999999999948:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_4 \leq 2:\\ \;\;\;\;\frac{-1 \cdot \left(1 + x\right)}{-1 - x}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ y t)) (- x -1.0)))
        (t_2 (- (* t z) x))
        (t_3 (* z (/ y (* t_2 (- x -1.0)))))
        (t_4 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_4 -100000000.0)
     t_3
     (if (<= t_4 0.9999999999999948)
       t_1
       (if (<= t_4 2.0)
         (/ (* -1.0 (+ 1.0 x)) (- -1.0 x))
         (if (<= t_4 INFINITY) t_3 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = z * (y / (t_2 * (x - -1.0)));
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 0.9999999999999948) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (t * z) - x;
	double t_3 = z * (y / (t_2 * (x - -1.0)));
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -100000000.0) {
		tmp = t_3;
	} else if (t_4 <= 0.9999999999999948) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_4 <= Double.POSITIVE_INFINITY) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + (y / t)) / (x - -1.0)
	t_2 = (t * z) - x
	t_3 = z * (y / (t_2 * (x - -1.0)))
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_4 <= -100000000.0:
		tmp = t_3
	elif t_4 <= 0.9999999999999948:
		tmp = t_1
	elif t_4 <= 2.0:
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x)
	elif t_4 <= math.inf:
		tmp = t_3
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0))
	t_2 = Float64(Float64(t * z) - x)
	t_3 = Float64(z * Float64(y / Float64(t_2 * Float64(x - -1.0))))
	t_4 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 0.9999999999999948)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(-1.0 * Float64(1.0 + x)) / Float64(-1.0 - x));
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x + (y / t)) / (x - -1.0);
	t_2 = (t * z) - x;
	t_3 = z * (y / (t_2 * (x - -1.0)));
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -100000000.0)
		tmp = t_3;
	elseif (t_4 <= 0.9999999999999948)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	elseif (t_4 <= Inf)
		tmp = t_3;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(y / N[(t$95$2 * N[(x - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = 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$4, -100000000.0], t$95$3, If[LessEqual[t$95$4, 0.9999999999999948], t$95$1, If[LessEqual[t$95$4, 2.0], N[(N[(-1.0 * N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], t$95$3, 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))) < -1e8 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. lower-*.f64 N/A

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

      7. mult-flip-rev N/A

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

      8. lower-/.f64 29.0%

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-+.f64 N/A

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

      14. lower-*.f64 29.0%

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

      15. lift-+.f64 N/A

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

      16. add-flip N/A

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

      17. metadata-eval N/A

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

      18. lower--.f64 29.0%

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

   6. Applied rewrites 29.0%

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

   if -1e8 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 0.99999999999999478 or +inf.0 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 78.0%

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

   4. Applied rewrites 78.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lower-/.f64 N/A

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

   6. Applied rewrites 78.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 53.4%

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

   9. Applied rewrites 53.4%

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

Alternative 9: 86.3% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x - -1.0);
	double t_2 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	double tmp;
	if (t_2 <= 0.9999999999999948) {
		tmp = t_1;
	} else if (t_2 <= 1.000001) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x + Float64(y / t)) / Float64(x - -1.0))
	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 <= 0.9999999999999948)
		tmp = t_1;
	elseif (t_2 <= 1.000001)
		tmp = Float64(Float64(-1.0 * Float64(1.0 + x)) / Float64(-1.0 - x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / N[(x - -1.0), $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, 0.9999999999999948], t$95$1, If[LessEqual[t$95$2, 1.000001], N[(N[(-1.0 * N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

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))) < 0.99999999999999478 or 1.0000009999999999 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 88.9%

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

   2. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - \frac{x}{t \cdot z - x}}}{x + 1} \]
   3. 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. lower--.f64 N/A

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

      4. lower-*.f64 66.7%

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

   4. Applied rewrites 66.7%

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

      1. lift-+.f64 N/A

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

      2. add-flip N/A

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

      3. metadata-eval N/A

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

      4. lower--.f64 66.7%

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

   6. Applied rewrites 66.7%

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

   7. Taylor expanded in z around inf

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

      1. lower-+.f64 N/A

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

      2. lower-/.f64 70.4%

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

   9. Applied rewrites 70.4%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 78.0%

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

   4. Applied rewrites 78.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lower-/.f64 N/A

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

   6. Applied rewrites 78.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 53.4%

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

   9. Applied rewrites 53.4%

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

Alternative 10: 76.2% accurate, 0.2× speedup

Math

\[\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 -20000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{-35}:\\ \;\;\;\;x \cdot \left(1 + x \cdot \left(x - 1\right)\right)\\ \mathbf{elif}\;t\_2 \leq 2:\\ \;\;\;\;\frac{-1 \cdot \left(1 + x\right)}{-1 - x}\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x - -1}\\ \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 -20000.0)
     t_1
     (if (<= t_2 5e-35)
       (* x (+ 1.0 (* x (- x 1.0))))
       (if (<= t_2 2.0)
         (/ (* -1.0 (+ 1.0 x)) (- -1.0 x))
         (if (<= t_2 INFINITY) t_1 (/ x (- x -1.0))))))))

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 <= -20000.0) {
		tmp = t_1;
	} else if (t_2 <= 5e-35) {
		tmp = x * (1.0 + (x * (x - 1.0)));
	} else if (t_2 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = x / (x - -1.0);
	}
	return tmp;
}

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 <= -20000.0) {
		tmp = t_1;
	} else if (t_2 <= 5e-35) {
		tmp = x * (1.0 + (x * (x - 1.0)));
	} else if (t_2 <= 2.0) {
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	} else if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = x / (x - -1.0);
	}
	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 <= -20000.0:
		tmp = t_1
	elif t_2 <= 5e-35:
		tmp = x * (1.0 + (x * (x - 1.0)))
	elif t_2 <= 2.0:
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x)
	elif t_2 <= math.inf:
		tmp = t_1
	else:
		tmp = x / (x - -1.0)
	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 <= -20000.0)
		tmp = t_1;
	elseif (t_2 <= 5e-35)
		tmp = Float64(x * Float64(1.0 + Float64(x * Float64(x - 1.0))));
	elseif (t_2 <= 2.0)
		tmp = Float64(Float64(-1.0 * Float64(1.0 + x)) / Float64(-1.0 - x));
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(x / Float64(x - -1.0));
	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 <= -20000.0)
		tmp = t_1;
	elseif (t_2 <= 5e-35)
		tmp = x * (1.0 + (x * (x - 1.0)));
	elseif (t_2 <= 2.0)
		tmp = (-1.0 * (1.0 + x)) / (-1.0 - x);
	elseif (t_2 <= Inf)
		tmp = t_1;
	else
		tmp = x / (x - -1.0);
	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, -20000.0], t$95$1, If[LessEqual[t$95$2, 5e-35], N[(x * N[(1.0 + N[(x * N[(x - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2.0], N[(N[(-1.0 * N[(1.0 + x), $MachinePrecision]), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$1, N[(x / N[(x - -1.0), $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))) < -2e4 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < +inf.0

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 27.0%

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

   7. Applied rewrites 27.0%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 13.0%

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

   7. Applied rewrites 13.0%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 78.0%

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

   4. Applied rewrites 78.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lower-/.f64 N/A

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

   6. Applied rewrites 78.0%

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

   7. Taylor expanded in z around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 53.4%

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

   9. Applied rewrites 53.4%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{x}{x - -1} \]

      5. lower--.f64 56.1%

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

   6. Applied rewrites 56.1%

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

Alternative 11: 67.1% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.9000000000000003e-182 or 2e7 < x

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{x}{x - -1} \]

      5. lower--.f64 56.1%

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

   6. Applied rewrites 56.1%

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

   if -3.9000000000000003e-182 < x < 2e7

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 28.2%

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

   4. Applied rewrites 28.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 27.0%

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

   7. Applied rewrites 27.0%

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

Alternative 12: 66.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} t_1 := \frac{x}{x - -1}\\ \mathbf{if}\;x \leq -3.9 \cdot 10^{-182}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-21}:\\ \;\;\;\;\frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ x (- x -1.0))))
   (if (<= x -3.9e-182) t_1 (if (<= x 3.2e-21) (/ y t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x / (x - -1.0);
	double tmp;
	if (x <= -3.9e-182) {
		tmp = t_1;
	} else if (x <= 3.2e-21) {
		tmp = y / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x / (x - (-1.0d0))
    if (x <= (-3.9d-182)) then
        tmp = t_1
    else if (x <= 3.2d-21) then
        tmp = y / t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x / (x - -1.0);
	double tmp;
	if (x <= -3.9e-182) {
		tmp = t_1;
	} else if (x <= 3.2e-21) {
		tmp = y / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x / (x - -1.0)
	tmp = 0
	if x <= -3.9e-182:
		tmp = t_1
	elif x <= 3.2e-21:
		tmp = y / t
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x / (x - -1.0);
	tmp = 0.0;
	if (x <= -3.9e-182)
		tmp = t_1;
	elseif (x <= 3.2e-21)
		tmp = y / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.9000000000000003e-182 or 3.2000000000000002e-21 < x

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. add-flip N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{x}{x - -1} \]

      5. lower--.f64 56.1%

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

   6. Applied rewrites 56.1%

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

   if -3.9000000000000003e-182 < x < 3.2000000000000002e-21

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 25.1%

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

   4. Applied rewrites 25.1%

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

Alternative 13: 65.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} t_1 := 1 - \frac{1}{x}\\ \mathbf{if}\;x \leq -9.5 \cdot 10^{-35}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -3.9 \cdot 10^{-182}:\\ \;\;\;\;\frac{x}{1}\\ \mathbf{elif}\;x \leq 230000:\\ \;\;\;\;\frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- 1.0 (/ 1.0 x))))
   (if (<= x -9.5e-35)
     t_1
     (if (<= x -3.9e-182) (/ x 1.0) (if (<= x 230000.0) (/ y t) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = 1.0 - (1.0 / x);
	double tmp;
	if (x <= -9.5e-35) {
		tmp = t_1;
	} else if (x <= -3.9e-182) {
		tmp = x / 1.0;
	} else if (x <= 230000.0) {
		tmp = y / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 1.0d0 - (1.0d0 / x)
    if (x <= (-9.5d-35)) then
        tmp = t_1
    else if (x <= (-3.9d-182)) then
        tmp = x / 1.0d0
    else if (x <= 230000.0d0) then
        tmp = y / t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = 1.0 - (1.0 / x);
	double tmp;
	if (x <= -9.5e-35) {
		tmp = t_1;
	} else if (x <= -3.9e-182) {
		tmp = x / 1.0;
	} else if (x <= 230000.0) {
		tmp = y / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = 1.0 - (1.0 / x)
	tmp = 0
	if x <= -9.5e-35:
		tmp = t_1
	elif x <= -3.9e-182:
		tmp = x / 1.0
	elif x <= 230000.0:
		tmp = y / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(1.0 - Float64(1.0 / x))
	tmp = 0.0
	if (x <= -9.5e-35)
		tmp = t_1;
	elseif (x <= -3.9e-182)
		tmp = Float64(x / 1.0);
	elseif (x <= 230000.0)
		tmp = Float64(y / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = 1.0 - (1.0 / x);
	tmp = 0.0;
	if (x <= -9.5e-35)
		tmp = t_1;
	elseif (x <= -3.9e-182)
		tmp = x / 1.0;
	elseif (x <= 230000.0)
		tmp = y / t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -9.5e-35], t$95$1, If[LessEqual[x, -3.9e-182], N[(x / 1.0), $MachinePrecision], If[LessEqual[x, 230000.0], N[(y / t), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.5000000000000003e-35 or 2.3e5 < x

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around inf

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 45.6%

         \[\leadsto 1 - \frac{1}{x} \]

   7. Applied rewrites 45.6%

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

   if -9.5000000000000003e-35 < x < -3.9000000000000003e-182

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto \frac{x}{1} \]
   6. Step-by-step derivation

   7. Applied rewrites 13.1%

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

   if -3.9000000000000003e-182 < x < 2.3e5

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 25.1%

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

   4. Applied rewrites 25.1%

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

Alternative 14: 28.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} t_1 := \frac{x + \frac{y \cdot z - x}{t \cdot z - x}}{x + 1}\\ \mathbf{if}\;t\_1 \leq -20000:\\ \;\;\;\;\frac{y}{t}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-40}:\\ \;\;\;\;\frac{x}{1}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t}\\ \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 -20000.0) (/ y t) (if (<= t_1 5e-40) (/ x 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 <= -20000.0) {
		tmp = y / t;
	} else if (t_1 <= 5e-40) {
		tmp = x / 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 <= (-20000.0d0)) then
        tmp = y / t
    else if (t_1 <= 5d-40) then
        tmp = x / 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 <= -20000.0) {
		tmp = y / t;
	} else if (t_1 <= 5e-40) {
		tmp = x / 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 <= -20000.0:
		tmp = y / t
	elif t_1 <= 5e-40:
		tmp = x / 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 <= -20000.0)
		tmp = Float64(y / t);
	elseif (t_1 <= 5e-40)
		tmp = Float64(x / 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 <= -20000.0)
		tmp = y / t;
	elseif (t_1 <= 5e-40)
		tmp = x / 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, -20000.0], N[(y / t), $MachinePrecision], If[LessEqual[t$95$1, 5e-40], N[(x / 1.0), $MachinePrecision], N[(y / t), $MachinePrecision]]]]

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))) < -2e4 or 4.9999999999999996e-40 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 88.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 25.1%

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

   4. Applied rewrites 25.1%

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

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

   1. Initial program 88.9%

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

   2. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 56.1%

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

   4. Applied rewrites 56.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto \frac{x}{1} \]
   6. Step-by-step derivation

   7. Applied rewrites 13.1%

      \[\leadsto \frac{x}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 13.1% accurate, 5.6× speedup

Math

\[\frac{x}{1} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(x / 1.0), $MachinePrecision]

Derivation

1. Initial program 88.9%

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

2. Taylor expanded in t around inf

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 56.1%

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

4. Applied rewrites 56.1%

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

5. Taylor expanded in x around 0

   \[\leadsto \frac{x}{1} \]
6. Step-by-step derivation

7. Applied rewrites 13.1%

   \[\leadsto \frac{x}{1} \]
8. Add Preprocessing

Reproduce

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