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

Percentage Accurate: 95.6% → 98.5%

Time: 16.4s

Alternatives: 13

Speedup: 0.8×

• 27.1% 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.6% 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.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{-135}:\\ \;\;\;\;\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}:\\ \;\;\;\;\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1e-135)
   (+ (- (* x 2.0) (* (* y 9.0) (* z t))) (* a (* 27.0 b)))
   (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);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1e-135) {
		tmp = ((x * 2.0) - ((y * 9.0) * (z * t))) + (a * (27.0 * b));
	} 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])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1e-135)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(y * 9.0) * Float64(z * t))) + Float64(a * Float64(27.0 * b)));
	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.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1e-135], 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[(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 z < -1e-135

   1. Initial program 90.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- 90.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 90.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 90.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* 90.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- 90.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* 90.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 90.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 90.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* 94.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* 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

   if -1e-135 < z

   1. Initial program 92.0%

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

      1. +-commutative 92.0%

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

      2. associate-+r- 92.0%

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

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

         \[\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* 95.1%

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

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

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

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

         \[\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* 95.2%

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

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

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

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

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

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

          \[\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* 92.6%

          \[\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* 92.6%

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

          \[\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* 92.6%

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{-135}:\\ \;\;\;\;\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}:\\ \;\;\;\;\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 2: 46.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [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(z \cdot y\right)\right)\\ t_2 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -1.8 \cdot 10^{-81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 2.15 \cdot 10^{-161}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-12}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+18}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \leq 2.7 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 1.45 \cdot 10^{+156}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

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 (* z y)))) (t_2 (* 27.0 (* a b))))
   (if (<= b -1.8e-81)
     t_2
     (if (<= b 1.9e-209)
       (* x 2.0)
       (if (<= b 2.15e-161)
         t_1
         (if (<= b 3.8e-12)
           (* x 2.0)
           (if (<= b 4.5e+18)
             t_2
             (if (<= b 2.7e+20) (* x 2.0) (if (<= b 1.45e+156) t_1 t_2)))))))))

C

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 * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.8e-81) {
		tmp = t_2;
	} else if (b <= 1.9e-209) {
		tmp = x * 2.0;
	} else if (b <= 2.15e-161) {
		tmp = t_1;
	} else if (b <= 3.8e-12) {
		tmp = x * 2.0;
	} else if (b <= 4.5e+18) {
		tmp = t_2;
	} else if (b <= 2.7e+20) {
		tmp = x * 2.0;
	} else if (b <= 1.45e+156) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

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) :: t_2
    real(8) :: tmp
    t_1 = (-9.0d0) * (t * (z * y))
    t_2 = 27.0d0 * (a * b)
    if (b <= (-1.8d-81)) then
        tmp = t_2
    else if (b <= 1.9d-209) then
        tmp = x * 2.0d0
    else if (b <= 2.15d-161) then
        tmp = t_1
    else if (b <= 3.8d-12) then
        tmp = x * 2.0d0
    else if (b <= 4.5d+18) then
        tmp = t_2
    else if (b <= 2.7d+20) then
        tmp = x * 2.0d0
    else if (b <= 1.45d+156) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

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 * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.8e-81) {
		tmp = t_2;
	} else if (b <= 1.9e-209) {
		tmp = x * 2.0;
	} else if (b <= 2.15e-161) {
		tmp = t_1;
	} else if (b <= 3.8e-12) {
		tmp = x * 2.0;
	} else if (b <= 4.5e+18) {
		tmp = t_2;
	} else if (b <= 2.7e+20) {
		tmp = x * 2.0;
	} else if (b <= 1.45e+156) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[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 * (z * y))
	t_2 = 27.0 * (a * b)
	tmp = 0
	if b <= -1.8e-81:
		tmp = t_2
	elif b <= 1.9e-209:
		tmp = x * 2.0
	elif b <= 2.15e-161:
		tmp = t_1
	elif b <= 3.8e-12:
		tmp = x * 2.0
	elif b <= 4.5e+18:
		tmp = t_2
	elif b <= 2.7e+20:
		tmp = x * 2.0
	elif b <= 1.45e+156:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

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(z * y)))
	t_2 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -1.8e-81)
		tmp = t_2;
	elseif (b <= 1.9e-209)
		tmp = Float64(x * 2.0);
	elseif (b <= 2.15e-161)
		tmp = t_1;
	elseif (b <= 3.8e-12)
		tmp = Float64(x * 2.0);
	elseif (b <= 4.5e+18)
		tmp = t_2;
	elseif (b <= 2.7e+20)
		tmp = Float64(x * 2.0);
	elseif (b <= 1.45e+156)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

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 * (z * y));
	t_2 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -1.8e-81)
		tmp = t_2;
	elseif (b <= 1.9e-209)
		tmp = x * 2.0;
	elseif (b <= 2.15e-161)
		tmp = t_1;
	elseif (b <= 3.8e-12)
		tmp = x * 2.0;
	elseif (b <= 4.5e+18)
		tmp = t_2;
	elseif (b <= 2.7e+20)
		tmp = x * 2.0;
	elseif (b <= 1.45e+156)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.8e-81], t$95$2, If[LessEqual[b, 1.9e-209], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 2.15e-161], t$95$1, If[LessEqual[b, 3.8e-12], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 4.5e+18], t$95$2, If[LessEqual[b, 2.7e+20], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 1.45e+156], t$95$1, t$95$2]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.7999999999999999e-81 or 3.79999999999999996e-12 < b < 4.5e18 or 1.45000000000000005e156 < b

   1. Initial program 93.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- 93.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 93.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 93.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* 93.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- 93.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* 93.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 93.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 93.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* 95.4%

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

      10. associate-*l* 95.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 95.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 55.1%

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

   if -1.7999999999999999e-81 < b < 1.8999999999999999e-209 or 2.14999999999999983e-161 < b < 3.79999999999999996e-12 or 4.5e18 < b < 2.7e20

   1. Initial program 88.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- 88.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 88.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 88.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* 88.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- 88.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* 88.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 88.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 88.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* 94.4%

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

      10. associate-*l* 94.4%

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

   3. Simplified 94.4%

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

   5. Taylor expanded in x around inf 52.2%

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

   if 1.8999999999999999e-209 < b < 2.14999999999999983e-161 or 2.7e20 < b < 1.45000000000000005e156

   1. Initial program 90.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- 90.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 90.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 90.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* 90.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- 90.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* 90.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 90.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 90.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* 93.6%

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

      10. associate-*l* 93.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 93.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 54.5%

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

4. Final simplification 54.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.8 \cdot 10^{-81}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 2.15 \cdot 10^{-161}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-12}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+18}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 2.7 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 1.45 \cdot 10^{+156}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 46.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -6 \cdot 10^{-82}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 1.7 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{-161}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 5.7 \cdot 10^{-9}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 1.1 \cdot 10^{+19}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{+157}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\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.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= b -6e-82)
     t_1
     (if (<= b 1.7e-209)
       (* x 2.0)
       (if (<= b 6.2e-161)
         (* -9.0 (* t (* z y)))
         (if (<= b 5.7e-9)
           (* x 2.0)
           (if (<= b 4.5e+18)
             t_1
             (if (<= b 1.1e+19)
               (* x 2.0)
               (if (<= b 2.1e+157) (* -9.0 (* z (* y t))) t_1)))))))))

C

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -6e-82) {
		tmp = t_1;
	} else if (b <= 1.7e-209) {
		tmp = x * 2.0;
	} else if (b <= 6.2e-161) {
		tmp = -9.0 * (t * (z * y));
	} else if (b <= 5.7e-9) {
		tmp = x * 2.0;
	} else if (b <= 4.5e+18) {
		tmp = t_1;
	} else if (b <= 1.1e+19) {
		tmp = x * 2.0;
	} else if (b <= 2.1e+157) {
		tmp = -9.0 * (z * (y * t));
	} 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.
real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (b <= (-6d-82)) then
        tmp = t_1
    else if (b <= 1.7d-209) then
        tmp = x * 2.0d0
    else if (b <= 6.2d-161) then
        tmp = (-9.0d0) * (t * (z * y))
    else if (b <= 5.7d-9) then
        tmp = x * 2.0d0
    else if (b <= 4.5d+18) then
        tmp = t_1
    else if (b <= 1.1d+19) then
        tmp = x * 2.0d0
    else if (b <= 2.1d+157) then
        tmp = (-9.0d0) * (z * (y * t))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -6e-82) {
		tmp = t_1;
	} else if (b <= 1.7e-209) {
		tmp = x * 2.0;
	} else if (b <= 6.2e-161) {
		tmp = -9.0 * (t * (z * y));
	} else if (b <= 5.7e-9) {
		tmp = x * 2.0;
	} else if (b <= 4.5e+18) {
		tmp = t_1;
	} else if (b <= 1.1e+19) {
		tmp = x * 2.0;
	} else if (b <= 2.1e+157) {
		tmp = -9.0 * (z * (y * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if b <= -6e-82:
		tmp = t_1
	elif b <= 1.7e-209:
		tmp = x * 2.0
	elif b <= 6.2e-161:
		tmp = -9.0 * (t * (z * y))
	elif b <= 5.7e-9:
		tmp = x * 2.0
	elif b <= 4.5e+18:
		tmp = t_1
	elif b <= 1.1e+19:
		tmp = x * 2.0
	elif b <= 2.1e+157:
		tmp = -9.0 * (z * (y * t))
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -6e-82)
		tmp = t_1;
	elseif (b <= 1.7e-209)
		tmp = Float64(x * 2.0);
	elseif (b <= 6.2e-161)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	elseif (b <= 5.7e-9)
		tmp = Float64(x * 2.0);
	elseif (b <= 4.5e+18)
		tmp = t_1;
	elseif (b <= 1.1e+19)
		tmp = Float64(x * 2.0);
	elseif (b <= 2.1e+157)
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -6e-82)
		tmp = t_1;
	elseif (b <= 1.7e-209)
		tmp = x * 2.0;
	elseif (b <= 6.2e-161)
		tmp = -9.0 * (t * (z * y));
	elseif (b <= 5.7e-9)
		tmp = x * 2.0;
	elseif (b <= 4.5e+18)
		tmp = t_1;
	elseif (b <= 1.1e+19)
		tmp = x * 2.0;
	elseif (b <= 2.1e+157)
		tmp = -9.0 * (z * (y * t));
	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.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -6e-82], t$95$1, If[LessEqual[b, 1.7e-209], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 6.2e-161], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.7e-9], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 4.5e+18], t$95$1, If[LessEqual[b, 1.1e+19], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 2.1e+157], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -5.9999999999999998e-82 or 5.6999999999999998e-9 < b < 4.5e18 or 2.1e157 < b

   1. Initial program 93.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- 93.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 93.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 93.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* 93.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- 93.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* 93.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 93.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 93.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* 95.4%

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

      10. associate-*l* 95.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 95.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 55.1%

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

   if -5.9999999999999998e-82 < b < 1.69999999999999994e-209 or 6.1999999999999997e-161 < b < 5.6999999999999998e-9 or 4.5e18 < b < 1.1e19

   1. Initial program 88.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- 88.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 88.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 88.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* 88.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- 88.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* 88.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 88.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 88.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* 94.4%

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

      10. associate-*l* 94.4%

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

   3. Simplified 94.4%

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

   5. Taylor expanded in x around inf 52.2%

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

   if 1.69999999999999994e-209 < b < 6.1999999999999997e-161

   1. Initial program 91.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- 91.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 91.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 91.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* 91.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- 91.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* 91.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 91.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 91.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* 91.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* 91.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 91.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 y around inf 67.8%

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

   if 1.1e19 < b < 2.1e157

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

   3. Taylor expanded in y around 0 90.1%

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

   4. Taylor expanded in y around inf 46.5%

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

      1. *-commutative 46.5%

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

      2. associate-*l* 46.5%

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

      3. associate-*l* 46.6%

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

   6. Simplified 46.6%

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

   7. Taylor expanded in t around 0 46.5%

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

      1. associate-*r* 51.5%

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

      2. *-commutative 51.5%

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

   9. Simplified 51.5%

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

4. Final simplification 54.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6 \cdot 10^{-82}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 1.7 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{-161}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 5.7 \cdot 10^{-9}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+18}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 1.1 \cdot 10^{+19}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{+157}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 46.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ t_2 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -1.3 \cdot 10^{-81}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.6 \cdot 10^{-163}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 6.1 \cdot 10^{-12}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.4 \cdot 10^{+18}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \leq 2 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.4 \cdot 10^{+154}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

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 (* t (* -9.0 (* z y)))) (t_2 (* 27.0 (* a b))))
   (if (<= b -1.3e-81)
     t_2
     (if (<= b 2e-209)
       (* x 2.0)
       (if (<= b 4.6e-163)
         t_1
         (if (<= b 6.1e-12)
           (* x 2.0)
           (if (<= b 6.4e+18)
             t_2
             (if (<= b 2e+20) (* x 2.0) (if (<= b 3.4e+154) t_1 t_2)))))))))

C

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 = t * (-9.0 * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.3e-81) {
		tmp = t_2;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 4.6e-163) {
		tmp = t_1;
	} else if (b <= 6.1e-12) {
		tmp = x * 2.0;
	} else if (b <= 6.4e+18) {
		tmp = t_2;
	} else if (b <= 2e+20) {
		tmp = x * 2.0;
	} else if (b <= 3.4e+154) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

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) :: t_2
    real(8) :: tmp
    t_1 = t * ((-9.0d0) * (z * y))
    t_2 = 27.0d0 * (a * b)
    if (b <= (-1.3d-81)) then
        tmp = t_2
    else if (b <= 2d-209) then
        tmp = x * 2.0d0
    else if (b <= 4.6d-163) then
        tmp = t_1
    else if (b <= 6.1d-12) then
        tmp = x * 2.0d0
    else if (b <= 6.4d+18) then
        tmp = t_2
    else if (b <= 2d+20) then
        tmp = x * 2.0d0
    else if (b <= 3.4d+154) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

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 = t * (-9.0 * (z * y));
	double t_2 = 27.0 * (a * b);
	double tmp;
	if (b <= -1.3e-81) {
		tmp = t_2;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 4.6e-163) {
		tmp = t_1;
	} else if (b <= 6.1e-12) {
		tmp = x * 2.0;
	} else if (b <= 6.4e+18) {
		tmp = t_2;
	} else if (b <= 2e+20) {
		tmp = x * 2.0;
	} else if (b <= 3.4e+154) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = t * (-9.0 * (z * y))
	t_2 = 27.0 * (a * b)
	tmp = 0
	if b <= -1.3e-81:
		tmp = t_2
	elif b <= 2e-209:
		tmp = x * 2.0
	elif b <= 4.6e-163:
		tmp = t_1
	elif b <= 6.1e-12:
		tmp = x * 2.0
	elif b <= 6.4e+18:
		tmp = t_2
	elif b <= 2e+20:
		tmp = x * 2.0
	elif b <= 3.4e+154:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(t * Float64(-9.0 * Float64(z * y)))
	t_2 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -1.3e-81)
		tmp = t_2;
	elseif (b <= 2e-209)
		tmp = Float64(x * 2.0);
	elseif (b <= 4.6e-163)
		tmp = t_1;
	elseif (b <= 6.1e-12)
		tmp = Float64(x * 2.0);
	elseif (b <= 6.4e+18)
		tmp = t_2;
	elseif (b <= 2e+20)
		tmp = Float64(x * 2.0);
	elseif (b <= 3.4e+154)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

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 = t * (-9.0 * (z * y));
	t_2 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -1.3e-81)
		tmp = t_2;
	elseif (b <= 2e-209)
		tmp = x * 2.0;
	elseif (b <= 4.6e-163)
		tmp = t_1;
	elseif (b <= 6.1e-12)
		tmp = x * 2.0;
	elseif (b <= 6.4e+18)
		tmp = t_2;
	elseif (b <= 2e+20)
		tmp = x * 2.0;
	elseif (b <= 3.4e+154)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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[(t * N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -1.3e-81], t$95$2, If[LessEqual[b, 2e-209], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 4.6e-163], t$95$1, If[LessEqual[b, 6.1e-12], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 6.4e+18], t$95$2, If[LessEqual[b, 2e+20], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 3.4e+154], t$95$1, t$95$2]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.2999999999999999e-81 or 6.1000000000000003e-12 < b < 6.4e18 or 3.39999999999999974e154 < b

   1. Initial program 93.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- 93.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 93.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 93.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* 93.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- 93.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* 93.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 93.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 93.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* 95.4%

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

      10. associate-*l* 95.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 95.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 55.1%

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

   if -1.2999999999999999e-81 < b < 2.0000000000000001e-209 or 4.5999999999999999e-163 < b < 6.1000000000000003e-12 or 6.4e18 < b < 2e20

   1. Initial program 89.0%

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

      1. associate-+l- 89.0%

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

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

         \[\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.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- 89.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* 89.0%

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

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

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

      9. associate-*l* 94.4%

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

      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 51.7%

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

   if 2.0000000000000001e-209 < b < 4.5999999999999999e-163 or 2e20 < b < 3.39999999999999974e154

   1. Initial program 90.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. Taylor expanded in y around 0 90.4%

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

   4. Taylor expanded in y around inf 53.0%

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

      1. *-commutative 53.0%

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

      2. associate-*l* 53.2%

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

      3. associate-*l* 53.2%

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

   6. Simplified 53.2%

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

   7. Taylor expanded in y around 0 53.2%

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

4. Final simplification 53.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.3 \cdot 10^{-81}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.6 \cdot 10^{-163}:\\ \;\;\;\;t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 6.1 \cdot 10^{-12}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.4 \cdot 10^{+18}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 2 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.4 \cdot 10^{+154}:\\ \;\;\;\;t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 46.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -2.6 \cdot 10^{-81}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-161}:\\ \;\;\;\;t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 7 \cdot 10^{-10}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.4 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.5 \cdot 10^{+154}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\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.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= b -2.6e-81)
     t_1
     (if (<= b 2e-209)
       (* x 2.0)
       (if (<= b 1.9e-161)
         (* t (* -9.0 (* z y)))
         (if (<= b 7e-10)
           (* x 2.0)
           (if (<= b 6.4e+18)
             t_1
             (if (<= b 1.4e+20)
               (* x 2.0)
               (if (<= b 3.5e+154) (* t (* y (* z -9.0))) t_1)))))))))

C

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -2.6e-81) {
		tmp = t_1;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 1.9e-161) {
		tmp = t * (-9.0 * (z * y));
	} else if (b <= 7e-10) {
		tmp = x * 2.0;
	} else if (b <= 6.4e+18) {
		tmp = t_1;
	} else if (b <= 1.4e+20) {
		tmp = x * 2.0;
	} else if (b <= 3.5e+154) {
		tmp = t * (y * (z * -9.0));
	} 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.
real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (b <= (-2.6d-81)) then
        tmp = t_1
    else if (b <= 2d-209) then
        tmp = x * 2.0d0
    else if (b <= 1.9d-161) then
        tmp = t * ((-9.0d0) * (z * y))
    else if (b <= 7d-10) then
        tmp = x * 2.0d0
    else if (b <= 6.4d+18) then
        tmp = t_1
    else if (b <= 1.4d+20) then
        tmp = x * 2.0d0
    else if (b <= 3.5d+154) then
        tmp = t * (y * (z * (-9.0d0)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -2.6e-81) {
		tmp = t_1;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 1.9e-161) {
		tmp = t * (-9.0 * (z * y));
	} else if (b <= 7e-10) {
		tmp = x * 2.0;
	} else if (b <= 6.4e+18) {
		tmp = t_1;
	} else if (b <= 1.4e+20) {
		tmp = x * 2.0;
	} else if (b <= 3.5e+154) {
		tmp = t * (y * (z * -9.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if b <= -2.6e-81:
		tmp = t_1
	elif b <= 2e-209:
		tmp = x * 2.0
	elif b <= 1.9e-161:
		tmp = t * (-9.0 * (z * y))
	elif b <= 7e-10:
		tmp = x * 2.0
	elif b <= 6.4e+18:
		tmp = t_1
	elif b <= 1.4e+20:
		tmp = x * 2.0
	elif b <= 3.5e+154:
		tmp = t * (y * (z * -9.0))
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -2.6e-81)
		tmp = t_1;
	elseif (b <= 2e-209)
		tmp = Float64(x * 2.0);
	elseif (b <= 1.9e-161)
		tmp = Float64(t * Float64(-9.0 * Float64(z * y)));
	elseif (b <= 7e-10)
		tmp = Float64(x * 2.0);
	elseif (b <= 6.4e+18)
		tmp = t_1;
	elseif (b <= 1.4e+20)
		tmp = Float64(x * 2.0);
	elseif (b <= 3.5e+154)
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -2.6e-81)
		tmp = t_1;
	elseif (b <= 2e-209)
		tmp = x * 2.0;
	elseif (b <= 1.9e-161)
		tmp = t * (-9.0 * (z * y));
	elseif (b <= 7e-10)
		tmp = x * 2.0;
	elseif (b <= 6.4e+18)
		tmp = t_1;
	elseif (b <= 1.4e+20)
		tmp = x * 2.0;
	elseif (b <= 3.5e+154)
		tmp = t * (y * (z * -9.0));
	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.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -2.6e-81], t$95$1, If[LessEqual[b, 2e-209], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 1.9e-161], N[(t * N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 7e-10], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 6.4e+18], t$95$1, If[LessEqual[b, 1.4e+20], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 3.5e+154], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -2.5999999999999999e-81 or 6.99999999999999961e-10 < b < 6.4e18 or 3.5000000000000002e154 < b

   1. Initial program 93.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- 93.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 93.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 93.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* 93.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- 93.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* 93.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 93.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 93.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* 95.4%

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

      10. associate-*l* 95.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 95.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 55.1%

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

   if -2.5999999999999999e-81 < b < 2.0000000000000001e-209 or 1.9000000000000001e-161 < b < 6.99999999999999961e-10 or 6.4e18 < b < 1.4e20

   1. Initial program 88.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- 88.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 88.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 88.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* 88.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- 88.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* 88.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 88.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 88.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* 94.4%

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

      10. associate-*l* 94.4%

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

   3. Simplified 94.4%

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

   5. Taylor expanded in x around inf 52.2%

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

   if 2.0000000000000001e-209 < b < 1.9000000000000001e-161

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

   3. Taylor expanded in y around 0 91.7%

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

   4. Taylor expanded in y around inf 67.8%

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

      1. *-commutative 67.8%

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

      2. associate-*l* 68.1%

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

      3. associate-*l* 67.9%

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

   6. Simplified 67.9%

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

   7. Taylor expanded in y around 0 68.1%

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

   if 1.4e20 < b < 3.5000000000000002e154

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

   3. Taylor expanded in y around 0 90.1%

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

   4. Taylor expanded in y around inf 46.5%

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

      1. *-commutative 46.5%

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

      2. associate-*l* 46.5%

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

      3. associate-*l* 46.6%

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

   6. Simplified 46.6%

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

4. Final simplification 54.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.6 \cdot 10^{-81}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-161}:\\ \;\;\;\;t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;b \leq 7 \cdot 10^{-10}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 6.4 \cdot 10^{+18}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{+20}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.5 \cdot 10^{+154}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 46.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;b \leq -3 \cdot 10^{-81}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.8 \cdot 10^{-165}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;b \leq 0.00034:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+19}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.6 \cdot 10^{+154}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\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.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= b -3e-81)
     t_1
     (if (<= b 2e-209)
       (* x 2.0)
       (if (<= b 4.8e-165)
         (* y (* -9.0 (* z t)))
         (if (<= b 0.00034)
           (* x 2.0)
           (if (<= b 5.8e+18)
             t_1
             (if (<= b 7.2e+19)
               (* x 2.0)
               (if (<= b 3.6e+154) (* t (* y (* z -9.0))) t_1)))))))))

C

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -3e-81) {
		tmp = t_1;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 4.8e-165) {
		tmp = y * (-9.0 * (z * t));
	} else if (b <= 0.00034) {
		tmp = x * 2.0;
	} else if (b <= 5.8e+18) {
		tmp = t_1;
	} else if (b <= 7.2e+19) {
		tmp = x * 2.0;
	} else if (b <= 3.6e+154) {
		tmp = t * (y * (z * -9.0));
	} 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.
real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (b <= (-3d-81)) then
        tmp = t_1
    else if (b <= 2d-209) then
        tmp = x * 2.0d0
    else if (b <= 4.8d-165) then
        tmp = y * ((-9.0d0) * (z * t))
    else if (b <= 0.00034d0) then
        tmp = x * 2.0d0
    else if (b <= 5.8d+18) then
        tmp = t_1
    else if (b <= 7.2d+19) then
        tmp = x * 2.0d0
    else if (b <= 3.6d+154) then
        tmp = t * (y * (z * (-9.0d0)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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 = 27.0 * (a * b);
	double tmp;
	if (b <= -3e-81) {
		tmp = t_1;
	} else if (b <= 2e-209) {
		tmp = x * 2.0;
	} else if (b <= 4.8e-165) {
		tmp = y * (-9.0 * (z * t));
	} else if (b <= 0.00034) {
		tmp = x * 2.0;
	} else if (b <= 5.8e+18) {
		tmp = t_1;
	} else if (b <= 7.2e+19) {
		tmp = x * 2.0;
	} else if (b <= 3.6e+154) {
		tmp = t * (y * (z * -9.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if b <= -3e-81:
		tmp = t_1
	elif b <= 2e-209:
		tmp = x * 2.0
	elif b <= 4.8e-165:
		tmp = y * (-9.0 * (z * t))
	elif b <= 0.00034:
		tmp = x * 2.0
	elif b <= 5.8e+18:
		tmp = t_1
	elif b <= 7.2e+19:
		tmp = x * 2.0
	elif b <= 3.6e+154:
		tmp = t * (y * (z * -9.0))
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (b <= -3e-81)
		tmp = t_1;
	elseif (b <= 2e-209)
		tmp = Float64(x * 2.0);
	elseif (b <= 4.8e-165)
		tmp = Float64(y * Float64(-9.0 * Float64(z * t)));
	elseif (b <= 0.00034)
		tmp = Float64(x * 2.0);
	elseif (b <= 5.8e+18)
		tmp = t_1;
	elseif (b <= 7.2e+19)
		tmp = Float64(x * 2.0);
	elseif (b <= 3.6e+154)
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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 = 27.0 * (a * b);
	tmp = 0.0;
	if (b <= -3e-81)
		tmp = t_1;
	elseif (b <= 2e-209)
		tmp = x * 2.0;
	elseif (b <= 4.8e-165)
		tmp = y * (-9.0 * (z * t));
	elseif (b <= 0.00034)
		tmp = x * 2.0;
	elseif (b <= 5.8e+18)
		tmp = t_1;
	elseif (b <= 7.2e+19)
		tmp = x * 2.0;
	elseif (b <= 3.6e+154)
		tmp = t * (y * (z * -9.0));
	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.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -3e-81], t$95$1, If[LessEqual[b, 2e-209], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 4.8e-165], N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 0.00034], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 5.8e+18], t$95$1, If[LessEqual[b, 7.2e+19], N[(x * 2.0), $MachinePrecision], If[LessEqual[b, 3.6e+154], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -2.9999999999999999e-81 or 3.4e-4 < b < 5.8e18 or 3.6000000000000001e154 < b

   1. Initial program 93.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- 93.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 93.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 93.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* 93.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- 93.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* 93.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 93.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 93.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* 95.4%

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

      10. associate-*l* 95.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 95.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 55.1%

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

   if -2.9999999999999999e-81 < b < 2.0000000000000001e-209 or 4.8000000000000004e-165 < b < 3.4e-4 or 5.8e18 < b < 7.2e19

   1. Initial program 89.0%

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

      1. associate-+l- 89.0%

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

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

         \[\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.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- 89.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* 89.0%

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

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

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

      9. associate-*l* 94.4%

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

      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 51.7%

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

   if 2.0000000000000001e-209 < b < 4.8000000000000004e-165

   1. Initial program 90.9%

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

      1. associate-+l- 90.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 90.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 90.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* 90.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- 90.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* 90.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 90.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 90.9%

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

      9. associate-*l* 90.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* 91.0%

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

   3. Simplified 91.0%

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

   5. Taylor expanded in a around 0 82.4%

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

   6. Taylor expanded in y around inf 82.6%

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

   7. Taylor expanded in x around 0 65.3%

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

   if 7.2e19 < b < 3.6000000000000001e154

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

   3. Taylor expanded in y around 0 90.1%

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

   4. Taylor expanded in y around inf 46.5%

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

      1. *-commutative 46.5%

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

      2. associate-*l* 46.5%

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

      3. associate-*l* 46.6%

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

   6. Simplified 46.6%

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

4. Final simplification 53.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3 \cdot 10^{-81}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-209}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 4.8 \cdot 10^{-165}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;b \leq 0.00034:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{+18}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+19}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;b \leq 3.6 \cdot 10^{+154}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\\ \mathbf{else}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+28}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + \left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - t \cdot \left(9 \cdot \left(z \cdot y\right)\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1e+28)
   (+ (* a (* 27.0 b)) (- (* x 2.0) (* 9.0 (* z (* y t)))))
   (+ (- (* x 2.0) (* t (* 9.0 (* z y)))) (* b (* a 27.0)))))

C

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 <= -1e+28) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))));
	} else {
		tmp = ((x * 2.0) - (t * (9.0 * (z * y)))) + (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.
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 <= (-1d+28)) then
        tmp = (a * (27.0d0 * b)) + ((x * 2.0d0) - (9.0d0 * (z * (y * t))))
    else
        tmp = ((x * 2.0d0) - (t * (9.0d0 * (z * y)))) + (b * (a * 27.0d0))
    end if
    code = tmp
end function

Java

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 <= -1e+28) {
		tmp = (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))));
	} else {
		tmp = ((x * 2.0) - (t * (9.0 * (z * y)))) + (b * (a * 27.0));
	}
	return tmp;
}

Python

[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 <= -1e+28:
		tmp = (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))))
	else:
		tmp = ((x * 2.0) - (t * (9.0 * (z * y)))) + (b * (a * 27.0))
	return tmp

Julia

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 <= -1e+28)
		tmp = Float64(Float64(a * Float64(27.0 * b)) + Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(t * Float64(9.0 * Float64(z * y)))) + 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])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -1e+28)
		tmp = (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))));
	else
		tmp = ((x * 2.0) - (t * (9.0 * (z * y)))) + (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.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1e+28], N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(t * N[(9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.99999999999999958e27

   1. Initial program 84.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- 84.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 84.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 84.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* 84.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- 84.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* 84.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 84.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 84.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* 91.0%

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

      10. associate-*l* 91.0%

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

   3. Simplified 91.0%

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

   5. Taylor expanded in y around 0 84.5%

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

      1. associate-*r* 97.5%

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

   7. Simplified 97.5%

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

   if -9.99999999999999958e27 < z

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

   3. Taylor expanded in y around 0 93.1%

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

4. Final simplification 93.9%

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

Alternative 8: 76.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9.5 \cdot 10^{+76}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 2.2 \cdot 10^{-153}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -9.5e+76)
   (* -9.0 (* z (* y t)))
   (if (<= z 2.2e-153)
     (+ (* x 2.0) (* 27.0 (* a b)))
     (- (* x 2.0) (* 9.0 (* t (* z y)))))))

C

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.5e+76) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= 2.2e-153) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Fortran

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.5d+76)) then
        tmp = (-9.0d0) * (z * (y * t))
    else if (z <= 2.2d-153) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    else
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    end if
    code = tmp
end function

Java

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.5e+76) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= 2.2e-153) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Python

[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.5e+76:
		tmp = -9.0 * (z * (y * t))
	elif z <= 2.2e-153:
		tmp = (x * 2.0) + (27.0 * (a * b))
	else:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	return tmp

Julia

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.5e+76)
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	elseif (z <= 2.2e-153)
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	else
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	end
	return tmp
end

MATLAB

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.5e+76)
		tmp = -9.0 * (z * (y * t));
	elseif (z <= 2.2e-153)
		tmp = (x * 2.0) + (27.0 * (a * b));
	else
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	end
	tmp_2 = tmp;
end

Wolfram

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.5e+76], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.2e-153], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.5000000000000003e76

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

   3. Taylor expanded in y around 0 83.8%

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

   4. Taylor expanded in y around inf 49.2%

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

      1. *-commutative 49.2%

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

      2. associate-*l* 49.2%

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

      3. associate-*l* 49.2%

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

   6. Simplified 49.2%

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

   7. Taylor expanded in t around 0 49.2%

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

      1. associate-*r* 51.6%

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

      2. *-commutative 51.6%

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

   9. Simplified 51.6%

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

   if -9.5000000000000003e76 < z < 2.20000000000000001e-153

   1. Initial program 98.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- 98.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 98.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 98.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* 98.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- 98.9%

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

      6. associate-*l* 98.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 98.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 98.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.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* 98.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 98.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 0 87.5%

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

   if 2.20000000000000001e-153 < z

   1. Initial program 86.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- 86.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 86.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 86.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* 86.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- 86.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* 86.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 86.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 86.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.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* 92.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 92.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 0 64.8%

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

4. Final simplification 73.0%

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

Alternative 9: 79.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.9 \cdot 10^{-18}:\\ \;\;\;\;y \cdot \left(2 \cdot \frac{x}{y} - 9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 9.2 \cdot 10^{-152}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.9e-18)
   (* y (- (* 2.0 (/ x y)) (* 9.0 (* z t))))
   (if (<= z 9.2e-152)
     (+ (* x 2.0) (* 27.0 (* a b)))
     (- (* x 2.0) (* 9.0 (* t (* z y)))))))

C

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.9e-18) {
		tmp = y * ((2.0 * (x / y)) - (9.0 * (z * t)));
	} else if (z <= 9.2e-152) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Fortran

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.9d-18)) then
        tmp = y * ((2.0d0 * (x / y)) - (9.0d0 * (z * t)))
    else if (z <= 9.2d-152) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    else
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    end if
    code = tmp
end function

Java

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.9e-18) {
		tmp = y * ((2.0 * (x / y)) - (9.0 * (z * t)));
	} else if (z <= 9.2e-152) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Python

[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.9e-18:
		tmp = y * ((2.0 * (x / y)) - (9.0 * (z * t)))
	elif z <= 9.2e-152:
		tmp = (x * 2.0) + (27.0 * (a * b))
	else:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	return tmp

Julia

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.9e-18)
		tmp = Float64(y * Float64(Float64(2.0 * Float64(x / y)) - Float64(9.0 * Float64(z * t))));
	elseif (z <= 9.2e-152)
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	else
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	end
	return tmp
end

MATLAB

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.9e-18)
		tmp = y * ((2.0 * (x / y)) - (9.0 * (z * t)));
	elseif (z <= 9.2e-152)
		tmp = (x * 2.0) + (27.0 * (a * b));
	else
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	end
	tmp_2 = tmp;
end

Wolfram

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.9e-18], N[(y * N[(N[(2.0 * N[(x / y), $MachinePrecision]), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.2e-152], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.8999999999999999e-18

   1. Initial program 86.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- 86.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 86.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 86.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* 86.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- 86.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* 86.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 86.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 86.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* 92.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* 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 0 62.9%

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

   6. Taylor expanded in y around inf 60.9%

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

   if -1.8999999999999999e-18 < z < 9.2000000000000005e-152

   1. Initial program 99.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- 99.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 99.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 99.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* 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.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 99.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 99.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* 98.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* 98.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 98.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 y around 0 88.7%

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

   if 9.2000000000000005e-152 < z

   1. Initial program 86.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- 86.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 86.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 86.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* 86.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- 86.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* 86.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 86.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 86.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.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* 92.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 92.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 0 64.8%

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

4. Final simplification 73.3%

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

Alternative 10: 75.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -2.9 \cdot 10^{+79}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 4.9 \cdot 10^{+17}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(y \cdot \left(z \cdot -9\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -2.9e+79)
   (* -9.0 (* z (* y t)))
   (if (<= z 4.9e+17) (+ (* x 2.0) (* 27.0 (* a b))) (* t (* y (* z -9.0))))))

C

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 <= -2.9e+79) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= 4.9e+17) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Fortran

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 <= (-2.9d+79)) then
        tmp = (-9.0d0) * (z * (y * t))
    else if (z <= 4.9d+17) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    else
        tmp = t * (y * (z * (-9.0d0)))
    end if
    code = tmp
end function

Java

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 <= -2.9e+79) {
		tmp = -9.0 * (z * (y * t));
	} else if (z <= 4.9e+17) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = t * (y * (z * -9.0));
	}
	return tmp;
}

Python

[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 <= -2.9e+79:
		tmp = -9.0 * (z * (y * t))
	elif z <= 4.9e+17:
		tmp = (x * 2.0) + (27.0 * (a * b))
	else:
		tmp = t * (y * (z * -9.0))
	return tmp

Julia

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 <= -2.9e+79)
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	elseif (z <= 4.9e+17)
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	else
		tmp = Float64(t * Float64(y * Float64(z * -9.0)));
	end
	return tmp
end

MATLAB

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 <= -2.9e+79)
		tmp = -9.0 * (z * (y * t));
	elseif (z <= 4.9e+17)
		tmp = (x * 2.0) + (27.0 * (a * b));
	else
		tmp = t * (y * (z * -9.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.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -2.9e+79], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.9e+17], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.89999999999999992e79

   1. Initial program 85.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. Taylor expanded in y around 0 85.2%

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

   4. Taylor expanded in y around inf 53.4%

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

      1. *-commutative 53.4%

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

      2. associate-*l* 53.4%

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

      3. associate-*l* 53.4%

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

   6. Simplified 53.4%

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

   7. Taylor expanded in t around 0 53.4%

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

      1. associate-*r* 56.0%

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

      2. *-commutative 56.0%

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

   9. Simplified 56.0%

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

   if -2.89999999999999992e79 < z < 4.9e17

   1. Initial program 97.2%

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

      1. associate-+l- 97.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 97.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 97.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* 97.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- 97.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* 97.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 97.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 97.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* 98.4%

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

      10. associate-*l* 98.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 98.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 y around 0 84.0%

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

   if 4.9e17 < z

   1. Initial program 83.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. Taylor expanded in y around 0 83.2%

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

   4. Taylor expanded in y around inf 42.3%

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

      1. *-commutative 42.3%

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

      2. associate-*l* 42.4%

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

      3. associate-*l* 42.4%

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

   6. Simplified 42.4%

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

4. Final simplification 68.4%

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

Alternative 11: 93.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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 (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))));
}

Fortran

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

Java

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 (a * (27.0 * b)) + ((x * 2.0) - (9.0 * (z * (y * t))));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.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- 91.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 91.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 91.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* 91.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- 91.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* 91.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 91.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 91.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* 94.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* 94.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 94.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 y around 0 91.6%

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

   1. associate-*r* 96.4%

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

7. Simplified 96.4%

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

8. Final simplification 96.4%

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

Alternative 12: 47.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -1.6 \cdot 10^{-81} \lor \neg \left(b \leq 1.85 \cdot 10^{-8}\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.
(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= b -1.6e-81) (not (<= b 1.85e-8))) (* 27.0 (* a b)) (* x 2.0)))

C

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 <= -1.6e-81) || !(b <= 1.85e-8)) {
		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.
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 <= (-1.6d-81)) .or. (.not. (b <= 1.85d-8))) 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;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((b <= -1.6e-81) || !(b <= 1.85e-8)) {
		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])
def code(x, y, z, t, a, b):
	tmp = 0
	if (b <= -1.6e-81) or not (b <= 1.85e-8):
		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])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((b <= -1.6e-81) || !(b <= 1.85e-8))
		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])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((b <= -1.6e-81) || ~((b <= 1.85e-8)))
		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.
code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -1.6e-81], N[Not[LessEqual[b, 1.85e-8]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.6e-81 or 1.85e-8 < b

   1. Initial program 93.4%

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

      1. associate-+l- 93.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 93.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 93.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* 93.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- 93.4%

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

      6. associate-*l* 93.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 93.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 93.4%

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

      9. associate-*l* 95.4%

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

      10. associate-*l* 95.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 95.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 51.7%

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

   if -1.6e-81 < b < 1.85e-8

   1. Initial program 89.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- 89.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 89.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 89.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* 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.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 89.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 89.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* 94.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.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 94.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 x around inf 47.9%

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

4. Final simplification 50.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.6 \cdot 10^{-81} \lor \neg \left(b \leq 1.85 \cdot 10^{-8}\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 30.9% accurate, 5.7× speedup

Math

\[\begin{array}{l} [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.
(FPCore (x y z t a b) :precision binary64 (* x 2.0))

C

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.
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;
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])
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])
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])){:}
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.
code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]

Derivation

1. Initial program 91.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- 91.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 91.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 91.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* 91.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- 91.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* 91.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 91.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 91.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* 94.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* 94.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 94.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 34.3%

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

6. Final simplification 34.3%

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

Developer target: 95.1% 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 2024055 
(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)))