Development.Shake.Progress:decay from shake-0.15.5

Percentage Accurate: 66.4% → 87.4%

Time: 19.1s

Alternatives: 21

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 66.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 87.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y - z \cdot \left(y - b\right)\\ t_2 := {\left(b - y\right)}^{2}\\ t_3 := \frac{t - a}{b - y}\\ t_4 := z \cdot \left(t - a\right)\\ \mathbf{if}\;z \leq -6800000000:\\ \;\;\;\;\frac{x \cdot \frac{y}{b - y} + y \cdot \frac{a - t}{t\_2}}{z} + t\_3\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-127}:\\ \;\;\;\;\frac{x \cdot y - a \cdot \left(z - t \cdot \frac{z}{a}\right)}{t\_1}\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;x + \frac{t\_4}{t\_1}\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-229}:\\ \;\;\;\;\frac{x \cdot y + t\_4}{y - y \cdot \left(z - b \cdot \frac{z}{y}\right)}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+36}:\\ \;\;\;\;x \cdot \left(\frac{y}{t\_1} + \frac{t\_4}{x \cdot t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t\_3 + \frac{y}{z} \cdot \frac{x}{b - y}\right) + y \cdot \frac{a - t}{z \cdot t\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b))))
        (t_2 (pow (- b y) 2.0))
        (t_3 (/ (- t a) (- b y)))
        (t_4 (* z (- t a))))
   (if (<= z -6800000000.0)
     (+ (/ (+ (* x (/ y (- b y))) (* y (/ (- a t) t_2))) z) t_3)
     (if (<= z -7e-127)
       (/ (- (* x y) (* a (- z (* t (/ z a))))) t_1)
       (if (<= z 2.45e-254)
         (+ x (/ t_4 t_1))
         (if (<= z 2e-229)
           (/ (+ (* x y) t_4) (- y (* y (- z (* b (/ z y))))))
           (if (<= z 2.4e+36)
             (* x (+ (/ y t_1) (/ t_4 (* x t_1))))
             (+
              (+ t_3 (* (/ y z) (/ x (- b y))))
              (* y (/ (- a t) (* z t_2)))))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = pow((b - y), 2.0);
	double t_3 = (t - a) / (b - y);
	double t_4 = z * (t - a);
	double tmp;
	if (z <= -6800000000.0) {
		tmp = (((x * (y / (b - y))) + (y * ((a - t) / t_2))) / z) + t_3;
	} else if (z <= -7e-127) {
		tmp = ((x * y) - (a * (z - (t * (z / a))))) / t_1;
	} else if (z <= 2.45e-254) {
		tmp = x + (t_4 / t_1);
	} else if (z <= 2e-229) {
		tmp = ((x * y) + t_4) / (y - (y * (z - (b * (z / y)))));
	} else if (z <= 2.4e+36) {
		tmp = x * ((y / t_1) + (t_4 / (x * t_1)));
	} else {
		tmp = (t_3 + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * t_2)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = y - (z * (y - b))
    t_2 = (b - y) ** 2.0d0
    t_3 = (t - a) / (b - y)
    t_4 = z * (t - a)
    if (z <= (-6800000000.0d0)) then
        tmp = (((x * (y / (b - y))) + (y * ((a - t) / t_2))) / z) + t_3
    else if (z <= (-7d-127)) then
        tmp = ((x * y) - (a * (z - (t * (z / a))))) / t_1
    else if (z <= 2.45d-254) then
        tmp = x + (t_4 / t_1)
    else if (z <= 2d-229) then
        tmp = ((x * y) + t_4) / (y - (y * (z - (b * (z / y)))))
    else if (z <= 2.4d+36) then
        tmp = x * ((y / t_1) + (t_4 / (x * t_1)))
    else
        tmp = (t_3 + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * t_2)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = Math.pow((b - y), 2.0);
	double t_3 = (t - a) / (b - y);
	double t_4 = z * (t - a);
	double tmp;
	if (z <= -6800000000.0) {
		tmp = (((x * (y / (b - y))) + (y * ((a - t) / t_2))) / z) + t_3;
	} else if (z <= -7e-127) {
		tmp = ((x * y) - (a * (z - (t * (z / a))))) / t_1;
	} else if (z <= 2.45e-254) {
		tmp = x + (t_4 / t_1);
	} else if (z <= 2e-229) {
		tmp = ((x * y) + t_4) / (y - (y * (z - (b * (z / y)))));
	} else if (z <= 2.4e+36) {
		tmp = x * ((y / t_1) + (t_4 / (x * t_1)));
	} else {
		tmp = (t_3 + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * t_2)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = math.pow((b - y), 2.0)
	t_3 = (t - a) / (b - y)
	t_4 = z * (t - a)
	tmp = 0
	if z <= -6800000000.0:
		tmp = (((x * (y / (b - y))) + (y * ((a - t) / t_2))) / z) + t_3
	elif z <= -7e-127:
		tmp = ((x * y) - (a * (z - (t * (z / a))))) / t_1
	elif z <= 2.45e-254:
		tmp = x + (t_4 / t_1)
	elif z <= 2e-229:
		tmp = ((x * y) + t_4) / (y - (y * (z - (b * (z / y)))))
	elif z <= 2.4e+36:
		tmp = x * ((y / t_1) + (t_4 / (x * t_1)))
	else:
		tmp = (t_3 + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * t_2)))
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(b - y) ^ 2.0
	t_3 = Float64(Float64(t - a) / Float64(b - y))
	t_4 = Float64(z * Float64(t - a))
	tmp = 0.0
	if (z <= -6800000000.0)
		tmp = Float64(Float64(Float64(Float64(x * Float64(y / Float64(b - y))) + Float64(y * Float64(Float64(a - t) / t_2))) / z) + t_3);
	elseif (z <= -7e-127)
		tmp = Float64(Float64(Float64(x * y) - Float64(a * Float64(z - Float64(t * Float64(z / a))))) / t_1);
	elseif (z <= 2.45e-254)
		tmp = Float64(x + Float64(t_4 / t_1));
	elseif (z <= 2e-229)
		tmp = Float64(Float64(Float64(x * y) + t_4) / Float64(y - Float64(y * Float64(z - Float64(b * Float64(z / y))))));
	elseif (z <= 2.4e+36)
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(t_4 / Float64(x * t_1))));
	else
		tmp = Float64(Float64(t_3 + Float64(Float64(y / z) * Float64(x / Float64(b - y)))) + Float64(y * Float64(Float64(a - t) / Float64(z * t_2))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = (b - y) ^ 2.0;
	t_3 = (t - a) / (b - y);
	t_4 = z * (t - a);
	tmp = 0.0;
	if (z <= -6800000000.0)
		tmp = (((x * (y / (b - y))) + (y * ((a - t) / t_2))) / z) + t_3;
	elseif (z <= -7e-127)
		tmp = ((x * y) - (a * (z - (t * (z / a))))) / t_1;
	elseif (z <= 2.45e-254)
		tmp = x + (t_4 / t_1);
	elseif (z <= 2e-229)
		tmp = ((x * y) + t_4) / (y - (y * (z - (b * (z / y)))));
	elseif (z <= 2.4e+36)
		tmp = x * ((y / t_1) + (t_4 / (x * t_1)));
	else
		tmp = (t_3 + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * t_2)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(b - y), $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$3 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6800000000.0], N[(N[(N[(N[(x * N[(y / N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(a - t), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] + t$95$3), $MachinePrecision], If[LessEqual[z, -7e-127], N[(N[(N[(x * y), $MachinePrecision] - N[(a * N[(z - N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[z, 2.45e-254], N[(x + N[(t$95$4 / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2e-229], N[(N[(N[(x * y), $MachinePrecision] + t$95$4), $MachinePrecision] / N[(y - N[(y * N[(z - N[(b * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.4e+36], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(t$95$4 / N[(x * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$3 + N[(N[(y / z), $MachinePrecision] * N[(x / N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(a - t), $MachinePrecision] / N[(z * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 6 regimes

2. if z < -6.8e9

   1. Initial program 43.5%

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

   3. Taylor expanded in z around -inf 66.8%

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

      1. associate--l+ 66.8%

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

      2. mul-1-neg 66.8%

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

      3. distribute-lft-out-- 66.8%

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

      4. associate-/l* 69.0%

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

      5. associate-/l* 90.2%

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

      6. div-sub 90.2%

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

   5. Simplified 90.2%

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

   if -6.8e9 < z < -6.99999999999999979e-127

   1. Initial program 95.2%

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

   3. Taylor expanded in a around inf 95.2%

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

      1. +-commutative 95.2%

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

      2. mul-1-neg 95.2%

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

      3. unsub-neg 95.2%

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

      4. associate-/l* 95.4%

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

   5. Simplified 95.4%

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

   if -6.99999999999999979e-127 < z < 2.4499999999999999e-254

   1. Initial program 88.0%

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

   3. Taylor expanded in x around 0 88.0%

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

   4. Taylor expanded in z around 0 99.9%

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

   if 2.4499999999999999e-254 < z < 2.00000000000000014e-229

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf 99.6%

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

      1. +-commutative 99.6%

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

      2. mul-1-neg 99.6%

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

      3. unsub-neg 99.6%

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

      4. associate-/l* 100.0%

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

   5. Simplified 100.0%

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

   if 2.00000000000000014e-229 < z < 2.39999999999999992e36

   1. Initial program 84.7%

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

   3. Taylor expanded in x around inf 95.9%

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

   if 2.39999999999999992e36 < z

   1. Initial program 40.3%

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

   3. Taylor expanded in z around inf 71.2%

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

      1. associate--r+ 71.2%

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

      2. +-commutative 71.2%

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

      3. associate--l+ 71.2%

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

      4. *-commutative 71.2%

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

      5. times-frac 77.7%

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

      6. div-sub 77.7%

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

      7. associate-/l* 95.3%

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

   5. Simplified 95.3%

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

4. Final simplification 95.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6800000000:\\ \;\;\;\;\frac{x \cdot \frac{y}{b - y} + y \cdot \frac{a - t}{{\left(b - y\right)}^{2}}}{z} + \frac{t - a}{b - y}\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-127}:\\ \;\;\;\;\frac{x \cdot y - a \cdot \left(z - t \cdot \frac{z}{a}\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 2 \cdot 10^{-229}:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - y \cdot \left(z - b \cdot \frac{z}{y}\right)}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+36}:\\ \;\;\;\;x \cdot \left(\frac{y}{y - z \cdot \left(y - b\right)} + \frac{z \cdot \left(t - a\right)}{x \cdot \left(y - z \cdot \left(y - b\right)\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{t - a}{b - y} + \frac{y}{z} \cdot \frac{x}{b - y}\right) + y \cdot \frac{a - t}{z \cdot {\left(b - y\right)}^{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 87.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y - z \cdot \left(y - b\right)\\ t_2 := z \cdot \left(t - a\right)\\ t_3 := \frac{x \cdot y + t\_2}{t\_1}\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;x \cdot \left(\frac{y}{t\_1} + \frac{t - a}{x \cdot b}\right)\\ \mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-291}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_3 \leq 0 \lor \neg \left(t\_3 \leq 2 \cdot 10^{+244}\right):\\ \;\;\;\;\left(\frac{t - a}{b - y} + \frac{y}{z} \cdot \frac{x}{b - y}\right) + y \cdot \frac{a - t}{z \cdot {\left(b - y\right)}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{t\_1} + \frac{x \cdot y}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b))))
        (t_2 (* z (- t a)))
        (t_3 (/ (+ (* x y) t_2) t_1)))
   (if (<= t_3 (- INFINITY))
     (* x (+ (/ y t_1) (/ (- t a) (* x b))))
     (if (<= t_3 -5e-291)
       t_3
       (if (or (<= t_3 0.0) (not (<= t_3 2e+244)))
         (+
          (+ (/ (- t a) (- b y)) (* (/ y z) (/ x (- b y))))
          (* y (/ (- a t) (* z (pow (- b y) 2.0)))))
         (+ (/ t_2 t_1) (/ (* x y) t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = z * (t - a);
	double t_3 = ((x * y) + t_2) / t_1;
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_3 <= -5e-291) {
		tmp = t_3;
	} else if ((t_3 <= 0.0) || !(t_3 <= 2e+244)) {
		tmp = (((t - a) / (b - y)) + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * pow((b - y), 2.0))));
	} else {
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = z * (t - a);
	double t_3 = ((x * y) + t_2) / t_1;
	double tmp;
	if (t_3 <= -Double.POSITIVE_INFINITY) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_3 <= -5e-291) {
		tmp = t_3;
	} else if ((t_3 <= 0.0) || !(t_3 <= 2e+244)) {
		tmp = (((t - a) / (b - y)) + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * Math.pow((b - y), 2.0))));
	} else {
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = z * (t - a)
	t_3 = ((x * y) + t_2) / t_1
	tmp = 0
	if t_3 <= -math.inf:
		tmp = x * ((y / t_1) + ((t - a) / (x * b)))
	elif t_3 <= -5e-291:
		tmp = t_3
	elif (t_3 <= 0.0) or not (t_3 <= 2e+244):
		tmp = (((t - a) / (b - y)) + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * math.pow((b - y), 2.0))))
	else:
		tmp = (t_2 / t_1) + ((x * y) / t_1)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(z * Float64(t - a))
	t_3 = Float64(Float64(Float64(x * y) + t_2) / t_1)
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(Float64(t - a) / Float64(x * b))));
	elseif (t_3 <= -5e-291)
		tmp = t_3;
	elseif ((t_3 <= 0.0) || !(t_3 <= 2e+244))
		tmp = Float64(Float64(Float64(Float64(t - a) / Float64(b - y)) + Float64(Float64(y / z) * Float64(x / Float64(b - y)))) + Float64(y * Float64(Float64(a - t) / Float64(z * (Float64(b - y) ^ 2.0)))));
	else
		tmp = Float64(Float64(t_2 / t_1) + Float64(Float64(x * y) / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = z * (t - a);
	t_3 = ((x * y) + t_2) / t_1;
	tmp = 0.0;
	if (t_3 <= -Inf)
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	elseif (t_3 <= -5e-291)
		tmp = t_3;
	elseif ((t_3 <= 0.0) || ~((t_3 <= 2e+244)))
		tmp = (((t - a) / (b - y)) + ((y / z) * (x / (b - y)))) + (y * ((a - t) / (z * ((b - y) ^ 2.0))));
	else
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(x * y), $MachinePrecision] + t$95$2), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(N[(t - a), $MachinePrecision] / N[(x * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-291], t$95$3, If[Or[LessEqual[t$95$3, 0.0], N[Not[LessEqual[t$95$3, 2e+244]], $MachinePrecision]], N[(N[(N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision] + N[(N[(y / z), $MachinePrecision] * N[(x / N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(a - t), $MachinePrecision] / N[(z * N[Power[N[(b - y), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 / t$95$1), $MachinePrecision] + N[(N[(x * y), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0

   1. Initial program 36.3%

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

   3. Taylor expanded in x around inf 69.0%

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

   4. Taylor expanded in y around 0 77.0%

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

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -5.0000000000000003e-291

   1. Initial program 99.4%

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

   if -5.0000000000000003e-291 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -0.0 or 2.00000000000000015e244 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 17.2%

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

   3. Taylor expanded in z around inf 49.4%

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

      1. associate--r+ 49.4%

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

      2. +-commutative 49.4%

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

      3. associate--l+ 49.4%

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

      4. *-commutative 49.4%

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

      5. times-frac 59.8%

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

      6. div-sub 59.8%

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

      7. associate-/l* 88.4%

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

   5. Simplified 88.4%

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

   if -0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 2.00000000000000015e244

   1. Initial program 99.4%

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

   3. Taylor expanded in x around 0 99.4%

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

4. Final simplification 93.5%

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

Alternative 3: 85.6% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b))))
        (t_2 (/ (- t a) (- b y)))
        (t_3 (* z (- t a)))
        (t_4 (/ (+ (* x y) t_3) t_1)))
   (if (<= t_4 (- INFINITY))
     (* x (+ (/ y t_1) (/ (- t a) (* x b))))
     (if (<= t_4 -5e-291)
       t_4
       (if (<= t_4 0.0)
         t_2
         (if (<= t_4 2e+244)
           (+ (/ t_3 t_1) (/ (* x y) t_1))
           (+ (- t_2 (/ x z)) (* y (/ (- a t) (* z (pow (- b y) 2.0)))))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = (t - a) / (b - y);
	double t_3 = z * (t - a);
	double t_4 = ((x * y) + t_3) / t_1;
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_4 <= -5e-291) {
		tmp = t_4;
	} else if (t_4 <= 0.0) {
		tmp = t_2;
	} else if (t_4 <= 2e+244) {
		tmp = (t_3 / t_1) + ((x * y) / t_1);
	} else {
		tmp = (t_2 - (x / z)) + (y * ((a - t) / (z * pow((b - y), 2.0))));
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = (t - a) / (b - y);
	double t_3 = z * (t - a);
	double t_4 = ((x * y) + t_3) / t_1;
	double tmp;
	if (t_4 <= -Double.POSITIVE_INFINITY) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_4 <= -5e-291) {
		tmp = t_4;
	} else if (t_4 <= 0.0) {
		tmp = t_2;
	} else if (t_4 <= 2e+244) {
		tmp = (t_3 / t_1) + ((x * y) / t_1);
	} else {
		tmp = (t_2 - (x / z)) + (y * ((a - t) / (z * Math.pow((b - y), 2.0))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = (t - a) / (b - y)
	t_3 = z * (t - a)
	t_4 = ((x * y) + t_3) / t_1
	tmp = 0
	if t_4 <= -math.inf:
		tmp = x * ((y / t_1) + ((t - a) / (x * b)))
	elif t_4 <= -5e-291:
		tmp = t_4
	elif t_4 <= 0.0:
		tmp = t_2
	elif t_4 <= 2e+244:
		tmp = (t_3 / t_1) + ((x * y) / t_1)
	else:
		tmp = (t_2 - (x / z)) + (y * ((a - t) / (z * math.pow((b - y), 2.0))))
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(Float64(t - a) / Float64(b - y))
	t_3 = Float64(z * Float64(t - a))
	t_4 = Float64(Float64(Float64(x * y) + t_3) / t_1)
	tmp = 0.0
	if (t_4 <= Float64(-Inf))
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(Float64(t - a) / Float64(x * b))));
	elseif (t_4 <= -5e-291)
		tmp = t_4;
	elseif (t_4 <= 0.0)
		tmp = t_2;
	elseif (t_4 <= 2e+244)
		tmp = Float64(Float64(t_3 / t_1) + Float64(Float64(x * y) / t_1));
	else
		tmp = Float64(Float64(t_2 - Float64(x / z)) + Float64(y * Float64(Float64(a - t) / Float64(z * (Float64(b - y) ^ 2.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = (t - a) / (b - y);
	t_3 = z * (t - a);
	t_4 = ((x * y) + t_3) / t_1;
	tmp = 0.0;
	if (t_4 <= -Inf)
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	elseif (t_4 <= -5e-291)
		tmp = t_4;
	elseif (t_4 <= 0.0)
		tmp = t_2;
	elseif (t_4 <= 2e+244)
		tmp = (t_3 / t_1) + ((x * y) / t_1);
	else
		tmp = (t_2 - (x / z)) + (y * ((a - t) / (z * ((b - y) ^ 2.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(x * y), $MachinePrecision] + t$95$3), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(N[(t - a), $MachinePrecision] / N[(x * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -5e-291], t$95$4, If[LessEqual[t$95$4, 0.0], t$95$2, If[LessEqual[t$95$4, 2e+244], N[(N[(t$95$3 / t$95$1), $MachinePrecision] + N[(N[(x * y), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 - N[(x / z), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(a - t), $MachinePrecision] / N[(z * N[Power[N[(b - y), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0

   1. Initial program 36.3%

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

   3. Taylor expanded in x around inf 69.0%

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

   4. Taylor expanded in y around 0 77.0%

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

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -5.0000000000000003e-291

   1. Initial program 99.4%

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

   if -5.0000000000000003e-291 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -0.0

   1. Initial program 21.3%

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

   3. Taylor expanded in z around inf 86.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 2.00000000000000015e244

   1. Initial program 99.4%

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

   3. Taylor expanded in x around 0 99.4%

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

   if 2.00000000000000015e244 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 15.6%

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

   3. Taylor expanded in z around inf 39.9%

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

      1. associate--r+ 39.9%

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

      2. +-commutative 39.9%

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

      3. associate--l+ 39.9%

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

      4. *-commutative 39.9%

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

      5. times-frac 49.8%

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

      6. div-sub 49.8%

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

      7. associate-/l* 84.6%

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

   5. Simplified 84.6%

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

   6. Taylor expanded in y around inf 77.1%

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

      1. associate-*r/ 77.1%

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

      2. mul-1-neg 77.1%

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

   8. Simplified 77.1%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq -\infty:\\ \;\;\;\;x \cdot \left(\frac{y}{y - z \cdot \left(y - b\right)} + \frac{t - a}{x \cdot b}\right)\\ \mathbf{elif}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq -5 \cdot 10^{-291}:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq 0:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{elif}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq 2 \cdot 10^{+244}:\\ \;\;\;\;\frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} + \frac{x \cdot y}{y - z \cdot \left(y - b\right)}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{t - a}{b - y} - \frac{x}{z}\right) + y \cdot \frac{a - t}{z \cdot {\left(b - y\right)}^{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y - z \cdot \left(y - b\right)\\ t_2 := z \cdot \left(t - a\right)\\ t_3 := \frac{x \cdot y + t\_2}{t\_1}\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;x \cdot \left(\frac{y}{t\_1} + \frac{t - a}{x \cdot b}\right)\\ \mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-291}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_3 \leq 0 \lor \neg \left(t\_3 \leq 2 \cdot 10^{+244}\right):\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_2}{t\_1} + \frac{x \cdot y}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b))))
        (t_2 (* z (- t a)))
        (t_3 (/ (+ (* x y) t_2) t_1)))
   (if (<= t_3 (- INFINITY))
     (* x (+ (/ y t_1) (/ (- t a) (* x b))))
     (if (<= t_3 -5e-291)
       t_3
       (if (or (<= t_3 0.0) (not (<= t_3 2e+244)))
         (/ (- t a) (- b y))
         (+ (/ t_2 t_1) (/ (* x y) t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = z * (t - a);
	double t_3 = ((x * y) + t_2) / t_1;
	double tmp;
	if (t_3 <= -((double) INFINITY)) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_3 <= -5e-291) {
		tmp = t_3;
	} else if ((t_3 <= 0.0) || !(t_3 <= 2e+244)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = z * (t - a);
	double t_3 = ((x * y) + t_2) / t_1;
	double tmp;
	if (t_3 <= -Double.POSITIVE_INFINITY) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if (t_3 <= -5e-291) {
		tmp = t_3;
	} else if ((t_3 <= 0.0) || !(t_3 <= 2e+244)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = z * (t - a)
	t_3 = ((x * y) + t_2) / t_1
	tmp = 0
	if t_3 <= -math.inf:
		tmp = x * ((y / t_1) + ((t - a) / (x * b)))
	elif t_3 <= -5e-291:
		tmp = t_3
	elif (t_3 <= 0.0) or not (t_3 <= 2e+244):
		tmp = (t - a) / (b - y)
	else:
		tmp = (t_2 / t_1) + ((x * y) / t_1)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(z * Float64(t - a))
	t_3 = Float64(Float64(Float64(x * y) + t_2) / t_1)
	tmp = 0.0
	if (t_3 <= Float64(-Inf))
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(Float64(t - a) / Float64(x * b))));
	elseif (t_3 <= -5e-291)
		tmp = t_3;
	elseif ((t_3 <= 0.0) || !(t_3 <= 2e+244))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(Float64(t_2 / t_1) + Float64(Float64(x * y) / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = z * (t - a);
	t_3 = ((x * y) + t_2) / t_1;
	tmp = 0.0;
	if (t_3 <= -Inf)
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	elseif (t_3 <= -5e-291)
		tmp = t_3;
	elseif ((t_3 <= 0.0) || ~((t_3 <= 2e+244)))
		tmp = (t - a) / (b - y);
	else
		tmp = (t_2 / t_1) + ((x * y) / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(x * y), $MachinePrecision] + t$95$2), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(N[(t - a), $MachinePrecision] / N[(x * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, -5e-291], t$95$3, If[Or[LessEqual[t$95$3, 0.0], N[Not[LessEqual[t$95$3, 2e+244]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 / t$95$1), $MachinePrecision] + N[(N[(x * y), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0

   1. Initial program 36.3%

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

   3. Taylor expanded in x around inf 69.0%

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

   4. Taylor expanded in y around 0 77.0%

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

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -5.0000000000000003e-291

   1. Initial program 99.4%

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

   if -5.0000000000000003e-291 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -0.0 or 2.00000000000000015e244 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 17.2%

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

   3. Taylor expanded in z around inf 78.5%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 2.00000000000000015e244

   1. Initial program 99.4%

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

   3. Taylor expanded in x around 0 99.4%

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

4. Final simplification 90.1%

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

Alternative 5: 84.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y - z \cdot \left(y - b\right)\\ t_2 := \frac{x \cdot y + z \cdot \left(t - a\right)}{t\_1}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;x \cdot \left(\frac{y}{t\_1} + \frac{t - a}{x \cdot b}\right)\\ \mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-291} \lor \neg \left(t\_2 \leq 0\right) \land t\_2 \leq 2 \cdot 10^{+244}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b)))) (t_2 (/ (+ (* x y) (* z (- t a))) t_1)))
   (if (<= t_2 (- INFINITY))
     (* x (+ (/ y t_1) (/ (- t a) (* x b))))
     (if (or (<= t_2 -5e-291) (and (not (<= t_2 0.0)) (<= t_2 2e+244)))
       t_2
       (/ (- t a) (- b y))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = ((x * y) + (z * (t - a))) / t_1;
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if ((t_2 <= -5e-291) || (!(t_2 <= 0.0) && (t_2 <= 2e+244))) {
		tmp = t_2;
	} else {
		tmp = (t - a) / (b - y);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = ((x * y) + (z * (t - a))) / t_1;
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	} else if ((t_2 <= -5e-291) || (!(t_2 <= 0.0) && (t_2 <= 2e+244))) {
		tmp = t_2;
	} else {
		tmp = (t - a) / (b - y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = ((x * y) + (z * (t - a))) / t_1
	tmp = 0
	if t_2 <= -math.inf:
		tmp = x * ((y / t_1) + ((t - a) / (x * b)))
	elif (t_2 <= -5e-291) or (not (t_2 <= 0.0) and (t_2 <= 2e+244)):
		tmp = t_2
	else:
		tmp = (t - a) / (b - y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(Float64(Float64(x * y) + Float64(z * Float64(t - a))) / t_1)
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(x * Float64(Float64(y / t_1) + Float64(Float64(t - a) / Float64(x * b))));
	elseif ((t_2 <= -5e-291) || (!(t_2 <= 0.0) && (t_2 <= 2e+244)))
		tmp = t_2;
	else
		tmp = Float64(Float64(t - a) / Float64(b - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = ((x * y) + (z * (t - a))) / t_1;
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = x * ((y / t_1) + ((t - a) / (x * b)));
	elseif ((t_2 <= -5e-291) || (~((t_2 <= 0.0)) && (t_2 <= 2e+244)))
		tmp = t_2;
	else
		tmp = (t - a) / (b - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(x * N[(N[(y / t$95$1), $MachinePrecision] + N[(N[(t - a), $MachinePrecision] / N[(x * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$2, -5e-291], And[N[Not[LessEqual[t$95$2, 0.0]], $MachinePrecision], LessEqual[t$95$2, 2e+244]]], t$95$2, N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0

   1. Initial program 36.3%

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

   3. Taylor expanded in x around inf 69.0%

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

   4. Taylor expanded in y around 0 77.0%

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

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -5.0000000000000003e-291 or -0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 2.00000000000000015e244

   1. Initial program 99.4%

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

   if -5.0000000000000003e-291 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -0.0 or 2.00000000000000015e244 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 17.2%

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

   3. Taylor expanded in z around inf 78.5%

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

4. Final simplification 90.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq -\infty:\\ \;\;\;\;x \cdot \left(\frac{y}{y - z \cdot \left(y - b\right)} + \frac{t - a}{x \cdot b}\right)\\ \mathbf{elif}\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq -5 \cdot 10^{-291} \lor \neg \left(\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq 0\right) \land \frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)} \leq 2 \cdot 10^{+244}:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b}\\ t_2 := \frac{t}{b - y}\\ \mathbf{if}\;z \leq -1.52 \cdot 10^{+237}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{+131}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;z \leq -1.32 \cdot 10^{-86}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -1.95 \cdot 10^{-100}:\\ \;\;\;\;z \cdot \frac{t - a}{y}\\ \mathbf{elif}\;z \leq -2.4 \cdot 10^{-107}:\\ \;\;\;\;x - a \cdot \frac{z}{y}\\ \mathbf{elif}\;z \leq -1.55 \cdot 10^{-160}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 3.2 \cdot 10^{-44}:\\ \;\;\;\;x + \frac{z \cdot t}{y}\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{+150}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{+260}:\\ \;\;\;\;\frac{a - t}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) b)) (t_2 (/ t (- b y))))
   (if (<= z -1.52e+237)
     t_2
     (if (<= z -8.5e+131)
       (/ a (- y b))
       (if (<= z -1.32e-86)
         t_1
         (if (<= z -1.95e-100)
           (* z (/ (- t a) y))
           (if (<= z -2.4e-107)
             (- x (* a (/ z y)))
             (if (<= z -1.55e-160)
               t_1
               (if (<= z 3.2e-44)
                 (+ x (/ (* z t) y))
                 (if (<= z 1.9e+150)
                   t_1
                   (if (<= z 1.06e+260) (/ (- a t) y) t_2)))))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / b;
	double t_2 = t / (b - y);
	double tmp;
	if (z <= -1.52e+237) {
		tmp = t_2;
	} else if (z <= -8.5e+131) {
		tmp = a / (y - b);
	} else if (z <= -1.32e-86) {
		tmp = t_1;
	} else if (z <= -1.95e-100) {
		tmp = z * ((t - a) / y);
	} else if (z <= -2.4e-107) {
		tmp = x - (a * (z / y));
	} else if (z <= -1.55e-160) {
		tmp = t_1;
	} else if (z <= 3.2e-44) {
		tmp = x + ((z * t) / y);
	} else if (z <= 1.9e+150) {
		tmp = t_1;
	} else if (z <= 1.06e+260) {
		tmp = (a - t) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (t - a) / b
    t_2 = t / (b - y)
    if (z <= (-1.52d+237)) then
        tmp = t_2
    else if (z <= (-8.5d+131)) then
        tmp = a / (y - b)
    else if (z <= (-1.32d-86)) then
        tmp = t_1
    else if (z <= (-1.95d-100)) then
        tmp = z * ((t - a) / y)
    else if (z <= (-2.4d-107)) then
        tmp = x - (a * (z / y))
    else if (z <= (-1.55d-160)) then
        tmp = t_1
    else if (z <= 3.2d-44) then
        tmp = x + ((z * t) / y)
    else if (z <= 1.9d+150) then
        tmp = t_1
    else if (z <= 1.06d+260) then
        tmp = (a - t) / y
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / b;
	double t_2 = t / (b - y);
	double tmp;
	if (z <= -1.52e+237) {
		tmp = t_2;
	} else if (z <= -8.5e+131) {
		tmp = a / (y - b);
	} else if (z <= -1.32e-86) {
		tmp = t_1;
	} else if (z <= -1.95e-100) {
		tmp = z * ((t - a) / y);
	} else if (z <= -2.4e-107) {
		tmp = x - (a * (z / y));
	} else if (z <= -1.55e-160) {
		tmp = t_1;
	} else if (z <= 3.2e-44) {
		tmp = x + ((z * t) / y);
	} else if (z <= 1.9e+150) {
		tmp = t_1;
	} else if (z <= 1.06e+260) {
		tmp = (a - t) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / b
	t_2 = t / (b - y)
	tmp = 0
	if z <= -1.52e+237:
		tmp = t_2
	elif z <= -8.5e+131:
		tmp = a / (y - b)
	elif z <= -1.32e-86:
		tmp = t_1
	elif z <= -1.95e-100:
		tmp = z * ((t - a) / y)
	elif z <= -2.4e-107:
		tmp = x - (a * (z / y))
	elif z <= -1.55e-160:
		tmp = t_1
	elif z <= 3.2e-44:
		tmp = x + ((z * t) / y)
	elif z <= 1.9e+150:
		tmp = t_1
	elif z <= 1.06e+260:
		tmp = (a - t) / y
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / b)
	t_2 = Float64(t / Float64(b - y))
	tmp = 0.0
	if (z <= -1.52e+237)
		tmp = t_2;
	elseif (z <= -8.5e+131)
		tmp = Float64(a / Float64(y - b));
	elseif (z <= -1.32e-86)
		tmp = t_1;
	elseif (z <= -1.95e-100)
		tmp = Float64(z * Float64(Float64(t - a) / y));
	elseif (z <= -2.4e-107)
		tmp = Float64(x - Float64(a * Float64(z / y)));
	elseif (z <= -1.55e-160)
		tmp = t_1;
	elseif (z <= 3.2e-44)
		tmp = Float64(x + Float64(Float64(z * t) / y));
	elseif (z <= 1.9e+150)
		tmp = t_1;
	elseif (z <= 1.06e+260)
		tmp = Float64(Float64(a - t) / y);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - a) / b;
	t_2 = t / (b - y);
	tmp = 0.0;
	if (z <= -1.52e+237)
		tmp = t_2;
	elseif (z <= -8.5e+131)
		tmp = a / (y - b);
	elseif (z <= -1.32e-86)
		tmp = t_1;
	elseif (z <= -1.95e-100)
		tmp = z * ((t - a) / y);
	elseif (z <= -2.4e-107)
		tmp = x - (a * (z / y));
	elseif (z <= -1.55e-160)
		tmp = t_1;
	elseif (z <= 3.2e-44)
		tmp = x + ((z * t) / y);
	elseif (z <= 1.9e+150)
		tmp = t_1;
	elseif (z <= 1.06e+260)
		tmp = (a - t) / y;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$2 = N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.52e+237], t$95$2, If[LessEqual[z, -8.5e+131], N[(a / N[(y - b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.32e-86], t$95$1, If[LessEqual[z, -1.95e-100], N[(z * N[(N[(t - a), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.4e-107], N[(x - N[(a * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.55e-160], t$95$1, If[LessEqual[z, 3.2e-44], N[(x + N[(N[(z * t), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.9e+150], t$95$1, If[LessEqual[z, 1.06e+260], N[(N[(a - t), $MachinePrecision] / y), $MachinePrecision], t$95$2]]]]]]]]]]]

Derivation

1. Split input into 7 regimes

2. if z < -1.51999999999999995e237 or 1.06e260 < z

   1. Initial program 31.9%

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

   3. Taylor expanded in x around inf 23.9%

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

   4. Taylor expanded in z around inf 71.3%

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

      1. div-sub 71.4%

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

      2. *-commutative 71.4%

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

   6. Simplified 71.4%

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

   7. Taylor expanded in t around inf 62.4%

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

   if -1.51999999999999995e237 < z < -8.50000000000000063e131

   1. Initial program 19.8%

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

   3. Taylor expanded in a around inf 11.8%

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

      1. mul-1-neg 11.8%

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

      2. distribute-lft-neg-out 11.8%

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

      3. *-commutative 11.8%

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

   5. Simplified 11.8%

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

   6. Taylor expanded in z around inf 69.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{a}{b - y}} \]
   7. Step-by-step derivation

      1. associate-*r/ 69.0%

         \[\leadsto \color{blue}{\frac{-1 \cdot a}{b - y}} \]

      2. mul-1-neg 69.0%

         \[\leadsto \frac{\color{blue}{-a}}{b - y} \]

   8. Simplified 69.0%

      \[\leadsto \color{blue}{\frac{-a}{b - y}} \]

   if -8.50000000000000063e131 < z < -1.32e-86 or -2.39999999999999994e-107 < z < -1.55e-160 or 3.19999999999999995e-44 < z < 1.89999999999999995e150

   1. Initial program 74.1%

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

   3. Taylor expanded in y around 0 49.5%

      \[\leadsto \color{blue}{\frac{t - a}{b}} \]

   if -1.32e-86 < z < -1.94999999999999989e-100

   1. Initial program 99.5%

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

   3. Taylor expanded in y around inf 99.5%

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

      1. associate-/l* 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in z around 0 100.0%

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

   7. Taylor expanded in y around 0 99.5%

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

      1. associate-*r/ 100.0%

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

   9. Simplified 100.0%

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

   if -1.94999999999999989e-100 < z < -2.39999999999999994e-107

   1. Initial program 99.2%

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

   3. Taylor expanded in y around inf 99.2%

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

      1. associate-/l* 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in z around 0 100.0%

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

   7. Taylor expanded in t around 0 99.2%

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

      1. mul-1-neg 99.2%

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

      2. unsub-neg 99.2%

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

      3. associate-/l* 100.0%

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

   9. Simplified 100.0%

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

   if -1.55e-160 < z < 3.19999999999999995e-44

   1. Initial program 86.3%

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

   3. Taylor expanded in y around inf 85.2%

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

      1. associate-/l* 69.4%

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

   5. Simplified 69.4%

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

   6. Taylor expanded in z around 0 58.0%

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

   7. Taylor expanded in a around 0 68.2%

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

   if 1.89999999999999995e150 < z < 1.06e260

   1. Initial program 40.8%

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

   3. Taylor expanded in x around inf 31.8%

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

   4. Taylor expanded in z around inf 70.2%

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

      1. div-sub 70.2%

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

      2. *-commutative 70.2%

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

   6. Simplified 70.2%

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

   7. Taylor expanded in b around 0 64.0%

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

      1. associate-*r/ 64.0%

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

      2. mul-1-neg 64.0%

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

   9. Simplified 64.0%

      \[\leadsto \color{blue}{\frac{-\left(t - a\right)}{y}} \]
3. Recombined 7 regimes into one program.

4. Final simplification 61.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.52 \cdot 10^{+237}:\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{elif}\;z \leq -8.5 \cdot 10^{+131}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;z \leq -1.32 \cdot 10^{-86}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{elif}\;z \leq -1.95 \cdot 10^{-100}:\\ \;\;\;\;z \cdot \frac{t - a}{y}\\ \mathbf{elif}\;z \leq -2.4 \cdot 10^{-107}:\\ \;\;\;\;x - a \cdot \frac{z}{y}\\ \mathbf{elif}\;z \leq -1.55 \cdot 10^{-160}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{elif}\;z \leq 3.2 \cdot 10^{-44}:\\ \;\;\;\;x + \frac{z \cdot t}{y}\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{+150}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{elif}\;z \leq 1.06 \cdot 10^{+260}:\\ \;\;\;\;\frac{a - t}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 83.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(t - a\right)\\ t_2 := y - z \cdot \left(y - b\right)\\ t_3 := \frac{x \cdot y + t\_1}{t\_2}\\ t_4 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -1.2 \cdot 10^{+15}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;z \leq -1.3 \cdot 10^{-120}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;x + \frac{t\_1}{t\_2}\\ \mathbf{elif}\;z \leq 1.3 \cdot 10^{+92}:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_4\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* z (- t a)))
        (t_2 (- y (* z (- y b))))
        (t_3 (/ (+ (* x y) t_1) t_2))
        (t_4 (/ (- t a) (- b y))))
   (if (<= z -1.2e+15)
     t_4
     (if (<= z -1.3e-120)
       t_3
       (if (<= z 2.45e-254) (+ x (/ t_1 t_2)) (if (<= z 1.3e+92) t_3 t_4))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = z * (t - a);
	double t_2 = y - (z * (y - b));
	double t_3 = ((x * y) + t_1) / t_2;
	double t_4 = (t - a) / (b - y);
	double tmp;
	if (z <= -1.2e+15) {
		tmp = t_4;
	} else if (z <= -1.3e-120) {
		tmp = t_3;
	} else if (z <= 2.45e-254) {
		tmp = x + (t_1 / t_2);
	} else if (z <= 1.3e+92) {
		tmp = t_3;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = z * (t - a)
    t_2 = y - (z * (y - b))
    t_3 = ((x * y) + t_1) / t_2
    t_4 = (t - a) / (b - y)
    if (z <= (-1.2d+15)) then
        tmp = t_4
    else if (z <= (-1.3d-120)) then
        tmp = t_3
    else if (z <= 2.45d-254) then
        tmp = x + (t_1 / t_2)
    else if (z <= 1.3d+92) then
        tmp = t_3
    else
        tmp = t_4
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = z * (t - a);
	double t_2 = y - (z * (y - b));
	double t_3 = ((x * y) + t_1) / t_2;
	double t_4 = (t - a) / (b - y);
	double tmp;
	if (z <= -1.2e+15) {
		tmp = t_4;
	} else if (z <= -1.3e-120) {
		tmp = t_3;
	} else if (z <= 2.45e-254) {
		tmp = x + (t_1 / t_2);
	} else if (z <= 1.3e+92) {
		tmp = t_3;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = z * (t - a)
	t_2 = y - (z * (y - b))
	t_3 = ((x * y) + t_1) / t_2
	t_4 = (t - a) / (b - y)
	tmp = 0
	if z <= -1.2e+15:
		tmp = t_4
	elif z <= -1.3e-120:
		tmp = t_3
	elif z <= 2.45e-254:
		tmp = x + (t_1 / t_2)
	elif z <= 1.3e+92:
		tmp = t_3
	else:
		tmp = t_4
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(z * Float64(t - a))
	t_2 = Float64(y - Float64(z * Float64(y - b)))
	t_3 = Float64(Float64(Float64(x * y) + t_1) / t_2)
	t_4 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -1.2e+15)
		tmp = t_4;
	elseif (z <= -1.3e-120)
		tmp = t_3;
	elseif (z <= 2.45e-254)
		tmp = Float64(x + Float64(t_1 / t_2));
	elseif (z <= 1.3e+92)
		tmp = t_3;
	else
		tmp = t_4;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = z * (t - a);
	t_2 = y - (z * (y - b));
	t_3 = ((x * y) + t_1) / t_2;
	t_4 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -1.2e+15)
		tmp = t_4;
	elseif (z <= -1.3e-120)
		tmp = t_3;
	elseif (z <= 2.45e-254)
		tmp = x + (t_1 / t_2);
	elseif (z <= 1.3e+92)
		tmp = t_3;
	else
		tmp = t_4;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(x * y), $MachinePrecision] + t$95$1), $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.2e+15], t$95$4, If[LessEqual[z, -1.3e-120], t$95$3, If[LessEqual[z, 2.45e-254], N[(x + N[(t$95$1 / t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.3e+92], t$95$3, t$95$4]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.2e15 or 1.2999999999999999e92 < z

   1. Initial program 38.8%

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

   3. Taylor expanded in z around inf 86.1%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -1.2e15 < z < -1.3000000000000001e-120 or 2.4499999999999999e-254 < z < 1.2999999999999999e92

   1. Initial program 87.8%

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

   if -1.3000000000000001e-120 < z < 2.4499999999999999e-254

   1. Initial program 88.2%

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

   3. Taylor expanded in x around 0 88.2%

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

   4. Taylor expanded in z around 0 99.9%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.2 \cdot 10^{+15}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{elif}\;z \leq -1.3 \cdot 10^{-120}:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 1.3 \cdot 10^{+92}:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 50.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b}\\ t_2 := \frac{t}{b - y}\\ \mathbf{if}\;z \leq -6.6 \cdot 10^{+237}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq -1.35 \cdot 10^{+135}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-49}:\\ \;\;\;\;x + \frac{z \cdot t}{y}\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{+150}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{+260}:\\ \;\;\;\;\frac{a - t}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) b)) (t_2 (/ t (- b y))))
   (if (<= z -6.6e+237)
     t_2
     (if (<= z -1.35e+135)
       (/ a (- y b))
       (if (<= z -1.6e-160)
         t_1
         (if (<= z 7e-49)
           (+ x (/ (* z t) y))
           (if (<= z 2.7e+150)
             t_1
             (if (<= z 5.6e+260) (/ (- a t) y) t_2))))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / b;
	double t_2 = t / (b - y);
	double tmp;
	if (z <= -6.6e+237) {
		tmp = t_2;
	} else if (z <= -1.35e+135) {
		tmp = a / (y - b);
	} else if (z <= -1.6e-160) {
		tmp = t_1;
	} else if (z <= 7e-49) {
		tmp = x + ((z * t) / y);
	} else if (z <= 2.7e+150) {
		tmp = t_1;
	} else if (z <= 5.6e+260) {
		tmp = (a - t) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (t - a) / b
    t_2 = t / (b - y)
    if (z <= (-6.6d+237)) then
        tmp = t_2
    else if (z <= (-1.35d+135)) then
        tmp = a / (y - b)
    else if (z <= (-1.6d-160)) then
        tmp = t_1
    else if (z <= 7d-49) then
        tmp = x + ((z * t) / y)
    else if (z <= 2.7d+150) then
        tmp = t_1
    else if (z <= 5.6d+260) then
        tmp = (a - t) / y
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / b;
	double t_2 = t / (b - y);
	double tmp;
	if (z <= -6.6e+237) {
		tmp = t_2;
	} else if (z <= -1.35e+135) {
		tmp = a / (y - b);
	} else if (z <= -1.6e-160) {
		tmp = t_1;
	} else if (z <= 7e-49) {
		tmp = x + ((z * t) / y);
	} else if (z <= 2.7e+150) {
		tmp = t_1;
	} else if (z <= 5.6e+260) {
		tmp = (a - t) / y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / b
	t_2 = t / (b - y)
	tmp = 0
	if z <= -6.6e+237:
		tmp = t_2
	elif z <= -1.35e+135:
		tmp = a / (y - b)
	elif z <= -1.6e-160:
		tmp = t_1
	elif z <= 7e-49:
		tmp = x + ((z * t) / y)
	elif z <= 2.7e+150:
		tmp = t_1
	elif z <= 5.6e+260:
		tmp = (a - t) / y
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / b)
	t_2 = Float64(t / Float64(b - y))
	tmp = 0.0
	if (z <= -6.6e+237)
		tmp = t_2;
	elseif (z <= -1.35e+135)
		tmp = Float64(a / Float64(y - b));
	elseif (z <= -1.6e-160)
		tmp = t_1;
	elseif (z <= 7e-49)
		tmp = Float64(x + Float64(Float64(z * t) / y));
	elseif (z <= 2.7e+150)
		tmp = t_1;
	elseif (z <= 5.6e+260)
		tmp = Float64(Float64(a - t) / y);
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - a) / b;
	t_2 = t / (b - y);
	tmp = 0.0;
	if (z <= -6.6e+237)
		tmp = t_2;
	elseif (z <= -1.35e+135)
		tmp = a / (y - b);
	elseif (z <= -1.6e-160)
		tmp = t_1;
	elseif (z <= 7e-49)
		tmp = x + ((z * t) / y);
	elseif (z <= 2.7e+150)
		tmp = t_1;
	elseif (z <= 5.6e+260)
		tmp = (a - t) / y;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$2 = N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6.6e+237], t$95$2, If[LessEqual[z, -1.35e+135], N[(a / N[(y - b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.6e-160], t$95$1, If[LessEqual[z, 7e-49], N[(x + N[(N[(z * t), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.7e+150], t$95$1, If[LessEqual[z, 5.6e+260], N[(N[(a - t), $MachinePrecision] / y), $MachinePrecision], t$95$2]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if z < -6.6000000000000001e237 or 5.5999999999999996e260 < z

   1. Initial program 31.9%

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

   3. Taylor expanded in x around inf 23.9%

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

   4. Taylor expanded in z around inf 71.3%

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

      1. div-sub 71.4%

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

      2. *-commutative 71.4%

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

   6. Simplified 71.4%

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

   7. Taylor expanded in t around inf 62.4%

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

   if -6.6000000000000001e237 < z < -1.34999999999999992e135

   1. Initial program 19.8%

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

   3. Taylor expanded in a around inf 11.8%

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

      1. mul-1-neg 11.8%

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

      2. distribute-lft-neg-out 11.8%

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

      3. *-commutative 11.8%

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

   5. Simplified 11.8%

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

   6. Taylor expanded in z around inf 69.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{a}{b - y}} \]
   7. Step-by-step derivation

      1. associate-*r/ 69.0%

         \[\leadsto \color{blue}{\frac{-1 \cdot a}{b - y}} \]

      2. mul-1-neg 69.0%

         \[\leadsto \frac{\color{blue}{-a}}{b - y} \]

   8. Simplified 69.0%

      \[\leadsto \color{blue}{\frac{-a}{b - y}} \]

   if -1.34999999999999992e135 < z < -1.60000000000000004e-160 or 7.00000000000000012e-49 < z < 2.70000000000000008e150

   1. Initial program 75.5%

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

   3. Taylor expanded in y around 0 46.9%

      \[\leadsto \color{blue}{\frac{t - a}{b}} \]

   if -1.60000000000000004e-160 < z < 7.00000000000000012e-49

   1. Initial program 86.3%

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

   3. Taylor expanded in y around inf 85.2%

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

      1. associate-/l* 69.4%

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

   5. Simplified 69.4%

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

   6. Taylor expanded in z around 0 58.0%

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

   7. Taylor expanded in a around 0 68.2%

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

   if 2.70000000000000008e150 < z < 5.5999999999999996e260

   1. Initial program 40.8%

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

   3. Taylor expanded in x around inf 31.8%

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

   4. Taylor expanded in z around inf 70.2%

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

      1. div-sub 70.2%

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

      2. *-commutative 70.2%

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

   6. Simplified 70.2%

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

   7. Taylor expanded in b around 0 64.0%

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

      1. associate-*r/ 64.0%

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

      2. mul-1-neg 64.0%

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

   9. Simplified 64.0%

      \[\leadsto \color{blue}{\frac{-\left(t - a\right)}{y}} \]
3. Recombined 5 regimes into one program.

4. Final simplification 59.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+237}:\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{elif}\;z \leq -1.35 \cdot 10^{+135}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-49}:\\ \;\;\;\;x + \frac{z \cdot t}{y}\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{+150}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{+260}:\\ \;\;\;\;\frac{a - t}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 79.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y - z \cdot \left(y - b\right)\\ t_2 := x + \frac{z \cdot \left(t - a\right)}{t\_1}\\ t_3 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -2800000000:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-150}:\\ \;\;\;\;\frac{x \cdot y + z \cdot t}{t\_1}\\ \mathbf{elif}\;z \leq 3800:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (- y (* z (- y b))))
        (t_2 (+ x (/ (* z (- t a)) t_1)))
        (t_3 (/ (- t a) (- b y))))
   (if (<= z -2800000000.0)
     t_3
     (if (<= z 2.45e-254)
       t_2
       (if (<= z 1.1e-150)
         (/ (+ (* x y) (* z t)) t_1)
         (if (<= z 3800.0) t_2 t_3))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = x + ((z * (t - a)) / t_1);
	double t_3 = (t - a) / (b - y);
	double tmp;
	if (z <= -2800000000.0) {
		tmp = t_3;
	} else if (z <= 2.45e-254) {
		tmp = t_2;
	} else if (z <= 1.1e-150) {
		tmp = ((x * y) + (z * t)) / t_1;
	} else if (z <= 3800.0) {
		tmp = t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = y - (z * (y - b))
    t_2 = x + ((z * (t - a)) / t_1)
    t_3 = (t - a) / (b - y)
    if (z <= (-2800000000.0d0)) then
        tmp = t_3
    else if (z <= 2.45d-254) then
        tmp = t_2
    else if (z <= 1.1d-150) then
        tmp = ((x * y) + (z * t)) / t_1
    else if (z <= 3800.0d0) then
        tmp = t_2
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y - (z * (y - b));
	double t_2 = x + ((z * (t - a)) / t_1);
	double t_3 = (t - a) / (b - y);
	double tmp;
	if (z <= -2800000000.0) {
		tmp = t_3;
	} else if (z <= 2.45e-254) {
		tmp = t_2;
	} else if (z <= 1.1e-150) {
		tmp = ((x * y) + (z * t)) / t_1;
	} else if (z <= 3800.0) {
		tmp = t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = y - (z * (y - b))
	t_2 = x + ((z * (t - a)) / t_1)
	t_3 = (t - a) / (b - y)
	tmp = 0
	if z <= -2800000000.0:
		tmp = t_3
	elif z <= 2.45e-254:
		tmp = t_2
	elif z <= 1.1e-150:
		tmp = ((x * y) + (z * t)) / t_1
	elif z <= 3800.0:
		tmp = t_2
	else:
		tmp = t_3
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(y - Float64(z * Float64(y - b)))
	t_2 = Float64(x + Float64(Float64(z * Float64(t - a)) / t_1))
	t_3 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -2800000000.0)
		tmp = t_3;
	elseif (z <= 2.45e-254)
		tmp = t_2;
	elseif (z <= 1.1e-150)
		tmp = Float64(Float64(Float64(x * y) + Float64(z * t)) / t_1);
	elseif (z <= 3800.0)
		tmp = t_2;
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y - (z * (y - b));
	t_2 = x + ((z * (t - a)) / t_1);
	t_3 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -2800000000.0)
		tmp = t_3;
	elseif (z <= 2.45e-254)
		tmp = t_2;
	elseif (z <= 1.1e-150)
		tmp = ((x * y) + (z * t)) / t_1;
	elseif (z <= 3800.0)
		tmp = t_2;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2800000000.0], t$95$3, If[LessEqual[z, 2.45e-254], t$95$2, If[LessEqual[z, 1.1e-150], N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[z, 3800.0], t$95$2, t$95$3]]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.8e9 or 3800 < z

   1. Initial program 43.3%

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

   3. Taylor expanded in z around inf 83.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -2.8e9 < z < 2.4499999999999999e-254 or 1.1e-150 < z < 3800

   1. Initial program 87.6%

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

   3. Taylor expanded in x around 0 87.6%

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

   4. Taylor expanded in z around 0 84.3%

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

   if 2.4499999999999999e-254 < z < 1.1e-150

   1. Initial program 91.7%

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

   3. Taylor expanded in a around 0 83.8%

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

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2800000000:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{elif}\;z \leq 2.45 \cdot 10^{-254}:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-150}:\\ \;\;\;\;\frac{x \cdot y + z \cdot t}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 3800:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 71.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := z \cdot \left(t - a\right)\\ t_2 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -135000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160}:\\ \;\;\;\;\frac{t\_1}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-48}:\\ \;\;\;\;x \cdot \left(\frac{t\_1}{x \cdot y} + 1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* z (- t a))) (t_2 (/ (- t a) (- b y))))
   (if (<= z -135000000000.0)
     t_2
     (if (<= z -1.6e-160)
       (/ t_1 (- y (* z (- y b))))
       (if (<= z 7e-48) (* x (+ (/ t_1 (* x y)) 1.0)) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = z * (t - a);
	double t_2 = (t - a) / (b - y);
	double tmp;
	if (z <= -135000000000.0) {
		tmp = t_2;
	} else if (z <= -1.6e-160) {
		tmp = t_1 / (y - (z * (y - b)));
	} else if (z <= 7e-48) {
		tmp = x * ((t_1 / (x * y)) + 1.0);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = z * (t - a)
    t_2 = (t - a) / (b - y)
    if (z <= (-135000000000.0d0)) then
        tmp = t_2
    else if (z <= (-1.6d-160)) then
        tmp = t_1 / (y - (z * (y - b)))
    else if (z <= 7d-48) then
        tmp = x * ((t_1 / (x * y)) + 1.0d0)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = z * (t - a);
	double t_2 = (t - a) / (b - y);
	double tmp;
	if (z <= -135000000000.0) {
		tmp = t_2;
	} else if (z <= -1.6e-160) {
		tmp = t_1 / (y - (z * (y - b)));
	} else if (z <= 7e-48) {
		tmp = x * ((t_1 / (x * y)) + 1.0);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = z * (t - a)
	t_2 = (t - a) / (b - y)
	tmp = 0
	if z <= -135000000000.0:
		tmp = t_2
	elif z <= -1.6e-160:
		tmp = t_1 / (y - (z * (y - b)))
	elif z <= 7e-48:
		tmp = x * ((t_1 / (x * y)) + 1.0)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(z * Float64(t - a))
	t_2 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -135000000000.0)
		tmp = t_2;
	elseif (z <= -1.6e-160)
		tmp = Float64(t_1 / Float64(y - Float64(z * Float64(y - b))));
	elseif (z <= 7e-48)
		tmp = Float64(x * Float64(Float64(t_1 / Float64(x * y)) + 1.0));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = z * (t - a);
	t_2 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -135000000000.0)
		tmp = t_2;
	elseif (z <= -1.6e-160)
		tmp = t_1 / (y - (z * (y - b)));
	elseif (z <= 7e-48)
		tmp = x * ((t_1 / (x * y)) + 1.0);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -135000000000.0], t$95$2, If[LessEqual[z, -1.6e-160], N[(t$95$1 / N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7e-48], N[(x * N[(N[(t$95$1 / N[(x * y), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.35e11 or 6.99999999999999982e-48 < z

   1. Initial program 46.7%

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

   3. Taylor expanded in z around inf 80.3%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -1.35e11 < z < -1.60000000000000004e-160

   1. Initial program 96.2%

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

   3. Taylor expanded in x around 0 77.2%

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

   if -1.60000000000000004e-160 < z < 6.99999999999999982e-48

   1. Initial program 86.3%

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

   3. Taylor expanded in y around inf 85.2%

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

      1. associate-/l* 69.4%

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

   5. Simplified 69.4%

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

   6. Taylor expanded in z around 0 58.0%

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

   7. Taylor expanded in x around inf 70.0%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -135000000000:\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160}:\\ \;\;\;\;\frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-48}:\\ \;\;\;\;x \cdot \left(\frac{z \cdot \left(t - a\right)}{x \cdot y} + 1\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{t - a}{b - y}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 41.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{b - y}\\ \mathbf{if}\;z \leq -5.6 \cdot 10^{+186}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -3.8 \cdot 10^{+64}:\\ \;\;\;\;\frac{a}{-b}\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160} \lor \neg \left(z \leq 1.55 \cdot 10^{-43}\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ t (- b y))))
   (if (<= z -5.6e+186)
     t_1
     (if (<= z -3.8e+64)
       (/ a (- b))
       (if (or (<= z -1.6e-160) (not (<= z 1.55e-43))) t_1 x)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = t / (b - y);
	double tmp;
	if (z <= -5.6e+186) {
		tmp = t_1;
	} else if (z <= -3.8e+64) {
		tmp = a / -b;
	} else if ((z <= -1.6e-160) || !(z <= 1.55e-43)) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = t / (b - y)
    if (z <= (-5.6d+186)) then
        tmp = t_1
    else if (z <= (-3.8d+64)) then
        tmp = a / -b
    else if ((z <= (-1.6d-160)) .or. (.not. (z <= 1.55d-43))) then
        tmp = t_1
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = t / (b - y);
	double tmp;
	if (z <= -5.6e+186) {
		tmp = t_1;
	} else if (z <= -3.8e+64) {
		tmp = a / -b;
	} else if ((z <= -1.6e-160) || !(z <= 1.55e-43)) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = t / (b - y)
	tmp = 0
	if z <= -5.6e+186:
		tmp = t_1
	elif z <= -3.8e+64:
		tmp = a / -b
	elif (z <= -1.6e-160) or not (z <= 1.55e-43):
		tmp = t_1
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(t / Float64(b - y))
	tmp = 0.0
	if (z <= -5.6e+186)
		tmp = t_1;
	elseif (z <= -3.8e+64)
		tmp = Float64(a / Float64(-b));
	elseif ((z <= -1.6e-160) || !(z <= 1.55e-43))
		tmp = t_1;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = t / (b - y);
	tmp = 0.0;
	if (z <= -5.6e+186)
		tmp = t_1;
	elseif (z <= -3.8e+64)
		tmp = a / -b;
	elseif ((z <= -1.6e-160) || ~((z <= 1.55e-43)))
		tmp = t_1;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.6e+186], t$95$1, If[LessEqual[z, -3.8e+64], N[(a / (-b)), $MachinePrecision], If[Or[LessEqual[z, -1.6e-160], N[Not[LessEqual[z, 1.55e-43]], $MachinePrecision]], t$95$1, x]]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.60000000000000037e186 or -3.8000000000000001e64 < z < -1.60000000000000004e-160 or 1.55e-43 < z

   1. Initial program 55.4%

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

   3. Taylor expanded in x around inf 49.8%

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

   4. Taylor expanded in z around inf 61.4%

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

      1. div-sub 62.1%

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

      2. *-commutative 62.1%

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

   6. Simplified 62.1%

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

   7. Taylor expanded in t around inf 44.4%

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

   if -5.60000000000000037e186 < z < -3.8000000000000001e64

   1. Initial program 52.9%

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

   3. Taylor expanded in a around inf 28.8%

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

      1. mul-1-neg 28.8%

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

      2. distribute-lft-neg-out 28.8%

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

      3. *-commutative 28.8%

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

   5. Simplified 28.8%

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

   6. Taylor expanded in y around 0 36.7%

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

      1. associate-*r/ 36.7%

         \[\leadsto \color{blue}{\frac{-1 \cdot a}{b}} \]

      2. mul-1-neg 36.7%

         \[\leadsto \frac{\color{blue}{-a}}{b} \]

   8. Simplified 36.7%

      \[\leadsto \color{blue}{\frac{-a}{b}} \]

   if -1.60000000000000004e-160 < z < 1.55e-43

   1. Initial program 86.3%

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

   3. Taylor expanded in z around 0 51.8%

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

4. Final simplification 46.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.6 \cdot 10^{+186}:\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{elif}\;z \leq -3.8 \cdot 10^{+64}:\\ \;\;\;\;\frac{a}{-b}\\ \mathbf{elif}\;z \leq -1.6 \cdot 10^{-160} \lor \neg \left(z \leq 1.55 \cdot 10^{-43}\right):\\ \;\;\;\;\frac{t}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 80.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4600000000 \lor \neg \left(z \leq 24000\right):\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z \cdot \left(t - a\right)}{y - z \cdot \left(y - b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -4600000000.0) (not (<= z 24000.0)))
   (/ (- t a) (- b y))
   (+ x (/ (* z (- t a)) (- y (* z (- y b)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -4600000000.0) || !(z <= 24000.0)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * (t - a)) / (y - (z * (y - b))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-4600000000.0d0)) .or. (.not. (z <= 24000.0d0))) then
        tmp = (t - a) / (b - y)
    else
        tmp = x + ((z * (t - a)) / (y - (z * (y - b))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -4600000000.0) || !(z <= 24000.0)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * (t - a)) / (y - (z * (y - b))));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -4600000000.0) or not (z <= 24000.0):
		tmp = (t - a) / (b - y)
	else:
		tmp = x + ((z * (t - a)) / (y - (z * (y - b))))
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -4600000000.0) || !(z <= 24000.0))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(x + Float64(Float64(z * Float64(t - a)) / Float64(y - Float64(z * Float64(y - b)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -4600000000.0) || ~((z <= 24000.0)))
		tmp = (t - a) / (b - y);
	else
		tmp = x + ((z * (t - a)) / (y - (z * (y - b))));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -4600000000.0], N[Not[LessEqual[z, 24000.0]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(y - N[(z * N[(y - b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.6e9 or 24000 < z

   1. Initial program 43.3%

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

   3. Taylor expanded in z around inf 83.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -4.6e9 < z < 24000

   1. Initial program 88.4%

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

   3. Taylor expanded in x around 0 88.4%

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

   4. Taylor expanded in z around 0 79.7%

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

4. Final simplification 81.7%

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

Alternative 13: 69.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.6e-160) (not (<= z 5e-43)))
   (/ (- t a) (- b y))
   (* x (+ (/ (* z (- t a)) (* x y)) 1.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e-160) || !(z <= 5e-43)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x * (((z * (t - a)) / (x * y)) + 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.6d-160)) .or. (.not. (z <= 5d-43))) then
        tmp = (t - a) / (b - y)
    else
        tmp = x * (((z * (t - a)) / (x * y)) + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e-160) || !(z <= 5e-43)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x * (((z * (t - a)) / (x * y)) + 1.0);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.6e-160) or not (z <= 5e-43):
		tmp = (t - a) / (b - y)
	else:
		tmp = x * (((z * (t - a)) / (x * y)) + 1.0)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.6e-160) || !(z <= 5e-43))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(x * Float64(Float64(Float64(z * Float64(t - a)) / Float64(x * y)) + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.6e-160) || ~((z <= 5e-43)))
		tmp = (t - a) / (b - y);
	else
		tmp = x * (((z * (t - a)) / (x * y)) + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.6e-160], N[Not[LessEqual[z, 5e-43]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(x * y), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.60000000000000004e-160 or 5.00000000000000019e-43 < z

   1. Initial program 55.0%

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

   3. Taylor expanded in z around inf 75.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -1.60000000000000004e-160 < z < 5.00000000000000019e-43

   1. Initial program 86.3%

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

   3. Taylor expanded in y around inf 85.2%

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

      1. associate-/l* 69.4%

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

   5. Simplified 69.4%

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

   6. Taylor expanded in z around 0 58.0%

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

   7. Taylor expanded in x around inf 70.0%

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

4. Final simplification 73.8%

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

Alternative 14: 53.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{1 - z}\\ \mathbf{if}\;y \leq -1.25 \cdot 10^{+60}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -2.1 \cdot 10^{-105}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{+46}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ x (- 1.0 z))))
   (if (<= y -1.25e+60)
     t_1
     (if (<= y -2.1e-105)
       (/ a (- y b))
       (if (<= y 2.8e+46) (/ (- t a) b) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 - z);
	double tmp;
	if (y <= -1.25e+60) {
		tmp = t_1;
	} else if (y <= -2.1e-105) {
		tmp = a / (y - b);
	} else if (y <= 2.8e+46) {
		tmp = (t - a) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x / (1.0d0 - z)
    if (y <= (-1.25d+60)) then
        tmp = t_1
    else if (y <= (-2.1d-105)) then
        tmp = a / (y - b)
    else if (y <= 2.8d+46) then
        tmp = (t - a) / b
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = x / (1.0 - z);
	double tmp;
	if (y <= -1.25e+60) {
		tmp = t_1;
	} else if (y <= -2.1e-105) {
		tmp = a / (y - b);
	} else if (y <= 2.8e+46) {
		tmp = (t - a) / b;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = x / (1.0 - z)
	tmp = 0
	if y <= -1.25e+60:
		tmp = t_1
	elif y <= -2.1e-105:
		tmp = a / (y - b)
	elif y <= 2.8e+46:
		tmp = (t - a) / b
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(x / Float64(1.0 - z))
	tmp = 0.0
	if (y <= -1.25e+60)
		tmp = t_1;
	elseif (y <= -2.1e-105)
		tmp = Float64(a / Float64(y - b));
	elseif (y <= 2.8e+46)
		tmp = Float64(Float64(t - a) / b);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = x / (1.0 - z);
	tmp = 0.0;
	if (y <= -1.25e+60)
		tmp = t_1;
	elseif (y <= -2.1e-105)
		tmp = a / (y - b);
	elseif (y <= 2.8e+46)
		tmp = (t - a) / b;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(x / N[(1.0 - z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.25e+60], t$95$1, If[LessEqual[y, -2.1e-105], N[(a / N[(y - b), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.8e+46], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.24999999999999994e60 or 2.80000000000000018e46 < y

   1. Initial program 44.3%

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

   3. Taylor expanded in y around inf 48.1%

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

      1. mul-1-neg 48.1%

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

      2. unsub-neg 48.1%

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

   5. Simplified 48.1%

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

   if -1.24999999999999994e60 < y < -2.1e-105

   1. Initial program 73.4%

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

   3. Taylor expanded in a around inf 31.6%

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

      1. mul-1-neg 31.6%

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

      2. distribute-lft-neg-out 31.6%

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

      3. *-commutative 31.6%

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

   5. Simplified 31.6%

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

   6. Taylor expanded in z around inf 44.7%

      \[\leadsto \color{blue}{-1 \cdot \frac{a}{b - y}} \]
   7. Step-by-step derivation

      1. associate-*r/ 44.7%

         \[\leadsto \color{blue}{\frac{-1 \cdot a}{b - y}} \]

      2. mul-1-neg 44.7%

         \[\leadsto \frac{\color{blue}{-a}}{b - y} \]

   8. Simplified 44.7%

      \[\leadsto \color{blue}{\frac{-a}{b - y}} \]

   if -2.1e-105 < y < 2.80000000000000018e46

   1. Initial program 79.2%

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

   3. Taylor expanded in y around 0 58.7%

      \[\leadsto \color{blue}{\frac{t - a}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 52.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{+60}:\\ \;\;\;\;\frac{x}{1 - z}\\ \mathbf{elif}\;y \leq -2.1 \cdot 10^{-105}:\\ \;\;\;\;\frac{a}{y - b}\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{+46}:\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{1 - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 33.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+45}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq -5.7 \cdot 10^{-208}:\\ \;\;\;\;\frac{a}{-b}\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+37}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -5.8e+45)
   x
   (if (<= y -5.7e-208) (/ a (- b)) (if (<= y 5.8e+37) (/ t b) x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -5.8e+45) {
		tmp = x;
	} else if (y <= -5.7e-208) {
		tmp = a / -b;
	} else if (y <= 5.8e+37) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y <= (-5.8d+45)) then
        tmp = x
    else if (y <= (-5.7d-208)) then
        tmp = a / -b
    else if (y <= 5.8d+37) then
        tmp = t / b
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -5.8e+45) {
		tmp = x;
	} else if (y <= -5.7e-208) {
		tmp = a / -b;
	} else if (y <= 5.8e+37) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -5.8e+45:
		tmp = x
	elif y <= -5.7e-208:
		tmp = a / -b
	elif y <= 5.8e+37:
		tmp = t / b
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -5.8e+45)
		tmp = x;
	elseif (y <= -5.7e-208)
		tmp = Float64(a / Float64(-b));
	elseif (y <= 5.8e+37)
		tmp = Float64(t / b);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -5.8e+45)
		tmp = x;
	elseif (y <= -5.7e-208)
		tmp = a / -b;
	elseif (y <= 5.8e+37)
		tmp = t / b;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -5.8e+45], x, If[LessEqual[y, -5.7e-208], N[(a / (-b)), $MachinePrecision], If[LessEqual[y, 5.8e+37], N[(t / b), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.7999999999999994e45 or 5.79999999999999957e37 < y

   1. Initial program 44.3%

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

   3. Taylor expanded in z around 0 37.6%

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

   if -5.7999999999999994e45 < y < -5.7000000000000004e-208

   1. Initial program 81.7%

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

   3. Taylor expanded in a around inf 36.5%

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

      1. mul-1-neg 36.5%

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

      2. distribute-lft-neg-out 36.5%

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

      3. *-commutative 36.5%

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

   5. Simplified 36.5%

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

   6. Taylor expanded in y around 0 30.4%

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

      1. associate-*r/ 30.4%

         \[\leadsto \color{blue}{\frac{-1 \cdot a}{b}} \]

      2. mul-1-neg 30.4%

         \[\leadsto \frac{\color{blue}{-a}}{b} \]

   8. Simplified 30.4%

      \[\leadsto \color{blue}{\frac{-a}{b}} \]

   if -5.7000000000000004e-208 < y < 5.79999999999999957e37

   1. Initial program 78.2%

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

   3. Taylor expanded in x around inf 60.1%

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

   4. Taylor expanded in b around inf 55.2%

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

   5. Taylor expanded in t around inf 41.0%

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

4. Final simplification 37.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{+45}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq -5.7 \cdot 10^{-208}:\\ \;\;\;\;\frac{a}{-b}\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+37}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 67.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.6 \cdot 10^{-160} \lor \neg \left(z \leq 4.6 \cdot 10^{-48}\right):\\ \;\;\;\;\frac{t - a}{b - y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{z \cdot t}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= z -1.6e-160) (not (<= z 4.6e-48)))
   (/ (- t a) (- b y))
   (+ x (/ (* z t) y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e-160) || !(z <= 4.6e-48)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * t) / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((z <= (-1.6d-160)) .or. (.not. (z <= 4.6d-48))) then
        tmp = (t - a) / (b - y)
    else
        tmp = x + ((z * t) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((z <= -1.6e-160) || !(z <= 4.6e-48)) {
		tmp = (t - a) / (b - y);
	} else {
		tmp = x + ((z * t) / y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (z <= -1.6e-160) or not (z <= 4.6e-48):
		tmp = (t - a) / (b - y)
	else:
		tmp = x + ((z * t) / y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((z <= -1.6e-160) || !(z <= 4.6e-48))
		tmp = Float64(Float64(t - a) / Float64(b - y));
	else
		tmp = Float64(x + Float64(Float64(z * t) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((z <= -1.6e-160) || ~((z <= 4.6e-48)))
		tmp = (t - a) / (b - y);
	else
		tmp = x + ((z * t) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -1.6e-160], N[Not[LessEqual[z, 4.6e-48]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z * t), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.60000000000000004e-160 or 4.6000000000000001e-48 < z

   1. Initial program 55.0%

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

   3. Taylor expanded in z around inf 75.7%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -1.60000000000000004e-160 < z < 4.6000000000000001e-48

   1. Initial program 86.3%

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

   3. Taylor expanded in y around inf 85.2%

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

      1. associate-/l* 69.4%

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

   5. Simplified 69.4%

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

   6. Taylor expanded in z around 0 58.0%

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

   7. Taylor expanded in a around 0 68.2%

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

4. Final simplification 73.2%

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

Alternative 17: 42.8% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -8.2e+108) (not (<= y 4.6e+37))) (/ x (- 1.0 z)) (/ t (- b y))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -8.2e+108) || !(y <= 4.6e+37)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = t / (b - y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-8.2d+108)) .or. (.not. (y <= 4.6d+37))) then
        tmp = x / (1.0d0 - z)
    else
        tmp = t / (b - y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -8.2e+108) || !(y <= 4.6e+37)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = t / (b - y);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -8.2e+108) or not (y <= 4.6e+37):
		tmp = x / (1.0 - z)
	else:
		tmp = t / (b - y)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -8.2e+108) || !(y <= 4.6e+37))
		tmp = Float64(x / Float64(1.0 - z));
	else
		tmp = Float64(t / Float64(b - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -8.2e+108) || ~((y <= 4.6e+37)))
		tmp = x / (1.0 - z);
	else
		tmp = t / (b - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -8.2e+108], N[Not[LessEqual[y, 4.6e+37]], $MachinePrecision]], N[(x / N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(t / N[(b - y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -8.1999999999999998e108 or 4.60000000000000005e37 < y

   1. Initial program 43.9%

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

   3. Taylor expanded in y around inf 49.9%

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

      1. mul-1-neg 49.9%

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

      2. unsub-neg 49.9%

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

   5. Simplified 49.9%

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

   if -8.1999999999999998e108 < y < 4.60000000000000005e37

   1. Initial program 77.3%

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

   3. Taylor expanded in x around inf 64.1%

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

   4. Taylor expanded in z around inf 54.3%

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

      1. div-sub 55.0%

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

      2. *-commutative 55.0%

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

   6. Simplified 55.0%

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

   7. Taylor expanded in t around inf 39.1%

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

4. Final simplification 43.0%

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

Alternative 18: 54.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= y -1.35e+46) (not (<= y 5.2e+47))) (/ x (- 1.0 z)) (/ (- t a) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -1.35e+46) || !(y <= 5.2e+47)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = (t - a) / b;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((y <= (-1.35d+46)) .or. (.not. (y <= 5.2d+47))) then
        tmp = x / (1.0d0 - z)
    else
        tmp = (t - a) / b
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y <= -1.35e+46) || !(y <= 5.2e+47)) {
		tmp = x / (1.0 - z);
	} else {
		tmp = (t - a) / b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (y <= -1.35e+46) or not (y <= 5.2e+47):
		tmp = x / (1.0 - z)
	else:
		tmp = (t - a) / b
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((y <= -1.35e+46) || !(y <= 5.2e+47))
		tmp = Float64(x / Float64(1.0 - z));
	else
		tmp = Float64(Float64(t - a) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y <= -1.35e+46) || ~((y <= 5.2e+47)))
		tmp = x / (1.0 - z);
	else
		tmp = (t - a) / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[y, -1.35e+46], N[Not[LessEqual[y, 5.2e+47]], $MachinePrecision]], N[(x / N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3500000000000001e46 or 5.20000000000000007e47 < y

   1. Initial program 43.9%

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

   3. Taylor expanded in y around inf 47.6%

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

      1. mul-1-neg 47.6%

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

      2. unsub-neg 47.6%

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

   5. Simplified 47.6%

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

   if -1.3500000000000001e46 < y < 5.20000000000000007e47

   1. Initial program 78.3%

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

   3. Taylor expanded in y around 0 52.9%

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

4. Final simplification 50.9%

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

Alternative 19: 41.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.8 \cdot 10^{-5} \lor \neg \left(b \leq 3.6 \cdot 10^{-29}\right):\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - t}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -2.8e-5) (not (<= b 3.6e-29))) (/ (- t a) b) (/ (- a t) y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.8e-5) || !(b <= 3.6e-29)) {
		tmp = (t - a) / b;
	} else {
		tmp = (a - t) / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b <= (-2.8d-5)) .or. (.not. (b <= 3.6d-29))) then
        tmp = (t - a) / b
    else
        tmp = (a - t) / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.8e-5) || !(b <= 3.6e-29)) {
		tmp = (t - a) / b;
	} else {
		tmp = (a - t) / y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.8e-5) or not (b <= 3.6e-29):
		tmp = (t - a) / b
	else:
		tmp = (a - t) / y
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -2.8e-5) || !(b <= 3.6e-29))
		tmp = Float64(Float64(t - a) / b);
	else
		tmp = Float64(Float64(a - t) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -2.8e-5) || ~((b <= 3.6e-29)))
		tmp = (t - a) / b;
	else
		tmp = (a - t) / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.8e-5], N[Not[LessEqual[b, 3.6e-29]], $MachinePrecision]], N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision], N[(N[(a - t), $MachinePrecision] / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.79999999999999996e-5 or 3.59999999999999974e-29 < b

   1. Initial program 62.1%

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

   3. Taylor expanded in y around 0 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b}} \]

   if -2.79999999999999996e-5 < b < 3.59999999999999974e-29

   1. Initial program 69.0%

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

   3. Taylor expanded in x around inf 65.3%

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

   4. Taylor expanded in z around inf 44.5%

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

      1. div-sub 45.4%

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

      2. *-commutative 45.4%

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

   6. Simplified 45.4%

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

   7. Taylor expanded in b around 0 44.7%

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

      1. associate-*r/ 44.7%

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

      2. mul-1-neg 44.7%

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

   9. Simplified 44.7%

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

4. Final simplification 48.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.8 \cdot 10^{-5} \lor \neg \left(b \leq 3.6 \cdot 10^{-29}\right):\\ \;\;\;\;\frac{t - a}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{a - t}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 20: 34.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.85 \cdot 10^{-29}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 6 \cdot 10^{+37}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.85e-29) x (if (<= y 6e+37) (/ t b) x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.85e-29) {
		tmp = x;
	} else if (y <= 6e+37) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (y <= (-1.85d-29)) then
        tmp = x
    else if (y <= 6d+37) then
        tmp = t / b
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.85e-29) {
		tmp = x;
	} else if (y <= 6e+37) {
		tmp = t / b;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.85e-29:
		tmp = x
	elif y <= 6e+37:
		tmp = t / b
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.85e-29)
		tmp = x;
	elseif (y <= 6e+37)
		tmp = Float64(t / b);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1.85e-29)
		tmp = x;
	elseif (y <= 6e+37)
		tmp = t / b;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1.85e-29], x, If[LessEqual[y, 6e+37], N[(t / b), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -1.8499999999999999e-29 or 6.00000000000000043e37 < y

   1. Initial program 49.7%

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

   3. Taylor expanded in z around 0 34.7%

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

   if -1.8499999999999999e-29 < y < 6.00000000000000043e37

   1. Initial program 79.5%

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

   3. Taylor expanded in x around inf 62.7%

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

   4. Taylor expanded in b around inf 55.2%

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

   5. Taylor expanded in t around inf 36.3%

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

4. Final simplification 35.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.85 \cdot 10^{-29}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 6 \cdot 10^{+37}:\\ \;\;\;\;\frac{t}{b}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 21: 25.5% accurate, 17.0× speedup

Math

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

FPCore

(FPCore (x y z t a b) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y, z, t, a, b):
	return x

Julia

function code(x, y, z, t, a, b)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := x

Derivation

1. Initial program 65.3%

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

3. Taylor expanded in z around 0 21.0%

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

4. Final simplification 21.0%

   \[\leadsto x \]
5. Add Preprocessing

Developer target: 73.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024079 
(FPCore (x y z t a b)
  :name "Development.Shake.Progress:decay from shake-0.15.5"
  :precision binary64

  :alt
  (- (/ (+ (* z t) (* y x)) (+ y (* z (- b y)))) (/ a (+ (- b y) (/ y z))))

  (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))