Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F

Percentage Accurate: 93.4% → 99.4%

Time: 13.0s

Alternatives: 12

Speedup: 0.6×

• 24.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = x - ((y * (z - t)) / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 93.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = x - ((y * (z - t)) / a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \left(z - t\right)\\ \mathbf{if}\;t\_1 \leq -4 \cdot 10^{+242}:\\ \;\;\;\;x + \frac{t - z}{\frac{a}{y}}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+216}:\\ \;\;\;\;x - \frac{t\_1}{a}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{t - z}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* y (- z t))))
   (if (<= t_1 -4e+242)
     (+ x (/ (- t z) (/ a y)))
     (if (<= t_1 2e+216) (- x (/ t_1 a)) (+ x (* y (/ (- t z) a)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if (t_1 <= -4e+242) {
		tmp = x + ((t - z) / (a / y));
	} else if (t_1 <= 2e+216) {
		tmp = x - (t_1 / a);
	} else {
		tmp = x + (y * ((t - z) / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: tmp
    t_1 = y * (z - t)
    if (t_1 <= (-4d+242)) then
        tmp = x + ((t - z) / (a / y))
    else if (t_1 <= 2d+216) then
        tmp = x - (t_1 / a)
    else
        tmp = x + (y * ((t - z) / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if (t_1 <= -4e+242) {
		tmp = x + ((t - z) / (a / y));
	} else if (t_1 <= 2e+216) {
		tmp = x - (t_1 / a);
	} else {
		tmp = x + (y * ((t - z) / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = y * (z - t)
	tmp = 0
	if t_1 <= -4e+242:
		tmp = x + ((t - z) / (a / y))
	elif t_1 <= 2e+216:
		tmp = x - (t_1 / a)
	else:
		tmp = x + (y * ((t - z) / a))
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y * Float64(z - t))
	tmp = 0.0
	if (t_1 <= -4e+242)
		tmp = Float64(x + Float64(Float64(t - z) / Float64(a / y)));
	elseif (t_1 <= 2e+216)
		tmp = Float64(x - Float64(t_1 / a));
	else
		tmp = Float64(x + Float64(y * Float64(Float64(t - z) / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = y * (z - t);
	tmp = 0.0;
	if (t_1 <= -4e+242)
		tmp = x + ((t - z) / (a / y));
	elseif (t_1 <= 2e+216)
		tmp = x - (t_1 / a);
	else
		tmp = x + (y * ((t - z) / a));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 y (-.f64 z t)) < -4.0000000000000002e242

   1. Initial program 67.5%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in y around 0 67.5%

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

      1. *-lft-identity 67.5%

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

      2. associate-*l/ 67.6%

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

      3. associate-*r* 99.7%

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

      4. associate-/r/ 99.9%

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

      5. associate-*l/ 100.0%

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

      6. *-lft-identity 100.0%

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

   7. Simplified 100.0%

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

   if -4.0000000000000002e242 < (*.f64 y (-.f64 z t)) < 2e216

   1. Initial program 99.9%

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

   if 2e216 < (*.f64 y (-.f64 z t))

   1. Initial program 89.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

   3. Simplified 100.0%

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

4. Final simplification 99.9%

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

Alternative 2: 49.8% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{\frac{a}{y}}\\ t_2 := y \cdot \frac{-z}{a}\\ \mathbf{if}\;a \leq -8.5 \cdot 10^{+22}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -1.15 \cdot 10^{-47}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-74}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 7 \cdot 10^{-247}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{-183}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq 1.3 \cdot 10^{-138}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.2 \cdot 10^{-87}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq 1.45:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ t (/ a y))) (t_2 (* y (/ (- z) a))))
   (if (<= a -8.5e+22)
     x
     (if (<= a -1.15e-47)
       (* t (/ y a))
       (if (<= a -8e-74)
         x
         (if (<= a 7e-247)
           t_1
           (if (<= a 1.4e-183)
             t_2
             (if (<= a 1.3e-138)
               t_1
               (if (<= a 1.2e-87) t_2 (if (<= a 1.45) t_1 x))))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t / (a / y);
	double t_2 = y * (-z / a);
	double tmp;
	if (a <= -8.5e+22) {
		tmp = x;
	} else if (a <= -1.15e-47) {
		tmp = t * (y / a);
	} else if (a <= -8e-74) {
		tmp = x;
	} else if (a <= 7e-247) {
		tmp = t_1;
	} else if (a <= 1.4e-183) {
		tmp = t_2;
	} else if (a <= 1.3e-138) {
		tmp = t_1;
	} else if (a <= 1.2e-87) {
		tmp = t_2;
	} else if (a <= 1.45) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = t / (a / y)
    t_2 = y * (-z / a)
    if (a <= (-8.5d+22)) then
        tmp = x
    else if (a <= (-1.15d-47)) then
        tmp = t * (y / a)
    else if (a <= (-8d-74)) then
        tmp = x
    else if (a <= 7d-247) then
        tmp = t_1
    else if (a <= 1.4d-183) then
        tmp = t_2
    else if (a <= 1.3d-138) then
        tmp = t_1
    else if (a <= 1.2d-87) then
        tmp = t_2
    else if (a <= 1.45d0) 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 t_1 = t / (a / y);
	double t_2 = y * (-z / a);
	double tmp;
	if (a <= -8.5e+22) {
		tmp = x;
	} else if (a <= -1.15e-47) {
		tmp = t * (y / a);
	} else if (a <= -8e-74) {
		tmp = x;
	} else if (a <= 7e-247) {
		tmp = t_1;
	} else if (a <= 1.4e-183) {
		tmp = t_2;
	} else if (a <= 1.3e-138) {
		tmp = t_1;
	} else if (a <= 1.2e-87) {
		tmp = t_2;
	} else if (a <= 1.45) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t / (a / y)
	t_2 = y * (-z / a)
	tmp = 0
	if a <= -8.5e+22:
		tmp = x
	elif a <= -1.15e-47:
		tmp = t * (y / a)
	elif a <= -8e-74:
		tmp = x
	elif a <= 7e-247:
		tmp = t_1
	elif a <= 1.4e-183:
		tmp = t_2
	elif a <= 1.3e-138:
		tmp = t_1
	elif a <= 1.2e-87:
		tmp = t_2
	elif a <= 1.45:
		tmp = t_1
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t / Float64(a / y))
	t_2 = Float64(y * Float64(Float64(-z) / a))
	tmp = 0.0
	if (a <= -8.5e+22)
		tmp = x;
	elseif (a <= -1.15e-47)
		tmp = Float64(t * Float64(y / a));
	elseif (a <= -8e-74)
		tmp = x;
	elseif (a <= 7e-247)
		tmp = t_1;
	elseif (a <= 1.4e-183)
		tmp = t_2;
	elseif (a <= 1.3e-138)
		tmp = t_1;
	elseif (a <= 1.2e-87)
		tmp = t_2;
	elseif (a <= 1.45)
		tmp = t_1;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t / (a / y);
	t_2 = y * (-z / a);
	tmp = 0.0;
	if (a <= -8.5e+22)
		tmp = x;
	elseif (a <= -1.15e-47)
		tmp = t * (y / a);
	elseif (a <= -8e-74)
		tmp = x;
	elseif (a <= 7e-247)
		tmp = t_1;
	elseif (a <= 1.4e-183)
		tmp = t_2;
	elseif (a <= 1.3e-138)
		tmp = t_1;
	elseif (a <= 1.2e-87)
		tmp = t_2;
	elseif (a <= 1.45)
		tmp = t_1;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[((-z) / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -8.5e+22], x, If[LessEqual[a, -1.15e-47], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -8e-74], x, If[LessEqual[a, 7e-247], t$95$1, If[LessEqual[a, 1.4e-183], t$95$2, If[LessEqual[a, 1.3e-138], t$95$1, If[LessEqual[a, 1.2e-87], t$95$2, If[LessEqual[a, 1.45], t$95$1, x]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -8.49999999999999979e22 or -1.14999999999999991e-47 < a < -7.99999999999999966e-74 or 1.44999999999999996 < a

   1. Initial program 91.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around inf 81.2%

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

      1. associate-/l* 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 68.1%

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

   if -8.49999999999999979e22 < a < -1.14999999999999991e-47

   1. Initial program 99.7%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 70.6%

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

      1. associate-*r/ 70.6%

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

      2. mul-1-neg 70.6%

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

      3. distribute-lft-neg-out 70.6%

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

      4. *-commutative 70.6%

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

      5. associate-/l* 70.9%

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

      6. distribute-neg-frac 70.9%

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

      7. distribute-neg-frac2 70.9%

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

   7. Simplified 70.9%

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

   8. Taylor expanded in x around 0 51.6%

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

      1. associate-*r/ 51.9%

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

   10. Simplified 51.9%

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

   if -7.99999999999999966e-74 < a < 6.9999999999999998e-247 or 1.39999999999999992e-183 < a < 1.3e-138 or 1.2e-87 < a < 1.44999999999999996

   1. Initial program 99.8%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 87.9%

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

   3. Simplified 87.9%

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

   5. Taylor expanded in z around 0 73.8%

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

      1. associate-*r/ 73.8%

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

      2. mul-1-neg 73.8%

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

      3. distribute-lft-neg-out 73.8%

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

      4. *-commutative 73.8%

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

      5. associate-/l* 66.0%

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

      6. distribute-neg-frac 66.0%

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

      7. distribute-neg-frac2 66.0%

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

   7. Simplified 66.0%

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

   8. Taylor expanded in x around 0 63.2%

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

      1. associate-*r/ 64.5%

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

   10. Simplified 64.5%

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

       1. clear-num 64.5%

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

       2. un-div-inv 64.6%

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

   12. Applied egg-rr 64.6%

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

   if 6.9999999999999998e-247 < a < 1.39999999999999992e-183 or 1.3e-138 < a < 1.2e-87

   1. Initial program 99.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 85.3%

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

   3. Simplified 85.3%

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

   5. Taylor expanded in z around inf 92.3%

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

      1. associate-/l* 85.0%

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

   7. Simplified 85.0%

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

      1. *-commutative 85.0%

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

      2. associate-/r/ 85.1%

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

   9. Applied egg-rr 85.1%

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

   10. Taylor expanded in x around 0 73.9%

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

       1. mul-1-neg 73.9%

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

       2. associate-*r/ 66.6%

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

       3. distribute-rgt-neg-in 66.6%

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

       4. distribute-neg-frac2 66.6%

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

   12. Simplified 66.6%

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

4. Final simplification 65.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -8.5 \cdot 10^{+22}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -1.15 \cdot 10^{-47}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-74}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 7 \cdot 10^{-247}:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{-183}:\\ \;\;\;\;y \cdot \frac{-z}{a}\\ \mathbf{elif}\;a \leq 1.3 \cdot 10^{-138}:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 1.2 \cdot 10^{-87}:\\ \;\;\;\;y \cdot \frac{-z}{a}\\ \mathbf{elif}\;a \leq 1.45:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{\frac{a}{y}}\\ \mathbf{if}\;a \leq -8.5 \cdot 10^{+22}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -5.8 \cdot 10^{-49}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -1.02 \cdot 10^{-73}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.75 \cdot 10^{-247}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 3.9 \cdot 10^{-82}:\\ \;\;\;\;z \cdot \frac{y}{-a}\\ \mathbf{elif}\;a \leq 0.8:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ t (/ a y))))
   (if (<= a -8.5e+22)
     x
     (if (<= a -5.8e-49)
       (* t (/ y a))
       (if (<= a -1.02e-73)
         x
         (if (<= a 2.75e-247)
           t_1
           (if (<= a 3.9e-82) (* z (/ y (- a))) (if (<= a 0.8) t_1 x))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t / (a / y);
	double tmp;
	if (a <= -8.5e+22) {
		tmp = x;
	} else if (a <= -5.8e-49) {
		tmp = t * (y / a);
	} else if (a <= -1.02e-73) {
		tmp = x;
	} else if (a <= 2.75e-247) {
		tmp = t_1;
	} else if (a <= 3.9e-82) {
		tmp = z * (y / -a);
	} else if (a <= 0.8) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: tmp
    t_1 = t / (a / y)
    if (a <= (-8.5d+22)) then
        tmp = x
    else if (a <= (-5.8d-49)) then
        tmp = t * (y / a)
    else if (a <= (-1.02d-73)) then
        tmp = x
    else if (a <= 2.75d-247) then
        tmp = t_1
    else if (a <= 3.9d-82) then
        tmp = z * (y / -a)
    else if (a <= 0.8d0) 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 t_1 = t / (a / y);
	double tmp;
	if (a <= -8.5e+22) {
		tmp = x;
	} else if (a <= -5.8e-49) {
		tmp = t * (y / a);
	} else if (a <= -1.02e-73) {
		tmp = x;
	} else if (a <= 2.75e-247) {
		tmp = t_1;
	} else if (a <= 3.9e-82) {
		tmp = z * (y / -a);
	} else if (a <= 0.8) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t / (a / y)
	tmp = 0
	if a <= -8.5e+22:
		tmp = x
	elif a <= -5.8e-49:
		tmp = t * (y / a)
	elif a <= -1.02e-73:
		tmp = x
	elif a <= 2.75e-247:
		tmp = t_1
	elif a <= 3.9e-82:
		tmp = z * (y / -a)
	elif a <= 0.8:
		tmp = t_1
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t / Float64(a / y))
	tmp = 0.0
	if (a <= -8.5e+22)
		tmp = x;
	elseif (a <= -5.8e-49)
		tmp = Float64(t * Float64(y / a));
	elseif (a <= -1.02e-73)
		tmp = x;
	elseif (a <= 2.75e-247)
		tmp = t_1;
	elseif (a <= 3.9e-82)
		tmp = Float64(z * Float64(y / Float64(-a)));
	elseif (a <= 0.8)
		tmp = t_1;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t / (a / y);
	tmp = 0.0;
	if (a <= -8.5e+22)
		tmp = x;
	elseif (a <= -5.8e-49)
		tmp = t * (y / a);
	elseif (a <= -1.02e-73)
		tmp = x;
	elseif (a <= 2.75e-247)
		tmp = t_1;
	elseif (a <= 3.9e-82)
		tmp = z * (y / -a);
	elseif (a <= 0.8)
		tmp = t_1;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -8.5e+22], x, If[LessEqual[a, -5.8e-49], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -1.02e-73], x, If[LessEqual[a, 2.75e-247], t$95$1, If[LessEqual[a, 3.9e-82], N[(z * N[(y / (-a)), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 0.8], t$95$1, x]]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -8.49999999999999979e22 or -5.8e-49 < a < -1.0199999999999999e-73 or 0.80000000000000004 < a

   1. Initial program 91.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around inf 81.2%

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

      1. associate-/l* 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 68.1%

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

   if -8.49999999999999979e22 < a < -5.8e-49

   1. Initial program 99.7%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 70.6%

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

      1. associate-*r/ 70.6%

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

      2. mul-1-neg 70.6%

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

      3. distribute-lft-neg-out 70.6%

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

      4. *-commutative 70.6%

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

      5. associate-/l* 70.9%

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

      6. distribute-neg-frac 70.9%

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

      7. distribute-neg-frac2 70.9%

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

   7. Simplified 70.9%

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

   8. Taylor expanded in x around 0 51.6%

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

      1. associate-*r/ 51.9%

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

   10. Simplified 51.9%

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

   if -1.0199999999999999e-73 < a < 2.74999999999999997e-247 or 3.89999999999999973e-82 < a < 0.80000000000000004

   1. Initial program 99.8%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in z around 0 74.1%

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

      1. associate-*r/ 74.1%

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

      2. mul-1-neg 74.1%

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

      3. distribute-lft-neg-out 74.1%

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

      4. *-commutative 74.1%

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

      5. associate-/l* 66.6%

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

      6. distribute-neg-frac 66.6%

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

      7. distribute-neg-frac2 66.6%

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

   7. Simplified 66.6%

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

   8. Taylor expanded in x around 0 63.5%

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

      1. associate-*r/ 63.5%

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

   10. Simplified 63.5%

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

       1. clear-num 63.5%

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

       2. un-div-inv 63.6%

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

   12. Applied egg-rr 63.6%

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

   if 2.74999999999999997e-247 < a < 3.89999999999999973e-82

   1. Initial program 99.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 81.6%

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

   3. Simplified 81.6%

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

   5. Taylor expanded in z around inf 81.1%

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

      1. associate-/l* 70.6%

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

   7. Simplified 70.6%

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

   8. Taylor expanded in x around 0 65.1%

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

      1. associate-*r/ 65.1%

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

      2. *-commutative 65.1%

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

      3. neg-mul-1 65.1%

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

      4. distribute-lft-neg-in 65.1%

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

      5. associate-*r/ 59.9%

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

      6. *-commutative 59.9%

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

   10. Simplified 59.9%

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

4. Final simplification 64.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -8.5 \cdot 10^{+22}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -5.8 \cdot 10^{-49}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -1.02 \cdot 10^{-73}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 2.75 \cdot 10^{-247}:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 3.9 \cdot 10^{-82}:\\ \;\;\;\;z \cdot \frac{y}{-a}\\ \mathbf{elif}\;a \leq 0.8:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 50.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{\frac{a}{y}}\\ \mathbf{if}\;a \leq -9 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.6 \cdot 10^{-49}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -2.3 \cdot 10^{-74}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 3.5 \cdot 10^{-247}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.7 \cdot 10^{-85}:\\ \;\;\;\;\frac{y \cdot z}{-a}\\ \mathbf{elif}\;a \leq 0.11:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ t (/ a y))))
   (if (<= a -9e+24)
     x
     (if (<= a -3.6e-49)
       (* t (/ y a))
       (if (<= a -2.3e-74)
         x
         (if (<= a 3.5e-247)
           t_1
           (if (<= a 1.7e-85) (/ (* y z) (- a)) (if (<= a 0.11) t_1 x))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t / (a / y);
	double tmp;
	if (a <= -9e+24) {
		tmp = x;
	} else if (a <= -3.6e-49) {
		tmp = t * (y / a);
	} else if (a <= -2.3e-74) {
		tmp = x;
	} else if (a <= 3.5e-247) {
		tmp = t_1;
	} else if (a <= 1.7e-85) {
		tmp = (y * z) / -a;
	} else if (a <= 0.11) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: tmp
    t_1 = t / (a / y)
    if (a <= (-9d+24)) then
        tmp = x
    else if (a <= (-3.6d-49)) then
        tmp = t * (y / a)
    else if (a <= (-2.3d-74)) then
        tmp = x
    else if (a <= 3.5d-247) then
        tmp = t_1
    else if (a <= 1.7d-85) then
        tmp = (y * z) / -a
    else if (a <= 0.11d0) 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 t_1 = t / (a / y);
	double tmp;
	if (a <= -9e+24) {
		tmp = x;
	} else if (a <= -3.6e-49) {
		tmp = t * (y / a);
	} else if (a <= -2.3e-74) {
		tmp = x;
	} else if (a <= 3.5e-247) {
		tmp = t_1;
	} else if (a <= 1.7e-85) {
		tmp = (y * z) / -a;
	} else if (a <= 0.11) {
		tmp = t_1;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t / (a / y)
	tmp = 0
	if a <= -9e+24:
		tmp = x
	elif a <= -3.6e-49:
		tmp = t * (y / a)
	elif a <= -2.3e-74:
		tmp = x
	elif a <= 3.5e-247:
		tmp = t_1
	elif a <= 1.7e-85:
		tmp = (y * z) / -a
	elif a <= 0.11:
		tmp = t_1
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t / Float64(a / y))
	tmp = 0.0
	if (a <= -9e+24)
		tmp = x;
	elseif (a <= -3.6e-49)
		tmp = Float64(t * Float64(y / a));
	elseif (a <= -2.3e-74)
		tmp = x;
	elseif (a <= 3.5e-247)
		tmp = t_1;
	elseif (a <= 1.7e-85)
		tmp = Float64(Float64(y * z) / Float64(-a));
	elseif (a <= 0.11)
		tmp = t_1;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t / (a / y);
	tmp = 0.0;
	if (a <= -9e+24)
		tmp = x;
	elseif (a <= -3.6e-49)
		tmp = t * (y / a);
	elseif (a <= -2.3e-74)
		tmp = x;
	elseif (a <= 3.5e-247)
		tmp = t_1;
	elseif (a <= 1.7e-85)
		tmp = (y * z) / -a;
	elseif (a <= 0.11)
		tmp = t_1;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -9e+24], x, If[LessEqual[a, -3.6e-49], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -2.3e-74], x, If[LessEqual[a, 3.5e-247], t$95$1, If[LessEqual[a, 1.7e-85], N[(N[(y * z), $MachinePrecision] / (-a)), $MachinePrecision], If[LessEqual[a, 0.11], t$95$1, x]]]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -9.00000000000000039e24 or -3.5999999999999997e-49 < a < -2.2999999999999998e-74 or 0.110000000000000001 < a

   1. Initial program 91.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around inf 81.2%

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

      1. associate-/l* 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 68.1%

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

   if -9.00000000000000039e24 < a < -3.5999999999999997e-49

   1. Initial program 99.7%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 70.6%

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

      1. associate-*r/ 70.6%

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

      2. mul-1-neg 70.6%

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

      3. distribute-lft-neg-out 70.6%

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

      4. *-commutative 70.6%

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

      5. associate-/l* 70.9%

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

      6. distribute-neg-frac 70.9%

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

      7. distribute-neg-frac2 70.9%

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

   7. Simplified 70.9%

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

   8. Taylor expanded in x around 0 51.6%

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

      1. associate-*r/ 51.9%

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

   10. Simplified 51.9%

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

   if -2.2999999999999998e-74 < a < 3.4999999999999999e-247 or 1.7e-85 < a < 0.110000000000000001

   1. Initial program 99.8%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in z around 0 74.1%

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

      1. associate-*r/ 74.1%

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

      2. mul-1-neg 74.1%

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

      3. distribute-lft-neg-out 74.1%

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

      4. *-commutative 74.1%

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

      5. associate-/l* 66.6%

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

      6. distribute-neg-frac 66.6%

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

      7. distribute-neg-frac2 66.6%

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

   7. Simplified 66.6%

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

   8. Taylor expanded in x around 0 63.5%

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

      1. associate-*r/ 63.5%

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

   10. Simplified 63.5%

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

       1. clear-num 63.5%

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

       2. un-div-inv 63.6%

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

   12. Applied egg-rr 63.6%

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

   if 3.4999999999999999e-247 < a < 1.7e-85

   1. Initial program 99.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 81.6%

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

   3. Simplified 81.6%

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

   5. Taylor expanded in z around inf 81.1%

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

      1. associate-/l* 70.6%

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

   7. Simplified 70.6%

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

   8. Taylor expanded in x around 0 65.1%

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

      1. associate-*r/ 65.1%

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

      2. *-commutative 65.1%

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

      3. neg-mul-1 65.1%

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

      4. distribute-lft-neg-in 65.1%

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

      5. associate-*r/ 59.9%

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

      6. *-commutative 59.9%

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

   10. Simplified 59.9%

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

       1. associate-*l/ 65.1%

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

       2. frac-2neg 65.1%

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

       3. add-sqr-sqrt 36.3%

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

       4. sqrt-unprod 29.1%

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

       5. sqr-neg 29.1%

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

       6. sqrt-unprod 0.4%

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

       7. add-sqr-sqrt 1.0%

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

       8. distribute-rgt-neg-out 1.0%

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

       9. *-commutative 1.0%

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

       10. add-sqr-sqrt 0.6%

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

       11. sqrt-unprod 15.7%

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

       12. sqr-neg 15.7%

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

       13. sqrt-unprod 28.6%

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

       14. add-sqr-sqrt 65.1%

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

   12. Applied egg-rr 65.1%

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

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -9 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.6 \cdot 10^{-49}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -2.3 \cdot 10^{-74}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 3.5 \cdot 10^{-247}:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 1.7 \cdot 10^{-85}:\\ \;\;\;\;\frac{y \cdot z}{-a}\\ \mathbf{elif}\;a \leq 0.11:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.9% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* y (- z t))))
   (if (or (<= t_1 -2e+79) (not (<= t_1 2e+216)))
     (+ x (* y (/ (- t z) a)))
     (- x (/ t_1 a)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if ((t_1 <= -2e+79) || !(t_1 <= 2e+216)) {
		tmp = x + (y * ((t - z) / a));
	} else {
		tmp = x - (t_1 / a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: tmp
    t_1 = y * (z - t)
    if ((t_1 <= (-2d+79)) .or. (.not. (t_1 <= 2d+216))) then
        tmp = x + (y * ((t - z) / a))
    else
        tmp = x - (t_1 / a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = y * (z - t);
	double tmp;
	if ((t_1 <= -2e+79) || !(t_1 <= 2e+216)) {
		tmp = x + (y * ((t - z) / a));
	} else {
		tmp = x - (t_1 / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = y * (z - t)
	tmp = 0
	if (t_1 <= -2e+79) or not (t_1 <= 2e+216):
		tmp = x + (y * ((t - z) / a))
	else:
		tmp = x - (t_1 / a)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y * Float64(z - t))
	tmp = 0.0
	if ((t_1 <= -2e+79) || !(t_1 <= 2e+216))
		tmp = Float64(x + Float64(y * Float64(Float64(t - z) / a)));
	else
		tmp = Float64(x - Float64(t_1 / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = y * (z - t);
	tmp = 0.0;
	if ((t_1 <= -2e+79) || ~((t_1 <= 2e+216)))
		tmp = x + (y * ((t - z) / a));
	else
		tmp = x - (t_1 / a);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (-.f64 z t)) < -1.99999999999999993e79 or 2e216 < (*.f64 y (-.f64 z t))

   1. Initial program 87.4%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   if -1.99999999999999993e79 < (*.f64 y (-.f64 z t)) < 2e216

   1. Initial program 99.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 6: 50.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.2 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -1.7 \cdot 10^{-47} \lor \neg \left(a \leq -1.08 \cdot 10^{-72}\right) \land a \leq 0.74:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.2e+24)
   x
   (if (or (<= a -1.7e-47) (and (not (<= a -1.08e-72)) (<= a 0.74)))
     (* t (/ y a))
     x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.2e+24) {
		tmp = x;
	} else if ((a <= -1.7e-47) || (!(a <= -1.08e-72) && (a <= 0.74))) {
		tmp = t * (y / a);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (a <= (-2.2d+24)) then
        tmp = x
    else if ((a <= (-1.7d-47)) .or. (.not. (a <= (-1.08d-72))) .and. (a <= 0.74d0)) then
        tmp = t * (y / a)
    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 tmp;
	if (a <= -2.2e+24) {
		tmp = x;
	} else if ((a <= -1.7e-47) || (!(a <= -1.08e-72) && (a <= 0.74))) {
		tmp = t * (y / a);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -2.2e+24:
		tmp = x
	elif (a <= -1.7e-47) or (not (a <= -1.08e-72) and (a <= 0.74)):
		tmp = t * (y / a)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.2e+24)
		tmp = x;
	elseif ((a <= -1.7e-47) || (!(a <= -1.08e-72) && (a <= 0.74)))
		tmp = Float64(t * Float64(y / a));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -2.2e+24)
		tmp = x;
	elseif ((a <= -1.7e-47) || (~((a <= -1.08e-72)) && (a <= 0.74)))
		tmp = t * (y / a);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.2e+24], x, If[Or[LessEqual[a, -1.7e-47], And[N[Not[LessEqual[a, -1.08e-72]], $MachinePrecision], LessEqual[a, 0.74]]], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if a < -2.20000000000000002e24 or -1.7000000000000001e-47 < a < -1.07999999999999998e-72 or 0.73999999999999999 < a

   1. Initial program 91.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around inf 81.2%

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

      1. associate-/l* 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 68.1%

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

   if -2.20000000000000002e24 < a < -1.7000000000000001e-47 or -1.07999999999999998e-72 < a < 0.73999999999999999

   1. Initial program 99.8%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 89.4%

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

   3. Simplified 89.4%

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

   5. Taylor expanded in z around 0 64.9%

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

      1. associate-*r/ 64.9%

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

      2. mul-1-neg 64.9%

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

      3. distribute-lft-neg-out 64.9%

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

      4. *-commutative 64.9%

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

      5. associate-/l* 58.6%

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

      6. distribute-neg-frac 58.6%

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

      7. distribute-neg-frac2 58.6%

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

   7. Simplified 58.6%

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

   8. Taylor expanded in x around 0 51.1%

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

      1. associate-*r/ 52.6%

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

   10. Simplified 52.6%

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

4. Final simplification 61.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.2 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -1.7 \cdot 10^{-47} \lor \neg \left(a \leq -1.08 \cdot 10^{-72}\right) \land a \leq 0.74:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 50.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.8 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.1 \cdot 10^{-48}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -2.7 \cdot 10^{-73}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 0.245:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.8e+24)
   x
   (if (<= a -3.1e-48)
     (* t (/ y a))
     (if (<= a -2.7e-73) x (if (<= a 0.245) (/ t (/ a y)) x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.8e+24) {
		tmp = x;
	} else if (a <= -3.1e-48) {
		tmp = t * (y / a);
	} else if (a <= -2.7e-73) {
		tmp = x;
	} else if (a <= 0.245) {
		tmp = t / (a / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (a <= (-1.8d+24)) then
        tmp = x
    else if (a <= (-3.1d-48)) then
        tmp = t * (y / a)
    else if (a <= (-2.7d-73)) then
        tmp = x
    else if (a <= 0.245d0) then
        tmp = t / (a / y)
    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 tmp;
	if (a <= -1.8e+24) {
		tmp = x;
	} else if (a <= -3.1e-48) {
		tmp = t * (y / a);
	} else if (a <= -2.7e-73) {
		tmp = x;
	} else if (a <= 0.245) {
		tmp = t / (a / y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -1.8e+24:
		tmp = x
	elif a <= -3.1e-48:
		tmp = t * (y / a)
	elif a <= -2.7e-73:
		tmp = x
	elif a <= 0.245:
		tmp = t / (a / y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -1.8e+24)
		tmp = x;
	elseif (a <= -3.1e-48)
		tmp = Float64(t * Float64(y / a));
	elseif (a <= -2.7e-73)
		tmp = x;
	elseif (a <= 0.245)
		tmp = Float64(t / Float64(a / y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -1.8e+24)
		tmp = x;
	elseif (a <= -3.1e-48)
		tmp = t * (y / a);
	elseif (a <= -2.7e-73)
		tmp = x;
	elseif (a <= 0.245)
		tmp = t / (a / y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -1.8e+24], x, If[LessEqual[a, -3.1e-48], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -2.7e-73], x, If[LessEqual[a, 0.245], N[(t / N[(a / y), $MachinePrecision]), $MachinePrecision], x]]]]

Derivation

1. Split input into 3 regimes

2. if a < -1.79999999999999992e24 or -3.10000000000000016e-48 < a < -2.69999999999999994e-73 or 0.245 < a

   1. Initial program 91.2%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in z around inf 81.2%

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

      1. associate-/l* 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around inf 68.1%

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

   if -1.79999999999999992e24 < a < -3.10000000000000016e-48

   1. Initial program 99.7%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around 0 70.6%

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

      1. associate-*r/ 70.6%

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

      2. mul-1-neg 70.6%

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

      3. distribute-lft-neg-out 70.6%

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

      4. *-commutative 70.6%

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

      5. associate-/l* 70.9%

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

      6. distribute-neg-frac 70.9%

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

      7. distribute-neg-frac2 70.9%

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

   7. Simplified 70.9%

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

   8. Taylor expanded in x around 0 51.6%

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

      1. associate-*r/ 51.9%

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

   10. Simplified 51.9%

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

   if -2.69999999999999994e-73 < a < 0.245

   1. Initial program 99.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 87.2%

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

   3. Simplified 87.2%

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

   5. Taylor expanded in z around 0 63.8%

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

      1. associate-*r/ 63.8%

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

      2. mul-1-neg 63.8%

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

      3. distribute-lft-neg-out 63.8%

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

      4. *-commutative 63.8%

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

      5. associate-/l* 56.1%

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

      6. distribute-neg-frac 56.1%

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

      7. distribute-neg-frac2 56.1%

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

   7. Simplified 56.1%

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

   8. Taylor expanded in x around 0 50.9%

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

      1. associate-*r/ 52.8%

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

   10. Simplified 52.8%

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

       1. clear-num 52.8%

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

       2. un-div-inv 52.9%

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

   12. Applied egg-rr 52.9%

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

4. Final simplification 61.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.8 \cdot 10^{+24}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.1 \cdot 10^{-48}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;a \leq -2.7 \cdot 10^{-73}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 0.245:\\ \;\;\;\;\frac{t}{\frac{a}{y}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 74.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{+139} \lor \neg \left(z \leq 2 \cdot 10^{+212}\right):\\ \;\;\;\;z \cdot \frac{y}{-a}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.7e+139) (not (<= z 2e+212)))
   (* z (/ y (- a)))
   (+ x (/ (* y t) a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.7e+139) || !(z <= 2e+212)) {
		tmp = z * (y / -a);
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if ((z <= (-1.7d+139)) .or. (.not. (z <= 2d+212))) then
        tmp = z * (y / -a)
    else
        tmp = x + ((y * t) / a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.7e+139) || !(z <= 2e+212)) {
		tmp = z * (y / -a);
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.7e+139) or not (z <= 2e+212):
		tmp = z * (y / -a)
	else:
		tmp = x + ((y * t) / a)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.7e+139) || !(z <= 2e+212))
		tmp = Float64(z * Float64(y / Float64(-a)));
	else
		tmp = Float64(x + Float64(Float64(y * t) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.7e+139) || ~((z <= 2e+212)))
		tmp = z * (y / -a);
	else
		tmp = x + ((y * t) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1.7e+139], N[Not[LessEqual[z, 2e+212]], $MachinePrecision]], N[(z * N[(y / (-a)), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.7000000000000001e139 or 1.9999999999999998e212 < z

   1. Initial program 83.3%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 89.4%

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

   3. Simplified 89.4%

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

   5. Taylor expanded in z around inf 79.8%

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

      1. associate-/l* 84.3%

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

   7. Simplified 84.3%

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

   8. Taylor expanded in x around 0 60.3%

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

      1. associate-*r/ 60.3%

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

      2. *-commutative 60.3%

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

      3. neg-mul-1 60.3%

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

      4. distribute-lft-neg-in 60.3%

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

      5. associate-*r/ 70.2%

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

      6. *-commutative 70.2%

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

   10. Simplified 70.2%

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

   if -1.7000000000000001e139 < z < 1.9999999999999998e212

   1. Initial program 98.4%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 96.1%

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

   3. Simplified 96.1%

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

   5. Taylor expanded in z around 0 82.0%

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

      1. associate-*r/ 82.0%

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

      2. mul-1-neg 82.0%

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

      3. distribute-lft-neg-out 82.0%

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

      4. *-commutative 82.0%

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

      5. associate-/l* 79.3%

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

      6. distribute-neg-frac 79.3%

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

      7. distribute-neg-frac2 79.3%

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

   7. Simplified 79.3%

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

   8. Taylor expanded in x around 0 82.0%

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

4. Final simplification 79.4%

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

Alternative 9: 81.6% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -4.5e-70) (not (<= t 9.5e+43)))
   (+ x (/ (* y t) a))
   (- x (* y (/ z a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -4.5e-70) || !(t <= 9.5e+43)) {
		tmp = x + ((y * t) / a);
	} else {
		tmp = x - (y * (z / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if ((t <= (-4.5d-70)) .or. (.not. (t <= 9.5d+43))) then
        tmp = x + ((y * t) / a)
    else
        tmp = x - (y * (z / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -4.5e-70) || !(t <= 9.5e+43)) {
		tmp = x + ((y * t) / a);
	} else {
		tmp = x - (y * (z / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (t <= -4.5e-70) or not (t <= 9.5e+43):
		tmp = x + ((y * t) / a)
	else:
		tmp = x - (y * (z / a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -4.5e-70) || !(t <= 9.5e+43))
		tmp = Float64(x + Float64(Float64(y * t) / a));
	else
		tmp = Float64(x - Float64(y * Float64(z / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((t <= -4.5e-70) || ~((t <= 9.5e+43)))
		tmp = x + ((y * t) / a);
	else
		tmp = x - (y * (z / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -4.5e-70], N[Not[LessEqual[t, 9.5e+43]], $MachinePrecision]], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(x - N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -4.50000000000000022e-70 or 9.5000000000000004e43 < t

   1. Initial program 93.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 90.9%

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

   3. Simplified 90.9%

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

   5. Taylor expanded in z around 0 83.4%

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

      1. associate-*r/ 83.4%

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

      2. mul-1-neg 83.4%

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

      3. distribute-lft-neg-out 83.4%

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

      4. *-commutative 83.4%

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

      5. associate-/l* 81.3%

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

      6. distribute-neg-frac 81.3%

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

      7. distribute-neg-frac2 81.3%

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

   7. Simplified 81.3%

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

   8. Taylor expanded in x around 0 83.4%

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

   if -4.50000000000000022e-70 < t < 9.5000000000000004e43

   1. Initial program 96.3%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 98.3%

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

   3. Simplified 98.3%

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

   5. Taylor expanded in z around inf 90.6%

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

      1. associate-/l* 92.6%

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

   7. Simplified 92.6%

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

4. Final simplification 88.1%

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

Alternative 10: 81.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.9 \cdot 10^{-70}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{elif}\;t \leq 6.9 \cdot 10^{+44}:\\ \;\;\;\;x - y \cdot \frac{z}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.9e-70)
   (+ x (* y (/ t a)))
   (if (<= t 6.9e+44) (- x (* y (/ z a))) (+ x (/ (* y t) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.9e-70) {
		tmp = x + (y * (t / a));
	} else if (t <= 6.9e+44) {
		tmp = x - (y * (z / a));
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (t <= (-1.9d-70)) then
        tmp = x + (y * (t / a))
    else if (t <= 6.9d+44) then
        tmp = x - (y * (z / a))
    else
        tmp = x + ((y * t) / a)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.9e-70) {
		tmp = x + (y * (t / a));
	} else if (t <= 6.9e+44) {
		tmp = x - (y * (z / a));
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -1.9e-70:
		tmp = x + (y * (t / a))
	elif t <= 6.9e+44:
		tmp = x - (y * (z / a))
	else:
		tmp = x + ((y * t) / a)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.9e-70)
		tmp = Float64(x + Float64(y * Float64(t / a)));
	elseif (t <= 6.9e+44)
		tmp = Float64(x - Float64(y * Float64(z / a)));
	else
		tmp = Float64(x + Float64(Float64(y * t) / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -1.9e-70)
		tmp = x + (y * (t / a));
	elseif (t <= 6.9e+44)
		tmp = x - (y * (z / a));
	else
		tmp = x + ((y * t) / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.9e-70], N[(x + N[(y * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 6.9e+44], N[(x - N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.8999999999999999e-70

   1. Initial program 92.6%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 95.0%

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

   3. Simplified 95.0%

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

   5. Taylor expanded in z around 0 80.6%

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

      1. associate-*r/ 80.6%

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

      2. mul-1-neg 80.6%

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

      3. distribute-lft-neg-out 80.6%

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

      4. *-commutative 80.6%

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

      5. associate-/l* 81.9%

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

      6. distribute-neg-frac 81.9%

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

      7. distribute-neg-frac2 81.9%

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

   7. Simplified 81.9%

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

   if -1.8999999999999999e-70 < t < 6.8999999999999997e44

   1. Initial program 96.3%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 98.3%

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

   3. Simplified 98.3%

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

   5. Taylor expanded in z around inf 90.6%

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

      1. associate-/l* 92.6%

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

   7. Simplified 92.6%

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

   if 6.8999999999999997e44 < t

   1. Initial program 95.9%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 84.4%

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

   3. Simplified 84.4%

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

   5. Taylor expanded in z around 0 87.9%

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

      1. associate-*r/ 87.9%

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

      2. mul-1-neg 87.9%

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

      3. distribute-lft-neg-out 87.9%

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

      4. *-commutative 87.9%

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

      5. associate-/l* 80.4%

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

      6. distribute-neg-frac 80.4%

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

      7. distribute-neg-frac2 80.4%

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

   7. Simplified 80.4%

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

   8. Taylor expanded in x around 0 87.9%

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

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.9 \cdot 10^{-70}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{elif}\;t \leq 6.9 \cdot 10^{+44}:\\ \;\;\;\;x - y \cdot \frac{z}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 93.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 6.1 \cdot 10^{+221}:\\ \;\;\;\;x + y \cdot \frac{t - z}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{z}{\frac{a}{y}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z 6.1e+221) (+ x (* y (/ (- t z) a))) (- x (/ z (/ a y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= 6.1e+221) {
		tmp = x + (y * ((t - z) / a));
	} else {
		tmp = x - (z / (a / y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: tmp
    if (z <= 6.1d+221) then
        tmp = x + (y * ((t - z) / a))
    else
        tmp = x - (z / (a / y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= 6.1e+221) {
		tmp = x + (y * ((t - z) / a));
	} else {
		tmp = x - (z / (a / y));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= 6.1e+221:
		tmp = x + (y * ((t - z) / a))
	else:
		tmp = x - (z / (a / y))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= 6.1e+221)
		tmp = Float64(x + Float64(y * Float64(Float64(t - z) / a)));
	else
		tmp = Float64(x - Float64(z / Float64(a / y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= 6.1e+221)
		tmp = x + (y * ((t - z) / a));
	else
		tmp = x - (z / (a / y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, 6.1e+221], N[(x + N[(y * N[(N[(t - z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(z / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6.0999999999999998e221

   1. Initial program 97.0%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 96.2%

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

   3. Simplified 96.2%

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

   if 6.0999999999999998e221 < z

   1. Initial program 74.6%

      \[x - \frac{y \cdot \left(z - t\right)}{a} \]
   2. Step-by-step derivation

      1. associate-/l* 77.9%

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

   3. Simplified 77.9%

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

   5. Taylor expanded in z around inf 74.6%

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

      1. associate-/l* 77.9%

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

   7. Simplified 77.9%

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

      1. *-commutative 77.9%

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

      2. associate-/r/ 98.0%

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

   9. Applied egg-rr 98.0%

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

4. Final simplification 96.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 6.1 \cdot 10^{+221}:\\ \;\;\;\;x + y \cdot \frac{t - z}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{z}{\frac{a}{y}}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 39.4% accurate, 9.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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
    code = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.1%

   \[x - \frac{y \cdot \left(z - t\right)}{a} \]
2. Step-by-step derivation

   1. associate-/l* 94.7%

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

3. Simplified 94.7%

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

5. Taylor expanded in z around inf 70.7%

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

   1. associate-/l* 71.7%

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

7. Simplified 71.7%

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

8. Taylor expanded in x around inf 44.1%

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

9. Final simplification 44.1%

   \[\leadsto x \]
10. Add Preprocessing

Developer target: 99.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{z - t}\\ \mathbf{if}\;y < -1.0761266216389975 \cdot 10^{-10}:\\ \;\;\;\;x - \frac{1}{\frac{t\_1}{y}}\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x - \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{y}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ a (- z t))))
   (if (< y -1.0761266216389975e-10)
     (- x (/ 1.0 (/ t_1 y)))
     (if (< y 2.894426862792089e-49)
       (- x (/ (* y (- z t)) a))
       (- x (/ y t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x - (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x - ((y * (z - t)) / a);
	} else {
		tmp = x - (y / t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    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) :: t_1
    real(8) :: tmp
    t_1 = a / (z - t)
    if (y < (-1.0761266216389975d-10)) then
        tmp = x - (1.0d0 / (t_1 / y))
    else if (y < 2.894426862792089d-49) then
        tmp = x - ((y * (z - t)) / a)
    else
        tmp = x - (y / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x - (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x - ((y * (z - t)) / a);
	} else {
		tmp = x - (y / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = a / (z - t)
	tmp = 0
	if y < -1.0761266216389975e-10:
		tmp = x - (1.0 / (t_1 / y))
	elif y < 2.894426862792089e-49:
		tmp = x - ((y * (z - t)) / a)
	else:
		tmp = x - (y / t_1)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(a / Float64(z - t))
	tmp = 0.0
	if (y < -1.0761266216389975e-10)
		tmp = Float64(x - Float64(1.0 / Float64(t_1 / y)));
	elseif (y < 2.894426862792089e-49)
		tmp = Float64(x - Float64(Float64(y * Float64(z - t)) / a));
	else
		tmp = Float64(x - Float64(y / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = a / (z - t);
	tmp = 0.0;
	if (y < -1.0761266216389975e-10)
		tmp = x - (1.0 / (t_1 / y));
	elseif (y < 2.894426862792089e-49)
		tmp = x - ((y * (z - t)) / a);
	else
		tmp = x - (y / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(a / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -1.0761266216389975e-10], N[(x - N[(1.0 / N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[y, 2.894426862792089e-49], N[(x - N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(x - N[(y / t$95$1), $MachinePrecision]), $MachinePrecision]]]]

Reproduce

herbie shell --seed 2024053 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, F"
  :precision binary64

  :alt
  (if (< y -1.0761266216389975e-10) (- x (/ 1.0 (/ (/ a (- z t)) y))) (if (< y 2.894426862792089e-49) (- x (/ (* y (- z t)) a)) (- x (/ y (/ a (- z t))))))

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