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

Percentage Accurate: 95.1% → 98.4%

Time: 13.4s

Alternatives: 16

Speedup: 1.0×

• 26.7% 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.1% 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.4% accurate, 0.1× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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) -2e-88)
   (fma a (* 27.0 b) (fma x 2.0 (* y (* z (* t -9.0)))))
   (+ (- (* x 2.0) (* t (* (* y 9.0) z))) (* b (* a 27.0)))))

C

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

Julia

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

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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], -2e-88], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(t * N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y #s(literal 9 binary64)) < -1.99999999999999987e-88

   1. Initial program 95.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 95.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- 95.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. *-commutative 95.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)} \]

      4. cancel-sign-sub-inv 95.2%

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

      5. associate-*r* 92.0%

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

      6. distribute-lft-neg-in 92.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 z \]

      7. *-commutative 92.0%

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

      8. cancel-sign-sub-inv 92.0%

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

      9. associate-+r- 92.0%

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

      10. associate-*l* 92.0%

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

      11. fma-define 92.0%

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

      12. fma-neg 92.0%

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

      13. associate-*l* 98.6%

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

      14. distribute-rgt-neg-in 98.6%

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

      15. *-commutative 98.6%

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

      16. associate-*l* 98.6%

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

      17. *-commutative 98.6%

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

      18. distribute-lft-neg-in 98.6%

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

      19. associate-*r* 98.7%

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

   3. Simplified 98.7%

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

   if -1.99999999999999987e-88 < (*.f64 y #s(literal 9 binary64))

   1. Initial program 95.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. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 96.6%

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

Alternative 2: 98.6% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 5e5

   1. Initial program 94.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. associate-+l- 94.3%

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

      2. *-commutative 94.3%

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

      3. *-commutative 94.3%

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

      4. associate-*l* 94.3%

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

      5. associate-+l- 94.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} \]

      6. associate-*l* 94.3%

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

      7. *-commutative 94.3%

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

      8. *-commutative 94.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 \]

      9. associate-*l* 97.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 \]

      10. associate-*l* 96.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 96.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. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 96.7%

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

      2. associate-+r- 96.7%

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

      3. associate-*r* 97.3%

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

      4. *-commutative 97.3%

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

      5. associate-*l* 97.2%

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

      6. associate-*l* 97.2%

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

      7. associate-*r* 96.7%

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

   6. Applied egg-rr 96.7%

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

   if 5e5 < t

   1. Initial program 98.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. +-commutative 98.4%

         \[\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- 98.4%

         \[\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. *-commutative 98.4%

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

      4. cancel-sign-sub-inv 98.4%

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

      5. associate-*r* 87.5%

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

      6. distribute-lft-neg-in 87.5%

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

      7. *-commutative 87.5%

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

      8. cancel-sign-sub-inv 87.5%

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

      9. associate-+r- 87.5%

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

      10. associate-*l* 87.4%

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

      11. fma-define 88.9%

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

      12. cancel-sign-sub-inv 88.9%

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

      13. fma-define 88.9%

          \[\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. distribute-lft-neg-in 88.9%

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

      15. distribute-rgt-neg-in 88.9%

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

      16. *-commutative 88.9%

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

      17. associate-*r* 99.8%

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

      18. associate-*l* 99.8%

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

      19. neg-mul-1 99.8%

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

      20. associate-*r* 99.8%

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

   3. Simplified 99.8%

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

4. Final simplification 97.5%

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

Alternative 3: 50.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -0.0255:\\ \;\;\;\;-9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq -9.2 \cdot 10^{-300}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{-290}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{-233}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{-98}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -0.0255)
   (* -9.0 (* y (* z t)))
   (if (<= z -9.2e-300)
     (* x 2.0)
     (if (<= z 3.9e-290)
       (* 27.0 (* a b))
       (if (<= z 6.5e-233)
         (* x 2.0)
         (if (<= z 1.4e-98) (* a (* 27.0 b)) (* -9.0 (* t (* y z)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.0255) {
		tmp = -9.0 * (y * (z * t));
	} else if (z <= -9.2e-300) {
		tmp = x * 2.0;
	} else if (z <= 3.9e-290) {
		tmp = 27.0 * (a * b);
	} else if (z <= 6.5e-233) {
		tmp = x * 2.0;
	} else if (z <= 1.4e-98) {
		tmp = a * (27.0 * b);
	} else {
		tmp = -9.0 * (t * (y * z));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 <= (-0.0255d0)) then
        tmp = (-9.0d0) * (y * (z * t))
    else if (z <= (-9.2d-300)) then
        tmp = x * 2.0d0
    else if (z <= 3.9d-290) then
        tmp = 27.0d0 * (a * b)
    else if (z <= 6.5d-233) then
        tmp = x * 2.0d0
    else if (z <= 1.4d-98) then
        tmp = a * (27.0d0 * b)
    else
        tmp = (-9.0d0) * (t * (y * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.0255) {
		tmp = -9.0 * (y * (z * t));
	} else if (z <= -9.2e-300) {
		tmp = x * 2.0;
	} else if (z <= 3.9e-290) {
		tmp = 27.0 * (a * b);
	} else if (z <= 6.5e-233) {
		tmp = x * 2.0;
	} else if (z <= 1.4e-98) {
		tmp = a * (27.0 * b);
	} else {
		tmp = -9.0 * (t * (y * z));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -0.0255:
		tmp = -9.0 * (y * (z * t))
	elif z <= -9.2e-300:
		tmp = x * 2.0
	elif z <= 3.9e-290:
		tmp = 27.0 * (a * b)
	elif z <= 6.5e-233:
		tmp = x * 2.0
	elif z <= 1.4e-98:
		tmp = a * (27.0 * b)
	else:
		tmp = -9.0 * (t * (y * z))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -0.0255)
		tmp = Float64(-9.0 * Float64(y * Float64(z * t)));
	elseif (z <= -9.2e-300)
		tmp = Float64(x * 2.0);
	elseif (z <= 3.9e-290)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (z <= 6.5e-233)
		tmp = Float64(x * 2.0);
	elseif (z <= 1.4e-98)
		tmp = Float64(a * Float64(27.0 * b));
	else
		tmp = Float64(-9.0 * Float64(t * Float64(y * z)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -0.0255)
		tmp = -9.0 * (y * (z * t));
	elseif (z <= -9.2e-300)
		tmp = x * 2.0;
	elseif (z <= 3.9e-290)
		tmp = 27.0 * (a * b);
	elseif (z <= 6.5e-233)
		tmp = x * 2.0;
	elseif (z <= 1.4e-98)
		tmp = a * (27.0 * b);
	else
		tmp = -9.0 * (t * (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -0.0255], N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -9.2e-300], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 3.9e-290], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.5e-233], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 1.4e-98], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], N[(-9.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

2. if z < -0.0254999999999999984

   1. Initial program 89.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. associate-+l- 89.2%

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

      2. *-commutative 89.2%

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

      3. *-commutative 89.2%

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

      4. associate-*l* 89.1%

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

      5. associate-+l- 89.1%

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

      6. associate-*l* 89.2%

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

      7. *-commutative 89.2%

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

      8. *-commutative 89.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 \]

      9. 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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in x around 0 68.5%

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

   6. Taylor expanded in a around 0 51.1%

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

      1. *-commutative 51.1%

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

      2. associate-*l* 49.7%

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

      3. *-commutative 49.7%

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

   8. Simplified 49.7%

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

   if -0.0254999999999999984 < z < -9.20000000000000003e-300 or 3.89999999999999973e-290 < z < 6.49999999999999989e-233

   1. Initial program 99.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. associate-+l- 99.9%

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

      2. *-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*l* 99.8%

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

      5. associate-+l- 99.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} \]

      6. associate-*l* 99.9%

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

      7. *-commutative 99.9%

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

      8. *-commutative 99.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 \]

      9. 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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in x around inf 50.5%

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

   if -9.20000000000000003e-300 < z < 3.89999999999999973e-290

   1. Initial program 99.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. associate-+l- 99.6%

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

      2. *-commutative 99.6%

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

      3. *-commutative 99.6%

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

      4. associate-*l* 99.6%

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

      5. associate-+l- 99.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} \]

      6. associate-*l* 99.6%

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

      7. *-commutative 99.6%

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

      8. *-commutative 99.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 \]

      9. associate-*l* 99.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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in a around inf 82.0%

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

   if 6.49999999999999989e-233 < z < 1.3999999999999999e-98

   1. Initial program 97.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. associate-+l- 97.4%

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

      2. *-commutative 97.4%

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

      3. *-commutative 97.4%

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

      4. associate-*l* 97.4%

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

      5. associate-+l- 97.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} \]

      6. associate-*l* 97.4%

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

      7. *-commutative 97.4%

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

      8. *-commutative 97.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 \]

      9. 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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in a around inf 32.6%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 32.8%

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

      2. *-commutative 32.8%

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

      3. associate-*r* 29.4%

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

   7. Simplified 29.4%

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

   if 1.3999999999999999e-98 < z

   1. Initial program 95.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. associate-+l- 95.1%

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

      2. *-commutative 95.1%

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

      3. *-commutative 95.1%

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

      4. associate-*l* 95.1%

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

      5. associate-+l- 95.1%

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

      6. associate-*l* 95.1%

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

      7. *-commutative 95.1%

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

      8. *-commutative 95.1%

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

      9. associate-*l* 89.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 \]

      10. associate-*l* 88.9%

          \[\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 88.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in y around inf 57.2%

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

4. Final simplification 51.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.0255:\\ \;\;\;\;-9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq -9.2 \cdot 10^{-300}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 3.9 \cdot 10^{-290}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{-233}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{-98}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 50.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -0.0014:\\ \;\;\;\;\left(z \cdot \left(9 \cdot t\right)\right) \cdot \left(-y\right)\\ \mathbf{elif}\;z \leq -9.2 \cdot 10^{-300}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{-289}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{-232}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{-99}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -0.0014)
   (* (* z (* 9.0 t)) (- y))
   (if (<= z -9.2e-300)
     (* x 2.0)
     (if (<= z 3.6e-289)
       (* 27.0 (* a b))
       (if (<= z 5.8e-232)
         (* x 2.0)
         (if (<= z 6.5e-99) (* a (* 27.0 b)) (* -9.0 (* t (* y z)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.0014) {
		tmp = (z * (9.0 * t)) * -y;
	} else if (z <= -9.2e-300) {
		tmp = x * 2.0;
	} else if (z <= 3.6e-289) {
		tmp = 27.0 * (a * b);
	} else if (z <= 5.8e-232) {
		tmp = x * 2.0;
	} else if (z <= 6.5e-99) {
		tmp = a * (27.0 * b);
	} else {
		tmp = -9.0 * (t * (y * z));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 <= (-0.0014d0)) then
        tmp = (z * (9.0d0 * t)) * -y
    else if (z <= (-9.2d-300)) then
        tmp = x * 2.0d0
    else if (z <= 3.6d-289) then
        tmp = 27.0d0 * (a * b)
    else if (z <= 5.8d-232) then
        tmp = x * 2.0d0
    else if (z <= 6.5d-99) then
        tmp = a * (27.0d0 * b)
    else
        tmp = (-9.0d0) * (t * (y * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -0.0014) {
		tmp = (z * (9.0 * t)) * -y;
	} else if (z <= -9.2e-300) {
		tmp = x * 2.0;
	} else if (z <= 3.6e-289) {
		tmp = 27.0 * (a * b);
	} else if (z <= 5.8e-232) {
		tmp = x * 2.0;
	} else if (z <= 6.5e-99) {
		tmp = a * (27.0 * b);
	} else {
		tmp = -9.0 * (t * (y * z));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -0.0014:
		tmp = (z * (9.0 * t)) * -y
	elif z <= -9.2e-300:
		tmp = x * 2.0
	elif z <= 3.6e-289:
		tmp = 27.0 * (a * b)
	elif z <= 5.8e-232:
		tmp = x * 2.0
	elif z <= 6.5e-99:
		tmp = a * (27.0 * b)
	else:
		tmp = -9.0 * (t * (y * z))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -0.0014)
		tmp = Float64(Float64(z * Float64(9.0 * t)) * Float64(-y));
	elseif (z <= -9.2e-300)
		tmp = Float64(x * 2.0);
	elseif (z <= 3.6e-289)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (z <= 5.8e-232)
		tmp = Float64(x * 2.0);
	elseif (z <= 6.5e-99)
		tmp = Float64(a * Float64(27.0 * b));
	else
		tmp = Float64(-9.0 * Float64(t * Float64(y * z)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -0.0014)
		tmp = (z * (9.0 * t)) * -y;
	elseif (z <= -9.2e-300)
		tmp = x * 2.0;
	elseif (z <= 3.6e-289)
		tmp = 27.0 * (a * b);
	elseif (z <= 5.8e-232)
		tmp = x * 2.0;
	elseif (z <= 6.5e-99)
		tmp = a * (27.0 * b);
	else
		tmp = -9.0 * (t * (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -0.0014], N[(N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision] * (-y)), $MachinePrecision], If[LessEqual[z, -9.2e-300], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 3.6e-289], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.8e-232], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.5e-99], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], N[(-9.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

2. if z < -0.00139999999999999999

   1. Initial program 89.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. Add Preprocessing
   3. Step-by-step derivation

      1. pow1 89.2%

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

      2. associate-*l* 89.1%

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

   4. Applied egg-rr 89.1%

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

   5. Taylor expanded in y around inf 51.1%

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

      1. *-commutative 51.1%

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

      2. associate-*l* 51.2%

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

      3. associate-*l* 51.1%

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

   7. Simplified 51.1%

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

      1. *-commutative 51.1%

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

      2. associate-*r* 51.2%

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

      3. associate-*l* 51.1%

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

      4. metadata-eval 51.1%

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

      5. distribute-lft-neg-in 51.1%

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

      6. distribute-rgt-neg-in 51.1%

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

      7. associate-*l* 49.8%

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

      8. *-commutative 49.8%

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

   9. Applied egg-rr 49.8%

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

   if -0.00139999999999999999 < z < -9.20000000000000003e-300 or 3.6e-289 < z < 5.7999999999999998e-232

   1. Initial program 99.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. associate-+l- 99.9%

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

      2. *-commutative 99.9%

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

      3. *-commutative 99.9%

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

      4. associate-*l* 99.8%

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

      5. associate-+l- 99.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} \]

      6. associate-*l* 99.9%

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

      7. *-commutative 99.9%

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

      8. *-commutative 99.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 \]

      9. 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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in x around inf 50.5%

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

   if -9.20000000000000003e-300 < z < 3.6e-289

   1. Initial program 99.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. associate-+l- 99.6%

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

      2. *-commutative 99.6%

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

      3. *-commutative 99.6%

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

      4. associate-*l* 99.6%

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

      5. associate-+l- 99.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} \]

      6. associate-*l* 99.6%

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

      7. *-commutative 99.6%

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

      8. *-commutative 99.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 \]

      9. associate-*l* 99.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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in a around inf 82.0%

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

   if 5.7999999999999998e-232 < z < 6.50000000000000033e-99

   1. Initial program 97.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. associate-+l- 97.4%

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

      2. *-commutative 97.4%

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

      3. *-commutative 97.4%

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

      4. associate-*l* 97.4%

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

      5. associate-+l- 97.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} \]

      6. associate-*l* 97.4%

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

      7. *-commutative 97.4%

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

      8. *-commutative 97.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 \]

      9. 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 \]

      10. 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. Add Preprocessing

   5. Taylor expanded in a around inf 32.6%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 32.8%

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

      2. *-commutative 32.8%

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

      3. associate-*r* 29.4%

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

   7. Simplified 29.4%

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

   if 6.50000000000000033e-99 < z

   1. Initial program 95.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. associate-+l- 95.1%

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

      2. *-commutative 95.1%

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

      3. *-commutative 95.1%

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

      4. associate-*l* 95.1%

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

      5. associate-+l- 95.1%

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

      6. associate-*l* 95.1%

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

      7. *-commutative 95.1%

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

      8. *-commutative 95.1%

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

      9. associate-*l* 89.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 \]

      10. associate-*l* 88.9%

          \[\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 88.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in y around inf 57.2%

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

4. Final simplification 51.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -0.0014:\\ \;\;\;\;\left(z \cdot \left(9 \cdot t\right)\right) \cdot \left(-y\right)\\ \mathbf{elif}\;z \leq -9.2 \cdot 10^{-300}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{-289}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;z \leq 5.8 \cdot 10^{-232}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.5 \cdot 10^{-99}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \mathbf{if}\;b \leq -1.25 \cdot 10^{-53} \lor \neg \left(b \leq 5 \cdot 10^{+117}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - t\_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 (* y z)))))
   (if (or (<= b -1.25e-53) (not (<= b 5e+117)))
     (- (* 27.0 (* a b)) t_1)
     (- (* x 2.0) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 9.0 * (t * (y * z));
	double tmp;
	if ((b <= -1.25e-53) || !(b <= 5e+117)) {
		tmp = (27.0 * (a * b)) - t_1;
	} else {
		tmp = (x * 2.0) - t_1;
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 9.0 * (t * (y * z));
	double tmp;
	if ((b <= -1.25e-53) || !(b <= 5e+117)) {
		tmp = (27.0 * (a * b)) - t_1;
	} else {
		tmp = (x * 2.0) - t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 9.0 * (t * (y * z))
	tmp = 0
	if (b <= -1.25e-53) or not (b <= 5e+117):
		tmp = (27.0 * (a * b)) - t_1
	else:
		tmp = (x * 2.0) - t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(9.0 * Float64(t * Float64(y * z)))
	tmp = 0.0
	if ((b <= -1.25e-53) || !(b <= 5e+117))
		tmp = Float64(Float64(27.0 * Float64(a * b)) - t_1);
	else
		tmp = Float64(Float64(x * 2.0) - t_1);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 9.0 * (t * (y * z));
	tmp = 0.0;
	if ((b <= -1.25e-53) || ~((b <= 5e+117)))
		tmp = (27.0 * (a * b)) - t_1;
	else
		tmp = (x * 2.0) - t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[b, -1.25e-53], N[Not[LessEqual[b, 5e+117]], $MachinePrecision]], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if b < -1.25e-53 or 4.99999999999999983e117 < b

   1. Initial program 94.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. associate-+l- 94.9%

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

      2. *-commutative 94.9%

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

      3. *-commutative 94.9%

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

      4. associate-*l* 94.9%

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

      5. associate-+l- 94.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} \]

      6. associate-*l* 94.9%

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

      7. *-commutative 94.9%

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

      8. *-commutative 94.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 \]

      9. associate-*l* 90.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 \]

      10. associate-*l* 89.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 89.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. Add Preprocessing

   5. Taylor expanded in x around 0 81.5%

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

   if -1.25e-53 < b < 4.99999999999999983e117

   1. Initial program 95.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. associate-+l- 95.7%

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

      2. *-commutative 95.7%

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

      3. *-commutative 95.7%

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

      4. associate-*l* 95.7%

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

      5. associate-+l- 95.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} \]

      6. associate-*l* 95.7%

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

      7. *-commutative 95.7%

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

      8. *-commutative 95.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 \]

      9. associate-*l* 98.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 \]

      10. associate-*l* 98.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 98.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. Add Preprocessing

   5. Taylor expanded in a around 0 82.0%

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

4. Final simplification 81.8%

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

Alternative 6: 78.9% accurate, 0.7× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 (* y z)))))
   (if (<= b -1.65e-101)
     (- (* a (* 27.0 b)) (* (* y z) (* 9.0 t)))
     (if (<= b 9.5e+117) (- (* x 2.0) t_1) (- (* 27.0 (* a b)) t_1)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.65e-101], N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9.5e+117], N[(N[(x * 2.0), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.64999999999999992e-101

   1. Initial program 98.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. Add Preprocessing
   3. Step-by-step derivation

      1. pow1 98.6%

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

      2. associate-*l* 98.7%

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

   4. Applied egg-rr 98.7%

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

   5. Taylor expanded in x around 0 80.7%

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

      1. associate-*r* 80.8%

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

      2. *-commutative 80.8%

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

      3. associate-*r* 80.7%

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

      4. associate-*r* 80.7%

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

   7. Simplified 80.7%

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

   if -1.64999999999999992e-101 < b < 9.50000000000000041e117

   1. Initial program 95.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. associate-+l- 95.4%

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

      2. *-commutative 95.4%

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

      3. *-commutative 95.4%

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

      4. associate-*l* 95.4%

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

      5. associate-+l- 95.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} \]

      6. associate-*l* 95.4%

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

      7. *-commutative 95.4%

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

      8. *-commutative 95.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 \]

      9. associate-*l* 98.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 \]

      10. associate-*l* 98.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 98.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. Add Preprocessing

   5. Taylor expanded in a around 0 80.6%

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

   if 9.50000000000000041e117 < b

   1. Initial program 86.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. associate-+l- 86.9%

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

      2. *-commutative 86.9%

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

      3. *-commutative 86.9%

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

      4. associate-*l* 86.8%

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

      5. associate-+l- 86.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} \]

      6. associate-*l* 86.9%

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

      7. *-commutative 86.9%

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

      8. *-commutative 86.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 \]

      9. associate-*l* 87.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 \]

      10. associate-*l* 84.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 84.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. Add Preprocessing

   5. Taylor expanded in x around 0 80.7%

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

4. Final simplification 80.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.65 \cdot 10^{-101}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) - \left(y \cdot z\right) \cdot \left(9 \cdot t\right)\\ \mathbf{elif}\;b \leq 9.5 \cdot 10^{+117}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) - 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 47.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := -9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \mathbf{if}\;t \leq -1.7 \cdot 10^{-86}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 3.7 \cdot 10^{-51}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;t \leq 2.6 \cdot 10^{+34}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 (* y z)))))
   (if (<= t -1.7e-86)
     t_1
     (if (<= t 3.7e-51) (* x 2.0) (if (<= t 2.6e+34) (* 27.0 (* a b)) t_1)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * (t * (y * z));
	double tmp;
	if (t <= -1.7e-86) {
		tmp = t_1;
	} else if (t <= 3.7e-51) {
		tmp = x * 2.0;
	} else if (t <= 2.6e+34) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * (t * (y * z));
	double tmp;
	if (t <= -1.7e-86) {
		tmp = t_1;
	} else if (t <= 3.7e-51) {
		tmp = x * 2.0;
	} else if (t <= 2.6e+34) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = -9.0 * (t * (y * z))
	tmp = 0
	if t <= -1.7e-86:
		tmp = t_1
	elif t <= 3.7e-51:
		tmp = x * 2.0
	elif t <= 2.6e+34:
		tmp = 27.0 * (a * b)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(-9.0 * Float64(t * Float64(y * z)))
	tmp = 0.0
	if (t <= -1.7e-86)
		tmp = t_1;
	elseif (t <= 3.7e-51)
		tmp = Float64(x * 2.0);
	elseif (t <= 2.6e+34)
		tmp = Float64(27.0 * Float64(a * b));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = -9.0 * (t * (y * z));
	tmp = 0.0;
	if (t <= -1.7e-86)
		tmp = t_1;
	elseif (t <= 3.7e-51)
		tmp = x * 2.0;
	elseif (t <= 2.6e+34)
		tmp = 27.0 * (a * b);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.7e-86], t$95$1, If[LessEqual[t, 3.7e-51], N[(x * 2.0), $MachinePrecision], If[LessEqual[t, 2.6e+34], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.7e-86 or 2.59999999999999997e34 < t

   1. Initial program 97.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. associate-+l- 97.8%

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

      2. *-commutative 97.8%

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

      3. *-commutative 97.8%

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

      4. associate-*l* 97.8%

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

      5. associate-+l- 97.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} \]

      6. associate-*l* 97.8%

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

      7. *-commutative 97.8%

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

      8. *-commutative 97.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 \]

      9. associate-*l* 91.2%

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

      10. associate-*l* 91.2%

          \[\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.2%

      \[\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. Add Preprocessing

   5. Taylor expanded in y around inf 56.4%

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

   if -1.7e-86 < t < 3.69999999999999973e-51

   1. Initial program 92.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. associate-+l- 92.5%

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

      2. *-commutative 92.5%

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

      3. *-commutative 92.5%

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

      4. associate-*l* 92.5%

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

      5. associate-+l- 92.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} \]

      6. associate-*l* 92.5%

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

      7. *-commutative 92.5%

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

      8. *-commutative 92.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 \]

      9. associate-*l* 99.9%

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

      10. associate-*l* 99.9%

          \[\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.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in x around inf 48.8%

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

   if 3.69999999999999973e-51 < t < 2.59999999999999997e34

   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. associate-+l- 94.7%

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

      2. *-commutative 94.7%

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

      3. *-commutative 94.7%

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

      4. associate-*l* 94.6%

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

      5. associate-+l- 94.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} \]

      6. associate-*l* 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 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 \]

      9. 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 \]

      10. associate-*l* 89.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 89.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. Add Preprocessing

   5. Taylor expanded in a around inf 42.9%

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

4. Final simplification 52.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.7 \cdot 10^{-86}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \mathbf{elif}\;t \leq 3.7 \cdot 10^{-51}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;t \leq 2.6 \cdot 10^{+34}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 97.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 9.6000000000000007e69

   1. Initial program 96.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. associate-+l- 96.1%

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

      2. *-commutative 96.1%

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

      3. *-commutative 96.1%

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

      4. associate-*l* 96.1%

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

      5. associate-+l- 96.1%

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

      6. associate-*l* 96.1%

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

      7. *-commutative 96.1%

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

      8. *-commutative 96.1%

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

      9. associate-*l* 97.9%

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

      10. associate-*l* 97.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 97.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. Add Preprocessing

   if 9.6000000000000007e69 < z

   1. Initial program 92.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. associate-+l- 92.7%

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

      2. *-commutative 92.7%

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

      3. *-commutative 92.7%

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

      4. associate-*l* 92.7%

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

      5. associate-+l- 92.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} \]

      6. associate-*l* 92.7%

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

      7. *-commutative 92.7%

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

      8. *-commutative 92.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 \]

      9. associate-*l* 83.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 \]

      10. associate-*l* 83.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 83.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. Add Preprocessing

   5. Taylor expanded in a around 0 76.9%

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

4. Final simplification 93.1%

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

Alternative 9: 98.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 2e-255

   1. Initial program 95.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. associate-+l- 95.1%

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

      2. *-commutative 95.1%

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

      3. *-commutative 95.1%

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

      4. associate-*l* 95.0%

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

      5. associate-+l- 95.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} \]

      6. associate-*l* 95.1%

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

      7. *-commutative 95.1%

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

      8. *-commutative 95.1%

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

      9. associate-*l* 97.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 \]

      10. associate-*l* 97.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 97.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. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 97.1%

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

      2. associate-+r- 97.1%

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

      3. associate-*r* 97.1%

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

      4. *-commutative 97.1%

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

      5. associate-*l* 97.1%

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

      6. associate-*l* 97.1%

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

      7. associate-*r* 96.4%

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

   6. Applied egg-rr 96.4%

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

   if 2e-255 < z

   1. Initial program 95.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. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 96.2%

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

Alternative 10: 76.9% accurate, 0.8× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 -6.9e-31) (not (<= b 9.5e+150)))
   (+ (* 27.0 (* a b)) (* x 2.0))
   (- (* x 2.0) (* 9.0 (* t (* y z))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -6.9e-31) || !(b <= 9.5e+150)) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (y * z)));
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -6.9e-31) || !(b <= 9.5e+150)) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (y * z)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -6.9e-31) or not (b <= 9.5e+150):
		tmp = (27.0 * (a * b)) + (x * 2.0)
	else:
		tmp = (x * 2.0) - (9.0 * (t * (y * z)))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -6.9e-31) || !(b <= 9.5e+150))
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	else
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(y * z))));
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -6.9000000000000004e-31 or 9.5000000000000001e150 < b

   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. associate-+l- 94.7%

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

      2. *-commutative 94.7%

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

      3. *-commutative 94.7%

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

      4. associate-*l* 94.7%

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

      5. associate-+l- 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} \]

      6. associate-*l* 94.7%

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

      7. *-commutative 94.7%

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

      8. *-commutative 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 \]

      9. associate-*l* 89.9%

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

      10. associate-*l* 88.9%

          \[\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 88.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in y around 0 69.1%

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

   if -6.9000000000000004e-31 < b < 9.5000000000000001e150

   1. Initial program 95.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. associate-+l- 95.9%

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

      2. *-commutative 95.9%

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

      3. *-commutative 95.9%

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

      4. associate-*l* 95.8%

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

      5. associate-+l- 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} \]

      6. associate-*l* 95.9%

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

      7. *-commutative 95.9%

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

      8. *-commutative 95.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 \]

      9. associate-*l* 98.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 \]

      10. associate-*l* 98.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 98.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. Add Preprocessing

   5. Taylor expanded in a around 0 81.2%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6.9 \cdot 10^{-31} \lor \neg \left(b \leq 9.5 \cdot 10^{+150}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 76.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -1.15e19

   1. Initial program 88.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. Add Preprocessing
   3. Step-by-step derivation

      1. pow1 88.3%

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

      2. associate-*l* 88.2%

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

   4. Applied egg-rr 88.2%

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

   5. Taylor expanded in y around inf 53.5%

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

      1. *-commutative 53.5%

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

      2. associate-*l* 53.6%

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

      3. associate-*l* 53.5%

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

   7. Simplified 53.5%

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

      1. *-commutative 53.5%

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

      2. associate-*r* 53.6%

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

      3. associate-*l* 53.5%

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

      4. metadata-eval 53.5%

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

      5. distribute-lft-neg-in 53.5%

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

      6. distribute-rgt-neg-in 53.5%

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

      7. associate-*l* 52.0%

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

      8. *-commutative 52.0%

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

   9. Applied egg-rr 52.0%

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

   if -1.15e19 < z < 1.9000000000000002e-52

   1. Initial program 99.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. associate-+l- 99.3%

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

      2. *-commutative 99.3%

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

      3. *-commutative 99.3%

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

      4. associate-*l* 99.2%

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

      5. associate-+l- 99.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} \]

      6. associate-*l* 99.3%

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

      7. *-commutative 99.3%

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

      8. *-commutative 99.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 \]

      9. 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 \]

      10. associate-*l* 99.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 99.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. Add Preprocessing

   5. Taylor expanded in y around 0 80.4%

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

   if 1.9000000000000002e-52 < z

   1. Initial program 94.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. associate-+l- 94.5%

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

      2. *-commutative 94.5%

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

      3. *-commutative 94.5%

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

      4. associate-*l* 94.5%

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

      5. associate-+l- 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} \]

      6. associate-*l* 94.5%

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

      7. *-commutative 94.5%

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

      8. *-commutative 94.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 \]

      9. associate-*l* 87.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 \]

      10. associate-*l* 87.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 87.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. Add Preprocessing

   5. Taylor expanded in y around inf 62.0%

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

4. Final simplification 68.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.15 \cdot 10^{+19}:\\ \;\;\;\;\left(z \cdot \left(9 \cdot t\right)\right) \cdot \left(-y\right)\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-52}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(y \cdot z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 95.1% accurate, 1.0× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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) (* t (* (* y 9.0) z))) (* b (* a 27.0))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.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. Add Preprocessing

3. Final simplification 95.4%

   \[\leadsto \left(x \cdot 2 - t \cdot \left(\left(y \cdot 9\right) \cdot z\right)\right) + b \cdot \left(a \cdot 27\right) \]
4. Add Preprocessing

Alternative 13: 95.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.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. Add Preprocessing
3. Step-by-step derivation

   1. pow1 95.4%

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

   2. associate-*l* 95.4%

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

4. Applied egg-rr 95.4%

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

5. Final simplification 95.4%

   \[\leadsto b \cdot \left(a \cdot 27\right) + \left(x \cdot 2 - t \cdot \left(y \cdot \left(9 \cdot z\right)\right)\right) \]
6. Add Preprocessing

Alternative 14: 47.6% accurate, 1.1× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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.3e-69) (not (<= b 2.5e+117))) (* 27.0 (* a b)) (* x 2.0)))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -2.3e-69) || !(b <= 2.5e+117)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -2.3e-69) or not (b <= 2.5e+117):
		tmp = 27.0 * (a * b)
	else:
		tmp = x * 2.0
	return tmp

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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.3e-69], N[Not[LessEqual[b, 2.5e+117]], $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.3000000000000001e-69 or 2.49999999999999992e117 < b

   1. Initial program 95.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. associate-+l- 95.1%

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

      2. *-commutative 95.1%

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

      3. *-commutative 95.1%

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

      4. associate-*l* 95.1%

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

      5. associate-+l- 95.1%

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

      6. associate-*l* 95.1%

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

      7. *-commutative 95.1%

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

      8. *-commutative 95.1%

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

      9. associate-*l* 90.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 \]

      10. associate-*l* 89.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 89.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. Add Preprocessing

   5. Taylor expanded in a around inf 53.5%

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

   if -2.3000000000000001e-69 < b < 2.49999999999999992e117

   1. Initial program 95.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. associate-+l- 95.6%

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

      2. *-commutative 95.6%

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

      3. *-commutative 95.6%

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

      4. associate-*l* 95.6%

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

      5. associate-+l- 95.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} \]

      6. associate-*l* 95.6%

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

      7. *-commutative 95.6%

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

      8. *-commutative 95.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 \]

      9. associate-*l* 97.9%

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

      10. associate-*l* 97.9%

          \[\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 97.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in x around inf 43.4%

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

4. Final simplification 47.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{-69} \lor \neg \left(b \leq 2.5 \cdot 10^{+117}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 47.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if b <= -8e-68:
		tmp = a * (27.0 * b)
	elif b <= 2.5e+117:
		tmp = x * 2.0
	else:
		tmp = 27.0 * (a * b)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (b <= -8e-68)
		tmp = Float64(a * Float64(27.0 * b));
	elseif (b <= 2.5e+117)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(27.0 * Float64(a * b));
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -8.00000000000000053e-68

   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. associate-+l- 98.5%

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

      2. *-commutative 98.5%

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

      3. *-commutative 98.5%

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

      4. associate-*l* 98.6%

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

      5. associate-+l- 98.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} \]

      6. associate-*l* 98.5%

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

      7. *-commutative 98.5%

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

      8. *-commutative 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 \]

      9. associate-*l* 92.2%

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

      10. associate-*l* 92.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 92.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. Add Preprocessing

   5. Taylor expanded in a around inf 51.0%

      \[\leadsto \color{blue}{27 \cdot \left(a \cdot b\right)} \]
   6. Step-by-step derivation

      1. associate-*r* 51.1%

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

      2. *-commutative 51.1%

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

      3. associate-*r* 51.0%

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

   7. Simplified 51.0%

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

   if -8.00000000000000053e-68 < b < 2.49999999999999992e117

   1. Initial program 95.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. associate-+l- 95.6%

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

      2. *-commutative 95.6%

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

      3. *-commutative 95.6%

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

      4. associate-*l* 95.6%

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

      5. associate-+l- 95.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} \]

      6. associate-*l* 95.6%

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

      7. *-commutative 95.6%

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

      8. *-commutative 95.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 \]

      9. associate-*l* 97.9%

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

      10. associate-*l* 97.9%

          \[\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 97.9%

      \[\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. Add Preprocessing

   5. Taylor expanded in x around inf 43.4%

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

   if 2.49999999999999992e117 < b

   1. Initial program 86.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. associate-+l- 86.9%

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

      2. *-commutative 86.9%

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

      3. *-commutative 86.9%

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

      4. associate-*l* 86.8%

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

      5. associate-+l- 86.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} \]

      6. associate-*l* 86.9%

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

      7. *-commutative 86.9%

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

      8. *-commutative 86.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 \]

      9. associate-*l* 87.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 \]

      10. associate-*l* 84.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 84.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. Add Preprocessing

   5. Taylor expanded in a around inf 59.4%

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

4. Final simplification 47.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-68}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;b \leq 2.5 \cdot 10^{+117}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 30.3% accurate, 5.7× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, 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 95.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. associate-+l- 95.4%

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

   2. *-commutative 95.4%

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

   3. *-commutative 95.4%

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

   4. associate-*l* 95.4%

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

   5. associate-+l- 95.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} \]

   6. associate-*l* 95.4%

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

   7. *-commutative 95.4%

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

   8. *-commutative 95.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 \]

   9. 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 \]

   10. associate-*l* 94.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 94.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. Add Preprocessing

5. Taylor expanded in x around inf 31.4%

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

6. Final simplification 31.4%

   \[\leadsto x \cdot 2 \]
7. Add Preprocessing

Developer target: 94.7% accurate, 0.8× 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 2024067 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, A"
  :precision binary64

  :alt
  (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)))