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

Percentage Accurate: 89.2% → 96.7%

Time: 11.1s

Alternatives: 9

Speedup: 0.3×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    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.2% 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

real(8) function code(x, y, z, t)
    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.7% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    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 = (z * t) - x
    t_2 = (x - ((x - (y * z)) / t_1)) / (x + 1.0d0)
    if (t_2 <= (-5d+156)) then
        tmp = y * ((z / (x + 1.0d0)) / t_1)
    else if (t_2 <= 4d+277) then
        tmp = t_2
    else
        tmp = (x / (x + 1.0d0)) + (((y / (x + 1.0d0)) + ((x / z) / ((-1.0d0) - x))) / t)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * t), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x - N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+156], N[(y * N[(N[(z / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 4e+277], t$95$2, N[(N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(y / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x / z), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t), $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))) < -4.99999999999999992e156

   1. Initial program 57.8%

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

      1. *-commutative 57.8%

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

   3. Simplified 57.8%

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

   5. Taylor expanded in y around inf 57.1%

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

      1. associate-/l* 80.4%

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

      2. associate-/r* 95.9%

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

      3. +-commutative 95.9%

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

   7. Simplified 95.9%

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

   if -4.99999999999999992e156 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.00000000000000001e277

   1. Initial program 99.3%

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

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

   1. Initial program 27.6%

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

      1. *-commutative 27.6%

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

   3. Simplified 27.6%

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

   5. Taylor expanded in t around -inf 96.8%

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

      1. +-commutative 96.8%

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

      2. mul-1-neg 96.8%

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

      3. unsub-neg 96.8%

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

      4. +-commutative 96.8%

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

   7. Simplified 96.8%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1} \leq -5 \cdot 10^{+156}:\\ \;\;\;\;y \cdot \frac{\frac{z}{x + 1}}{z \cdot t - x}\\ \mathbf{elif}\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1} \leq 4 \cdot 10^{+277}:\\ \;\;\;\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + 1} + \frac{\frac{y}{x + 1} + \frac{\frac{x}{z}}{-1 - x}}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 96.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot t - x\\ t_2 := \frac{x - \frac{x - y \cdot z}{t\_1}}{x + 1}\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{+156}:\\ \;\;\;\;y \cdot \frac{\frac{z}{x + 1}}{t\_1}\\ \mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+277}:\\ \;\;\;\;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 (- (* z t) x)) (t_2 (/ (- x (/ (- x (* y z)) t_1)) (+ x 1.0))))
   (if (<= t_2 -5e+156)
     (* y (/ (/ z (+ x 1.0)) t_1))
     (if (<= t_2 4e+277) t_2 (/ (+ x (/ y t)) (+ x 1.0))))))

C

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

Fortran

real(8) function code(x, y, z, t)
    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 = (z * t) - x
    t_2 = (x - ((x - (y * z)) / t_1)) / (x + 1.0d0)
    if (t_2 <= (-5d+156)) then
        tmp = y * ((z / (x + 1.0d0)) / t_1)
    else if (t_2 <= 4d+277) then
        tmp = t_2
    else
        tmp = (x + (y / t)) / (x + 1.0d0)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * t) - x)
	t_2 = Float64(Float64(x - Float64(Float64(x - Float64(y * z)) / t_1)) / Float64(x + 1.0))
	tmp = 0.0
	if (t_2 <= -5e+156)
		tmp = Float64(y * Float64(Float64(z / Float64(x + 1.0)) / t_1));
	elseif (t_2 <= 4e+277)
		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 = (z * t) - x;
	t_2 = (x - ((x - (y * z)) / t_1)) / (x + 1.0);
	tmp = 0.0;
	if (t_2 <= -5e+156)
		tmp = y * ((z / (x + 1.0)) / t_1);
	elseif (t_2 <= 4e+277)
		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[(z * t), $MachinePrecision] - x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x - N[(N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+156], N[(y * N[(N[(z / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 4e+277], 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))) < -4.99999999999999992e156

   1. Initial program 57.8%

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

      1. *-commutative 57.8%

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

   3. Simplified 57.8%

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

   5. Taylor expanded in y around inf 57.1%

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

      1. associate-/l* 80.4%

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

      2. associate-/r* 95.9%

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

      3. +-commutative 95.9%

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

   7. Simplified 95.9%

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

   if -4.99999999999999992e156 < (/.f64 (+.f64 x (/.f64 (-.f64 (*.f64 y z) x) (-.f64 (*.f64 t z) x))) (+.f64 x #s(literal 1 binary64))) < 4.00000000000000001e277

   1. Initial program 99.3%

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

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

   1. Initial program 27.6%

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

      1. *-commutative 27.6%

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

   3. Simplified 27.6%

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

   5. Taylor expanded in z around inf 96.6%

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

      1. +-commutative 96.6%

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

      2. +-commutative 96.6%

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

   7. Simplified 96.6%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1} \leq -5 \cdot 10^{+156}:\\ \;\;\;\;y \cdot \frac{\frac{z}{x + 1}}{z \cdot t - x}\\ \mathbf{elif}\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1} \leq 4 \cdot 10^{+277}:\\ \;\;\;\;\frac{x - \frac{x - y \cdot z}{z \cdot t - x}}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x + \frac{y}{t}}{x + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x + \frac{y}{t}}{x + 1}\\ \mathbf{if}\;z \leq -5.5 \cdot 10^{-102}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 5 \cdot 10^{-293}:\\ \;\;\;\;\frac{\frac{x}{z \cdot t - x} - x}{-1 - x}\\ \mathbf{elif}\;z \leq 4 \cdot 10^{-132}:\\ \;\;\;\;\frac{1 + \left(x - y \cdot \frac{z}{x}\right)}{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 -5.5e-102)
     t_1
     (if (<= z 5e-293)
       (/ (- (/ x (- (* z t) x)) x) (- -1.0 x))
       (if (<= z 4e-132) (/ (+ 1.0 (- x (* y (/ 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 <= -5.5e-102) {
		tmp = t_1;
	} else if (z <= 5e-293) {
		tmp = ((x / ((z * t) - x)) - x) / (-1.0 - x);
	} else if (z <= 4e-132) {
		tmp = (1.0 + (x - (y * (z / x)))) / (x + 1.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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 <= (-5.5d-102)) then
        tmp = t_1
    else if (z <= 5d-293) then
        tmp = ((x / ((z * t) - x)) - x) / ((-1.0d0) - x)
    else if (z <= 4d-132) then
        tmp = (1.0d0 + (x - (y * (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 <= -5.5e-102) {
		tmp = t_1;
	} else if (z <= 5e-293) {
		tmp = ((x / ((z * t) - x)) - x) / (-1.0 - x);
	} else if (z <= 4e-132) {
		tmp = (1.0 + (x - (y * (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 <= -5.5e-102:
		tmp = t_1
	elif z <= 5e-293:
		tmp = ((x / ((z * t) - x)) - x) / (-1.0 - x)
	elif z <= 4e-132:
		tmp = (1.0 + (x - (y * (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 <= -5.5e-102)
		tmp = t_1;
	elseif (z <= 5e-293)
		tmp = Float64(Float64(Float64(x / Float64(Float64(z * t) - x)) - x) / Float64(-1.0 - x));
	elseif (z <= 4e-132)
		tmp = Float64(Float64(1.0 + Float64(x - Float64(y * Float64(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 <= -5.5e-102)
		tmp = t_1;
	elseif (z <= 5e-293)
		tmp = ((x / ((z * t) - x)) - x) / (-1.0 - x);
	elseif (z <= 4e-132)
		tmp = (1.0 + (x - (y * (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, -5.5e-102], t$95$1, If[LessEqual[z, 5e-293], N[(N[(N[(x / N[(N[(z * t), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision] - x), $MachinePrecision] / N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4e-132], N[(N[(1.0 + N[(x - N[(y * N[(z / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.4999999999999997e-102 or 3.9999999999999999e-132 < z

   1. Initial program 81.6%

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

      1. *-commutative 81.6%

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

   3. Simplified 81.6%

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

   5. Taylor expanded in z around inf 85.8%

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

      1. +-commutative 85.8%

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

      2. +-commutative 85.8%

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

   7. Simplified 85.8%

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

   if -5.4999999999999997e-102 < z < 5.0000000000000003e-293

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around 0 87.1%

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

      1. +-commutative 87.1%

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

   7. Simplified 87.1%

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

   if 5.0000000000000003e-293 < z < 3.9999999999999999e-132

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in t around 0 86.6%

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

      1. mul-1-neg 86.6%

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

      2. unsub-neg 86.6%

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

      3. associate-/l* 86.6%

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

      4. +-commutative 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 86.1%

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

Alternative 4: 79.6% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.34999999999999992e-87 or 3.9999999999999999e-132 < z

   1. Initial program 81.3%

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

      1. *-commutative 81.3%

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

   3. Simplified 81.3%

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

   5. Taylor expanded in z around inf 86.1%

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

      1. +-commutative 86.1%

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

      2. +-commutative 86.1%

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

   7. Simplified 86.1%

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

   if -1.34999999999999992e-87 < z < 3.9999999999999999e-132

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in t around 0 77.3%

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

      1. mul-1-neg 77.3%

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

      2. unsub-neg 77.3%

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

      3. associate-/l* 77.3%

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

      4. +-commutative 77.3%

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

   7. Simplified 77.3%

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

4. Final simplification 83.4%

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

Alternative 5: 75.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -6.9e-233) (not (<= z 2.8e-132)))
   (/ (+ x (/ y t)) (+ x 1.0))
   1.0))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -6.9e-233) || !(z <= 2.8e-132)) {
		tmp = (x + (y / t)) / (x + 1.0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z <= (-6.9d-233)) .or. (.not. (z <= 2.8d-132))) then
        tmp = (x + (y / t)) / (x + 1.0d0)
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -6.9e-233) || !(z <= 2.8e-132)) {
		tmp = (x + (y / t)) / (x + 1.0);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -6.9e-233) or not (z <= 2.8e-132):
		tmp = (x + (y / t)) / (x + 1.0)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -6.9e-233) || !(z <= 2.8e-132))
		tmp = Float64(Float64(x + Float64(y / t)) / Float64(x + 1.0));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -6.9e-233) || ~((z <= 2.8e-132)))
		tmp = (x + (y / t)) / (x + 1.0);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.8999999999999997e-233 or 2.80000000000000002e-132 < z

   1. Initial program 83.5%

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

      1. *-commutative 83.5%

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

   3. Simplified 83.5%

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

   5. Taylor expanded in z around inf 82.5%

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

      1. +-commutative 82.5%

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

      2. +-commutative 82.5%

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

   7. Simplified 82.5%

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

   if -6.8999999999999997e-233 < z < 2.80000000000000002e-132

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 71.0%

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

4. Final simplification 80.1%

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

Alternative 6: 71.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -8.5e-13) (not (<= x 3.6e-22)))
   (/ x (+ x 1.0))
   (* y (/ z (- (* z t) x)))))

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x <= (-8.5d-13)) .or. (.not. (x <= 3.6d-22))) then
        tmp = x / (x + 1.0d0)
    else
        tmp = y * (z / ((z * t) - x))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -8.5000000000000001e-13 or 3.5999999999999998e-22 < x

   1. Initial program 83.3%

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

      1. *-commutative 83.3%

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

   3. Simplified 83.3%

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

   5. Taylor expanded in t around inf 78.4%

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

      1. +-commutative 78.4%

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

   7. Simplified 78.4%

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

   if -8.5000000000000001e-13 < x < 3.5999999999999998e-22

   1. Initial program 90.2%

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

      1. *-commutative 90.2%

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

   3. Simplified 90.2%

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

   5. Taylor expanded in y around inf 53.1%

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

      1. associate-/l* 57.5%

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

      2. associate-/r* 57.5%

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

      3. +-commutative 57.5%

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

   7. Simplified 57.5%

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

   8. Taylor expanded in x around 0 57.5%

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

4. Final simplification 67.6%

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

Alternative 7: 66.9% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -2.1e-100) (not (<= x 1.65e-191))) (/ x (+ x 1.0)) (/ y t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -2.1e-100) || !(x <= 1.65e-191)) {
		tmp = x / (x + 1.0);
	} else {
		tmp = y / t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x <= (-2.1d-100)) .or. (.not. (x <= 1.65d-191))) then
        tmp = x / (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 tmp;
	if ((x <= -2.1e-100) || !(x <= 1.65e-191)) {
		tmp = x / (x + 1.0);
	} else {
		tmp = y / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x <= -2.1e-100) or not (x <= 1.65e-191):
		tmp = x / (x + 1.0)
	else:
		tmp = y / t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -2.1e-100) || !(x <= 1.65e-191))
		tmp = Float64(x / Float64(x + 1.0));
	else
		tmp = Float64(y / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x <= -2.1e-100) || ~((x <= 1.65e-191)))
		tmp = x / (x + 1.0);
	else
		tmp = y / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -2.1e-100], N[Not[LessEqual[x, 1.65e-191]], $MachinePrecision]], N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(y / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.10000000000000009e-100 or 1.64999999999999991e-191 < x

   1. Initial program 85.7%

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

      1. *-commutative 85.7%

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

   3. Simplified 85.7%

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

   5. Taylor expanded in t around inf 66.6%

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

      1. +-commutative 66.6%

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

   7. Simplified 66.6%

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

   if -2.10000000000000009e-100 < x < 1.64999999999999991e-191

   1. Initial program 89.3%

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

      1. *-commutative 89.3%

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

   3. Simplified 89.3%

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

   5. Taylor expanded in x around 0 66.4%

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

4. Final simplification 66.5%

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

Alternative 8: 67.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-63}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 2.1 \cdot 10^{-104}:\\ \;\;\;\;\frac{y}{t}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.2e-63) 1.0 (if (<= x 2.1e-104) (/ y t) 1.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.2e-63) {
		tmp = 1.0;
	} else if (x <= 2.1e-104) {
		tmp = y / t;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-2.2d-63)) then
        tmp = 1.0d0
    else if (x <= 2.1d-104) then
        tmp = y / t
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.2e-63) {
		tmp = 1.0;
	} else if (x <= 2.1e-104) {
		tmp = y / t;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.2e-63:
		tmp = 1.0
	elif x <= 2.1e-104:
		tmp = y / t
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.2e-63)
		tmp = 1.0;
	elseif (x <= 2.1e-104)
		tmp = Float64(y / t);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.2e-63)
		tmp = 1.0;
	elseif (x <= 2.1e-104)
		tmp = y / t;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.2e-63], 1.0, If[LessEqual[x, 2.1e-104], N[(y / t), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -2.2e-63 or 2.09999999999999999e-104 < x

   1. Initial program 84.8%

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

      1. *-commutative 84.8%

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

   3. Simplified 84.8%

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

   5. Taylor expanded in x around inf 69.2%

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

   if -2.2e-63 < x < 2.09999999999999999e-104

   1. Initial program 89.8%

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

      1. *-commutative 89.8%

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

   3. Simplified 89.8%

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

   5. Taylor expanded in x around 0 58.0%

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

Alternative 9: 53.0% accurate, 17.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = 1.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 86.9%

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

   1. *-commutative 86.9%

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

3. Simplified 86.9%

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

5. Taylor expanded in x around inf 45.7%

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

Developer Target 1: 99.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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