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

Percentage Accurate: 85.2% → 89.3%

Time: 33.5s

Alternatives: 23

Speedup: 0.8×

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

Specification

Math

\[\begin{array}{l} \\ \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \end{array} \]

FPCore

(FPCore (x y z t a b c i j k)
 :precision binary64
 (-
  (-
   (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c))
   (* (* x 4.0) i))
  (* (* j 27.0) k)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    code = (((((((x * 18.0d0) * y) * z) * t) - ((a * 4.0d0) * t)) + (b * c)) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}

Python

def code(x, y, z, t, a, b, c, i, j, k):
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)

Julia

function code(x, y, z, t, a, b, c, i, j, k)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(Float64(a * 4.0) * t)) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i, j, k)
	tmp = (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]

Initial Program: 85.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \end{array} \]

FPCore

(FPCore (x y z t a b c i j k)
 :precision binary64
 (-
  (-
   (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c))
   (* (* x 4.0) i))
  (* (* j 27.0) k)))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    code = (((((((x * 18.0d0) * y) * z) * t) - ((a * 4.0d0) * t)) + (b * c)) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}

Python

def code(x, y, z, t, a, b, c, i, j, k):
	return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)

Julia

function code(x, y, z, t, a, b, c, i, j, k)
	return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(Float64(a * 4.0) * t)) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i, j, k)
	tmp = (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]

Alternative 1: 89.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -7.7 \cdot 10^{-84} \lor \neg \left(t \leq 1.4 \cdot 10^{-231}\right):\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(-4 \cdot i\right)\right)\right) + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \left(t \cdot z\right) - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - i \cdot \left(x \cdot 4\right)\right) - k \cdot \left(j \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= t -7.7e-84) (not (<= t 1.4e-231)))
   (+
    (fma t (fma x (* 18.0 (* y z)) (* a -4.0)) (fma b c (* x (* -4.0 i))))
    (* j (* k -27.0)))
   (-
    (-
     (+ (- (* (* 18.0 (* x y)) (* t z)) (* t (* a 4.0))) (* b c))
     (* i (* x 4.0)))
    (* k (* j 27.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -7.7e-84) || !(t <= 1.4e-231)) {
		tmp = fma(t, fma(x, (18.0 * (y * z)), (a * -4.0)), fma(b, c, (x * (-4.0 * i)))) + (j * (k * -27.0));
	} else {
		tmp = (((((18.0 * (x * y)) * (t * z)) - (t * (a * 4.0))) + (b * c)) - (i * (x * 4.0))) - (k * (j * 27.0));
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -7.7e-84) || !(t <= 1.4e-231))
		tmp = Float64(fma(t, fma(x, Float64(18.0 * Float64(y * z)), Float64(a * -4.0)), fma(b, c, Float64(x * Float64(-4.0 * i)))) + Float64(j * Float64(k * -27.0)));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(18.0 * Float64(x * y)) * Float64(t * z)) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(i * Float64(x * 4.0))) - Float64(k * Float64(j * 27.0)));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[t, -7.7e-84], N[Not[LessEqual[t, 1.4e-231]], $MachinePrecision]], N[(N[(t * N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b * c + N[(x * N[(-4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(18.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(t * z), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(i * N[(x * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -7.7000000000000001e-84 or 1.3999999999999999e-231 < t

   1. Initial program 86.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 93.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   if -7.7000000000000001e-84 < t < 1.3999999999999999e-231

   1. Initial program 79.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. pow1 79.6%

         \[\leadsto \left(\left(\left(\color{blue}{{\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t\right)}^{1}} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      2. associate-*l* 87.6%

         \[\leadsto \left(\left(\left({\color{blue}{\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot \left(z \cdot t\right)\right)}}^{1} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      3. *-commutative 87.6%

         \[\leadsto \left(\left(\left({\left(\color{blue}{\left(y \cdot \left(x \cdot 18\right)\right)} \cdot \left(z \cdot t\right)\right)}^{1} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   4. Applied egg-rr 87.6%

      \[\leadsto \left(\left(\left(\color{blue}{{\left(\left(y \cdot \left(x \cdot 18\right)\right) \cdot \left(z \cdot t\right)\right)}^{1}} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]
   5. Step-by-step derivation

      1. unpow1 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(y \cdot \left(x \cdot 18\right)\right) \cdot \left(z \cdot t\right)} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      2. associate-*r* 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(\left(y \cdot x\right) \cdot 18\right)} \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      3. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\left(\color{blue}{\left(x \cdot y\right)} \cdot 18\right) \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      4. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(18 \cdot \left(x \cdot y\right)\right)} \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      5. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \color{blue}{\left(t \cdot z\right)} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   6. Simplified 87.6%

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

4. Final simplification 91.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -7.7 \cdot 10^{-84} \lor \neg \left(t \leq 1.4 \cdot 10^{-231}\right):\\ \;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(-4 \cdot i\right)\right)\right) + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \left(t \cdot z\right) - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - i \cdot \left(x \cdot 4\right)\right) - k \cdot \left(j \cdot 27\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 92.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := \left(b \cdot c + \left(t \cdot \left(z \cdot \left(y \cdot \left(x \cdot 18\right)\right)\right) - t \cdot \left(a \cdot 4\right)\right)\right) - i \cdot \left(x \cdot 4\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + \left(b \cdot c + x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\right)\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1 - k \cdot \left(j \cdot 27\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1
         (-
          (+ (* b c) (- (* t (* z (* y (* x 18.0)))) (* t (* a 4.0))))
          (* i (* x 4.0)))))
   (if (<= t_1 (- INFINITY))
     (+
      (* -4.0 (* t a))
      (+ (* b c) (* x (- (* 18.0 (* t (* y z))) (* i 4.0)))))
     (if (<= t_1 INFINITY)
       (- t_1 (* k (* j 27.0)))
       (* x (* y (+ (* -4.0 (/ i y)) (* 18.0 (* t z)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((b * c) + ((t * (z * (y * (x * 18.0)))) - (t * (a * 4.0)))) - (i * (x * 4.0));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (-4.0 * (t * a)) + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_1 - (k * (j * 27.0));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((b * c) + ((t * (z * (y * (x * 18.0)))) - (t * (a * 4.0)))) - (i * (x * 4.0));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = (-4.0 * (t * a)) + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1 - (k * (j * 27.0));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = ((b * c) + ((t * (z * (y * (x * 18.0)))) - (t * (a * 4.0)))) - (i * (x * 4.0))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = (-4.0 * (t * a)) + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))))
	elif t_1 <= math.inf:
		tmp = t_1 - (k * (j * 27.0))
	else:
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(Float64(b * c) + Float64(Float64(t * Float64(z * Float64(y * Float64(x * 18.0)))) - Float64(t * Float64(a * 4.0)))) - Float64(i * Float64(x * 4.0)))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(-4.0 * Float64(t * a)) + Float64(Float64(b * c) + Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(i * 4.0)))));
	elseif (t_1 <= Inf)
		tmp = Float64(t_1 - Float64(k * Float64(j * 27.0)));
	else
		tmp = Float64(x * Float64(y * Float64(Float64(-4.0 * Float64(i / y)) + Float64(18.0 * Float64(t * z)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = ((b * c) + ((t * (z * (y * (x * 18.0)))) - (t * (a * 4.0)))) - (i * (x * 4.0));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = (-4.0 * (t * a)) + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	elseif (t_1 <= Inf)
		tmp = t_1 - (k * (j * 27.0));
	else
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(b * c), $MachinePrecision] + N[(N[(t * N[(z * N[(y * N[(x * 18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * N[(x * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(t$95$1 - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(N[(-4.0 * N[(i / y), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x 18) y) z) t) (*.f64 (*.f64 a 4) t)) (*.f64 b c)) (*.f64 (*.f64 x 4) i)) < -inf.0

   1. Initial program 81.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 86.6%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 88.4%

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

   6. Taylor expanded in x around 0 92.3%

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

   if -inf.0 < (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x 18) y) z) t) (*.f64 (*.f64 a 4) t)) (*.f64 b c)) (*.f64 (*.f64 x 4) i)) < +inf.0

   1. Initial program 94.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]
   2. Add Preprocessing

   if +inf.0 < (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x 18) y) z) t) (*.f64 (*.f64 a 4) t)) (*.f64 b c)) (*.f64 (*.f64 x 4) i))

   1. Initial program 0.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 22.2%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 66.7%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in y around inf 77.8%

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

4. Final simplification 92.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(b \cdot c + \left(t \cdot \left(z \cdot \left(y \cdot \left(x \cdot 18\right)\right)\right) - t \cdot \left(a \cdot 4\right)\right)\right) - i \cdot \left(x \cdot 4\right) \leq -\infty:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + \left(b \cdot c + x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\right)\\ \mathbf{elif}\;\left(b \cdot c + \left(t \cdot \left(z \cdot \left(y \cdot \left(x \cdot 18\right)\right)\right) - t \cdot \left(a \cdot 4\right)\right)\right) - i \cdot \left(x \cdot 4\right) \leq \infty:\\ \;\;\;\;\left(\left(b \cdot c + \left(t \cdot \left(z \cdot \left(y \cdot \left(x \cdot 18\right)\right)\right) - t \cdot \left(a \cdot 4\right)\right)\right) - i \cdot \left(x \cdot 4\right)\right) - k \cdot \left(j \cdot 27\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 35.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := a \cdot \left(t \cdot -4\right)\\ t_2 := -27 \cdot \left(j \cdot k\right)\\ t_3 := 18 \cdot \left(x \cdot \left(z \cdot \left(t \cdot y\right)\right)\right)\\ \mathbf{if}\;b \cdot c \leq -1.5 \cdot 10^{+47}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.7 \cdot 10^{-103}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq -4 \cdot 10^{-204}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;b \cdot c \leq -1.15 \cdot 10^{-250}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-275}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \cdot c \leq -7 \cdot 10^{-283}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;b \cdot c \leq 4 \cdot 10^{+31}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 1.22 \cdot 10^{+155}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 2.5 \cdot 10^{+217}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* a (* t -4.0)))
        (t_2 (* -27.0 (* j k)))
        (t_3 (* 18.0 (* x (* z (* t y))))))
   (if (<= (* b c) -1.5e+47)
     (* b c)
     (if (<= (* b c) -1.7e-103)
       t_1
       (if (<= (* b c) -4e-204)
         t_3
         (if (<= (* b c) -1.15e-250)
           t_1
           (if (<= (* b c) -5e-275)
             t_2
             (if (<= (* b c) -7e-283)
               t_3
               (if (<= (* b c) 4e+31)
                 (* j (* k -27.0))
                 (if (<= (* b c) 1.22e+155)
                   t_1
                   (if (<= (* b c) 2.5e+217) t_2 (* b c))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double t_2 = -27.0 * (j * k);
	double t_3 = 18.0 * (x * (z * (t * y)));
	double tmp;
	if ((b * c) <= -1.5e+47) {
		tmp = b * c;
	} else if ((b * c) <= -1.7e-103) {
		tmp = t_1;
	} else if ((b * c) <= -4e-204) {
		tmp = t_3;
	} else if ((b * c) <= -1.15e-250) {
		tmp = t_1;
	} else if ((b * c) <= -5e-275) {
		tmp = t_2;
	} else if ((b * c) <= -7e-283) {
		tmp = t_3;
	} else if ((b * c) <= 4e+31) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 1.22e+155) {
		tmp = t_1;
	} else if ((b * c) <= 2.5e+217) {
		tmp = t_2;
	} else {
		tmp = b * c;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = a * (t * (-4.0d0))
    t_2 = (-27.0d0) * (j * k)
    t_3 = 18.0d0 * (x * (z * (t * y)))
    if ((b * c) <= (-1.5d+47)) then
        tmp = b * c
    else if ((b * c) <= (-1.7d-103)) then
        tmp = t_1
    else if ((b * c) <= (-4d-204)) then
        tmp = t_3
    else if ((b * c) <= (-1.15d-250)) then
        tmp = t_1
    else if ((b * c) <= (-5d-275)) then
        tmp = t_2
    else if ((b * c) <= (-7d-283)) then
        tmp = t_3
    else if ((b * c) <= 4d+31) then
        tmp = j * (k * (-27.0d0))
    else if ((b * c) <= 1.22d+155) then
        tmp = t_1
    else if ((b * c) <= 2.5d+217) then
        tmp = t_2
    else
        tmp = b * c
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double t_2 = -27.0 * (j * k);
	double t_3 = 18.0 * (x * (z * (t * y)));
	double tmp;
	if ((b * c) <= -1.5e+47) {
		tmp = b * c;
	} else if ((b * c) <= -1.7e-103) {
		tmp = t_1;
	} else if ((b * c) <= -4e-204) {
		tmp = t_3;
	} else if ((b * c) <= -1.15e-250) {
		tmp = t_1;
	} else if ((b * c) <= -5e-275) {
		tmp = t_2;
	} else if ((b * c) <= -7e-283) {
		tmp = t_3;
	} else if ((b * c) <= 4e+31) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 1.22e+155) {
		tmp = t_1;
	} else if ((b * c) <= 2.5e+217) {
		tmp = t_2;
	} else {
		tmp = b * c;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = a * (t * -4.0)
	t_2 = -27.0 * (j * k)
	t_3 = 18.0 * (x * (z * (t * y)))
	tmp = 0
	if (b * c) <= -1.5e+47:
		tmp = b * c
	elif (b * c) <= -1.7e-103:
		tmp = t_1
	elif (b * c) <= -4e-204:
		tmp = t_3
	elif (b * c) <= -1.15e-250:
		tmp = t_1
	elif (b * c) <= -5e-275:
		tmp = t_2
	elif (b * c) <= -7e-283:
		tmp = t_3
	elif (b * c) <= 4e+31:
		tmp = j * (k * -27.0)
	elif (b * c) <= 1.22e+155:
		tmp = t_1
	elif (b * c) <= 2.5e+217:
		tmp = t_2
	else:
		tmp = b * c
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(a * Float64(t * -4.0))
	t_2 = Float64(-27.0 * Float64(j * k))
	t_3 = Float64(18.0 * Float64(x * Float64(z * Float64(t * y))))
	tmp = 0.0
	if (Float64(b * c) <= -1.5e+47)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -1.7e-103)
		tmp = t_1;
	elseif (Float64(b * c) <= -4e-204)
		tmp = t_3;
	elseif (Float64(b * c) <= -1.15e-250)
		tmp = t_1;
	elseif (Float64(b * c) <= -5e-275)
		tmp = t_2;
	elseif (Float64(b * c) <= -7e-283)
		tmp = t_3;
	elseif (Float64(b * c) <= 4e+31)
		tmp = Float64(j * Float64(k * -27.0));
	elseif (Float64(b * c) <= 1.22e+155)
		tmp = t_1;
	elseif (Float64(b * c) <= 2.5e+217)
		tmp = t_2;
	else
		tmp = Float64(b * c);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = a * (t * -4.0);
	t_2 = -27.0 * (j * k);
	t_3 = 18.0 * (x * (z * (t * y)));
	tmp = 0.0;
	if ((b * c) <= -1.5e+47)
		tmp = b * c;
	elseif ((b * c) <= -1.7e-103)
		tmp = t_1;
	elseif ((b * c) <= -4e-204)
		tmp = t_3;
	elseif ((b * c) <= -1.15e-250)
		tmp = t_1;
	elseif ((b * c) <= -5e-275)
		tmp = t_2;
	elseif ((b * c) <= -7e-283)
		tmp = t_3;
	elseif ((b * c) <= 4e+31)
		tmp = j * (k * -27.0);
	elseif ((b * c) <= 1.22e+155)
		tmp = t_1;
	elseif ((b * c) <= 2.5e+217)
		tmp = t_2;
	else
		tmp = b * c;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(18.0 * N[(x * N[(z * N[(t * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.5e+47], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.7e-103], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], -4e-204], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], -1.15e-250], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], -5e-275], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -7e-283], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 4e+31], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.22e+155], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.5e+217], t$95$2, N[(b * c), $MachinePrecision]]]]]]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 b c) < -1.5000000000000001e47 or 2.50000000000000021e217 < (*.f64 b c)

   1. Initial program 81.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 81.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 81.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 81.5%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 80.3%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 80.3%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 80.3%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   9. Taylor expanded in b around inf 62.2%

      \[\leadsto \color{blue}{b \cdot c} \]

   if -1.5000000000000001e47 < (*.f64 b c) < -1.70000000000000001e-103 or -4e-204 < (*.f64 b c) < -1.15e-250 or 3.9999999999999999e31 < (*.f64 b c) < 1.21999999999999996e155

   1. Initial program 96.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.6%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 86.8%

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

   6. Taylor expanded in x around 0 86.5%

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

   7. Taylor expanded in a around inf 48.4%

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

      1. *-commutative 48.4%

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

      2. associate-*r* 48.4%

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

   9. Simplified 48.4%

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

   if -1.70000000000000001e-103 < (*.f64 b c) < -4e-204 or -4.99999999999999983e-275 < (*.f64 b c) < -6.9999999999999997e-283

   1. Initial program 89.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 94.7%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 84.7%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in t around inf 59.1%

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

      1. pow1 59.1%

         \[\leadsto 18 \cdot \color{blue}{{\left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)}^{1}} \]

   8. Applied egg-rr 59.1%

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

      1. unpow1 59.1%

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

      2. *-commutative 59.1%

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

      3. associate-*l* 64.2%

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

      4. *-commutative 64.2%

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

      5. associate-*r* 64.2%

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

      6. *-commutative 64.2%

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

   10. Simplified 64.2%

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

   if -1.15e-250 < (*.f64 b c) < -4.99999999999999983e-275 or 1.21999999999999996e155 < (*.f64 b c) < 2.50000000000000021e217

   1. Initial program 82.3%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 76.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 47.6%

      \[\leadsto \color{blue}{-27 \cdot \left(j \cdot k\right)} \]

   if -6.9999999999999997e-283 < (*.f64 b c) < 3.9999999999999999e31

   1. Initial program 80.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 35.8%

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

      1. *-commutative 35.8%

         \[\leadsto \color{blue}{\left(j \cdot k\right) \cdot -27} \]

      2. associate-*r* 35.8%

         \[\leadsto \color{blue}{j \cdot \left(k \cdot -27\right)} \]

      3. *-commutative 35.8%

         \[\leadsto j \cdot \color{blue}{\left(-27 \cdot k\right)} \]

   7. Simplified 35.8%

      \[\leadsto \color{blue}{j \cdot \left(-27 \cdot k\right)} \]
3. Recombined 5 regimes into one program.

4. Final simplification 49.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1.5 \cdot 10^{+47}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.7 \cdot 10^{-103}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq -4 \cdot 10^{-204}:\\ \;\;\;\;18 \cdot \left(x \cdot \left(z \cdot \left(t \cdot y\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq -1.15 \cdot 10^{-250}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-275}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;b \cdot c \leq -7 \cdot 10^{-283}:\\ \;\;\;\;18 \cdot \left(x \cdot \left(z \cdot \left(t \cdot y\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq 4 \cdot 10^{+31}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 1.22 \cdot 10^{+155}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 2.5 \cdot 10^{+217}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 54.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := t\_1 + b \cdot c\\ t_3 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{if}\;x \leq -1.75 \cdot 10^{+216}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;x \leq -4.2 \cdot 10^{+140}:\\ \;\;\;\;i \cdot \left(\frac{b \cdot c}{i} - x \cdot 4\right)\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{+67}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;x \leq -1.85 \cdot 10^{-31}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;x \leq -3 \cdot 10^{-126}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;x \leq -2.65 \cdot 10^{-178}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-200}:\\ \;\;\;\;t\_1 + t \cdot \left(a \cdot -4\right)\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-88}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;x \leq 6 \cdot 10^{-49}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;x \leq 4.25 \cdot 10^{-10}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0)))
        (t_2 (+ t_1 (* b c)))
        (t_3 (* t (+ (* 18.0 (* x (* y z))) (* a -4.0)))))
   (if (<= x -1.75e+216)
     (* x (- (* 18.0 (* t (* y z))) (* i 4.0)))
     (if (<= x -4.2e+140)
       (* i (- (/ (* b c) i) (* x 4.0)))
       (if (<= x -1.25e+67)
         t_3
         (if (<= x -1.85e-31)
           t_2
           (if (<= x -3e-126)
             t_3
             (if (<= x -2.65e-178)
               t_2
               (if (<= x 3.8e-200)
                 (+ t_1 (* t (* a -4.0)))
                 (if (<= x 8.5e-88)
                   t_2
                   (if (<= x 6e-49)
                     t_3
                     (if (<= x 4.25e-10)
                       (* c (+ b (* -27.0 (/ (* j k) c))))
                       (*
                        x
                        (*
                         y
                         (+ (* -4.0 (/ i y)) (* 18.0 (* t z)))))))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = t_1 + (b * c);
	double t_3 = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	double tmp;
	if (x <= -1.75e+216) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if (x <= -4.2e+140) {
		tmp = i * (((b * c) / i) - (x * 4.0));
	} else if (x <= -1.25e+67) {
		tmp = t_3;
	} else if (x <= -1.85e-31) {
		tmp = t_2;
	} else if (x <= -3e-126) {
		tmp = t_3;
	} else if (x <= -2.65e-178) {
		tmp = t_2;
	} else if (x <= 3.8e-200) {
		tmp = t_1 + (t * (a * -4.0));
	} else if (x <= 8.5e-88) {
		tmp = t_2;
	} else if (x <= 6e-49) {
		tmp = t_3;
	} else if (x <= 4.25e-10) {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = t_1 + (b * c)
    t_3 = t * ((18.0d0 * (x * (y * z))) + (a * (-4.0d0)))
    if (x <= (-1.75d+216)) then
        tmp = x * ((18.0d0 * (t * (y * z))) - (i * 4.0d0))
    else if (x <= (-4.2d+140)) then
        tmp = i * (((b * c) / i) - (x * 4.0d0))
    else if (x <= (-1.25d+67)) then
        tmp = t_3
    else if (x <= (-1.85d-31)) then
        tmp = t_2
    else if (x <= (-3d-126)) then
        tmp = t_3
    else if (x <= (-2.65d-178)) then
        tmp = t_2
    else if (x <= 3.8d-200) then
        tmp = t_1 + (t * (a * (-4.0d0)))
    else if (x <= 8.5d-88) then
        tmp = t_2
    else if (x <= 6d-49) then
        tmp = t_3
    else if (x <= 4.25d-10) then
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    else
        tmp = x * (y * (((-4.0d0) * (i / y)) + (18.0d0 * (t * z))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = t_1 + (b * c);
	double t_3 = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	double tmp;
	if (x <= -1.75e+216) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if (x <= -4.2e+140) {
		tmp = i * (((b * c) / i) - (x * 4.0));
	} else if (x <= -1.25e+67) {
		tmp = t_3;
	} else if (x <= -1.85e-31) {
		tmp = t_2;
	} else if (x <= -3e-126) {
		tmp = t_3;
	} else if (x <= -2.65e-178) {
		tmp = t_2;
	} else if (x <= 3.8e-200) {
		tmp = t_1 + (t * (a * -4.0));
	} else if (x <= 8.5e-88) {
		tmp = t_2;
	} else if (x <= 6e-49) {
		tmp = t_3;
	} else if (x <= 4.25e-10) {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = t_1 + (b * c)
	t_3 = t * ((18.0 * (x * (y * z))) + (a * -4.0))
	tmp = 0
	if x <= -1.75e+216:
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0))
	elif x <= -4.2e+140:
		tmp = i * (((b * c) / i) - (x * 4.0))
	elif x <= -1.25e+67:
		tmp = t_3
	elif x <= -1.85e-31:
		tmp = t_2
	elif x <= -3e-126:
		tmp = t_3
	elif x <= -2.65e-178:
		tmp = t_2
	elif x <= 3.8e-200:
		tmp = t_1 + (t * (a * -4.0))
	elif x <= 8.5e-88:
		tmp = t_2
	elif x <= 6e-49:
		tmp = t_3
	elif x <= 4.25e-10:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	else:
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(t_1 + Float64(b * c))
	t_3 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) + Float64(a * -4.0)))
	tmp = 0.0
	if (x <= -1.75e+216)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(i * 4.0)));
	elseif (x <= -4.2e+140)
		tmp = Float64(i * Float64(Float64(Float64(b * c) / i) - Float64(x * 4.0)));
	elseif (x <= -1.25e+67)
		tmp = t_3;
	elseif (x <= -1.85e-31)
		tmp = t_2;
	elseif (x <= -3e-126)
		tmp = t_3;
	elseif (x <= -2.65e-178)
		tmp = t_2;
	elseif (x <= 3.8e-200)
		tmp = Float64(t_1 + Float64(t * Float64(a * -4.0)));
	elseif (x <= 8.5e-88)
		tmp = t_2;
	elseif (x <= 6e-49)
		tmp = t_3;
	elseif (x <= 4.25e-10)
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	else
		tmp = Float64(x * Float64(y * Float64(Float64(-4.0 * Float64(i / y)) + Float64(18.0 * Float64(t * z)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = t_1 + (b * c);
	t_3 = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	tmp = 0.0;
	if (x <= -1.75e+216)
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	elseif (x <= -4.2e+140)
		tmp = i * (((b * c) / i) - (x * 4.0));
	elseif (x <= -1.25e+67)
		tmp = t_3;
	elseif (x <= -1.85e-31)
		tmp = t_2;
	elseif (x <= -3e-126)
		tmp = t_3;
	elseif (x <= -2.65e-178)
		tmp = t_2;
	elseif (x <= 3.8e-200)
		tmp = t_1 + (t * (a * -4.0));
	elseif (x <= 8.5e-88)
		tmp = t_2;
	elseif (x <= 6e-49)
		tmp = t_3;
	elseif (x <= 4.25e-10)
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	else
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 + N[(b * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.75e+216], N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.2e+140], N[(i * N[(N[(N[(b * c), $MachinePrecision] / i), $MachinePrecision] - N[(x * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.25e+67], t$95$3, If[LessEqual[x, -1.85e-31], t$95$2, If[LessEqual[x, -3e-126], t$95$3, If[LessEqual[x, -2.65e-178], t$95$2, If[LessEqual[x, 3.8e-200], N[(t$95$1 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.5e-88], t$95$2, If[LessEqual[x, 6e-49], t$95$3, If[LessEqual[x, 4.25e-10], N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(N[(-4.0 * N[(i / y), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]]

Derivation

1. Split input into 7 regimes

2. if x < -1.74999999999999996e216

   1. Initial program 48.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 65.8%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 87.4%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   if -1.74999999999999996e216 < x < -4.2000000000000004e140

   1. Initial program 72.7%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 81.8%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 90.9%

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

   6. Taylor expanded in t around 0 82.3%

      \[\leadsto \color{blue}{b \cdot c - 4 \cdot \left(i \cdot x\right)} \]

   7. Taylor expanded in i around inf 91.4%

      \[\leadsto \color{blue}{i \cdot \left(\frac{b \cdot c}{i} - 4 \cdot x\right)} \]

   if -4.2000000000000004e140 < x < -1.24999999999999994e67 or -1.8499999999999999e-31 < x < -3.0000000000000002e-126 or 8.4999999999999996e-88 < x < 6e-49

   1. Initial program 88.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 94.1%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 85.2%

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

   6. Taylor expanded in x around 0 79.9%

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

   7. Taylor expanded in t around inf 71.5%

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

   if -1.24999999999999994e67 < x < -1.8499999999999999e-31 or -3.0000000000000002e-126 < x < -2.65000000000000004e-178 or 3.8e-200 < x < 8.4999999999999996e-88

   1. Initial program 96.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 79.2%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -2.65000000000000004e-178 < x < 3.8e-200

   1. Initial program 94.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in a around inf 75.0%

      \[\leadsto \color{blue}{-4 \cdot \left(a \cdot t\right)} + j \cdot \left(k \cdot -27\right) \]
   6. Step-by-step derivation

      1. associate-*r* 75.0%

         \[\leadsto \color{blue}{\left(-4 \cdot a\right) \cdot t} + j \cdot \left(k \cdot -27\right) \]

      2. *-commutative 75.0%

         \[\leadsto \color{blue}{\left(a \cdot -4\right)} \cdot t + j \cdot \left(k \cdot -27\right) \]

      3. metadata-eval 75.0%

         \[\leadsto \left(a \cdot \color{blue}{\left(-4\right)}\right) \cdot t + j \cdot \left(k \cdot -27\right) \]

      4. distribute-rgt-neg-in 75.0%

         \[\leadsto \color{blue}{\left(-a \cdot 4\right)} \cdot t + j \cdot \left(k \cdot -27\right) \]

      5. *-commutative 75.0%

         \[\leadsto \color{blue}{t \cdot \left(-a \cdot 4\right)} + j \cdot \left(k \cdot -27\right) \]

      6. distribute-rgt-neg-in 75.0%

         \[\leadsto t \cdot \color{blue}{\left(a \cdot \left(-4\right)\right)} + j \cdot \left(k \cdot -27\right) \]

      7. metadata-eval 75.0%

         \[\leadsto t \cdot \left(a \cdot \color{blue}{-4}\right) + j \cdot \left(k \cdot -27\right) \]

      8. *-commutative 75.0%

         \[\leadsto t \cdot \color{blue}{\left(-4 \cdot a\right)} + j \cdot \left(k \cdot -27\right) \]

   7. Simplified 75.0%

      \[\leadsto \color{blue}{t \cdot \left(-4 \cdot a\right)} + j \cdot \left(k \cdot -27\right) \]

   if 6e-49 < x < 4.2499999999999998e-10

   1. Initial program 93.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 93.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 58.8%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 59.2%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]

   if 4.2499999999999998e-10 < x

   1. Initial program 79.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.7%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 68.2%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in y around inf 71.0%

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

4. Final simplification 75.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{+216}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;x \leq -4.2 \cdot 10^{+140}:\\ \;\;\;\;i \cdot \left(\frac{b \cdot c}{i} - x \cdot 4\right)\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{+67}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;x \leq -1.85 \cdot 10^{-31}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;x \leq -3 \cdot 10^{-126}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;x \leq -2.65 \cdot 10^{-178}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-200}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + t \cdot \left(a \cdot -4\right)\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-88}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;x \leq 6 \cdot 10^{-49}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;x \leq 4.25 \cdot 10^{-10}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 35.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := a \cdot \left(t \cdot -4\right)\\ \mathbf{if}\;b \cdot c \leq -1.9 \cdot 10^{+47}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.5 \cdot 10^{-103}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq -3.9 \cdot 10^{-190}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq -1.75 \cdot 10^{-250}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 8.4 \cdot 10^{+21}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 2.05 \cdot 10^{+154}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 1.16 \cdot 10^{+221}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* a (* t -4.0))))
   (if (<= (* b c) -1.9e+47)
     (* b c)
     (if (<= (* b c) -1.5e-103)
       t_1
       (if (<= (* b c) -3.9e-190)
         (* 18.0 (* t (* x (* y z))))
         (if (<= (* b c) -1.75e-250)
           t_1
           (if (<= (* b c) 8.4e+21)
             (* j (* k -27.0))
             (if (<= (* b c) 2.05e+154)
               t_1
               (if (<= (* b c) 1.16e+221) (* -27.0 (* j k)) (* b c))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double tmp;
	if ((b * c) <= -1.9e+47) {
		tmp = b * c;
	} else if ((b * c) <= -1.5e-103) {
		tmp = t_1;
	} else if ((b * c) <= -3.9e-190) {
		tmp = 18.0 * (t * (x * (y * z)));
	} else if ((b * c) <= -1.75e-250) {
		tmp = t_1;
	} else if ((b * c) <= 8.4e+21) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 2.05e+154) {
		tmp = t_1;
	} else if ((b * c) <= 1.16e+221) {
		tmp = -27.0 * (j * k);
	} else {
		tmp = b * c;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a * (t * (-4.0d0))
    if ((b * c) <= (-1.9d+47)) then
        tmp = b * c
    else if ((b * c) <= (-1.5d-103)) then
        tmp = t_1
    else if ((b * c) <= (-3.9d-190)) then
        tmp = 18.0d0 * (t * (x * (y * z)))
    else if ((b * c) <= (-1.75d-250)) then
        tmp = t_1
    else if ((b * c) <= 8.4d+21) then
        tmp = j * (k * (-27.0d0))
    else if ((b * c) <= 2.05d+154) then
        tmp = t_1
    else if ((b * c) <= 1.16d+221) then
        tmp = (-27.0d0) * (j * k)
    else
        tmp = b * c
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double tmp;
	if ((b * c) <= -1.9e+47) {
		tmp = b * c;
	} else if ((b * c) <= -1.5e-103) {
		tmp = t_1;
	} else if ((b * c) <= -3.9e-190) {
		tmp = 18.0 * (t * (x * (y * z)));
	} else if ((b * c) <= -1.75e-250) {
		tmp = t_1;
	} else if ((b * c) <= 8.4e+21) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 2.05e+154) {
		tmp = t_1;
	} else if ((b * c) <= 1.16e+221) {
		tmp = -27.0 * (j * k);
	} else {
		tmp = b * c;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = a * (t * -4.0)
	tmp = 0
	if (b * c) <= -1.9e+47:
		tmp = b * c
	elif (b * c) <= -1.5e-103:
		tmp = t_1
	elif (b * c) <= -3.9e-190:
		tmp = 18.0 * (t * (x * (y * z)))
	elif (b * c) <= -1.75e-250:
		tmp = t_1
	elif (b * c) <= 8.4e+21:
		tmp = j * (k * -27.0)
	elif (b * c) <= 2.05e+154:
		tmp = t_1
	elif (b * c) <= 1.16e+221:
		tmp = -27.0 * (j * k)
	else:
		tmp = b * c
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(a * Float64(t * -4.0))
	tmp = 0.0
	if (Float64(b * c) <= -1.9e+47)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -1.5e-103)
		tmp = t_1;
	elseif (Float64(b * c) <= -3.9e-190)
		tmp = Float64(18.0 * Float64(t * Float64(x * Float64(y * z))));
	elseif (Float64(b * c) <= -1.75e-250)
		tmp = t_1;
	elseif (Float64(b * c) <= 8.4e+21)
		tmp = Float64(j * Float64(k * -27.0));
	elseif (Float64(b * c) <= 2.05e+154)
		tmp = t_1;
	elseif (Float64(b * c) <= 1.16e+221)
		tmp = Float64(-27.0 * Float64(j * k));
	else
		tmp = Float64(b * c);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = a * (t * -4.0);
	tmp = 0.0;
	if ((b * c) <= -1.9e+47)
		tmp = b * c;
	elseif ((b * c) <= -1.5e-103)
		tmp = t_1;
	elseif ((b * c) <= -3.9e-190)
		tmp = 18.0 * (t * (x * (y * z)));
	elseif ((b * c) <= -1.75e-250)
		tmp = t_1;
	elseif ((b * c) <= 8.4e+21)
		tmp = j * (k * -27.0);
	elseif ((b * c) <= 2.05e+154)
		tmp = t_1;
	elseif ((b * c) <= 1.16e+221)
		tmp = -27.0 * (j * k);
	else
		tmp = b * c;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.9e+47], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.5e-103], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], -3.9e-190], N[(18.0 * N[(t * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.75e-250], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 8.4e+21], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.05e+154], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1.16e+221], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 b c) < -1.9000000000000002e47 or 1.15999999999999997e221 < (*.f64 b c)

   1. Initial program 81.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 81.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 81.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 81.5%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 80.3%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 80.3%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 80.3%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   9. Taylor expanded in b around inf 62.2%

      \[\leadsto \color{blue}{b \cdot c} \]

   if -1.9000000000000002e47 < (*.f64 b c) < -1.5e-103 or -3.89999999999999995e-190 < (*.f64 b c) < -1.7499999999999999e-250 or 8.4e21 < (*.f64 b c) < 2.05e154

   1. Initial program 96.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.6%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 86.8%

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

   6. Taylor expanded in x around 0 86.5%

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

   7. Taylor expanded in a around inf 48.4%

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

      1. *-commutative 48.4%

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

      2. associate-*r* 48.4%

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

   9. Simplified 48.4%

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

   if -1.5e-103 < (*.f64 b c) < -3.89999999999999995e-190

   1. Initial program 92.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.2%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 84.9%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in t around inf 62.3%

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

   if -1.7499999999999999e-250 < (*.f64 b c) < 8.4e21

   1. Initial program 81.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 36.2%

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

      1. *-commutative 36.2%

         \[\leadsto \color{blue}{\left(j \cdot k\right) \cdot -27} \]

      2. associate-*r* 36.2%

         \[\leadsto \color{blue}{j \cdot \left(k \cdot -27\right)} \]

      3. *-commutative 36.2%

         \[\leadsto j \cdot \color{blue}{\left(-27 \cdot k\right)} \]

   7. Simplified 36.2%

      \[\leadsto \color{blue}{j \cdot \left(-27 \cdot k\right)} \]

   if 2.05e154 < (*.f64 b c) < 1.15999999999999997e221

   1. Initial program 76.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 76.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 39.9%

      \[\leadsto \color{blue}{-27 \cdot \left(j \cdot k\right)} \]
3. Recombined 5 regimes into one program.

4. Final simplification 48.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1.9 \cdot 10^{+47}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.5 \cdot 10^{-103}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq -3.9 \cdot 10^{-190}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq -1.75 \cdot 10^{-250}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 8.4 \cdot 10^{+21}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 2.05 \cdot 10^{+154}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 1.16 \cdot 10^{+221}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 51.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq 10^{-229}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 10^{-171}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{-132} \lor \neg \left(b \cdot c \leq 4 \cdot 10^{-45}\right) \land b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* x (* -4.0 i)) (* -4.0 (* t a)))))
   (if (<= (* b c) -1e+47)
     (+ (* j (* k -27.0)) (* b c))
     (if (<= (* b c) 1e-229)
       t_1
       (if (<= (* b c) 1e-171)
         (* k (* j -27.0))
         (if (or (<= (* b c) 2e-132)
                 (and (not (<= (* b c) 4e-45)) (<= (* b c) 5e+151)))
           t_1
           (* c (+ b (* -27.0 (/ (* j k) c))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = (j * (k * -27.0)) + (b * c);
	} else if ((b * c) <= 1e-229) {
		tmp = t_1;
	} else if ((b * c) <= 1e-171) {
		tmp = k * (j * -27.0);
	} else if (((b * c) <= 2e-132) || (!((b * c) <= 4e-45) && ((b * c) <= 5e+151))) {
		tmp = t_1;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * ((-4.0d0) * i)) + ((-4.0d0) * (t * a))
    if ((b * c) <= (-1d+47)) then
        tmp = (j * (k * (-27.0d0))) + (b * c)
    else if ((b * c) <= 1d-229) then
        tmp = t_1
    else if ((b * c) <= 1d-171) then
        tmp = k * (j * (-27.0d0))
    else if (((b * c) <= 2d-132) .or. (.not. ((b * c) <= 4d-45)) .and. ((b * c) <= 5d+151)) then
        tmp = t_1
    else
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = (j * (k * -27.0)) + (b * c);
	} else if ((b * c) <= 1e-229) {
		tmp = t_1;
	} else if ((b * c) <= 1e-171) {
		tmp = k * (j * -27.0);
	} else if (((b * c) <= 2e-132) || (!((b * c) <= 4e-45) && ((b * c) <= 5e+151))) {
		tmp = t_1;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (x * (-4.0 * i)) + (-4.0 * (t * a))
	tmp = 0
	if (b * c) <= -1e+47:
		tmp = (j * (k * -27.0)) + (b * c)
	elif (b * c) <= 1e-229:
		tmp = t_1
	elif (b * c) <= 1e-171:
		tmp = k * (j * -27.0)
	elif ((b * c) <= 2e-132) or (not ((b * c) <= 4e-45) and ((b * c) <= 5e+151)):
		tmp = t_1
	else:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(x * Float64(-4.0 * i)) + Float64(-4.0 * Float64(t * a)))
	tmp = 0.0
	if (Float64(b * c) <= -1e+47)
		tmp = Float64(Float64(j * Float64(k * -27.0)) + Float64(b * c));
	elseif (Float64(b * c) <= 1e-229)
		tmp = t_1;
	elseif (Float64(b * c) <= 1e-171)
		tmp = Float64(k * Float64(j * -27.0));
	elseif ((Float64(b * c) <= 2e-132) || (!(Float64(b * c) <= 4e-45) && (Float64(b * c) <= 5e+151)))
		tmp = t_1;
	else
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	tmp = 0.0;
	if ((b * c) <= -1e+47)
		tmp = (j * (k * -27.0)) + (b * c);
	elseif ((b * c) <= 1e-229)
		tmp = t_1;
	elseif ((b * c) <= 1e-171)
		tmp = k * (j * -27.0);
	elseif (((b * c) <= 2e-132) || (~(((b * c) <= 4e-45)) && ((b * c) <= 5e+151)))
		tmp = t_1;
	else
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(-4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1e+47], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1e-229], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1e-171], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[N[(b * c), $MachinePrecision], 2e-132], And[N[Not[LessEqual[N[(b * c), $MachinePrecision], 4e-45]], $MachinePrecision], LessEqual[N[(b * c), $MachinePrecision], 5e+151]]], t$95$1, N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 b c) < -1e47

   1. Initial program 85.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 68.6%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -1e47 < (*.f64 b c) < 1.00000000000000007e-229 or 9.9999999999999998e-172 < (*.f64 b c) < 2e-132 or 3.99999999999999994e-45 < (*.f64 b c) < 5.0000000000000002e151

   1. Initial program 87.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.7%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 73.5%

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

   6. Taylor expanded in x around 0 74.2%

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

   7. Taylor expanded in x around inf 73.5%

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

   8. Taylor expanded in i around inf 55.2%

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

      1. *-commutative 55.2%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + -4 \cdot \color{blue}{\left(x \cdot i\right)} \]

      2. *-commutative 55.2%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{\left(x \cdot i\right) \cdot -4} \]

      3. associate-*r* 55.2%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   10. Simplified 55.2%

       \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   if 1.00000000000000007e-229 < (*.f64 b c) < 9.9999999999999998e-172

   1. Initial program 71.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 81.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 51.1%

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

      1. associate-*r* 51.1%

         \[\leadsto \color{blue}{\left(-27 \cdot j\right) \cdot k} \]

      2. *-commutative 51.1%

         \[\leadsto \color{blue}{k \cdot \left(-27 \cdot j\right)} \]

   7. Simplified 51.1%

      \[\leadsto \color{blue}{k \cdot \left(-27 \cdot j\right)} \]

   if 2e-132 < (*.f64 b c) < 3.99999999999999994e-45 or 5.0000000000000002e151 < (*.f64 b c)

   1. Initial program 78.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 84.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 70.0%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 72.0%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 61.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq 10^{-229}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;b \cdot c \leq 10^{-171}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{-132} \lor \neg \left(b \cdot c \leq 4 \cdot 10^{-45}\right) \land b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 53.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;t\_1 + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -2 \cdot 10^{-103}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \cdot c \leq -1 \cdot 10^{-159}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;t\_1 + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))) (t_2 (+ (* x (* -4.0 i)) (* -4.0 (* t a)))))
   (if (<= (* b c) -1e+47)
     (+ t_1 (* b c))
     (if (<= (* b c) -2e-103)
       t_2
       (if (<= (* b c) -1e-159)
         (* x (- (* 18.0 (* t (* y z))) (* i 4.0)))
         (if (<= (* b c) -5e-219)
           (* t (+ (* 18.0 (* x (* y z))) (* a -4.0)))
           (if (<= (* b c) 5e+20)
             (+ t_1 (* -4.0 (* x i)))
             (if (<= (* b c) 5e+151)
               t_2
               (* c (+ b (* -27.0 (/ (* j k) c))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -2e-103) {
		tmp = t_2;
	} else if ((b * c) <= -1e-159) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if ((b * c) <= -5e-219) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = t_2;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (x * ((-4.0d0) * i)) + ((-4.0d0) * (t * a))
    if ((b * c) <= (-1d+47)) then
        tmp = t_1 + (b * c)
    else if ((b * c) <= (-2d-103)) then
        tmp = t_2
    else if ((b * c) <= (-1d-159)) then
        tmp = x * ((18.0d0 * (t * (y * z))) - (i * 4.0d0))
    else if ((b * c) <= (-5d-219)) then
        tmp = t * ((18.0d0 * (x * (y * z))) + (a * (-4.0d0)))
    else if ((b * c) <= 5d+20) then
        tmp = t_1 + ((-4.0d0) * (x * i))
    else if ((b * c) <= 5d+151) then
        tmp = t_2
    else
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -2e-103) {
		tmp = t_2;
	} else if ((b * c) <= -1e-159) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if ((b * c) <= -5e-219) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = t_2;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a))
	tmp = 0
	if (b * c) <= -1e+47:
		tmp = t_1 + (b * c)
	elif (b * c) <= -2e-103:
		tmp = t_2
	elif (b * c) <= -1e-159:
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0))
	elif (b * c) <= -5e-219:
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0))
	elif (b * c) <= 5e+20:
		tmp = t_1 + (-4.0 * (x * i))
	elif (b * c) <= 5e+151:
		tmp = t_2
	else:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(x * Float64(-4.0 * i)) + Float64(-4.0 * Float64(t * a)))
	tmp = 0.0
	if (Float64(b * c) <= -1e+47)
		tmp = Float64(t_1 + Float64(b * c));
	elseif (Float64(b * c) <= -2e-103)
		tmp = t_2;
	elseif (Float64(b * c) <= -1e-159)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(i * 4.0)));
	elseif (Float64(b * c) <= -5e-219)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) + Float64(a * -4.0)));
	elseif (Float64(b * c) <= 5e+20)
		tmp = Float64(t_1 + Float64(-4.0 * Float64(x * i)));
	elseif (Float64(b * c) <= 5e+151)
		tmp = t_2;
	else
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	tmp = 0.0;
	if ((b * c) <= -1e+47)
		tmp = t_1 + (b * c);
	elseif ((b * c) <= -2e-103)
		tmp = t_2;
	elseif ((b * c) <= -1e-159)
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	elseif ((b * c) <= -5e-219)
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	elseif ((b * c) <= 5e+20)
		tmp = t_1 + (-4.0 * (x * i));
	elseif ((b * c) <= 5e+151)
		tmp = t_2;
	else
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(-4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1e+47], N[(t$95$1 + N[(b * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -2e-103], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -1e-159], N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -5e-219], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+20], N[(t$95$1 + N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+151], t$95$2, N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 6 regimes

2. if (*.f64 b c) < -1e47

   1. Initial program 85.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 68.6%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -1e47 < (*.f64 b c) < -1.99999999999999992e-103 or 5e20 < (*.f64 b c) < 5.0000000000000002e151

   1. Initial program 96.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.0%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 85.7%

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

   6. Taylor expanded in x around 0 85.4%

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

   7. Taylor expanded in x around inf 83.3%

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

   8. Taylor expanded in i around inf 70.1%

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

      1. *-commutative 70.1%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + -4 \cdot \color{blue}{\left(x \cdot i\right)} \]

      2. *-commutative 70.1%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{\left(x \cdot i\right) \cdot -4} \]

      3. associate-*r* 70.1%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   10. Simplified 70.1%

       \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   if -1.99999999999999992e-103 < (*.f64 b c) < -9.99999999999999989e-160

   1. Initial program 90.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.9%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 82.3%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   if -9.99999999999999989e-160 < (*.f64 b c) < -5.0000000000000002e-219

   1. Initial program 99.7%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 99.7%

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

   6. Taylor expanded in x around 0 99.7%

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

   7. Taylor expanded in t around inf 99.7%

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

   if -5.0000000000000002e-219 < (*.f64 b c) < 5e20

   1. Initial program 81.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in i around inf 59.1%

      \[\leadsto \color{blue}{-4 \cdot \left(i \cdot x\right)} + j \cdot \left(k \cdot -27\right) \]

   if 5.0000000000000002e151 < (*.f64 b c)

   1. Initial program 75.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 73.2%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 78.2%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]
3. Recombined 6 regimes into one program.

4. Final simplification 68.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -2 \cdot 10^{-103}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;b \cdot c \leq -1 \cdot 10^{-159}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 75.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := \left(b \cdot c + t\_1\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{if}\;y \leq -2.4 \cdot 10^{+253}:\\ \;\;\;\;t\_1 + \left(b \cdot c + x \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot 18\right)\right)\right)\\ \mathbf{elif}\;y \leq -2.8 \cdot 10^{+155}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -3.5 \cdot 10^{+98}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \mathbf{elif}\;y \leq 9.8 \cdot 10^{+29}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* -4.0 (* t a)))
        (t_2 (- (+ (* b c) t_1) (+ (* 4.0 (* x i)) (* 27.0 (* j k))))))
   (if (<= y -2.4e+253)
     (+ t_1 (+ (* b c) (* x (* (* y z) (* t 18.0)))))
     (if (<= y -2.8e+155)
       t_2
       (if (<= y -3.5e+98)
         (* x (* y (+ (* -4.0 (/ i y)) (* 18.0 (* t z)))))
         (if (<= y 9.8e+29)
           t_2
           (* z (+ (* -27.0 (/ (* j k) z)) (* 18.0 (* t (* x y)))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -4.0 * (t * a);
	double t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	double tmp;
	if (y <= -2.4e+253) {
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	} else if (y <= -2.8e+155) {
		tmp = t_2;
	} else if (y <= -3.5e+98) {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	} else if (y <= 9.8e+29) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = ((b * c) + t_1) - ((4.0d0 * (x * i)) + (27.0d0 * (j * k)))
    if (y <= (-2.4d+253)) then
        tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0d0))))
    else if (y <= (-2.8d+155)) then
        tmp = t_2
    else if (y <= (-3.5d+98)) then
        tmp = x * (y * (((-4.0d0) * (i / y)) + (18.0d0 * (t * z))))
    else if (y <= 9.8d+29) then
        tmp = t_2
    else
        tmp = z * (((-27.0d0) * ((j * k) / z)) + (18.0d0 * (t * (x * y))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -4.0 * (t * a);
	double t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	double tmp;
	if (y <= -2.4e+253) {
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	} else if (y <= -2.8e+155) {
		tmp = t_2;
	} else if (y <= -3.5e+98) {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	} else if (y <= 9.8e+29) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = -4.0 * (t * a)
	t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)))
	tmp = 0
	if y <= -2.4e+253:
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))))
	elif y <= -2.8e+155:
		tmp = t_2
	elif y <= -3.5e+98:
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))))
	elif y <= 9.8e+29:
		tmp = t_2
	else:
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(-4.0 * Float64(t * a))
	t_2 = Float64(Float64(Float64(b * c) + t_1) - Float64(Float64(4.0 * Float64(x * i)) + Float64(27.0 * Float64(j * k))))
	tmp = 0.0
	if (y <= -2.4e+253)
		tmp = Float64(t_1 + Float64(Float64(b * c) + Float64(x * Float64(Float64(y * z) * Float64(t * 18.0)))));
	elseif (y <= -2.8e+155)
		tmp = t_2;
	elseif (y <= -3.5e+98)
		tmp = Float64(x * Float64(y * Float64(Float64(-4.0 * Float64(i / y)) + Float64(18.0 * Float64(t * z)))));
	elseif (y <= 9.8e+29)
		tmp = t_2;
	else
		tmp = Float64(z * Float64(Float64(-27.0 * Float64(Float64(j * k) / z)) + Float64(18.0 * Float64(t * Float64(x * y)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = -4.0 * (t * a);
	t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	tmp = 0.0;
	if (y <= -2.4e+253)
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	elseif (y <= -2.8e+155)
		tmp = t_2;
	elseif (y <= -3.5e+98)
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	elseif (y <= 9.8e+29)
		tmp = t_2;
	else
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision] - N[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.4e+253], N[(t$95$1 + N[(N[(b * c), $MachinePrecision] + N[(x * N[(N[(y * z), $MachinePrecision] * N[(t * 18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2.8e+155], t$95$2, If[LessEqual[y, -3.5e+98], N[(x * N[(y * N[(N[(-4.0 * N[(i / y), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9.8e+29], t$95$2, N[(z * N[(N[(-27.0 * N[(N[(j * k), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -2.39999999999999991e253

   1. Initial program 93.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 100.0%

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

   6. Taylor expanded in x around 0 94.4%

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

   7. Taylor expanded in t around inf 94.4%

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

      1. associate-*r* 94.4%

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

      2. *-commutative 94.4%

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

   9. Simplified 94.4%

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

   if -2.39999999999999991e253 < y < -2.80000000000000016e155 or -3.5e98 < y < 9.8000000000000003e29

   1. Initial program 85.7%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 89.0%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 83.6%

      \[\leadsto \color{blue}{\left(-4 \cdot \left(a \cdot t\right) + b \cdot c\right) - \left(4 \cdot \left(i \cdot x\right) + 27 \cdot \left(j \cdot k\right)\right)} \]

   if -2.80000000000000016e155 < y < -3.5e98

   1. Initial program 64.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 73.1%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 64.8%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in y around inf 82.2%

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

   if 9.8000000000000003e29 < y

   1. Initial program 83.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 53.0%

      \[\leadsto \color{blue}{18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)} + j \cdot \left(k \cdot -27\right) \]
   6. Step-by-step derivation

      1. associate-*r* 51.7%

         \[\leadsto 18 \cdot \color{blue}{\left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   7. Simplified 51.7%

      \[\leadsto \color{blue}{18 \cdot \left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   8. Taylor expanded in z around inf 57.5%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{+253}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + \left(b \cdot c + x \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot 18\right)\right)\right)\\ \mathbf{elif}\;y \leq -2.8 \cdot 10^{+155}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{elif}\;y \leq -3.5 \cdot 10^{+98}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \mathbf{elif}\;y \leq 9.8 \cdot 10^{+29}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 78.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := \left(b \cdot c + t\_1\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{if}\;y \leq -1.28 \cdot 10^{+253}:\\ \;\;\;\;t\_1 + \left(b \cdot c + x \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot 18\right)\right)\right)\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{+195}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -6 \cdot 10^{+74}:\\ \;\;\;\;t\_1 + \left(b \cdot c + x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\right)\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+30}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* -4.0 (* t a)))
        (t_2 (- (+ (* b c) t_1) (+ (* 4.0 (* x i)) (* 27.0 (* j k))))))
   (if (<= y -1.28e+253)
     (+ t_1 (+ (* b c) (* x (* (* y z) (* t 18.0)))))
     (if (<= y -1.1e+195)
       t_2
       (if (<= y -6e+74)
         (+ t_1 (+ (* b c) (* x (- (* 18.0 (* t (* y z))) (* i 4.0)))))
         (if (<= y 1.55e+30)
           t_2
           (* z (+ (* -27.0 (/ (* j k) z)) (* 18.0 (* t (* x y)))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -4.0 * (t * a);
	double t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	double tmp;
	if (y <= -1.28e+253) {
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	} else if (y <= -1.1e+195) {
		tmp = t_2;
	} else if (y <= -6e+74) {
		tmp = t_1 + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	} else if (y <= 1.55e+30) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = ((b * c) + t_1) - ((4.0d0 * (x * i)) + (27.0d0 * (j * k)))
    if (y <= (-1.28d+253)) then
        tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0d0))))
    else if (y <= (-1.1d+195)) then
        tmp = t_2
    else if (y <= (-6d+74)) then
        tmp = t_1 + ((b * c) + (x * ((18.0d0 * (t * (y * z))) - (i * 4.0d0))))
    else if (y <= 1.55d+30) then
        tmp = t_2
    else
        tmp = z * (((-27.0d0) * ((j * k) / z)) + (18.0d0 * (t * (x * y))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -4.0 * (t * a);
	double t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	double tmp;
	if (y <= -1.28e+253) {
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	} else if (y <= -1.1e+195) {
		tmp = t_2;
	} else if (y <= -6e+74) {
		tmp = t_1 + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	} else if (y <= 1.55e+30) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = -4.0 * (t * a)
	t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)))
	tmp = 0
	if y <= -1.28e+253:
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))))
	elif y <= -1.1e+195:
		tmp = t_2
	elif y <= -6e+74:
		tmp = t_1 + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))))
	elif y <= 1.55e+30:
		tmp = t_2
	else:
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(-4.0 * Float64(t * a))
	t_2 = Float64(Float64(Float64(b * c) + t_1) - Float64(Float64(4.0 * Float64(x * i)) + Float64(27.0 * Float64(j * k))))
	tmp = 0.0
	if (y <= -1.28e+253)
		tmp = Float64(t_1 + Float64(Float64(b * c) + Float64(x * Float64(Float64(y * z) * Float64(t * 18.0)))));
	elseif (y <= -1.1e+195)
		tmp = t_2;
	elseif (y <= -6e+74)
		tmp = Float64(t_1 + Float64(Float64(b * c) + Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(i * 4.0)))));
	elseif (y <= 1.55e+30)
		tmp = t_2;
	else
		tmp = Float64(z * Float64(Float64(-27.0 * Float64(Float64(j * k) / z)) + Float64(18.0 * Float64(t * Float64(x * y)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = -4.0 * (t * a);
	t_2 = ((b * c) + t_1) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	tmp = 0.0;
	if (y <= -1.28e+253)
		tmp = t_1 + ((b * c) + (x * ((y * z) * (t * 18.0))));
	elseif (y <= -1.1e+195)
		tmp = t_2;
	elseif (y <= -6e+74)
		tmp = t_1 + ((b * c) + (x * ((18.0 * (t * (y * z))) - (i * 4.0))));
	elseif (y <= 1.55e+30)
		tmp = t_2;
	else
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision] - N[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.28e+253], N[(t$95$1 + N[(N[(b * c), $MachinePrecision] + N[(x * N[(N[(y * z), $MachinePrecision] * N[(t * 18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.1e+195], t$95$2, If[LessEqual[y, -6e+74], N[(t$95$1 + N[(N[(b * c), $MachinePrecision] + N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.55e+30], t$95$2, N[(z * N[(N[(-27.0 * N[(N[(j * k), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -1.2800000000000001e253

   1. Initial program 93.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 100.0%

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

   6. Taylor expanded in x around 0 94.4%

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

   7. Taylor expanded in t around inf 94.4%

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

      1. associate-*r* 94.4%

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

      2. *-commutative 94.4%

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

   9. Simplified 94.4%

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

   if -1.2800000000000001e253 < y < -1.1e195 or -6e74 < y < 1.5499999999999999e30

   1. Initial program 87.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.4%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 85.1%

      \[\leadsto \color{blue}{\left(-4 \cdot \left(a \cdot t\right) + b \cdot c\right) - \left(4 \cdot \left(i \cdot x\right) + 27 \cdot \left(j \cdot k\right)\right)} \]

   if -1.1e195 < y < -6e74

   1. Initial program 64.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 72.2%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 64.5%

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

   6. Taylor expanded in x around 0 66.3%

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

   if 1.5499999999999999e30 < y

   1. Initial program 83.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 53.0%

      \[\leadsto \color{blue}{18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)} + j \cdot \left(k \cdot -27\right) \]
   6. Step-by-step derivation

      1. associate-*r* 51.7%

         \[\leadsto 18 \cdot \color{blue}{\left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   7. Simplified 51.7%

      \[\leadsto \color{blue}{18 \cdot \left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   8. Taylor expanded in z around inf 57.5%

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

4. Final simplification 78.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.28 \cdot 10^{+253}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + \left(b \cdot c + x \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot 18\right)\right)\right)\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{+195}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{elif}\;y \leq -6 \cdot 10^{+74}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + \left(b \cdot c + x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\right)\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+30}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 79.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := 4 \cdot \left(x \cdot i\right)\\ t_2 := \left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(t\_1 + 27 \cdot \left(j \cdot k\right)\right)\\ t_3 := \left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - t\_1\\ \mathbf{if}\;y \leq -9.8 \cdot 10^{+250}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;y \leq -1.42 \cdot 10^{+206}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -2.5 \cdot 10^{+74}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+30}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 4.0 (* x i)))
        (t_2 (- (+ (* b c) (* -4.0 (* t a))) (+ t_1 (* 27.0 (* j k)))))
        (t_3 (- (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))) t_1)))
   (if (<= y -9.8e+250)
     t_3
     (if (<= y -1.42e+206)
       t_2
       (if (<= y -2.5e+74)
         t_3
         (if (<= y 1.55e+30)
           t_2
           (* z (+ (* -27.0 (/ (* j k) z)) (* 18.0 (* t (* x y)))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double t_2 = ((b * c) + (-4.0 * (t * a))) - (t_1 + (27.0 * (j * k)));
	double t_3 = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - t_1;
	double tmp;
	if (y <= -9.8e+250) {
		tmp = t_3;
	} else if (y <= -1.42e+206) {
		tmp = t_2;
	} else if (y <= -2.5e+74) {
		tmp = t_3;
	} else if (y <= 1.55e+30) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = 4.0d0 * (x * i)
    t_2 = ((b * c) + ((-4.0d0) * (t * a))) - (t_1 + (27.0d0 * (j * k)))
    t_3 = ((b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))) - t_1
    if (y <= (-9.8d+250)) then
        tmp = t_3
    else if (y <= (-1.42d+206)) then
        tmp = t_2
    else if (y <= (-2.5d+74)) then
        tmp = t_3
    else if (y <= 1.55d+30) then
        tmp = t_2
    else
        tmp = z * (((-27.0d0) * ((j * k) / z)) + (18.0d0 * (t * (x * y))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double t_2 = ((b * c) + (-4.0 * (t * a))) - (t_1 + (27.0 * (j * k)));
	double t_3 = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - t_1;
	double tmp;
	if (y <= -9.8e+250) {
		tmp = t_3;
	} else if (y <= -1.42e+206) {
		tmp = t_2;
	} else if (y <= -2.5e+74) {
		tmp = t_3;
	} else if (y <= 1.55e+30) {
		tmp = t_2;
	} else {
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 4.0 * (x * i)
	t_2 = ((b * c) + (-4.0 * (t * a))) - (t_1 + (27.0 * (j * k)))
	t_3 = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - t_1
	tmp = 0
	if y <= -9.8e+250:
		tmp = t_3
	elif y <= -1.42e+206:
		tmp = t_2
	elif y <= -2.5e+74:
		tmp = t_3
	elif y <= 1.55e+30:
		tmp = t_2
	else:
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(4.0 * Float64(x * i))
	t_2 = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(t_1 + Float64(27.0 * Float64(j * k))))
	t_3 = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))) - t_1)
	tmp = 0.0
	if (y <= -9.8e+250)
		tmp = t_3;
	elseif (y <= -1.42e+206)
		tmp = t_2;
	elseif (y <= -2.5e+74)
		tmp = t_3;
	elseif (y <= 1.55e+30)
		tmp = t_2;
	else
		tmp = Float64(z * Float64(Float64(-27.0 * Float64(Float64(j * k) / z)) + Float64(18.0 * Float64(t * Float64(x * y)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 4.0 * (x * i);
	t_2 = ((b * c) + (-4.0 * (t * a))) - (t_1 + (27.0 * (j * k)));
	t_3 = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - t_1;
	tmp = 0.0;
	if (y <= -9.8e+250)
		tmp = t_3;
	elseif (y <= -1.42e+206)
		tmp = t_2;
	elseif (y <= -2.5e+74)
		tmp = t_3;
	elseif (y <= 1.55e+30)
		tmp = t_2;
	else
		tmp = z * ((-27.0 * ((j * k) / z)) + (18.0 * (t * (x * y))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t$95$1 + N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[y, -9.8e+250], t$95$3, If[LessEqual[y, -1.42e+206], t$95$2, If[LessEqual[y, -2.5e+74], t$95$3, If[LessEqual[y, 1.55e+30], t$95$2, N[(z * N[(N[(-27.0 * N[(N[(j * k), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -9.79999999999999986e250 or -1.42000000000000005e206 < y < -2.49999999999999982e74

   1. Initial program 74.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 83.9%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 79.4%

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

   if -9.79999999999999986e250 < y < -1.42000000000000005e206 or -2.49999999999999982e74 < y < 1.5499999999999999e30

   1. Initial program 87.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.3%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 85.0%

      \[\leadsto \color{blue}{\left(-4 \cdot \left(a \cdot t\right) + b \cdot c\right) - \left(4 \cdot \left(i \cdot x\right) + 27 \cdot \left(j \cdot k\right)\right)} \]

   if 1.5499999999999999e30 < y

   1. Initial program 83.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 53.0%

      \[\leadsto \color{blue}{18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)} + j \cdot \left(k \cdot -27\right) \]
   6. Step-by-step derivation

      1. associate-*r* 51.7%

         \[\leadsto 18 \cdot \color{blue}{\left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   7. Simplified 51.7%

      \[\leadsto \color{blue}{18 \cdot \left(\left(t \cdot x\right) \cdot \left(y \cdot z\right)\right)} + j \cdot \left(k \cdot -27\right) \]

   8. Taylor expanded in z around inf 57.5%

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

4. Final simplification 78.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.8 \cdot 10^{+250}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;y \leq -1.42 \cdot 10^{+206}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{elif}\;y \leq -2.5 \cdot 10^{+74}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+30}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-27 \cdot \frac{j \cdot k}{z} + 18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 88.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -1.8 \cdot 10^{-83} \lor \neg \left(t \leq 1.15 \cdot 10^{-228}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \left(t \cdot z\right) - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - i \cdot \left(x \cdot 4\right)\right) - k \cdot \left(j \cdot 27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= t -1.8e-83) (not (<= t 1.15e-228)))
   (-
    (+ (* b c) (* t (- (* x (* z (* 18.0 y))) (* a 4.0))))
    (+ (* x (* i 4.0)) (* j (* k 27.0))))
   (-
    (-
     (+ (- (* (* 18.0 (* x y)) (* t z)) (* t (* a 4.0))) (* b c))
     (* i (* x 4.0)))
    (* k (* j 27.0)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -1.8e-83) || !(t <= 1.15e-228)) {
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = (((((18.0 * (x * y)) * (t * z)) - (t * (a * 4.0))) + (b * c)) - (i * (x * 4.0))) - (k * (j * 27.0));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if ((t <= (-1.8d-83)) .or. (.not. (t <= 1.15d-228))) then
        tmp = ((b * c) + (t * ((x * (z * (18.0d0 * y))) - (a * 4.0d0)))) - ((x * (i * 4.0d0)) + (j * (k * 27.0d0)))
    else
        tmp = (((((18.0d0 * (x * y)) * (t * z)) - (t * (a * 4.0d0))) + (b * c)) - (i * (x * 4.0d0))) - (k * (j * 27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -1.8e-83) || !(t <= 1.15e-228)) {
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = (((((18.0 * (x * y)) * (t * z)) - (t * (a * 4.0))) + (b * c)) - (i * (x * 4.0))) - (k * (j * 27.0));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if (t <= -1.8e-83) or not (t <= 1.15e-228):
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)))
	else:
		tmp = (((((18.0 * (x * y)) * (t * z)) - (t * (a * 4.0))) + (b * c)) - (i * (x * 4.0))) - (k * (j * 27.0))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -1.8e-83) || !(t <= 1.15e-228))
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(x * Float64(z * Float64(18.0 * y))) - Float64(a * 4.0)))) - Float64(Float64(x * Float64(i * 4.0)) + Float64(j * Float64(k * 27.0))));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(Float64(18.0 * Float64(x * y)) * Float64(t * z)) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(i * Float64(x * 4.0))) - Float64(k * Float64(j * 27.0)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if ((t <= -1.8e-83) || ~((t <= 1.15e-228)))
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	else
		tmp = (((((18.0 * (x * y)) * (t * z)) - (t * (a * 4.0))) + (b * c)) - (i * (x * 4.0))) - (k * (j * 27.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[t, -1.8e-83], N[Not[LessEqual[t, 1.15e-228]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(x * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(i * 4.0), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(18.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(t * z), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(i * N[(x * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.80000000000000006e-83 or 1.1499999999999999e-228 < t

   1. Initial program 86.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 91.2%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 91.2%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 91.2%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 91.2%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 91.2%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 91.2%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 91.2%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 91.2%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   if -1.80000000000000006e-83 < t < 1.1499999999999999e-228

   1. Initial program 79.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. pow1 79.6%

         \[\leadsto \left(\left(\left(\color{blue}{{\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t\right)}^{1}} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      2. associate-*l* 87.6%

         \[\leadsto \left(\left(\left({\color{blue}{\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot \left(z \cdot t\right)\right)}}^{1} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      3. *-commutative 87.6%

         \[\leadsto \left(\left(\left({\left(\color{blue}{\left(y \cdot \left(x \cdot 18\right)\right)} \cdot \left(z \cdot t\right)\right)}^{1} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   4. Applied egg-rr 87.6%

      \[\leadsto \left(\left(\left(\color{blue}{{\left(\left(y \cdot \left(x \cdot 18\right)\right) \cdot \left(z \cdot t\right)\right)}^{1}} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]
   5. Step-by-step derivation

      1. unpow1 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(y \cdot \left(x \cdot 18\right)\right) \cdot \left(z \cdot t\right)} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      2. associate-*r* 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(\left(y \cdot x\right) \cdot 18\right)} \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      3. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\left(\color{blue}{\left(x \cdot y\right)} \cdot 18\right) \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      4. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\color{blue}{\left(18 \cdot \left(x \cdot y\right)\right)} \cdot \left(z \cdot t\right) - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

      5. *-commutative 87.6%

         \[\leadsto \left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \color{blue}{\left(t \cdot z\right)} - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   6. Simplified 87.6%

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

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.8 \cdot 10^{-83} \lor \neg \left(t \leq 1.15 \cdot 10^{-228}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\left(\left(18 \cdot \left(x \cdot y\right)\right) \cdot \left(t \cdot z\right) - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - i \cdot \left(x \cdot 4\right)\right) - k \cdot \left(j \cdot 27\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 35.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := a \cdot \left(t \cdot -4\right)\\ \mathbf{if}\;b \cdot c \leq -9.2 \cdot 10^{+45}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.2 \cdot 10^{-250}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 6.2 \cdot 10^{+23}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 1.22 \cdot 10^{+155}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \cdot c \leq 2.5 \cdot 10^{+217}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* a (* t -4.0))))
   (if (<= (* b c) -9.2e+45)
     (* b c)
     (if (<= (* b c) -1.2e-250)
       t_1
       (if (<= (* b c) 6.2e+23)
         (* j (* k -27.0))
         (if (<= (* b c) 1.22e+155)
           t_1
           (if (<= (* b c) 2.5e+217) (* -27.0 (* j k)) (* b c))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double tmp;
	if ((b * c) <= -9.2e+45) {
		tmp = b * c;
	} else if ((b * c) <= -1.2e-250) {
		tmp = t_1;
	} else if ((b * c) <= 6.2e+23) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 1.22e+155) {
		tmp = t_1;
	} else if ((b * c) <= 2.5e+217) {
		tmp = -27.0 * (j * k);
	} else {
		tmp = b * c;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a * (t * (-4.0d0))
    if ((b * c) <= (-9.2d+45)) then
        tmp = b * c
    else if ((b * c) <= (-1.2d-250)) then
        tmp = t_1
    else if ((b * c) <= 6.2d+23) then
        tmp = j * (k * (-27.0d0))
    else if ((b * c) <= 1.22d+155) then
        tmp = t_1
    else if ((b * c) <= 2.5d+217) then
        tmp = (-27.0d0) * (j * k)
    else
        tmp = b * c
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = a * (t * -4.0);
	double tmp;
	if ((b * c) <= -9.2e+45) {
		tmp = b * c;
	} else if ((b * c) <= -1.2e-250) {
		tmp = t_1;
	} else if ((b * c) <= 6.2e+23) {
		tmp = j * (k * -27.0);
	} else if ((b * c) <= 1.22e+155) {
		tmp = t_1;
	} else if ((b * c) <= 2.5e+217) {
		tmp = -27.0 * (j * k);
	} else {
		tmp = b * c;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = a * (t * -4.0)
	tmp = 0
	if (b * c) <= -9.2e+45:
		tmp = b * c
	elif (b * c) <= -1.2e-250:
		tmp = t_1
	elif (b * c) <= 6.2e+23:
		tmp = j * (k * -27.0)
	elif (b * c) <= 1.22e+155:
		tmp = t_1
	elif (b * c) <= 2.5e+217:
		tmp = -27.0 * (j * k)
	else:
		tmp = b * c
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(a * Float64(t * -4.0))
	tmp = 0.0
	if (Float64(b * c) <= -9.2e+45)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -1.2e-250)
		tmp = t_1;
	elseif (Float64(b * c) <= 6.2e+23)
		tmp = Float64(j * Float64(k * -27.0));
	elseif (Float64(b * c) <= 1.22e+155)
		tmp = t_1;
	elseif (Float64(b * c) <= 2.5e+217)
		tmp = Float64(-27.0 * Float64(j * k));
	else
		tmp = Float64(b * c);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = a * (t * -4.0);
	tmp = 0.0;
	if ((b * c) <= -9.2e+45)
		tmp = b * c;
	elseif ((b * c) <= -1.2e-250)
		tmp = t_1;
	elseif ((b * c) <= 6.2e+23)
		tmp = j * (k * -27.0);
	elseif ((b * c) <= 1.22e+155)
		tmp = t_1;
	elseif ((b * c) <= 2.5e+217)
		tmp = -27.0 * (j * k);
	else
		tmp = b * c;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -9.2e+45], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.2e-250], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 6.2e+23], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.22e+155], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.5e+217], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 b c) < -9.20000000000000049e45 or 2.50000000000000021e217 < (*.f64 b c)

   1. Initial program 81.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 81.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 81.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 81.5%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 80.3%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 80.3%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 80.3%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 80.3%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   9. Taylor expanded in b around inf 62.2%

      \[\leadsto \color{blue}{b \cdot c} \]

   if -9.20000000000000049e45 < (*.f64 b c) < -1.1999999999999999e-250 or 6.19999999999999941e23 < (*.f64 b c) < 1.21999999999999996e155

   1. Initial program 95.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 86.4%

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

   6. Taylor expanded in x around 0 86.2%

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

   7. Taylor expanded in a around inf 40.6%

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

      1. *-commutative 40.6%

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

      2. associate-*r* 40.6%

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

   9. Simplified 40.6%

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

   if -1.1999999999999999e-250 < (*.f64 b c) < 6.19999999999999941e23

   1. Initial program 81.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 36.2%

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

      1. *-commutative 36.2%

         \[\leadsto \color{blue}{\left(j \cdot k\right) \cdot -27} \]

      2. associate-*r* 36.2%

         \[\leadsto \color{blue}{j \cdot \left(k \cdot -27\right)} \]

      3. *-commutative 36.2%

         \[\leadsto j \cdot \color{blue}{\left(-27 \cdot k\right)} \]

   7. Simplified 36.2%

      \[\leadsto \color{blue}{j \cdot \left(-27 \cdot k\right)} \]

   if 1.21999999999999996e155 < (*.f64 b c) < 2.50000000000000021e217

   1. Initial program 76.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 76.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 39.9%

      \[\leadsto \color{blue}{-27 \cdot \left(j \cdot k\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 45.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -9.2 \cdot 10^{+45}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -1.2 \cdot 10^{-250}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 6.2 \cdot 10^{+23}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq 1.22 \cdot 10^{+155}:\\ \;\;\;\;a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 2.5 \cdot 10^{+217}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 54.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;t\_1 + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;t\_1 + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))) (t_2 (+ (* x (* -4.0 i)) (* -4.0 (* t a)))))
   (if (<= (* b c) -1e+47)
     (+ t_1 (* b c))
     (if (<= (* b c) -5e-219)
       t_2
       (if (<= (* b c) 5e+20)
         (+ t_1 (* -4.0 (* x i)))
         (if (<= (* b c) 5e+151) t_2 (* c (+ b (* -27.0 (/ (* j k) c))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -5e-219) {
		tmp = t_2;
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = t_2;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (x * ((-4.0d0) * i)) + ((-4.0d0) * (t * a))
    if ((b * c) <= (-1d+47)) then
        tmp = t_1 + (b * c)
    else if ((b * c) <= (-5d-219)) then
        tmp = t_2
    else if ((b * c) <= 5d+20) then
        tmp = t_1 + ((-4.0d0) * (x * i))
    else if ((b * c) <= 5d+151) then
        tmp = t_2
    else
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -5e-219) {
		tmp = t_2;
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = t_2;
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a))
	tmp = 0
	if (b * c) <= -1e+47:
		tmp = t_1 + (b * c)
	elif (b * c) <= -5e-219:
		tmp = t_2
	elif (b * c) <= 5e+20:
		tmp = t_1 + (-4.0 * (x * i))
	elif (b * c) <= 5e+151:
		tmp = t_2
	else:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(x * Float64(-4.0 * i)) + Float64(-4.0 * Float64(t * a)))
	tmp = 0.0
	if (Float64(b * c) <= -1e+47)
		tmp = Float64(t_1 + Float64(b * c));
	elseif (Float64(b * c) <= -5e-219)
		tmp = t_2;
	elseif (Float64(b * c) <= 5e+20)
		tmp = Float64(t_1 + Float64(-4.0 * Float64(x * i)));
	elseif (Float64(b * c) <= 5e+151)
		tmp = t_2;
	else
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (x * (-4.0 * i)) + (-4.0 * (t * a));
	tmp = 0.0;
	if ((b * c) <= -1e+47)
		tmp = t_1 + (b * c);
	elseif ((b * c) <= -5e-219)
		tmp = t_2;
	elseif ((b * c) <= 5e+20)
		tmp = t_1 + (-4.0 * (x * i));
	elseif ((b * c) <= 5e+151)
		tmp = t_2;
	else
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(-4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1e+47], N[(t$95$1 + N[(b * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -5e-219], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], 5e+20], N[(t$95$1 + N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+151], t$95$2, N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 b c) < -1e47

   1. Initial program 85.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 68.6%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -1e47 < (*.f64 b c) < -5.0000000000000002e-219 or 5e20 < (*.f64 b c) < 5.0000000000000002e151

   1. Initial program 95.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 92.4%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 86.2%

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

   6. Taylor expanded in x around 0 85.9%

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

   7. Taylor expanded in x around inf 84.4%

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

   8. Taylor expanded in i around inf 63.9%

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

      1. *-commutative 63.9%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + -4 \cdot \color{blue}{\left(x \cdot i\right)} \]

      2. *-commutative 63.9%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{\left(x \cdot i\right) \cdot -4} \]

      3. associate-*r* 63.9%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   10. Simplified 63.9%

       \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   if -5.0000000000000002e-219 < (*.f64 b c) < 5e20

   1. Initial program 81.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in i around inf 59.1%

      \[\leadsto \color{blue}{-4 \cdot \left(i \cdot x\right)} + j \cdot \left(k \cdot -27\right) \]

   if 5.0000000000000002e151 < (*.f64 b c)

   1. Initial program 75.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 73.2%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 78.2%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 53.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;t\_1 + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;t\_1 + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))))
   (if (<= (* b c) -1e+47)
     (+ t_1 (* b c))
     (if (<= (* b c) -5e-219)
       (* t (+ (* 18.0 (* x (* y z))) (* a -4.0)))
       (if (<= (* b c) 5e+20)
         (+ t_1 (* -4.0 (* x i)))
         (if (<= (* b c) 5e+151)
           (+ (* x (* -4.0 i)) (* -4.0 (* t a)))
           (* c (+ b (* -27.0 (/ (* j k) c))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -5e-219) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = (x * (-4.0 * i)) + (-4.0 * (t * a));
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    if ((b * c) <= (-1d+47)) then
        tmp = t_1 + (b * c)
    else if ((b * c) <= (-5d-219)) then
        tmp = t * ((18.0d0 * (x * (y * z))) + (a * (-4.0d0)))
    else if ((b * c) <= 5d+20) then
        tmp = t_1 + ((-4.0d0) * (x * i))
    else if ((b * c) <= 5d+151) then
        tmp = (x * ((-4.0d0) * i)) + ((-4.0d0) * (t * a))
    else
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double tmp;
	if ((b * c) <= -1e+47) {
		tmp = t_1 + (b * c);
	} else if ((b * c) <= -5e-219) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else if ((b * c) <= 5e+20) {
		tmp = t_1 + (-4.0 * (x * i));
	} else if ((b * c) <= 5e+151) {
		tmp = (x * (-4.0 * i)) + (-4.0 * (t * a));
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	tmp = 0
	if (b * c) <= -1e+47:
		tmp = t_1 + (b * c)
	elif (b * c) <= -5e-219:
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0))
	elif (b * c) <= 5e+20:
		tmp = t_1 + (-4.0 * (x * i))
	elif (b * c) <= 5e+151:
		tmp = (x * (-4.0 * i)) + (-4.0 * (t * a))
	else:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (Float64(b * c) <= -1e+47)
		tmp = Float64(t_1 + Float64(b * c));
	elseif (Float64(b * c) <= -5e-219)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) + Float64(a * -4.0)));
	elseif (Float64(b * c) <= 5e+20)
		tmp = Float64(t_1 + Float64(-4.0 * Float64(x * i)));
	elseif (Float64(b * c) <= 5e+151)
		tmp = Float64(Float64(x * Float64(-4.0 * i)) + Float64(-4.0 * Float64(t * a)));
	else
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	tmp = 0.0;
	if ((b * c) <= -1e+47)
		tmp = t_1 + (b * c);
	elseif ((b * c) <= -5e-219)
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	elseif ((b * c) <= 5e+20)
		tmp = t_1 + (-4.0 * (x * i));
	elseif ((b * c) <= 5e+151)
		tmp = (x * (-4.0 * i)) + (-4.0 * (t * a));
	else
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1e+47], N[(t$95$1 + N[(b * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -5e-219], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+20], N[(t$95$1 + N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+151], N[(N[(x * N[(-4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 b c) < -1e47

   1. Initial program 85.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 68.6%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -1e47 < (*.f64 b c) < -5.0000000000000002e-219

   1. Initial program 94.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 91.9%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 83.8%

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

   6. Taylor expanded in x around 0 85.6%

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

   7. Taylor expanded in t around inf 65.4%

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

   if -5.0000000000000002e-219 < (*.f64 b c) < 5e20

   1. Initial program 81.6%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 88.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in i around inf 59.1%

      \[\leadsto \color{blue}{-4 \cdot \left(i \cdot x\right)} + j \cdot \left(k \cdot -27\right) \]

   if 5e20 < (*.f64 b c) < 5.0000000000000002e151

   1. Initial program 99.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 93.9%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 92.9%

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

   6. Taylor expanded in x around 0 86.9%

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

   7. Taylor expanded in x around inf 81.1%

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

   8. Taylor expanded in i around inf 71.4%

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

      1. *-commutative 71.4%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + -4 \cdot \color{blue}{\left(x \cdot i\right)} \]

      2. *-commutative 71.4%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{\left(x \cdot i\right) \cdot -4} \]

      3. associate-*r* 71.4%

         \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   10. Simplified 71.4%

       \[\leadsto -4 \cdot \left(a \cdot t\right) + \color{blue}{x \cdot \left(i \cdot -4\right)} \]

   if 5.0000000000000002e151 < (*.f64 b c)

   1. Initial program 75.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 73.2%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 78.2%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]
3. Recombined 5 regimes into one program.

4. Final simplification 66.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -1 \cdot 10^{+47}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -5 \cdot 10^{-219}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+20}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + -4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+151}:\\ \;\;\;\;x \cdot \left(-4 \cdot i\right) + -4 \cdot \left(t \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 87.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -3.5 \cdot 10^{-118} \lor \neg \left(t \leq 4.8 \cdot 10^{-235}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= t -3.5e-118) (not (<= t 4.8e-235)))
   (-
    (+ (* b c) (* t (- (* x (* z (* 18.0 y))) (* a 4.0))))
    (+ (* x (* i 4.0)) (* j (* k 27.0))))
   (- (+ (* b c) (* -4.0 (* t a))) (+ (* 4.0 (* x i)) (* 27.0 (* j k))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -3.5e-118) || !(t <= 4.8e-235)) {
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if ((t <= (-3.5d-118)) .or. (.not. (t <= 4.8d-235))) then
        tmp = ((b * c) + (t * ((x * (z * (18.0d0 * y))) - (a * 4.0d0)))) - ((x * (i * 4.0d0)) + (j * (k * 27.0d0)))
    else
        tmp = ((b * c) + ((-4.0d0) * (t * a))) - ((4.0d0 * (x * i)) + (27.0d0 * (j * k)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -3.5e-118) || !(t <= 4.8e-235)) {
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if (t <= -3.5e-118) or not (t <= 4.8e-235):
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)))
	else:
		tmp = ((b * c) + (-4.0 * (t * a))) - ((4.0 * (x * i)) + (27.0 * (j * k)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -3.5e-118) || !(t <= 4.8e-235))
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(x * Float64(z * Float64(18.0 * y))) - Float64(a * 4.0)))) - Float64(Float64(x * Float64(i * 4.0)) + Float64(j * Float64(k * 27.0))));
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(Float64(4.0 * Float64(x * i)) + Float64(27.0 * Float64(j * k))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if ((t <= -3.5e-118) || ~((t <= 4.8e-235)))
		tmp = ((b * c) + (t * ((x * (z * (18.0 * y))) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	else
		tmp = ((b * c) + (-4.0 * (t * a))) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[t, -3.5e-118], N[Not[LessEqual[t, 4.8e-235]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(x * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(i * 4.0), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.5e-118 or 4.80000000000000022e-235 < t

   1. Initial program 87.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 91.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 91.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 91.5%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 91.5%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 91.5%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 91.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 91.5%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 91.5%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   if -3.5e-118 < t < 4.80000000000000022e-235

   1. Initial program 77.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 72.8%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 86.4%

      \[\leadsto \color{blue}{\left(-4 \cdot \left(a \cdot t\right) + b \cdot c\right) - \left(4 \cdot \left(i \cdot x\right) + 27 \cdot \left(j \cdot k\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.5 \cdot 10^{-118} \lor \neg \left(t \leq 4.8 \cdot 10^{-235}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 78.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq 8000:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot 18\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= b 8000.0)
   (-
    (+ (* b c) (* t (- (* (* y z) (* x 18.0)) (* a 4.0))))
    (+ (* x (* i 4.0)) (* j (* k 27.0))))
   (* c (+ b (* -27.0 (/ (* j k) c))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (b <= 8000.0) {
		tmp = ((b * c) + (t * (((y * z) * (x * 18.0)) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (b <= 8000.0d0) then
        tmp = ((b * c) + (t * (((y * z) * (x * 18.0d0)) - (a * 4.0d0)))) - ((x * (i * 4.0d0)) + (j * (k * 27.0d0)))
    else
        tmp = c * (b + ((-27.0d0) * ((j * k) / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (b <= 8000.0) {
		tmp = ((b * c) + (t * (((y * z) * (x * 18.0)) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	} else {
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if b <= 8000.0:
		tmp = ((b * c) + (t * (((y * z) * (x * 18.0)) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)))
	else:
		tmp = c * (b + (-27.0 * ((j * k) / c)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (b <= 8000.0)
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(y * z) * Float64(x * 18.0)) - Float64(a * 4.0)))) - Float64(Float64(x * Float64(i * 4.0)) + Float64(j * Float64(k * 27.0))));
	else
		tmp = Float64(c * Float64(b + Float64(-27.0 * Float64(Float64(j * k) / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (b <= 8000.0)
		tmp = ((b * c) + (t * (((y * z) * (x * 18.0)) - (a * 4.0)))) - ((x * (i * 4.0)) + (j * (k * 27.0)));
	else
		tmp = c * (b + (-27.0 * ((j * k) / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[b, 8000.0], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(y * z), $MachinePrecision] * N[(x * 18.0), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(i * 4.0), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c * N[(b + N[(-27.0 * N[(N[(j * k), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 8e3

   1. Initial program 85.2%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 87.6%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   if 8e3 < b

   1. Initial program 83.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 64.6%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   6. Taylor expanded in c around inf 69.8%

      \[\leadsto \color{blue}{c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 8000:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot 18\right) - a \cdot 4\right)\right) - \left(x \cdot \left(i \cdot 4\right) + j \cdot \left(k \cdot 27\right)\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(b + -27 \cdot \frac{j \cdot k}{c}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 17: 37.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;b \cdot c \leq -9 \cdot 10^{+97} \lor \neg \left(b \cdot c \leq 2.35 \cdot 10^{+82} \lor \neg \left(b \cdot c \leq 9.6 \cdot 10^{+163}\right) \land b \cdot c \leq 2.5 \cdot 10^{+217}\right):\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= (* b c) -9e+97)
         (not
          (or (<= (* b c) 2.35e+82)
              (and (not (<= (* b c) 9.6e+163)) (<= (* b c) 2.5e+217)))))
   (* b c)
   (* -27.0 (* j k))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (((b * c) <= -9e+97) || !(((b * c) <= 2.35e+82) || (!((b * c) <= 9.6e+163) && ((b * c) <= 2.5e+217)))) {
		tmp = b * c;
	} else {
		tmp = -27.0 * (j * k);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (((b * c) <= (-9d+97)) .or. (.not. ((b * c) <= 2.35d+82) .or. (.not. ((b * c) <= 9.6d+163)) .and. ((b * c) <= 2.5d+217))) then
        tmp = b * c
    else
        tmp = (-27.0d0) * (j * k)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (((b * c) <= -9e+97) || !(((b * c) <= 2.35e+82) || (!((b * c) <= 9.6e+163) && ((b * c) <= 2.5e+217)))) {
		tmp = b * c;
	} else {
		tmp = -27.0 * (j * k);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if ((b * c) <= -9e+97) or not (((b * c) <= 2.35e+82) or (not ((b * c) <= 9.6e+163) and ((b * c) <= 2.5e+217))):
		tmp = b * c
	else:
		tmp = -27.0 * (j * k)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((Float64(b * c) <= -9e+97) || !((Float64(b * c) <= 2.35e+82) || (!(Float64(b * c) <= 9.6e+163) && (Float64(b * c) <= 2.5e+217))))
		tmp = Float64(b * c);
	else
		tmp = Float64(-27.0 * Float64(j * k));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (((b * c) <= -9e+97) || ~((((b * c) <= 2.35e+82) || (~(((b * c) <= 9.6e+163)) && ((b * c) <= 2.5e+217)))))
		tmp = b * c;
	else
		tmp = -27.0 * (j * k);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[N[(b * c), $MachinePrecision], -9e+97], N[Not[Or[LessEqual[N[(b * c), $MachinePrecision], 2.35e+82], And[N[Not[LessEqual[N[(b * c), $MachinePrecision], 9.6e+163]], $MachinePrecision], LessEqual[N[(b * c), $MachinePrecision], 2.5e+217]]]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b c) < -8.99999999999999952e97 or 2.35e82 < (*.f64 b c) < 9.5999999999999994e163 or 2.50000000000000021e217 < (*.f64 b c)

   1. Initial program 82.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.5%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1 82.5%

         \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. associate-*l* 82.5%

         \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      3. associate-*r* 81.4%

         \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   6. Applied egg-rr 81.4%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
   7. Step-by-step derivation

      1. unpow1 81.4%

         \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

      2. *-commutative 81.4%

         \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   8. Simplified 81.4%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   9. Taylor expanded in b around inf 61.9%

      \[\leadsto \color{blue}{b \cdot c} \]

   if -8.99999999999999952e97 < (*.f64 b c) < 2.35e82 or 9.5999999999999994e163 < (*.f64 b c) < 2.50000000000000021e217

   1. Initial program 86.0%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 89.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around inf 30.1%

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

4. Final simplification 40.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot c \leq -9 \cdot 10^{+97} \lor \neg \left(b \cdot c \leq 2.35 \cdot 10^{+82} \lor \neg \left(b \cdot c \leq 9.6 \cdot 10^{+163}\right) \land b \cdot c \leq 2.5 \cdot 10^{+217}\right):\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 46.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right) + b \cdot c\\ t_2 := t \cdot \left(18 \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{if}\;y \leq -8.6 \cdot 10^{+248}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq -1.95 \cdot 10^{+187}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -5.4 \cdot 10^{+93}:\\ \;\;\;\;18 \cdot \left(x \cdot \left(z \cdot \left(t \cdot y\right)\right)\right)\\ \mathbf{elif}\;y \leq 8.2 \cdot 10^{+38}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* j (* k -27.0)) (* b c))) (t_2 (* t (* 18.0 (* z (* x y))))))
   (if (<= y -8.6e+248)
     t_2
     (if (<= y -1.95e+187)
       t_1
       (if (<= y -5.4e+93)
         (* 18.0 (* x (* z (* t y))))
         (if (<= y 8.2e+38) t_1 t_2))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (j * (k * -27.0)) + (b * c);
	double t_2 = t * (18.0 * (z * (x * y)));
	double tmp;
	if (y <= -8.6e+248) {
		tmp = t_2;
	} else if (y <= -1.95e+187) {
		tmp = t_1;
	} else if (y <= -5.4e+93) {
		tmp = 18.0 * (x * (z * (t * y)));
	} else if (y <= 8.2e+38) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (j * (k * (-27.0d0))) + (b * c)
    t_2 = t * (18.0d0 * (z * (x * y)))
    if (y <= (-8.6d+248)) then
        tmp = t_2
    else if (y <= (-1.95d+187)) then
        tmp = t_1
    else if (y <= (-5.4d+93)) then
        tmp = 18.0d0 * (x * (z * (t * y)))
    else if (y <= 8.2d+38) 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 && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (j * (k * -27.0)) + (b * c);
	double t_2 = t * (18.0 * (z * (x * y)));
	double tmp;
	if (y <= -8.6e+248) {
		tmp = t_2;
	} else if (y <= -1.95e+187) {
		tmp = t_1;
	} else if (y <= -5.4e+93) {
		tmp = 18.0 * (x * (z * (t * y)));
	} else if (y <= 8.2e+38) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (j * (k * -27.0)) + (b * c)
	t_2 = t * (18.0 * (z * (x * y)))
	tmp = 0
	if y <= -8.6e+248:
		tmp = t_2
	elif y <= -1.95e+187:
		tmp = t_1
	elif y <= -5.4e+93:
		tmp = 18.0 * (x * (z * (t * y)))
	elif y <= 8.2e+38:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(j * Float64(k * -27.0)) + Float64(b * c))
	t_2 = Float64(t * Float64(18.0 * Float64(z * Float64(x * y))))
	tmp = 0.0
	if (y <= -8.6e+248)
		tmp = t_2;
	elseif (y <= -1.95e+187)
		tmp = t_1;
	elseif (y <= -5.4e+93)
		tmp = Float64(18.0 * Float64(x * Float64(z * Float64(t * y))));
	elseif (y <= 8.2e+38)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (j * (k * -27.0)) + (b * c);
	t_2 = t * (18.0 * (z * (x * y)));
	tmp = 0.0;
	if (y <= -8.6e+248)
		tmp = t_2;
	elseif (y <= -1.95e+187)
		tmp = t_1;
	elseif (y <= -5.4e+93)
		tmp = 18.0 * (x * (z * (t * y)));
	elseif (y <= 8.2e+38)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(18.0 * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -8.6e+248], t$95$2, If[LessEqual[y, -1.95e+187], t$95$1, If[LessEqual[y, -5.4e+93], N[(18.0 * N[(x * N[(z * N[(t * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.2e+38], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.6000000000000001e248 or 8.2000000000000007e38 < y

   1. Initial program 84.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 80.9%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 72.7%

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

   6. Taylor expanded in x around 0 71.1%

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

   7. Taylor expanded in t around inf 52.8%

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

   8. Taylor expanded in a around 0 46.2%

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

      1. associate-*r* 47.7%

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

      2. *-commutative 47.7%

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

   10. Simplified 47.7%

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

   if -8.6000000000000001e248 < y < -1.94999999999999991e187 or -5.3999999999999999e93 < y < 8.2000000000000007e38

   1. Initial program 87.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 93.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 47.3%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]

   if -1.94999999999999991e187 < y < -5.3999999999999999e93

   1. Initial program 64.1%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 68.4%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 57.6%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in t around inf 33.4%

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

      1. pow1 33.4%

         \[\leadsto 18 \cdot \color{blue}{{\left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)}^{1}} \]

   8. Applied egg-rr 33.4%

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

      1. unpow1 33.4%

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

      2. *-commutative 33.4%

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

      3. associate-*l* 35.4%

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

      4. *-commutative 35.4%

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

      5. associate-*r* 48.2%

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

      6. *-commutative 48.2%

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

   10. Simplified 48.2%

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

4. Final simplification 47.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8.6 \cdot 10^{+248}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;y \leq -1.95 \cdot 10^{+187}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{elif}\;y \leq -5.4 \cdot 10^{+93}:\\ \;\;\;\;18 \cdot \left(x \cdot \left(z \cdot \left(t \cdot y\right)\right)\right)\\ \mathbf{elif}\;y \leq 8.2 \cdot 10^{+38}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 19: 50.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -9.8 \cdot 10^{+235}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot x\right)\right)\\ \mathbf{elif}\;x \leq -3.1 \cdot 10^{+118} \lor \neg \left(x \leq 4.2 \cdot 10^{-10}\right):\\ \;\;\;\;i \cdot \left(\frac{b \cdot c}{i} - x \cdot 4\right)\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= x -9.8e+235)
   (* 18.0 (* (* y z) (* t x)))
   (if (or (<= x -3.1e+118) (not (<= x 4.2e-10)))
     (* i (- (/ (* b c) i) (* x 4.0)))
     (+ (* j (* k -27.0)) (* b c)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -9.8e+235) {
		tmp = 18.0 * ((y * z) * (t * x));
	} else if ((x <= -3.1e+118) || !(x <= 4.2e-10)) {
		tmp = i * (((b * c) / i) - (x * 4.0));
	} else {
		tmp = (j * (k * -27.0)) + (b * c);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (x <= (-9.8d+235)) then
        tmp = 18.0d0 * ((y * z) * (t * x))
    else if ((x <= (-3.1d+118)) .or. (.not. (x <= 4.2d-10))) then
        tmp = i * (((b * c) / i) - (x * 4.0d0))
    else
        tmp = (j * (k * (-27.0d0))) + (b * c)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -9.8e+235) {
		tmp = 18.0 * ((y * z) * (t * x));
	} else if ((x <= -3.1e+118) || !(x <= 4.2e-10)) {
		tmp = i * (((b * c) / i) - (x * 4.0));
	} else {
		tmp = (j * (k * -27.0)) + (b * c);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if x <= -9.8e+235:
		tmp = 18.0 * ((y * z) * (t * x))
	elif (x <= -3.1e+118) or not (x <= 4.2e-10):
		tmp = i * (((b * c) / i) - (x * 4.0))
	else:
		tmp = (j * (k * -27.0)) + (b * c)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (x <= -9.8e+235)
		tmp = Float64(18.0 * Float64(Float64(y * z) * Float64(t * x)));
	elseif ((x <= -3.1e+118) || !(x <= 4.2e-10))
		tmp = Float64(i * Float64(Float64(Float64(b * c) / i) - Float64(x * 4.0)));
	else
		tmp = Float64(Float64(j * Float64(k * -27.0)) + Float64(b * c));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (x <= -9.8e+235)
		tmp = 18.0 * ((y * z) * (t * x));
	elseif ((x <= -3.1e+118) || ~((x <= 4.2e-10)))
		tmp = i * (((b * c) / i) - (x * 4.0));
	else
		tmp = (j * (k * -27.0)) + (b * c);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[x, -9.8e+235], N[(18.0 * N[(N[(y * z), $MachinePrecision] * N[(t * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -3.1e+118], N[Not[LessEqual[x, 4.2e-10]], $MachinePrecision]], N[(i * N[(N[(N[(b * c), $MachinePrecision] / i), $MachinePrecision] - N[(x * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.7999999999999995e235

   1. Initial program 56.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 78.1%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 89.5%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in t around inf 56.5%

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

      1. associate-*r* 61.6%

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

   8. Simplified 61.6%

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

   if -9.7999999999999995e235 < x < -3.09999999999999986e118 or 4.2e-10 < x

   1. Initial program 75.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.3%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 74.8%

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

   6. Taylor expanded in t around 0 55.3%

      \[\leadsto \color{blue}{b \cdot c - 4 \cdot \left(i \cdot x\right)} \]

   7. Taylor expanded in i around inf 56.4%

      \[\leadsto \color{blue}{i \cdot \left(\frac{b \cdot c}{i} - 4 \cdot x\right)} \]

   if -3.09999999999999986e118 < x < 4.2e-10

   1. Initial program 93.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 91.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 57.1%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 57.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.8 \cdot 10^{+235}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot x\right)\right)\\ \mathbf{elif}\;x \leq -3.1 \cdot 10^{+118} \lor \neg \left(x \leq 4.2 \cdot 10^{-10}\right):\\ \;\;\;\;i \cdot \left(\frac{b \cdot c}{i} - x \cdot 4\right)\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \end{array} \]
5. Add Preprocessing

Alternative 20: 69.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -6 \cdot 10^{+196} \lor \neg \left(t \leq 3.3 \cdot 10^{+18}\right):\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= t -6e+196) (not (<= t 3.3e+18)))
   (* t (+ (* 18.0 (* x (* y z))) (* a -4.0)))
   (- (* b c) (+ (* 4.0 (* x i)) (* 27.0 (* j k))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -6e+196) || !(t <= 3.3e+18)) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else {
		tmp = (b * c) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if ((t <= (-6d+196)) .or. (.not. (t <= 3.3d+18))) then
        tmp = t * ((18.0d0 * (x * (y * z))) + (a * (-4.0d0)))
    else
        tmp = (b * c) - ((4.0d0 * (x * i)) + (27.0d0 * (j * k)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -6e+196) || !(t <= 3.3e+18)) {
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	} else {
		tmp = (b * c) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if (t <= -6e+196) or not (t <= 3.3e+18):
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0))
	else:
		tmp = (b * c) - ((4.0 * (x * i)) + (27.0 * (j * k)))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -6e+196) || !(t <= 3.3e+18))
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) + Float64(a * -4.0)));
	else
		tmp = Float64(Float64(b * c) - Float64(Float64(4.0 * Float64(x * i)) + Float64(27.0 * Float64(j * k))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if ((t <= -6e+196) || ~((t <= 3.3e+18)))
		tmp = t * ((18.0 * (x * (y * z))) + (a * -4.0));
	else
		tmp = (b * c) - ((4.0 * (x * i)) + (27.0 * (j * k)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[t, -6e+196], N[Not[LessEqual[t, 3.3e+18]], $MachinePrecision]], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] - N[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -5.9999999999999997e196 or 3.3e18 < t

   1. Initial program 87.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.2%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 85.5%

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

   6. Taylor expanded in x around 0 78.5%

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

   7. Taylor expanded in t around inf 77.6%

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

   if -5.9999999999999997e196 < t < 3.3e18

   1. Initial program 83.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.1%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 74.4%

      \[\leadsto \color{blue}{b \cdot c - \left(4 \cdot \left(i \cdot x\right) + 27 \cdot \left(j \cdot k\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -6 \cdot 10^{+196} \lor \neg \left(t \leq 3.3 \cdot 10^{+18}\right):\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) + a \cdot -4\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c - \left(4 \cdot \left(x \cdot i\right) + 27 \cdot \left(j \cdot k\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 21: 70.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{+192}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{-10}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - 27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= x -1.15e+192)
   (* x (- (* 18.0 (* t (* y z))) (* i 4.0)))
   (if (<= x 4.5e-10)
     (- (+ (* b c) (* -4.0 (* t a))) (* 27.0 (* j k)))
     (* x (* y (+ (* -4.0 (/ i y)) (* 18.0 (* t z))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -1.15e+192) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if (x <= 4.5e-10) {
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (x <= (-1.15d+192)) then
        tmp = x * ((18.0d0 * (t * (y * z))) - (i * 4.0d0))
    else if (x <= 4.5d-10) then
        tmp = ((b * c) + ((-4.0d0) * (t * a))) - (27.0d0 * (j * k))
    else
        tmp = x * (y * (((-4.0d0) * (i / y)) + (18.0d0 * (t * z))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -1.15e+192) {
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	} else if (x <= 4.5e-10) {
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	} else {
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if x <= -1.15e+192:
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0))
	elif x <= 4.5e-10:
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k))
	else:
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (x <= -1.15e+192)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(i * 4.0)));
	elseif (x <= 4.5e-10)
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(27.0 * Float64(j * k)));
	else
		tmp = Float64(x * Float64(y * Float64(Float64(-4.0 * Float64(i / y)) + Float64(18.0 * Float64(t * z)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (x <= -1.15e+192)
		tmp = x * ((18.0 * (t * (y * z))) - (i * 4.0));
	elseif (x <= 4.5e-10)
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	else
		tmp = x * (y * ((-4.0 * (i / y)) + (18.0 * (t * z))));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[x, -1.15e+192], N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(i * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.5e-10], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * N[(N[(-4.0 * N[(i / y), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.15e192

   1. Initial program 54.7%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 69.8%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 88.9%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   if -1.15e192 < x < 4.5e-10

   1. Initial program 91.8%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 90.0%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 78.8%

      \[\leadsto \color{blue}{\left(-4 \cdot \left(a \cdot t\right) + b \cdot c\right) - 27 \cdot \left(j \cdot k\right)} \]

   if 4.5e-10 < x

   1. Initial program 79.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 85.7%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 68.2%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in y around inf 71.0%

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

4. Final simplification 77.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{+192}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - i \cdot 4\right)\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{-10}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - 27 \cdot \left(j \cdot k\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot \left(-4 \cdot \frac{i}{y} + 18 \cdot \left(t \cdot z\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 22: 50.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -6.2 \cdot 10^{+236}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot x\right)\right)\\ \mathbf{elif}\;x \leq -2.05 \cdot 10^{+120} \lor \neg \left(x \leq 4.3 \cdot 10^{-10}\right):\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= x -6.2e+236)
   (* 18.0 (* (* y z) (* t x)))
   (if (or (<= x -2.05e+120) (not (<= x 4.3e-10)))
     (- (* b c) (* 4.0 (* x i)))
     (+ (* j (* k -27.0)) (* b c)))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -6.2e+236) {
		tmp = 18.0 * ((y * z) * (t * x));
	} else if ((x <= -2.05e+120) || !(x <= 4.3e-10)) {
		tmp = (b * c) - (4.0 * (x * i));
	} else {
		tmp = (j * (k * -27.0)) + (b * c);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (x <= (-6.2d+236)) then
        tmp = 18.0d0 * ((y * z) * (t * x))
    else if ((x <= (-2.05d+120)) .or. (.not. (x <= 4.3d-10))) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else
        tmp = (j * (k * (-27.0d0))) + (b * c)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -6.2e+236) {
		tmp = 18.0 * ((y * z) * (t * x));
	} else if ((x <= -2.05e+120) || !(x <= 4.3e-10)) {
		tmp = (b * c) - (4.0 * (x * i));
	} else {
		tmp = (j * (k * -27.0)) + (b * c);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if x <= -6.2e+236:
		tmp = 18.0 * ((y * z) * (t * x))
	elif (x <= -2.05e+120) or not (x <= 4.3e-10):
		tmp = (b * c) - (4.0 * (x * i))
	else:
		tmp = (j * (k * -27.0)) + (b * c)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (x <= -6.2e+236)
		tmp = Float64(18.0 * Float64(Float64(y * z) * Float64(t * x)));
	elseif ((x <= -2.05e+120) || !(x <= 4.3e-10))
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	else
		tmp = Float64(Float64(j * Float64(k * -27.0)) + Float64(b * c));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (x <= -6.2e+236)
		tmp = 18.0 * ((y * z) * (t * x));
	elseif ((x <= -2.05e+120) || ~((x <= 4.3e-10)))
		tmp = (b * c) - (4.0 * (x * i));
	else
		tmp = (j * (k * -27.0)) + (b * c);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[x, -6.2e+236], N[(18.0 * N[(N[(y * z), $MachinePrecision] * N[(t * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -2.05e+120], N[Not[LessEqual[x, 4.3e-10]], $MachinePrecision]], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.19999999999999999e236

   1. Initial program 56.4%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 78.1%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 89.5%

      \[\leadsto \color{blue}{x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)} \]

   6. Taylor expanded in t around inf 56.5%

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

      1. associate-*r* 61.6%

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

   8. Simplified 61.6%

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

   if -6.19999999999999999e236 < x < -2.05e120 or 4.30000000000000014e-10 < x

   1. Initial program 75.5%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 82.3%

      \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in j around 0 74.8%

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

   6. Taylor expanded in t around 0 55.3%

      \[\leadsto \color{blue}{b \cdot c - 4 \cdot \left(i \cdot x\right)} \]

   if -2.05e120 < x < 4.30000000000000014e-10

   1. Initial program 93.9%

      \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

   3. Simplified 91.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t, \mathsf{fma}\left(x, 18 \cdot \left(y \cdot z\right), a \cdot -4\right), \mathsf{fma}\left(b, c, x \cdot \left(i \cdot -4\right)\right)\right) + j \cdot \left(k \cdot -27\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 57.1%

      \[\leadsto \color{blue}{b \cdot c} + j \cdot \left(k \cdot -27\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 56.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.2 \cdot 10^{+236}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(t \cdot x\right)\right)\\ \mathbf{elif}\;x \leq -2.05 \cdot 10^{+120} \lor \neg \left(x \leq 4.3 \cdot 10^{-10}\right):\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + b \cdot c\\ \end{array} \]
5. Add Preprocessing

Alternative 23: 24.0% accurate, 10.3× speedup

Math

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

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	return b * c;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    code = b * c
end function

Java

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

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	return b * c

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	return Float64(b * c)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.9%

   \[\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \]

3. Simplified 86.8%

   \[\leadsto \color{blue}{\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. pow1 86.8%

      \[\leadsto \left(t \cdot \left(\color{blue}{{\left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   2. associate-*l* 86.8%

      \[\leadsto \left(t \cdot \left({\color{blue}{\left(x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)}}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   3. associate-*r* 86.4%

      \[\leadsto \left(t \cdot \left({\left(x \cdot \color{blue}{\left(\left(18 \cdot y\right) \cdot z\right)}\right)}^{1} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

6. Applied egg-rr 86.4%

   \[\leadsto \left(t \cdot \left(\color{blue}{{\left(x \cdot \left(\left(18 \cdot y\right) \cdot z\right)\right)}^{1}} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]
7. Step-by-step derivation

   1. unpow1 86.4%

      \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(\left(18 \cdot y\right) \cdot z\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

   2. *-commutative 86.4%

      \[\leadsto \left(t \cdot \left(x \cdot \color{blue}{\left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

8. Simplified 86.4%

   \[\leadsto \left(t \cdot \left(\color{blue}{x \cdot \left(z \cdot \left(18 \cdot y\right)\right)} - a \cdot 4\right) + b \cdot c\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right) \]

9. Taylor expanded in b around inf 24.2%

   \[\leadsto \color{blue}{b \cdot c} \]

10. Final simplification 24.2%

    \[\leadsto b \cdot c \]
11. Add Preprocessing

Developer target: 89.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(a \cdot t + i \cdot x\right) \cdot 4\\ t_2 := \left(\left(18 \cdot t\right) \cdot \left(\left(x \cdot y\right) \cdot z\right) - t\_1\right) - \left(\left(k \cdot j\right) \cdot 27 - c \cdot b\right)\\ \mathbf{if}\;t < -1.6210815397541398 \cdot 10^{-69}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t < 165.68027943805222:\\ \;\;\;\;\left(\left(18 \cdot y\right) \cdot \left(x \cdot \left(z \cdot t\right)\right) - t\_1\right) + \left(c \cdot b - 27 \cdot \left(k \cdot j\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* (+ (* a t) (* i x)) 4.0))
        (t_2
         (-
          (- (* (* 18.0 t) (* (* x y) z)) t_1)
          (- (* (* k j) 27.0) (* c b)))))
   (if (< t -1.6210815397541398e-69)
     t_2
     (if (< t 165.68027943805222)
       (+ (- (* (* 18.0 y) (* x (* z t))) t_1) (- (* c b) (* 27.0 (* k j))))
       t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((a * t) + (i * x)) * 4.0;
	double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
	double tmp;
	if (t < -1.6210815397541398e-69) {
		tmp = t_2;
	} else if (t < 165.68027943805222) {
		tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c, i, j, k)
    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), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = ((a * t) + (i * x)) * 4.0d0
    t_2 = (((18.0d0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0d0) - (c * b))
    if (t < (-1.6210815397541398d-69)) then
        tmp = t_2
    else if (t < 165.68027943805222d0) then
        tmp = (((18.0d0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0d0 * (k * j)))
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((a * t) + (i * x)) * 4.0;
	double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
	double tmp;
	if (t < -1.6210815397541398e-69) {
		tmp = t_2;
	} else if (t < 165.68027943805222) {
		tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = ((a * t) + (i * x)) * 4.0
	t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b))
	tmp = 0
	if t < -1.6210815397541398e-69:
		tmp = t_2
	elif t < 165.68027943805222:
		tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)))
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(Float64(a * t) + Float64(i * x)) * 4.0)
	t_2 = Float64(Float64(Float64(Float64(18.0 * t) * Float64(Float64(x * y) * z)) - t_1) - Float64(Float64(Float64(k * j) * 27.0) - Float64(c * b)))
	tmp = 0.0
	if (t < -1.6210815397541398e-69)
		tmp = t_2;
	elseif (t < 165.68027943805222)
		tmp = Float64(Float64(Float64(Float64(18.0 * y) * Float64(x * Float64(z * t))) - t_1) + Float64(Float64(c * b) - Float64(27.0 * Float64(k * j))));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = ((a * t) + (i * x)) * 4.0;
	t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
	tmp = 0.0;
	if (t < -1.6210815397541398e-69)
		tmp = t_2;
	elseif (t < 165.68027943805222)
		tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] + N[(i * x), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(18.0 * t), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - N[(N[(N[(k * j), $MachinePrecision] * 27.0), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -1.6210815397541398e-69], t$95$2, If[Less[t, 165.68027943805222], N[(N[(N[(N[(18.0 * y), $MachinePrecision] * N[(x * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] + N[(N[(c * b), $MachinePrecision] - N[(27.0 * N[(k * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Reproduce

herbie shell --seed 2024055 
(FPCore (x y z t a b c i j k)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, E"
  :precision binary64

  :alt
  (if (< t -1.6210815397541398e-69) (- (- (* (* 18.0 t) (* (* x y) z)) (* (+ (* a t) (* i x)) 4.0)) (- (* (* k j) 27.0) (* c b))) (if (< t 165.68027943805222) (+ (- (* (* 18.0 y) (* x (* z t))) (* (+ (* a t) (* i x)) 4.0)) (- (* c b) (* 27.0 (* k j)))) (- (- (* (* 18.0 t) (* (* x y) z)) (* (+ (* a t) (* i x)) 4.0)) (- (* (* k j) 27.0) (* c b)))))

  (- (- (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c)) (* (* x 4.0) i)) (* (* j 27.0) k)))