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

Percentage Accurate: 89.6% → 96.5%

Time: 18.1s

Alternatives: 18

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 89.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 89.6%

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

3. Applied rewrites 96.5%

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

Alternative 2: 96.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x + 1}\\ \mathbf{if}\;z \leq -3.65 \cdot 10^{+87}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{+29}:\\ \;\;\;\;\frac{x + \frac{\mathsf{fma}\left(z, y, -x\right)}{t \cdot z - x}}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ y t)) (+ x 1.0))))
   (if (<= z -3.65e+87)
     t_1
     (if (<= z 2.25e+29)
       (/ (+ x (/ (fma z y (- x)) (- (* t z) x))) (+ x 1.0))
       t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x + 1.0);
	double tmp;
	if (z <= -3.65e+87) {
		tmp = t_1;
	} else if (z <= 2.25e+29) {
		tmp = (x + (fma(z, y, -x) / ((t * z) - x))) / (x + 1.0);
	} 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))
	tmp = 0.0
	if (z <= -3.65e+87)
		tmp = t_1;
	elseif (z <= 2.25e+29)
		tmp = Float64(Float64(x + Float64(fma(z, y, Float64(-x)) / Float64(Float64(t * z) - x))) / Float64(x + 1.0));
	else
		tmp = t_1;
	end
	return 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]}, If[LessEqual[z, -3.65e+87], t$95$1, If[LessEqual[z, 2.25e+29], N[(N[(x + N[(N[(z * y + (-x)), $MachinePrecision] / N[(N[(t * z), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.64999999999999998e87 or 2.2500000000000001e29 < z

   1. Initial program 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

   if -3.64999999999999998e87 < z < 2.2500000000000001e29

   1. Initial program 89.6%

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

   3. Applied rewrites 89.6%

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

Alternative 3: 96.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x (/ y t)) (+ x 1.0))))
   (if (<= z -3.65e+87)
     t_1
     (if (<= z 2.25e+29)
       (/ (+ x (/ (- (* y z) x) (- (* t z) x))) (+ x 1.0))
       t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x + 1.0);
	double tmp;
	if (z <= -3.65e+87) {
		tmp = t_1;
	} else if (z <= 2.25e+29) {
		tmp = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x + 1.0);
	double tmp;
	if (z <= -3.65e+87) {
		tmp = t_1;
	} else if (z <= 2.25e+29) {
		tmp = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x + (y / t)) / (x + 1.0)
	tmp = 0
	if z <= -3.65e+87:
		tmp = t_1
	elif z <= 2.25e+29:
		tmp = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0)
	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))
	tmp = 0.0
	if (z <= -3.65e+87)
		tmp = t_1;
	elseif (z <= 2.25e+29)
		tmp = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / Float64(Float64(t * z) - x))) / Float64(x + 1.0));
	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);
	tmp = 0.0;
	if (z <= -3.65e+87)
		tmp = t_1;
	elseif (z <= 2.25e+29)
		tmp = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	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]}, If[LessEqual[z, -3.65e+87], t$95$1, If[LessEqual[z, 2.25e+29], 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], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.64999999999999998e87 or 2.2500000000000001e29 < z

   1. Initial program 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

   if -3.64999999999999998e87 < z < 2.2500000000000001e29

   1. Initial program 89.6%

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

Alternative 4: 94.0% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x))
        (t_2 (* (/ z t_1) (/ y (+ x 1.0))))
        (t_3 (/ (+ x (/ (- (* y z) x) t_1)) (+ x 1.0))))
   (if (<= t_3 -5e+63)
     t_2
     (if (<= t_3 1e-24)
       (/ (+ x (/ (fma z y (- x)) t_1)) 1.0)
       (if (<= t_3 2.0)
         (/ (- x (/ x t_1)) (+ x 1.0))
         (if (<= t_3 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) * (y / (x + 1.0));
	double t_3 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double tmp;
	if (t_3 <= -5e+63) {
		tmp = t_2;
	} else if (t_3 <= 1e-24) {
		tmp = (x + (fma(z, y, -x) / t_1)) / 1.0;
	} else if (t_3 <= 2.0) {
		tmp = (x - (x / t_1)) / (x + 1.0);
	} else if (t_3 <= ((double) INFINITY)) {
		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 / t_1) * Float64(y / Float64(x + 1.0)))
	t_3 = Float64(Float64(x + Float64(Float64(Float64(y * z) - x) / t_1)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_3 <= -5e+63)
		tmp = t_2;
	elseif (t_3 <= 1e-24)
		tmp = Float64(Float64(x + Float64(fma(z, y, Float64(-x)) / t_1)) / 1.0);
	elseif (t_3 <= 2.0)
		tmp = Float64(Float64(x - Float64(x / t_1)) / Float64(x + 1.0));
	elseif (t_3 <= Inf)
		tmp = t_2;
	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[(t * z), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z / t$95$1), $MachinePrecision] * N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = 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$3, -5e+63], t$95$2, If[LessEqual[t$95$3, 1e-24], N[(N[(x + N[(N[(z * y + (-x)), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision], If[LessEqual[t$95$3, 2.0], N[(N[(x - N[(x / t$95$1), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 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))) < -5.00000000000000011e63 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 33.0%

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

   if -5.00000000000000011e63 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 9.99999999999999924e-25

   1. Initial program 89.6%

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

   3. Applied rewrites 89.6%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 46.2%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

      \[\leadsto \frac{\color{blue}{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 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

Alternative 5: 94.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot z - x\\ t_2 := \frac{z}{t\_1} \cdot \frac{y}{x + 1}\\ t_3 := x + \frac{y \cdot z - x}{t\_1}\\ t_4 := \frac{t\_3}{x + 1}\\ \mathbf{if}\;t\_4 \leq -5 \cdot 10^{+63}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_4 \leq 10^{-24}:\\ \;\;\;\;\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} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (* t z) x))
        (t_2 (* (/ z t_1) (/ y (+ x 1.0))))
        (t_3 (+ x (/ (- (* y z) x) t_1)))
        (t_4 (/ t_3 (+ x 1.0))))
   (if (<= t_4 -5e+63)
     t_2
     (if (<= t_4 1e-24)
       (/ 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) * (y / (x + 1.0));
	double t_3 = x + (((y * z) - x) / t_1);
	double t_4 = t_3 / (x + 1.0);
	double tmp;
	if (t_4 <= -5e+63) {
		tmp = t_2;
	} else if (t_4 <= 1e-24) {
		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) * (y / (x + 1.0));
	double t_3 = x + (((y * z) - x) / t_1);
	double t_4 = t_3 / (x + 1.0);
	double tmp;
	if (t_4 <= -5e+63) {
		tmp = t_2;
	} else if (t_4 <= 1e-24) {
		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) * (y / (x + 1.0))
	t_3 = x + (((y * z) - x) / t_1)
	t_4 = t_3 / (x + 1.0)
	tmp = 0
	if t_4 <= -5e+63:
		tmp = t_2
	elif t_4 <= 1e-24:
		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 / t_1) * Float64(y / Float64(x + 1.0)))
	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 <= -5e+63)
		tmp = t_2;
	elseif (t_4 <= 1e-24)
		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) * (y / (x + 1.0));
	t_3 = x + (((y * z) - x) / t_1);
	t_4 = t_3 / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -5e+63)
		tmp = t_2;
	elseif (t_4 <= 1e-24)
		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 / t$95$1), $MachinePrecision] * N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]), $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, -5e+63], t$95$2, If[LessEqual[t$95$4, 1e-24], 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))) < -5.00000000000000011e63 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 33.0%

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

   if -5.00000000000000011e63 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 9.99999999999999924e-25

   1. Initial program 89.6%

      \[\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}} \]

   4. Applied rewrites 46.2%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

      \[\leadsto \frac{\color{blue}{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 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

Alternative 6: 93.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x + 1}\\ t_2 := t \cdot z - x\\ t_3 := \frac{x + \frac{y \cdot z - x}{t\_2}}{x + 1}\\ t_4 := \frac{z}{\left(x + 1\right) \cdot t\_2} \cdot y\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_3 \leq -10000000000:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_3 \leq 2:\\ \;\;\;\;\frac{x - -1}{x + 1}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \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 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0)))
        (t_4 (* (/ z (* (+ x 1.0) t_2)) y)))
   (if (<= t_3 (- INFINITY))
     t_1
     (if (<= t_3 -10000000000.0)
       t_4
       (if (<= t_3 2e-7)
         t_1
         (if (<= t_3 2.0)
           (/ (- x -1.0) (+ x 1.0))
           (if (<= t_3 INFINITY) t_4 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double t_4 = (z / ((x + 1.0) * t_2)) * y;
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_3 <= -10000000000.0) {
		tmp = t_4;
	} else if (t_3 <= 2e-7) {
		tmp = t_1;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double t_4 = (z / ((x + 1.0) * t_2)) * y;
	double tmp;
	if (t_3 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_3 <= -10000000000.0) {
		tmp = t_4;
	} else if (t_3 <= 2e-7) {
		tmp = t_1;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_4;
	} 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	t_4 = (z / ((x + 1.0) * t_2)) * y
	tmp = 0
	if t_3 <= -math.inf:
		tmp = t_1
	elif t_3 <= -10000000000.0:
		tmp = t_4
	elif t_3 <= 2e-7:
		tmp = t_1
	elif t_3 <= 2.0:
		tmp = (x - -1.0) / (x + 1.0)
	elif t_3 <= math.inf:
		tmp = t_4
	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(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	t_4 = Float64(Float64(z / Float64(Float64(x + 1.0) * t_2)) * y)
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_3 <= -10000000000.0)
		tmp = t_4;
	elseif (t_3 <= 2e-7)
		tmp = t_1;
	elseif (t_3 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / Float64(x + 1.0));
	elseif (t_3 <= Inf)
		tmp = t_4;
	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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	t_4 = (z / ((x + 1.0) * t_2)) * y;
	tmp = 0.0;
	if (t_3 <= -Inf)
		tmp = t_1;
	elseif (t_3 <= -10000000000.0)
		tmp = t_4;
	elseif (t_3 <= 2e-7)
		tmp = t_1;
	elseif (t_3 <= 2.0)
		tmp = (x - -1.0) / (x + 1.0);
	elseif (t_3 <= Inf)
		tmp = t_4;
	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[(x + N[(N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(z / N[(N[(x + 1.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$1, If[LessEqual[t$95$3, -10000000000.0], t$95$4, If[LessEqual[t$95$3, 2e-7], t$95$1, If[LessEqual[t$95$3, 2.0], N[(N[(x - -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, 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))) < -inf.0 or -1e10 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.9999999999999999e-7 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 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

      \[\leadsto \frac{\color{blue}{x + \frac{y}{t}}}{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))) < -1e10 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 32.2%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

Alternative 7: 93.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \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 \frac{y}{x + 1}\\ t_4 := \frac{x + \frac{y \cdot z - x}{t\_2}}{x + 1}\\ \mathbf{if}\;t\_4 \leq -10000000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_4 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_4 \leq 2:\\ \;\;\;\;\frac{x - -1}{x + 1}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \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) (/ y (+ x 1.0))))
        (t_4 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_4 -10000000000.0)
     t_3
     (if (<= t_4 2e-7)
       t_1
       (if (<= t_4 2.0)
         (/ (- x -1.0) (+ 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) * (y / (x + 1.0));
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -10000000000.0) {
		tmp = t_3;
	} else if (t_4 <= 2e-7) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (x - -1.0) / (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) * (y / (x + 1.0));
	double t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_4 <= -10000000000.0) {
		tmp = t_3;
	} else if (t_4 <= 2e-7) {
		tmp = t_1;
	} else if (t_4 <= 2.0) {
		tmp = (x - -1.0) / (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) * (y / (x + 1.0))
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_4 <= -10000000000.0:
		tmp = t_3
	elif t_4 <= 2e-7:
		tmp = t_1
	elif t_4 <= 2.0:
		tmp = (x - -1.0) / (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 / t_2) * Float64(y / 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 <= -10000000000.0)
		tmp = t_3;
	elseif (t_4 <= 2e-7)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / 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) * (y / (x + 1.0));
	t_4 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_4 <= -10000000000.0)
		tmp = t_3;
	elseif (t_4 <= 2e-7)
		tmp = t_1;
	elseif (t_4 <= 2.0)
		tmp = (x - -1.0) / (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 / t$95$2), $MachinePrecision] * N[(y / N[(x + 1.0), $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, -10000000000.0], t$95$3, If[LessEqual[t$95$4, 2e-7], t$95$1, If[LessEqual[t$95$4, 2.0], N[(N[(x - -1.0), $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))) < -1e10 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 33.0%

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

   if -1e10 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.9999999999999999e-7 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 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

Alternative 8: 93.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot z - x\\ \frac{\mathsf{fma}\left(\frac{y}{t\_1}, z, x\right) - \frac{x}{t\_1}}{x + 1} \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 89.6%

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

3. Applied rewrites 93.2%

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

Alternative 9: 88.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x + 1}\\ t_2 := t \cdot z - x\\ t_3 := \frac{x + \frac{y \cdot z - x}{t\_2}}{x + 1}\\ \mathbf{if}\;t\_3 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_3 \leq 2:\\ \;\;\;\;\frac{x - -1}{x + 1}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\frac{y}{\left(x + 1\right) \cdot t\_2} \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \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 (/ (+ x (/ (- (* y z) x) t_2)) (+ x 1.0))))
   (if (<= t_3 2e-7)
     t_1
     (if (<= t_3 2.0)
       (/ (- x -1.0) (+ x 1.0))
       (if (<= t_3 INFINITY) (* (/ y (* (+ x 1.0) t_2)) z) 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_3 <= 2e-7) {
		tmp = t_1;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = (y / ((x + 1.0) * t_2)) * z;
	} 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	double tmp;
	if (t_3 <= 2e-7) {
		tmp = t_1;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = (y / ((x + 1.0) * t_2)) * z;
	} 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 = (x + (((y * z) - x) / t_2)) / (x + 1.0)
	tmp = 0
	if t_3 <= 2e-7:
		tmp = t_1
	elif t_3 <= 2.0:
		tmp = (x - -1.0) / (x + 1.0)
	elif t_3 <= math.inf:
		tmp = (y / ((x + 1.0) * t_2)) * z
	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(x + Float64(Float64(Float64(y * z) - x) / t_2)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_3 <= 2e-7)
		tmp = t_1;
	elseif (t_3 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / Float64(x + 1.0));
	elseif (t_3 <= Inf)
		tmp = Float64(Float64(y / Float64(Float64(x + 1.0) * t_2)) * z);
	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 = (x + (((y * z) - x) / t_2)) / (x + 1.0);
	tmp = 0.0;
	if (t_3 <= 2e-7)
		tmp = t_1;
	elseif (t_3 <= 2.0)
		tmp = (x - -1.0) / (x + 1.0);
	elseif (t_3 <= Inf)
		tmp = (y / ((x + 1.0) * t_2)) * z;
	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[(x + N[(N[(N[(y * z), $MachinePrecision] - x), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 2e-7], t$95$1, If[LessEqual[t$95$3, 2.0], N[(N[(x - -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(y / N[(N[(x + 1.0), $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], 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))) < 1.9999999999999999e-7 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 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

   if 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 29.0%

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

Alternative 10: 86.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \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 2 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2:\\ \;\;\;\;\frac{x - -1}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \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 2e-7) t_1 (if (<= t_2 2.0) (/ (- x -1.0) (+ x 1.0)) 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 <= 2e-7) {
		tmp = t_1;
	} else if (t_2 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x + (y / t)) / (x + 1.0);
	double t_2 = (x + (((y * z) - x) / ((t * z) - x))) / (x + 1.0);
	double tmp;
	if (t_2 <= 2e-7) {
		tmp = t_1;
	} else if (t_2 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} 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 <= 2e-7:
		tmp = t_1
	elif t_2 <= 2.0:
		tmp = (x - -1.0) / (x + 1.0)
	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 <= 2e-7)
		tmp = t_1;
	elseif (t_2 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / Float64(x + 1.0));
	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 <= 2e-7)
		tmp = t_1;
	elseif (t_2 <= 2.0)
		tmp = (x - -1.0) / (x + 1.0);
	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, 2e-7], t$95$1, If[LessEqual[t$95$2, 2.0], N[(N[(x - -1.0), $MachinePrecision] / N[(x + 1.0), $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))) < 1.9999999999999999e-7 or 2 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64)))

   1. Initial program 89.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 69.9%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

Alternative 11: 85.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot z - x\\ t_2 := \frac{z}{t\_1} \cdot y\\ t_3 := \frac{x + \frac{y \cdot z - x}{t\_1}}{x + 1}\\ \mathbf{if}\;t\_3 \leq -10000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{-7}:\\ \;\;\;\;\frac{x + \frac{y}{t}}{1}\\ \mathbf{elif}\;t\_3 \leq 2:\\ \;\;\;\;\frac{x - -1}{x + 1}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + x}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (t * z) - x;
	double t_2 = (z / t_1) * y;
	double t_3 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double tmp;
	if (t_3 <= -10000000000.0) {
		tmp = t_2;
	} else if (t_3 <= 2e-7) {
		tmp = (x + (y / t)) / 1.0;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = x / (1.0 + x);
	}
	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) * y;
	double t_3 = (x + (((y * z) - x) / t_1)) / (x + 1.0);
	double tmp;
	if (t_3 <= -10000000000.0) {
		tmp = t_2;
	} else if (t_3 <= 2e-7) {
		tmp = (x + (y / t)) / 1.0;
	} else if (t_3 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else {
		tmp = x / (1.0 + x);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

      \[\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)}} \]

   4. Applied rewrites 28.8%

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

   6. Applied rewrites 33.0%

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

   7. Taylor expanded in x around 0

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

   9. Applied rewrites 28.3%

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

   if -1e10 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.9999999999999999e-7

   1. Initial program 89.6%

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

   3. Applied rewrites 96.5%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 69.9%

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

   7. Taylor expanded in x around 0

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

   9. Applied rewrites 34.2%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

      \[\leadsto \frac{x - -1}{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 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

Alternative 12: 81.8% accurate, 0.3× speedup

Math

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

FPCore

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

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 <= 2e-7) {
		tmp = (x + (y / t)) / 1.0;
	} else if (t_1 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = y / fma(t, x, t);
	} else {
		tmp = x / (1.0 + x);
	}
	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 <= 2e-7)
		tmp = Float64(Float64(x + Float64(y / t)) / 1.0);
	elseif (t_1 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / Float64(x + 1.0));
	elseif (t_1 <= Inf)
		tmp = Float64(y / fma(t, x, t));
	else
		tmp = Float64(x / Float64(1.0 + x));
	end
	return 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, 2e-7], N[(N[(x + N[(y / t), $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(N[(x - -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(y / N[(t * x + t), $MachinePrecision]), $MachinePrecision], N[(x / N[(1.0 + x), $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))) < 1.9999999999999999e-7

   1. Initial program 89.6%

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

   3. Applied rewrites 96.5%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 69.9%

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

   7. Taylor expanded in x around 0

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

   9. Applied rewrites 34.2%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

   if 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

      \[\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)}} \]

   7. Applied rewrites 27.0%

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

   9. Applied rewrites 27.0%

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

   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 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

Alternative 13: 76.6% accurate, 0.2× speedup

Math

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

FPCore

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

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 t_2 = x / (1.0 + x);
	double tmp;
	if (t_1 <= -2e-33) {
		tmp = (y / t) / (x + 1.0);
	} else if (t_1 <= 2e-7) {
		tmp = t_2;
	} else if (t_1 <= 2.0) {
		tmp = (x - -1.0) / (x + 1.0);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = y / fma(t, x, t);
	} else {
		tmp = t_2;
	}
	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))
	t_2 = Float64(x / Float64(1.0 + x))
	tmp = 0.0
	if (t_1 <= -2e-33)
		tmp = Float64(Float64(y / t) / Float64(x + 1.0));
	elseif (t_1 <= 2e-7)
		tmp = t_2;
	elseif (t_1 <= 2.0)
		tmp = Float64(Float64(x - -1.0) / Float64(x + 1.0));
	elseif (t_1 <= Inf)
		tmp = Float64(y / fma(t, x, t));
	else
		tmp = t_2;
	end
	return 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]}, Block[{t$95$2 = N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-33], N[(N[(y / t), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-7], t$95$2, If[LessEqual[t$95$1, 2.0], N[(N[(x - -1.0), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(y / N[(t * x + t), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]

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))) < -2.0000000000000001e-33

   1. Initial program 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

      \[\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)}} \]

   7. Applied rewrites 27.0%

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

   9. Applied rewrites 26.8%

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

   if -2.0000000000000001e-33 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.9999999999999999e-7 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 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

   if 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

      \[\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)}} \]

   7. Applied rewrites 27.0%

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

   9. Applied rewrites 27.0%

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

Alternative 14: 76.5% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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))) < -2.0000000000000001e-33 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 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

      \[\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)}} \]

   7. Applied rewrites 27.0%

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

   9. Applied rewrites 27.0%

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

   if -2.0000000000000001e-33 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 1.9999999999999999e-7 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 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

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

   1. Initial program 89.6%

      \[\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} \]

   4. Applied rewrites 66.4%

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

   5. Taylor expanded in x around inf

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

   7. Applied rewrites 53.5%

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

Alternative 15: 67.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+16}:\\ \;\;\;\;1 - \frac{1}{x}\\ \mathbf{elif}\;x \leq 7.5 \cdot 10^{-70}:\\ \;\;\;\;\frac{y}{\mathsf{fma}\left(t, x, t\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 + x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -1.2e+16)
   (- 1.0 (/ 1.0 x))
   (if (<= x 7.5e-70) (/ y (fma t x t)) (/ x (+ 1.0 x)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -1.2e+16) {
		tmp = 1.0 - (1.0 / x);
	} else if (x <= 7.5e-70) {
		tmp = y / fma(t, x, t);
	} else {
		tmp = x / (1.0 + x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -1.2e+16)
		tmp = Float64(1.0 - Float64(1.0 / x));
	elseif (x <= 7.5e-70)
		tmp = Float64(y / fma(t, x, t));
	else
		tmp = Float64(x / Float64(1.0 + x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -1.2e+16], N[(1.0 - N[(1.0 / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7.5e-70], N[(y / N[(t * x + t), $MachinePrecision]), $MachinePrecision], N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.2e16

   1. Initial program 89.6%

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

   3. Applied rewrites 96.5%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 55.3%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 45.2%

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

   if -1.2e16 < x < 7.49999999999999973e-70

   1. Initial program 89.6%

      \[\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)}} \]

   4. Applied rewrites 28.8%

      \[\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)}} \]

   7. Applied rewrites 27.0%

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

   9. Applied rewrites 27.0%

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

   if 7.49999999999999973e-70 < x

   1. Initial program 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

Alternative 16: 67.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 + x}\\ \mathbf{if}\;x \leq -9.8 \cdot 10^{-83}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 7.5 \cdot 10^{-70}:\\ \;\;\;\;\frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ x (+ 1.0 x))))
   (if (<= x -9.8e-83) t_1 (if (<= x 7.5e-70) (/ y t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x / (1.0 + x);
	double tmp;
	if (x <= -9.8e-83) {
		tmp = t_1;
	} else if (x <= 7.5e-70) {
		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 / (1.0d0 + x)
    if (x <= (-9.8d-83)) then
        tmp = t_1
    else if (x <= 7.5d-70) 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 / (1.0 + x);
	double tmp;
	if (x <= -9.8e-83) {
		tmp = t_1;
	} else if (x <= 7.5e-70) {
		tmp = y / t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x / (1.0 + x)
	tmp = 0
	if x <= -9.8e-83:
		tmp = t_1
	elif x <= 7.5e-70:
		tmp = y / t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x / Float64(1.0 + x))
	tmp = 0.0
	if (x <= -9.8e-83)
		tmp = t_1;
	elseif (x <= 7.5e-70)
		tmp = Float64(y / t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x / (1.0 + x);
	tmp = 0.0;
	if (x <= -9.8e-83)
		tmp = t_1;
	elseif (x <= 7.5e-70)
		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[(1.0 + x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -9.8e-83], t$95$1, If[LessEqual[x, 7.5e-70], N[(y / t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -9.8e-83 or 7.49999999999999973e-70 < x

   1. Initial program 89.6%

      \[\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}} \]

   4. Applied rewrites 55.3%

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

   if -9.8e-83 < x < 7.49999999999999973e-70

   1. Initial program 89.6%

      \[\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}} \]

   4. Applied rewrites 24.9%

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

Alternative 17: 66.8% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- 1.0 (/ 1.0 x))))
   (if (<= x -5.8e-13) t_1 (if (<= x 1.05) (/ 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 <= -5.8e-13) {
		tmp = t_1;
	} else if (x <= 1.05) {
		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 <= (-5.8d-13)) then
        tmp = t_1
    else if (x <= 1.05d0) 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 <= -5.8e-13) {
		tmp = t_1;
	} else if (x <= 1.05) {
		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 <= -5.8e-13:
		tmp = t_1
	elif x <= 1.05:
		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 <= -5.8e-13)
		tmp = t_1;
	elseif (x <= 1.05)
		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 <= -5.8e-13)
		tmp = t_1;
	elseif (x <= 1.05)
		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, -5.8e-13], t$95$1, If[LessEqual[x, 1.05], N[(y / t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.7999999999999995e-13 or 1.05000000000000004 < x

   1. Initial program 89.6%

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

   3. Applied rewrites 96.5%

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

   4. Taylor expanded in t around inf

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

   6. Applied rewrites 55.3%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 45.2%

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

   if -5.7999999999999995e-13 < x < 1.05000000000000004

   1. Initial program 89.6%

      \[\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}} \]

   4. Applied rewrites 24.9%

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

Alternative 18: 24.9% accurate, 5.6× speedup

Math

\[\begin{array}{l} \\ \frac{y}{t} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = y / t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.6%

   \[\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}} \]

4. Applied rewrites 24.9%

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

Reproduce

herbie shell --seed 2025153 
(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)))