Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, A

Percentage Accurate: 95.4% → 98.8%

Time: 10.7s

Alternatives: 14

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

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 * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

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

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 * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 5 \cdot 10^{-42}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, \mathsf{fma}\left(z, y \cdot \left(t \cdot -9\right), b \cdot \left(a \cdot 27\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 5e-42)
   (fma a (* 27.0 b) (fma x 2.0 (* y (* t (* z -9.0)))))
   (fma x 2.0 (fma z (* y (* t -9.0)) (* b (* a 27.0))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 5e-42) {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (y * (t * (z * -9.0)))));
	} else {
		tmp = fma(x, 2.0, fma(z, (y * (t * -9.0)), (b * (a * 27.0))));
	}
	return tmp;
}

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 5e-42)
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(y * Float64(t * Float64(z * -9.0)))));
	else
		tmp = fma(x, 2.0, fma(z, Float64(y * Float64(t * -9.0)), Float64(b * Float64(a * 27.0))));
	end
	return tmp
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 5e-42], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0 + N[(z * N[(y * N[(t * -9.0), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 5.00000000000000003e-42

   1. Initial program 97.6%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 97.6%

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

      2. associate-+r- 97.6%

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

      3. cancel-sign-sub-inv 97.6%

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

      4. *-commutative 97.6%

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

      5. distribute-rgt-neg-out 97.6%

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

      6. associate-*r* 90.7%

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

      7. *-commutative 90.7%

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

      8. distribute-rgt-neg-in 90.7%

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

      9. associate-+r+ 90.7%

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

      10. sub-neg 90.7%

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

      11. associate-*l* 90.7%

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

      12. fma-def 90.6%

          \[\leadsto \color{blue}{\mathsf{fma}\left(a, 27 \cdot b, x \cdot 2 - \left(\left(y \cdot 9\right) \cdot t\right) \cdot z\right)} \]

      13. fma-neg 90.6%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \color{blue}{\mathsf{fma}\left(x, 2, -\left(\left(y \cdot 9\right) \cdot t\right) \cdot z\right)}\right) \]

      14. associate-*l* 91.2%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\color{blue}{\left(y \cdot \left(9 \cdot t\right)\right)} \cdot z\right)\right) \]

      15. *-commutative 91.2%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\left(y \cdot \color{blue}{\left(t \cdot 9\right)}\right) \cdot z\right)\right) \]

      16. associate-*r* 96.6%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\color{blue}{y \cdot \left(\left(t \cdot 9\right) \cdot z\right)}\right)\right) \]

      17. distribute-rgt-neg-in 96.6%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, \color{blue}{y \cdot \left(-\left(t \cdot 9\right) \cdot z\right)}\right)\right) \]

   3. Simplified 96.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(-9 \cdot z\right)\right)\right)\right)} \]

   if 5.00000000000000003e-42 < z

   1. Initial program 91.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 91.8%

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

      2. associate-+r- 91.8%

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

      3. cancel-sign-sub-inv 91.8%

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

      4. *-commutative 91.8%

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

      5. distribute-rgt-neg-out 91.8%

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

      6. associate-*r* 95.7%

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

      7. *-commutative 95.7%

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

      8. distribute-rgt-neg-in 95.7%

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

      9. associate-+r+ 95.7%

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

      10. sub-neg 95.7%

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

      11. +-commutative 95.7%

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

      12. associate-+l- 95.7%

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

      13. fma-neg 95.7%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, -\left(\left(\left(y \cdot 9\right) \cdot t\right) \cdot z - \left(a \cdot 27\right) \cdot b\right)\right)} \]

      14. associate-*l* 91.8%

          \[\leadsto \mathsf{fma}\left(x, 2, -\left(\color{blue}{\left(y \cdot 9\right) \cdot \left(t \cdot z\right)} - \left(a \cdot 27\right) \cdot b\right)\right) \]

      15. fma-neg 93.2%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\mathsf{fma}\left(y \cdot 9, t \cdot z, -\left(a \cdot 27\right) \cdot b\right)}\right) \]

      16. *-commutative 93.2%

          \[\leadsto \mathsf{fma}\left(x, 2, -\mathsf{fma}\left(y \cdot 9, \color{blue}{z \cdot t}, -\left(a \cdot 27\right) \cdot b\right)\right) \]

      17. fma-neg 91.8%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\left(\left(y \cdot 9\right) \cdot \left(z \cdot t\right) - \left(a \cdot 27\right) \cdot b\right)}\right) \]

   3. Simplified 97.1%

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

4. Final simplification 96.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 5 \cdot 10^{-42}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, \mathsf{fma}\left(z, y \cdot \left(t \cdot -9\right), b \cdot \left(a \cdot 27\right)\right)\right)\\ \end{array} \]

Alternative 2: 98.6% accurate, 0.1× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot 9 \leq -4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + a \cdot \left(27 \cdot b\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= (* y 9.0) -4e+64)
   (fma a (* 27.0 b) (fma x 2.0 (* y (* t (* z -9.0)))))
   (fma x 2.0 (+ (* z (* y (* t -9.0))) (* a (* 27.0 b))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y * 9.0) <= -4e+64) {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (y * (t * (z * -9.0)))));
	} else {
		tmp = fma(x, 2.0, ((z * (y * (t * -9.0))) + (a * (27.0 * b))));
	}
	return tmp;
}

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(y * 9.0) <= -4e+64)
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(y * Float64(t * Float64(z * -9.0)))));
	else
		tmp = fma(x, 2.0, Float64(Float64(z * Float64(y * Float64(t * -9.0))) + Float64(a * Float64(27.0 * b))));
	end
	return tmp
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(y * 9.0), $MachinePrecision], -4e+64], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0 + N[(N[(z * N[(y * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y 9) < -4.00000000000000009e64

   1. Initial program 92.1%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 92.1%

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

      2. associate-+r- 92.1%

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

      3. cancel-sign-sub-inv 92.1%

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

      4. *-commutative 92.1%

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

      5. distribute-rgt-neg-out 92.1%

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

      6. associate-*r* 81.7%

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

      7. *-commutative 81.7%

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

      8. distribute-rgt-neg-in 81.7%

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

      9. associate-+r+ 81.7%

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

      10. sub-neg 81.7%

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

      11. associate-*l* 81.7%

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

      12. fma-def 83.3%

          \[\leadsto \color{blue}{\mathsf{fma}\left(a, 27 \cdot b, x \cdot 2 - \left(\left(y \cdot 9\right) \cdot t\right) \cdot z\right)} \]

      13. fma-neg 83.3%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \color{blue}{\mathsf{fma}\left(x, 2, -\left(\left(y \cdot 9\right) \cdot t\right) \cdot z\right)}\right) \]

      14. associate-*l* 84.8%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\color{blue}{\left(y \cdot \left(9 \cdot t\right)\right)} \cdot z\right)\right) \]

      15. *-commutative 84.8%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\left(y \cdot \color{blue}{\left(t \cdot 9\right)}\right) \cdot z\right)\right) \]

      16. associate-*r* 98.2%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, -\color{blue}{y \cdot \left(\left(t \cdot 9\right) \cdot z\right)}\right)\right) \]

      17. distribute-rgt-neg-in 98.2%

          \[\leadsto \mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, \color{blue}{y \cdot \left(-\left(t \cdot 9\right) \cdot z\right)}\right)\right) \]

   3. Simplified 98.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(-9 \cdot z\right)\right)\right)\right)} \]

   if -4.00000000000000009e64 < (*.f64 y 9)

   1. Initial program 97.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 97.2%

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

      2. associate-+r- 97.2%

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

      3. cancel-sign-sub-inv 97.2%

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

      4. *-commutative 97.2%

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

      5. distribute-rgt-neg-out 97.2%

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

      6. associate-*r* 95.4%

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

      7. *-commutative 95.4%

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

      8. distribute-rgt-neg-in 95.4%

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

      9. associate-+r+ 95.4%

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

      10. sub-neg 95.4%

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

      11. +-commutative 95.4%

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

      12. associate-+l- 95.4%

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

      13. fma-neg 95.4%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, -\left(\left(\left(y \cdot 9\right) \cdot t\right) \cdot z - \left(a \cdot 27\right) \cdot b\right)\right)} \]

      14. associate-*l* 94.9%

          \[\leadsto \mathsf{fma}\left(x, 2, -\left(\color{blue}{\left(y \cdot 9\right) \cdot \left(t \cdot z\right)} - \left(a \cdot 27\right) \cdot b\right)\right) \]

      15. fma-neg 94.9%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\mathsf{fma}\left(y \cdot 9, t \cdot z, -\left(a \cdot 27\right) \cdot b\right)}\right) \]

      16. *-commutative 94.9%

          \[\leadsto \mathsf{fma}\left(x, 2, -\mathsf{fma}\left(y \cdot 9, \color{blue}{z \cdot t}, -\left(a \cdot 27\right) \cdot b\right)\right) \]

      17. fma-neg 94.9%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\left(\left(y \cdot 9\right) \cdot \left(z \cdot t\right) - \left(a \cdot 27\right) \cdot b\right)}\right) \]

   3. Simplified 95.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, \mathsf{fma}\left(z, y \cdot \left(t \cdot -9\right), \left(a \cdot 27\right) \cdot b\right)\right)} \]
   4. Step-by-step derivation

      1. fma-udef 95.4%

         \[\leadsto \mathsf{fma}\left(x, 2, \color{blue}{z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + \left(a \cdot 27\right) \cdot b}\right) \]

      2. associate-*r* 95.4%

         \[\leadsto \mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + \color{blue}{a \cdot \left(27 \cdot b\right)}\right) \]

   5. Applied egg-rr 95.4%

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

4. Final simplification 96.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot 9 \leq -4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + a \cdot \left(27 \cdot b\right)\right)\\ \end{array} \]

Alternative 3: 97.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} t_1 := a \cdot \left(27 \cdot b\right)\\ \mathbf{if}\;y \cdot 9 \leq -1 \cdot 10^{+68}:\\ \;\;\;\;t_1 + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + t_1\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* a (* 27.0 b))))
   (if (<= (* y 9.0) -1e+68)
     (+ t_1 (- (* x 2.0) (* (* y 9.0) (* z t))))
     (fma x 2.0 (+ (* z (* y (* t -9.0))) t_1)))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * (27.0 * b);
	double tmp;
	if ((y * 9.0) <= -1e+68) {
		tmp = t_1 + ((x * 2.0) - ((y * 9.0) * (z * t)));
	} else {
		tmp = fma(x, 2.0, ((z * (y * (t * -9.0))) + t_1));
	}
	return tmp;
}

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(a * Float64(27.0 * b))
	tmp = 0.0
	if (Float64(y * 9.0) <= -1e+68)
		tmp = Float64(t_1 + Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))));
	else
		tmp = fma(x, 2.0, Float64(Float64(z * Float64(y * Float64(t * -9.0))) + t_1));
	end
	return tmp
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * 9.0), $MachinePrecision], -1e+68], N[(t$95$1 + N[(N[(x * 2.0), $MachinePrecision] - N[(N[(y * 9.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0 + N[(N[(z * N[(y * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y 9) < -9.99999999999999953e67

   1. Initial program 93.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 93.4%

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

      2. distribute-lft-neg-in 93.4%

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

      3. associate-*l* 93.4%

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

      4. *-commutative 93.4%

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

      5. *-commutative 93.4%

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

      6. cancel-sign-sub-inv 93.4%

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

      7. *-commutative 93.4%

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

      8. *-commutative 93.4%

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

      9. associate-*l* 93.4%

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

      10. associate-*l* 96.6%

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

      11. associate-*l* 96.6%

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

   3. Simplified 96.6%

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

   if -9.99999999999999953e67 < (*.f64 y 9)

   1. Initial program 96.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. +-commutative 96.8%

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

      2. associate-+r- 96.8%

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

      3. cancel-sign-sub-inv 96.8%

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

      4. *-commutative 96.8%

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

      5. distribute-rgt-neg-out 96.8%

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

      6. associate-*r* 95.0%

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

      7. *-commutative 95.0%

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

      8. distribute-rgt-neg-in 95.0%

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

      9. associate-+r+ 95.0%

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

      10. sub-neg 95.0%

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

      11. +-commutative 95.0%

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

      12. associate-+l- 95.0%

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

      13. fma-neg 95.0%

          \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, -\left(\left(\left(y \cdot 9\right) \cdot t\right) \cdot z - \left(a \cdot 27\right) \cdot b\right)\right)} \]

      14. associate-*l* 94.5%

          \[\leadsto \mathsf{fma}\left(x, 2, -\left(\color{blue}{\left(y \cdot 9\right) \cdot \left(t \cdot z\right)} - \left(a \cdot 27\right) \cdot b\right)\right) \]

      15. fma-neg 95.0%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\mathsf{fma}\left(y \cdot 9, t \cdot z, -\left(a \cdot 27\right) \cdot b\right)}\right) \]

      16. *-commutative 95.0%

          \[\leadsto \mathsf{fma}\left(x, 2, -\mathsf{fma}\left(y \cdot 9, \color{blue}{z \cdot t}, -\left(a \cdot 27\right) \cdot b\right)\right) \]

      17. fma-neg 94.5%

          \[\leadsto \mathsf{fma}\left(x, 2, -\color{blue}{\left(\left(y \cdot 9\right) \cdot \left(z \cdot t\right) - \left(a \cdot 27\right) \cdot b\right)}\right) \]

   3. Simplified 96.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 2, \mathsf{fma}\left(z, y \cdot \left(t \cdot -9\right), \left(a \cdot 27\right) \cdot b\right)\right)} \]
   4. Step-by-step derivation

      1. fma-udef 95.0%

         \[\leadsto \mathsf{fma}\left(x, 2, \color{blue}{z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + \left(a \cdot 27\right) \cdot b}\right) \]

      2. associate-*r* 95.0%

         \[\leadsto \mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + \color{blue}{a \cdot \left(27 \cdot b\right)}\right) \]

   5. Applied egg-rr 95.0%

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

4. Final simplification 95.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot 9 \leq -1 \cdot 10^{+68}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 2, z \cdot \left(y \cdot \left(t \cdot -9\right)\right) + a \cdot \left(27 \cdot b\right)\right)\\ \end{array} \]

Alternative 4: 77.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} t_1 := 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ t_2 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;z \leq -3.2 \cdot 10^{+117}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -5.4 \cdot 10^{-70}:\\ \;\;\;\;x \cdot 2 - t_1\\ \mathbf{elif}\;z \leq 4.4 \cdot 10^{-185}:\\ \;\;\;\;t_2 + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_2 - t_1\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 9.0 (* t (* z y)))) (t_2 (* 27.0 (* a b))))
   (if (<= z -3.2e+117)
     (* y (* t (* z -9.0)))
     (if (<= z -5.4e-70)
       (- (* x 2.0) t_1)
       (if (<= z 4.4e-185) (+ t_2 (* x 2.0)) (- t_2 t_1))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 9.0 * (t * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (z <= -3.2e+117) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -5.4e-70) {
		tmp = (x * 2.0) - t_1;
	} else if (z <= 4.4e-185) {
		tmp = t_2 + (x * 2.0);
	} else {
		tmp = t_2 - t_1;
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 = 9.0d0 * (t * (z * y))
    t_2 = 27.0d0 * (a * b)
    if (z <= (-3.2d+117)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= (-5.4d-70)) then
        tmp = (x * 2.0d0) - t_1
    else if (z <= 4.4d-185) then
        tmp = t_2 + (x * 2.0d0)
    else
        tmp = t_2 - t_1
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 9.0 * (t * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (z <= -3.2e+117) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -5.4e-70) {
		tmp = (x * 2.0) - t_1;
	} else if (z <= 4.4e-185) {
		tmp = t_2 + (x * 2.0);
	} else {
		tmp = t_2 - t_1;
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	t_1 = 9.0 * (t * (z * y))
	t_2 = 27.0 * (a * b)
	tmp = 0
	if z <= -3.2e+117:
		tmp = y * (t * (z * -9.0))
	elif z <= -5.4e-70:
		tmp = (x * 2.0) - t_1
	elif z <= 4.4e-185:
		tmp = t_2 + (x * 2.0)
	else:
		tmp = t_2 - t_1
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(9.0 * Float64(t * Float64(z * y)))
	t_2 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (z <= -3.2e+117)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= -5.4e-70)
		tmp = Float64(Float64(x * 2.0) - t_1);
	elseif (z <= 4.4e-185)
		tmp = Float64(t_2 + Float64(x * 2.0));
	else
		tmp = Float64(t_2 - t_1);
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 9.0 * (t * (z * y));
	t_2 = 27.0 * (a * b);
	tmp = 0.0;
	if (z <= -3.2e+117)
		tmp = y * (t * (z * -9.0));
	elseif (z <= -5.4e-70)
		tmp = (x * 2.0) - t_1;
	elseif (z <= 4.4e-185)
		tmp = t_2 + (x * 2.0);
	else
		tmp = t_2 - t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.2e+117], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -5.4e-70], N[(N[(x * 2.0), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[z, 4.4e-185], N[(t$95$2 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(t$95$2 - t$95$1), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -3.20000000000000005e117

   1. Initial program 89.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 89.9%

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

      2. distribute-lft-neg-in 89.9%

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

      3. associate-*l* 90.0%

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

      4. *-commutative 90.0%

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

      5. *-commutative 90.0%

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

      6. cancel-sign-sub-inv 90.0%

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

      7. *-commutative 90.0%

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

      8. *-commutative 90.0%

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

      9. associate-*l* 89.9%

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

      10. associate-*l* 80.5%

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

      11. associate-*l* 80.4%

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

   3. Simplified 80.4%

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

   4. Taylor expanded in y around inf 53.3%

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

      1. *-commutative 53.3%

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

      2. associate-*r* 59.6%

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

      3. *-commutative 59.6%

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

      4. associate-*r* 59.8%

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

      5. associate-*l* 53.7%

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

   6. Simplified 53.7%

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

   if -3.20000000000000005e117 < z < -5.4000000000000003e-70

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 99.7%

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

      2. distribute-lft-neg-in 99.7%

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

      3. associate-*l* 99.7%

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

      4. *-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. cancel-sign-sub-inv 99.7%

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

      7. *-commutative 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-*l* 99.7%

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

      10. associate-*l* 99.7%

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

      11. associate-*l* 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in a around 0 64.7%

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

   if -5.4000000000000003e-70 < z < 4.4000000000000001e-185

   1. Initial program 98.5%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 98.5%

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

      2. distribute-lft-neg-in 98.5%

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

      3. associate-*l* 98.5%

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

      4. *-commutative 98.5%

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

      5. *-commutative 98.5%

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

      6. cancel-sign-sub-inv 98.5%

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

      7. *-commutative 98.5%

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

      8. *-commutative 98.5%

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

      9. associate-*l* 98.5%

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

      10. associate-*l* 99.7%

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

      11. associate-*l* 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around 0 85.1%

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]

   if 4.4000000000000001e-185 < z

   1. Initial program 94.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.4%

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

      2. distribute-lft-neg-in 94.4%

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

      3. associate-*l* 94.5%

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

      4. *-commutative 94.5%

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

      5. *-commutative 94.5%

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

      6. cancel-sign-sub-inv 94.5%

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

      7. *-commutative 94.5%

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

      8. *-commutative 94.5%

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

      9. associate-*l* 94.4%

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

      10. associate-*l* 93.6%

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

      11. associate-*l* 93.6%

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

   3. Simplified 93.6%

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

   4. Taylor expanded in x around 0 79.4%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.2 \cdot 10^{+117}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -5.4 \cdot 10^{-70}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 4.4 \cdot 10^{-185}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \]

Alternative 5: 77.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;z \leq -3.2 \cdot 10^{+117}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -2.3 \cdot 10^{-71}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 5.7 \cdot 10^{-185}:\\ \;\;\;\;t_1 + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_1 - t \cdot \left(y \cdot \left(z \cdot 9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= z -3.2e+117)
     (* y (* t (* z -9.0)))
     (if (<= z -2.3e-71)
       (- (* x 2.0) (* 9.0 (* t (* z y))))
       (if (<= z 5.7e-185) (+ t_1 (* x 2.0)) (- t_1 (* t (* y (* z 9.0)))))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -3.2e+117) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -2.3e-71) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else if (z <= 5.7e-185) {
		tmp = t_1 + (x * 2.0);
	} else {
		tmp = t_1 - (t * (y * (z * 9.0)));
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 = 27.0d0 * (a * b)
    if (z <= (-3.2d+117)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= (-2.3d-71)) then
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    else if (z <= 5.7d-185) then
        tmp = t_1 + (x * 2.0d0)
    else
        tmp = t_1 - (t * (y * (z * 9.0d0)))
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double tmp;
	if (z <= -3.2e+117) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -2.3e-71) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else if (z <= 5.7e-185) {
		tmp = t_1 + (x * 2.0);
	} else {
		tmp = t_1 - (t * (y * (z * 9.0)));
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if z <= -3.2e+117:
		tmp = y * (t * (z * -9.0))
	elif z <= -2.3e-71:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	elif z <= 5.7e-185:
		tmp = t_1 + (x * 2.0)
	else:
		tmp = t_1 - (t * (y * (z * 9.0)))
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (z <= -3.2e+117)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= -2.3e-71)
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	elseif (z <= 5.7e-185)
		tmp = Float64(t_1 + Float64(x * 2.0));
	else
		tmp = Float64(t_1 - Float64(t * Float64(y * Float64(z * 9.0))));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (z <= -3.2e+117)
		tmp = y * (t * (z * -9.0));
	elseif (z <= -2.3e-71)
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	elseif (z <= 5.7e-185)
		tmp = t_1 + (x * 2.0);
	else
		tmp = t_1 - (t * (y * (z * 9.0)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.2e+117], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.3e-71], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.7e-185], N[(t$95$1 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(t$95$1 - N[(t * N[(y * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if z < -3.20000000000000005e117

   1. Initial program 89.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 89.9%

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

      2. distribute-lft-neg-in 89.9%

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

      3. associate-*l* 90.0%

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

      4. *-commutative 90.0%

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

      5. *-commutative 90.0%

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

      6. cancel-sign-sub-inv 90.0%

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

      7. *-commutative 90.0%

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

      8. *-commutative 90.0%

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

      9. associate-*l* 89.9%

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

      10. associate-*l* 80.5%

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

      11. associate-*l* 80.4%

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

   3. Simplified 80.4%

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

   4. Taylor expanded in y around inf 53.3%

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

      1. *-commutative 53.3%

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

      2. associate-*r* 59.6%

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

      3. *-commutative 59.6%

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

      4. associate-*r* 59.8%

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

      5. associate-*l* 53.7%

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

   6. Simplified 53.7%

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

   if -3.20000000000000005e117 < z < -2.2999999999999998e-71

   1. Initial program 99.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 99.7%

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

      2. distribute-lft-neg-in 99.7%

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

      3. associate-*l* 99.7%

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

      4. *-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. cancel-sign-sub-inv 99.7%

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

      7. *-commutative 99.7%

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

      8. *-commutative 99.7%

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

      9. associate-*l* 99.7%

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

      10. associate-*l* 99.7%

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

      11. associate-*l* 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in a around 0 64.7%

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

   if -2.2999999999999998e-71 < z < 5.69999999999999986e-185

   1. Initial program 98.5%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 98.5%

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

      2. distribute-lft-neg-in 98.5%

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

      3. associate-*l* 98.5%

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

      4. *-commutative 98.5%

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

      5. *-commutative 98.5%

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

      6. cancel-sign-sub-inv 98.5%

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

      7. *-commutative 98.5%

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

      8. *-commutative 98.5%

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

      9. associate-*l* 98.5%

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

      10. associate-*l* 99.7%

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

      11. associate-*l* 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around 0 85.1%

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]

   if 5.69999999999999986e-185 < z

   1. Initial program 94.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.4%

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

      2. distribute-lft-neg-in 94.4%

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

      3. associate-*l* 94.5%

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

      4. *-commutative 94.5%

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

      5. *-commutative 94.5%

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

      6. cancel-sign-sub-inv 94.5%

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

      7. *-commutative 94.5%

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

      8. *-commutative 94.5%

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

      9. associate-*l* 94.4%

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

      10. associate-*l* 93.6%

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

      11. associate-*l* 93.6%

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

   3. Simplified 93.6%

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

   4. Taylor expanded in x around 0 79.4%

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

      1. expm1-log1p-u 47.6%

         \[\leadsto 27 \cdot \left(a \cdot b\right) - \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\right)} \]

      2. expm1-udef 44.4%

         \[\leadsto 27 \cdot \left(a \cdot b\right) - \color{blue}{\left(e^{\mathsf{log1p}\left(9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)} - 1\right)} \]

   6. Applied egg-rr 44.4%

      \[\leadsto 27 \cdot \left(a \cdot b\right) - \color{blue}{\left(e^{\mathsf{log1p}\left(9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)} - 1\right)} \]
   7. Step-by-step derivation

      1. expm1-def 47.6%

         \[\leadsto 27 \cdot \left(a \cdot b\right) - \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\right)} \]

      2. expm1-log1p 79.4%

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

      3. *-commutative 79.4%

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

      4. associate-*l* 79.4%

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

      5. associate-*l* 79.4%

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

   8. Simplified 79.4%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.2 \cdot 10^{+117}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -2.3 \cdot 10^{-71}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 5.7 \cdot 10^{-185}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - t \cdot \left(y \cdot \left(z \cdot 9\right)\right)\\ \end{array} \]

Alternative 6: 95.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 6 \cdot 10^{-11}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 6e-11)
   (+ (* a (* 27.0 b)) (- (* x 2.0) (* (* y 9.0) (* z t))))
   (- (* 27.0 (* a b)) (* 9.0 (* t (* z y))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 6e-11) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	} else {
		tmp = (27.0 * (a * b)) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= 6d-11) then
        tmp = (a * (27.0d0 * b)) + ((x * 2.0d0) - ((y * 9.0d0) * (z * t)))
    else
        tmp = (27.0d0 * (a * b)) - (9.0d0 * (t * (z * y)))
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 6e-11) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	} else {
		tmp = (27.0 * (a * b)) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= 6e-11:
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)))
	else:
		tmp = (27.0 * (a * b)) - (9.0 * (t * (z * y)))
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 6e-11)
		tmp = Float64(Float64(a * Float64(27.0 * b)) + Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))));
	else
		tmp = Float64(Float64(27.0 * Float64(a * b)) - Float64(9.0 * Float64(t * Float64(z * y))));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= 6e-11)
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	else
		tmp = (27.0 * (a * b)) - (9.0 * (t * (z * y)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 6e-11], N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(N[(y * 9.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6e-11

   1. Initial program 97.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 97.7%

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

      2. distribute-lft-neg-in 97.7%

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

      3. associate-*l* 97.7%

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

      4. *-commutative 97.7%

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

      5. *-commutative 97.7%

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

      6. cancel-sign-sub-inv 97.7%

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

      7. *-commutative 97.7%

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

      8. *-commutative 97.7%

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

      9. associate-*l* 97.7%

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

      10. associate-*l* 96.3%

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

      11. associate-*l* 96.3%

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

   3. Simplified 96.3%

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

   if 6e-11 < z

   1. Initial program 91.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 91.3%

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

      2. distribute-lft-neg-in 91.3%

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

      3. associate-*l* 91.3%

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

      4. *-commutative 91.3%

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

      5. *-commutative 91.3%

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

      6. cancel-sign-sub-inv 91.3%

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

      7. *-commutative 91.3%

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

      8. *-commutative 91.3%

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

      9. associate-*l* 91.3%

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

      10. associate-*l* 91.3%

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

      11. associate-*l* 91.4%

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

   3. Simplified 91.4%

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

   4. Taylor expanded in x around 0 83.4%

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

4. Final simplification 92.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 6 \cdot 10^{-11}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \]

Alternative 7: 98.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 6.2 \cdot 10^{-56}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right) + \left(x \cdot 2 - t \cdot \left(z \cdot \left(y \cdot 9\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 6.2e-56)
   (+ (* a (* 27.0 b)) (- (* x 2.0) (* (* y 9.0) (* z t))))
   (+ (* b (* a 27.0)) (- (* x 2.0) (* t (* z (* y 9.0)))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 6.2e-56) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	} else {
		tmp = (b * (a * 27.0)) + ((x * 2.0) - (t * (z * (y * 9.0))));
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= 6.2d-56) then
        tmp = (a * (27.0d0 * b)) + ((x * 2.0d0) - ((y * 9.0d0) * (z * t)))
    else
        tmp = (b * (a * 27.0d0)) + ((x * 2.0d0) - (t * (z * (y * 9.0d0))))
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 6.2e-56) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	} else {
		tmp = (b * (a * 27.0)) + ((x * 2.0) - (t * (z * (y * 9.0))));
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= 6.2e-56:
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)))
	else:
		tmp = (b * (a * 27.0)) + ((x * 2.0) - (t * (z * (y * 9.0))))
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 6.2e-56)
		tmp = Float64(Float64(a * Float64(27.0 * b)) + Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))));
	else
		tmp = Float64(Float64(b * Float64(a * 27.0)) + Float64(Float64(x * 2.0) - Float64(t * Float64(z * Float64(y * 9.0)))));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= 6.2e-56)
		tmp = (a * (27.0 * b)) + ((x * 2.0) - ((y * 9.0) * (z * t)));
	else
		tmp = (b * (a * 27.0)) + ((x * 2.0) - (t * (z * (y * 9.0))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 6.2e-56], N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(N[(y * 9.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(t * N[(z * N[(y * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6.19999999999999975e-56

   1. Initial program 97.6%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 97.6%

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

      2. distribute-lft-neg-in 97.6%

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

      3. associate-*l* 97.6%

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

      4. *-commutative 97.6%

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

      5. *-commutative 97.6%

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

      6. cancel-sign-sub-inv 97.6%

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

      7. *-commutative 97.6%

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

      8. *-commutative 97.6%

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

      9. associate-*l* 97.6%

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

      10. associate-*l* 96.1%

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

      11. associate-*l* 96.1%

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

   3. Simplified 96.1%

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

   if 6.19999999999999975e-56 < z

   1. Initial program 92.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 6.2 \cdot 10^{-56}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - \left(y \cdot 9\right) \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right) + \left(x \cdot 2 - t \cdot \left(z \cdot \left(y \cdot 9\right)\right)\right)\\ \end{array} \]

Alternative 8: 79.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+116}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-70} \lor \neg \left(z \leq 2.7 \cdot 10^{-57}\right):\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -4e+116)
   (* y (* t (* z -9.0)))
   (if (or (<= z -7e-70) (not (<= z 2.7e-57)))
     (- (* x 2.0) (* 9.0 (* t (* z y))))
     (+ (* 27.0 (* a b)) (* x 2.0)))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -4e+116) {
		tmp = y * (t * (z * -9.0));
	} else if ((z <= -7e-70) || !(z <= 2.7e-57)) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= (-4d+116)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if ((z <= (-7d-70)) .or. (.not. (z <= 2.7d-57))) then
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    else
        tmp = (27.0d0 * (a * b)) + (x * 2.0d0)
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -4e+116) {
		tmp = y * (t * (z * -9.0));
	} else if ((z <= -7e-70) || !(z <= 2.7e-57)) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -4e+116:
		tmp = y * (t * (z * -9.0))
	elif (z <= -7e-70) or not (z <= 2.7e-57):
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	else:
		tmp = (27.0 * (a * b)) + (x * 2.0)
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -4e+116)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif ((z <= -7e-70) || !(z <= 2.7e-57))
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	else
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -4e+116)
		tmp = y * (t * (z * -9.0));
	elseif ((z <= -7e-70) || ~((z <= 2.7e-57)))
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	else
		tmp = (27.0 * (a * b)) + (x * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -4e+116], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, -7e-70], N[Not[LessEqual[z, 2.7e-57]], $MachinePrecision]], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -4.00000000000000006e116

   1. Initial program 89.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 89.9%

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

      2. distribute-lft-neg-in 89.9%

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

      3. associate-*l* 90.0%

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

      4. *-commutative 90.0%

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

      5. *-commutative 90.0%

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

      6. cancel-sign-sub-inv 90.0%

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

      7. *-commutative 90.0%

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

      8. *-commutative 90.0%

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

      9. associate-*l* 89.9%

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

      10. associate-*l* 80.5%

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

      11. associate-*l* 80.4%

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

   3. Simplified 80.4%

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

   4. Taylor expanded in y around inf 53.3%

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

      1. *-commutative 53.3%

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

      2. associate-*r* 59.6%

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

      3. *-commutative 59.6%

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

      4. associate-*r* 59.8%

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

      5. associate-*l* 53.7%

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

   6. Simplified 53.7%

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

   if -4.00000000000000006e116 < z < -6.99999999999999949e-70 or 2.7000000000000002e-57 < z

   1. Initial program 94.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.7%

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

      2. distribute-lft-neg-in 94.7%

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

      3. associate-*l* 94.7%

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

      4. *-commutative 94.7%

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

      5. *-commutative 94.7%

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

      6. cancel-sign-sub-inv 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 94.7%

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

      9. associate-*l* 94.7%

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

      10. associate-*l* 93.8%

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

      11. associate-*l* 93.8%

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

   3. Simplified 93.8%

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

   4. Taylor expanded in a around 0 68.0%

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

   if -6.99999999999999949e-70 < z < 2.7000000000000002e-57

   1. Initial program 98.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 98.8%

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

      2. distribute-lft-neg-in 98.8%

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

      3. associate-*l* 98.9%

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

      4. *-commutative 98.9%

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

      5. *-commutative 98.9%

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

      6. cancel-sign-sub-inv 98.9%

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

      7. *-commutative 98.9%

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

      8. *-commutative 98.9%

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

      9. associate-*l* 98.8%

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

      10. associate-*l* 99.8%

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

      11. associate-*l* 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around 0 83.6%

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

4. Final simplification 73.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+116}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -7 \cdot 10^{-70} \lor \neg \left(z \leq 2.7 \cdot 10^{-57}\right):\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \end{array} \]

Alternative 9: 75.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -8.5 \cdot 10^{+36}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 0.00095:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -8.5e+36)
   (* y (* t (* z -9.0)))
   (if (<= z 0.00095) (+ (* 27.0 (* a b)) (* x 2.0)) (* z (* t (* y -9.0))))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.5e+36) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 0.00095) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = z * (t * (y * -9.0));
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= (-8.5d+36)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= 0.00095d0) then
        tmp = (27.0d0 * (a * b)) + (x * 2.0d0)
    else
        tmp = z * (t * (y * (-9.0d0)))
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.5e+36) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 0.00095) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = z * (t * (y * -9.0));
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -8.5e+36:
		tmp = y * (t * (z * -9.0))
	elif z <= 0.00095:
		tmp = (27.0 * (a * b)) + (x * 2.0)
	else:
		tmp = z * (t * (y * -9.0))
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -8.5e+36)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= 0.00095)
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	else
		tmp = Float64(z * Float64(t * Float64(y * -9.0)));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -8.5e+36)
		tmp = y * (t * (z * -9.0));
	elseif (z <= 0.00095)
		tmp = (27.0 * (a * b)) + (x * 2.0);
	else
		tmp = z * (t * (y * -9.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -8.5e+36], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.00095], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(z * N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.50000000000000014e36

   1. Initial program 93.4%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 93.4%

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

      2. distribute-lft-neg-in 93.4%

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

      3. associate-*l* 93.5%

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

      4. *-commutative 93.5%

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

      5. *-commutative 93.5%

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

      6. cancel-sign-sub-inv 93.5%

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

      7. *-commutative 93.5%

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

      8. *-commutative 93.5%

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

      9. associate-*l* 93.4%

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

      10. associate-*l* 87.3%

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

      11. associate-*l* 87.3%

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

   3. Simplified 87.3%

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

   4. Taylor expanded in y around inf 56.9%

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

      1. *-commutative 56.9%

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

      2. associate-*r* 61.1%

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

      3. *-commutative 61.1%

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

      4. associate-*r* 61.2%

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

      5. associate-*l* 57.2%

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

   6. Simplified 57.2%

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

   if -8.50000000000000014e36 < z < 9.49999999999999998e-4

   1. Initial program 99.0%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 99.0%

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

      2. distribute-lft-neg-in 99.0%

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

      3. associate-*l* 99.0%

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

      4. *-commutative 99.0%

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

      5. *-commutative 99.0%

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

      6. cancel-sign-sub-inv 99.0%

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

      7. *-commutative 99.0%

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

      8. *-commutative 99.0%

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

      9. associate-*l* 99.0%

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

      10. associate-*l* 99.1%

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

      11. associate-*l* 99.1%

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

   3. Simplified 99.1%

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

   4. Taylor expanded in y around 0 79.8%

      \[\leadsto \color{blue}{2 \cdot x + 27 \cdot \left(a \cdot b\right)} \]

   if 9.49999999999999998e-4 < z

   1. Initial program 90.9%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 90.9%

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

      2. distribute-lft-neg-in 90.9%

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

      3. associate-*l* 90.9%

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

      4. *-commutative 90.9%

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

      5. *-commutative 90.9%

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

      6. cancel-sign-sub-inv 90.9%

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

      7. *-commutative 90.9%

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

      8. *-commutative 90.9%

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

      9. associate-*l* 90.9%

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

      10. associate-*l* 91.0%

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

      11. associate-*l* 91.0%

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

   3. Simplified 91.0%

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

   4. Taylor expanded in y around inf 62.2%

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

      1. *-commutative 62.2%

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

      2. associate-*l* 61.0%

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

      3. associate-*l* 61.0%

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

      4. *-commutative 61.0%

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

      5. *-commutative 61.0%

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

      6. associate-*l* 65.0%

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

   6. Simplified 65.0%

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

4. Final simplification 72.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8.5 \cdot 10^{+36}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 0.00095:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\right)\right)\\ \end{array} \]

Alternative 10: 47.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -2.7 \cdot 10^{-58} \lor \neg \left(b \leq 1.9 \cdot 10^{+89}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -2.7e-58) (not (<= b 1.9e+89))) (* 27.0 (* a b)) (* x 2.0)))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.7e-58) || !(b <= 1.9e+89)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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.7d-58)) .or. (.not. (b <= 1.9d+89))) then
        tmp = 27.0d0 * (a * b)
    else
        tmp = x * 2.0d0
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.7e-58) || !(b <= 1.9e+89)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.7e-58) or not (b <= 1.9e+89):
		tmp = 27.0 * (a * b)
	else:
		tmp = x * 2.0
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -2.7e-58) || !(b <= 1.9e+89))
		tmp = Float64(27.0 * Float64(a * b));
	else
		tmp = Float64(x * 2.0);
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -2.7e-58) || ~((b <= 1.9e+89)))
		tmp = 27.0 * (a * b);
	else
		tmp = x * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.7e-58], N[Not[LessEqual[b, 1.9e+89]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -2.6999999999999999e-58 or 1.90000000000000012e89 < b

   1. Initial program 95.8%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 95.8%

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

      2. distribute-lft-neg-in 95.8%

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

      3. associate-*l* 95.8%

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

      4. *-commutative 95.8%

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

      5. *-commutative 95.8%

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

      6. cancel-sign-sub-inv 95.8%

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

      7. *-commutative 95.8%

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

      8. *-commutative 95.8%

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

      9. associate-*l* 95.8%

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

      10. associate-*l* 94.4%

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

      11. associate-*l* 94.4%

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

   3. Simplified 94.4%

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

   4. Taylor expanded in a around inf 62.6%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]

   if -2.6999999999999999e-58 < b < 1.90000000000000012e89

   1. Initial program 96.2%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 96.2%

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

      2. distribute-lft-neg-in 96.2%

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

      3. associate-*l* 96.2%

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

      4. *-commutative 96.2%

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

      5. *-commutative 96.2%

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

      6. cancel-sign-sub-inv 96.2%

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

      7. *-commutative 96.2%

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

      8. *-commutative 96.2%

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

      9. associate-*l* 96.2%

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

      10. associate-*l* 95.5%

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

      11. associate-*l* 95.5%

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

   3. Simplified 95.5%

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

   4. Taylor expanded in x around inf 36.9%

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

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.7 \cdot 10^{-58} \lor \neg \left(b \leq 1.9 \cdot 10^{+89}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \]

Alternative 11: 46.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -9.6 \cdot 10^{+73}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -9.6e+73) (* -9.0 (* t (* z y))) (* 27.0 (* a b))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -9.6e+73) {
		tmp = -9.0 * (t * (z * y));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= (-9.6d+73)) then
        tmp = (-9.0d0) * (t * (z * y))
    else
        tmp = 27.0d0 * (a * b)
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -9.6e+73) {
		tmp = -9.0 * (t * (z * y));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -9.6e+73:
		tmp = -9.0 * (t * (z * y))
	else:
		tmp = 27.0 * (a * b)
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -9.6e+73)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	else
		tmp = Float64(27.0 * Float64(a * b));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -9.6e+73)
		tmp = -9.0 * (t * (z * y));
	else
		tmp = 27.0 * (a * b);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -9.6e+73], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.60000000000000009e73

   1. Initial program 94.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.7%

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

      2. distribute-lft-neg-in 94.7%

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

      3. associate-*l* 94.7%

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

      4. *-commutative 94.7%

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

      5. *-commutative 94.7%

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

      6. cancel-sign-sub-inv 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 94.7%

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

      9. associate-*l* 94.7%

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

      10. associate-*l* 96.4%

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

      11. associate-*l* 96.4%

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

   3. Simplified 96.4%

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

   4. Taylor expanded in y around inf 60.1%

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

   if -9.60000000000000009e73 < y

   1. Initial program 96.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 96.3%

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

      2. distribute-lft-neg-in 96.3%

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

      3. associate-*l* 96.4%

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

      4. *-commutative 96.4%

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

      5. *-commutative 96.4%

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

      6. cancel-sign-sub-inv 96.4%

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

      7. *-commutative 96.4%

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

      8. *-commutative 96.4%

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

      9. associate-*l* 96.3%

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

      10. associate-*l* 94.6%

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

      11. associate-*l* 94.6%

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

   3. Simplified 94.6%

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

   4. Taylor expanded in a around inf 46.1%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.6 \cdot 10^{+73}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]

Alternative 12: 48.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{+74}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1.15e+74) (* y (* -9.0 (* z t))) (* 27.0 (* a b))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.15e+74) {
		tmp = y * (-9.0 * (z * t));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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.15d+74)) then
        tmp = y * ((-9.0d0) * (z * t))
    else
        tmp = 27.0d0 * (a * b)
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1.15e+74) {
		tmp = y * (-9.0 * (z * t));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1.15e+74:
		tmp = y * (-9.0 * (z * t))
	else:
		tmp = 27.0 * (a * b)
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1.15e+74)
		tmp = Float64(y * Float64(-9.0 * Float64(z * t)));
	else
		tmp = Float64(27.0 * Float64(a * b));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1.15e+74)
		tmp = y * (-9.0 * (z * t));
	else
		tmp = 27.0 * (a * b);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1.15e+74], N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.1499999999999999e74

   1. Initial program 94.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.7%

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

      2. distribute-lft-neg-in 94.7%

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

      3. associate-*l* 94.7%

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

      4. *-commutative 94.7%

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

      5. *-commutative 94.7%

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

      6. cancel-sign-sub-inv 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 94.7%

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

      9. associate-*l* 94.7%

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

      10. associate-*l* 96.4%

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

      11. associate-*l* 96.4%

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

   3. Simplified 96.4%

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

   4. Taylor expanded in y around inf 60.1%

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

      1. *-commutative 60.1%

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

      2. associate-*r* 51.9%

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

      3. *-commutative 51.9%

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

      4. associate-*r* 51.9%

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

      5. associate-*l* 63.6%

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

   6. Simplified 63.6%

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

   7. Taylor expanded in t around 0 63.5%

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

   if -1.1499999999999999e74 < y

   1. Initial program 96.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 96.3%

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

      2. distribute-lft-neg-in 96.3%

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

      3. associate-*l* 96.4%

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

      4. *-commutative 96.4%

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

      5. *-commutative 96.4%

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

      6. cancel-sign-sub-inv 96.4%

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

      7. *-commutative 96.4%

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

      8. *-commutative 96.4%

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

      9. associate-*l* 96.3%

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

      10. associate-*l* 94.6%

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

      11. associate-*l* 94.6%

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

   3. Simplified 94.6%

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

   4. Taylor expanded in a around inf 46.1%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{+74}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]

Alternative 13: 48.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{+74}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= y -1e+74) (* y (* t (* z -9.0))) (* 27.0 (* a b))))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1e+74) {
		tmp = y * (t * (z * -9.0));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 <= (-1d+74)) then
        tmp = y * (t * (z * (-9.0d0)))
    else
        tmp = 27.0d0 * (a * b)
    end if
    code = tmp
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y <= -1e+74) {
		tmp = y * (t * (z * -9.0));
	} else {
		tmp = 27.0 * (a * b);
	}
	return tmp;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if y <= -1e+74:
		tmp = y * (t * (z * -9.0))
	else:
		tmp = 27.0 * (a * b)
	return tmp

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y <= -1e+74)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	else
		tmp = Float64(27.0 * Float64(a * b));
	end
	return tmp
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y <= -1e+74)
		tmp = y * (t * (z * -9.0));
	else
		tmp = 27.0 * (a * b);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -1e+74], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.99999999999999952e73

   1. Initial program 94.7%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 94.7%

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

      2. distribute-lft-neg-in 94.7%

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

      3. associate-*l* 94.7%

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

      4. *-commutative 94.7%

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

      5. *-commutative 94.7%

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

      6. cancel-sign-sub-inv 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 94.7%

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

      9. associate-*l* 94.7%

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

      10. associate-*l* 96.4%

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

      11. associate-*l* 96.4%

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

   3. Simplified 96.4%

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

   4. Taylor expanded in y around inf 60.1%

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

      1. *-commutative 60.1%

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

      2. associate-*r* 51.9%

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

      3. *-commutative 51.9%

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

      4. associate-*r* 51.9%

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

      5. associate-*l* 63.6%

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

   6. Simplified 63.6%

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

   if -9.99999999999999952e73 < y

   1. Initial program 96.3%

      \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
   2. Step-by-step derivation

      1. sub-neg 96.3%

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

      2. distribute-lft-neg-in 96.3%

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

      3. associate-*l* 96.4%

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

      4. *-commutative 96.4%

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

      5. *-commutative 96.4%

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

      6. cancel-sign-sub-inv 96.4%

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

      7. *-commutative 96.4%

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

      8. *-commutative 96.4%

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

      9. associate-*l* 96.3%

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

      10. associate-*l* 94.6%

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

      11. associate-*l* 94.6%

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

   3. Simplified 94.6%

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

   4. Taylor expanded in a around inf 46.1%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{+74}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]

Alternative 14: 30.4% accurate, 5.7× speedup

Math

\[\begin{array}{l} [y, z, t] = \mathsf{sort}([y, z, t])\\ [a, b] = \mathsf{sort}([a, b])\\ \\ x \cdot 2 \end{array} \]

FPCore

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b) :precision binary64 (* x 2.0))

C

assert(y < z && z < t);
assert(a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Fortran

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
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 * 2.0d0
end function

Java

assert y < z && z < t;
assert a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Python

[y, z, t] = sort([y, z, t])
[a, b] = sort([a, b])
def code(x, y, z, t, a, b):
	return x * 2.0

Julia

y, z, t = sort([y, z, t])
a, b = sort([a, b])
function code(x, y, z, t, a, b)
	return Float64(x * 2.0)
end

MATLAB

y, z, t = num2cell(sort([y, z, t])){:}
a, b = num2cell(sort([a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = x * 2.0;
end

Wolfram

NOTE: y, z, and t should be sorted in increasing order before calling this function.
NOTE: a and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]

Derivation

1. Initial program 96.0%

   \[\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \]
2. Step-by-step derivation

   1. sub-neg 96.0%

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

   2. distribute-lft-neg-in 96.0%

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

   3. associate-*l* 96.0%

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

   4. *-commutative 96.0%

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

   5. *-commutative 96.0%

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

   6. cancel-sign-sub-inv 96.0%

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

   7. *-commutative 96.0%

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

   8. *-commutative 96.0%

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

   9. associate-*l* 96.0%

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

   10. associate-*l* 95.0%

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

   11. associate-*l* 95.0%

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

3. Simplified 95.0%

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

4. Taylor expanded in x around inf 26.5%

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

5. Final simplification 26.5%

   \[\leadsto x \cdot 2 \]

Developer target: 94.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\ \;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (< y 7.590524218811189e-161)
   (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b)))
   (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * 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 < 7.590524218811189d-161) then
        tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * 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 < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y < 7.590524218811189e-161:
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b))
	else:
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y < 7.590524218811189e-161)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y < 7.590524218811189e-161)
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	else
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2023271 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, A"
  :precision binary64

  :herbie-target
  (if (< y 7.590524218811189e-161) (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b))) (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b)))

  (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))