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

Percentage Accurate: 85.7% → 92.2%

Time: 34.6s

Alternatives: 26

Speedup: 0.9×

• 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.7% 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: 92.2% 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 := \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_1 \leq \infty:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\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 18.0) y) z) t) (* t (* a 4.0))) (* b c))
           (* (* x 4.0) i))
          (* (* j 27.0) k))))
   (if (<= t_1 INFINITY) t_1 (* x (- (* 18.0 (* y (* z t))) (* 4.0 i))))))

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 * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	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(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	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 * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	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[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $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]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 2: 86.7% 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}\;x \leq -7.8 \cdot 10^{+200}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -3.4 \cdot 10^{-147} \lor \neg \left(x \leq 7.8 \cdot 10^{-203}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right)\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - 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 (<= x -7.8e+200)
   (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
   (if (or (<= x -3.4e-147) (not (<= x 7.8e-203)))
     (-
      (+ (* b c) (* t (- (* (* x 18.0) (* y z)) (* a 4.0))))
      (+ (* x (* 4.0 i)) (* j (* 27.0 k))))
     (- (+ (* b c) (* -4.0 (* t a))) (* 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 (x <= -7.8e+200) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if ((x <= -3.4e-147) || !(x <= 7.8e-203)) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 (x <= (-7.8d+200)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if ((x <= (-3.4d-147)) .or. (.not. (x <= 7.8d-203))) then
        tmp = ((b * c) + (t * (((x * 18.0d0) * (y * z)) - (a * 4.0d0)))) - ((x * (4.0d0 * i)) + (j * (27.0d0 * k)))
    else
        tmp = ((b * c) + ((-4.0d0) * (t * a))) - (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 (x <= -7.8e+200) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if ((x <= -3.4e-147) || !(x <= 7.8e-203)) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 x <= -7.8e+200:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif (x <= -3.4e-147) or not (x <= 7.8e-203):
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)))
	else:
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 (x <= -7.8e+200)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif ((x <= -3.4e-147) || !(x <= 7.8e-203))
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(x * 18.0) * Float64(y * z)) - Float64(a * 4.0)))) - Float64(Float64(x * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k))));
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - 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 (x <= -7.8e+200)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif ((x <= -3.4e-147) || ~((x <= 7.8e-203)))
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	else
		tmp = ((b * c) + (-4.0 * (t * a))) - (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[LessEqual[x, -7.8e+200], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[x, -3.4e-147], N[Not[LessEqual[x, 7.8e-203]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(x * 18.0), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 3: 57.7% 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 := -4 \cdot \left(t \cdot a\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ t_3 := b \cdot c + t_1\\ t_4 := x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -3.3 \cdot 10^{+128}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq -2.7 \cdot 10^{+95}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -10500000000:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq -8.5 \cdot 10^{-74}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -4 \cdot 10^{-278}:\\ \;\;\;\;t_1 - 27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 9 \cdot 10^{-242}:\\ \;\;\;\;b \cdot c + t_2\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-84}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{-11}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{else}:\\ \;\;\;\;t_4\\ \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 (* j (* k -27.0)))
        (t_3 (+ (* b c) t_1))
        (t_4 (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))))
   (if (<= x -3.3e+128)
     t_4
     (if (<= x -2.7e+95)
       t_3
       (if (<= x -10500000000.0)
         t_4
         (if (<= x -8.5e-74)
           t_3
           (if (<= x -4e-278)
             (- t_1 (* 27.0 (* j k)))
             (if (<= x 9e-242)
               (+ (* b c) t_2)
               (if (<= x 8.5e-84)
                 t_3
                 (if (<= x 4.2e-11) (+ t_1 t_2) t_4))))))))))

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 = j * (k * -27.0);
	double t_3 = (b * c) + t_1;
	double t_4 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	double tmp;
	if (x <= -3.3e+128) {
		tmp = t_4;
	} else if (x <= -2.7e+95) {
		tmp = t_3;
	} else if (x <= -10500000000.0) {
		tmp = t_4;
	} else if (x <= -8.5e-74) {
		tmp = t_3;
	} else if (x <= -4e-278) {
		tmp = t_1 - (27.0 * (j * k));
	} else if (x <= 9e-242) {
		tmp = (b * c) + t_2;
	} else if (x <= 8.5e-84) {
		tmp = t_3;
	} else if (x <= 4.2e-11) {
		tmp = t_1 + t_2;
	} else {
		tmp = t_4;
	}
	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) :: t_4
    real(8) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = j * (k * (-27.0d0))
    t_3 = (b * c) + t_1
    t_4 = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    if (x <= (-3.3d+128)) then
        tmp = t_4
    else if (x <= (-2.7d+95)) then
        tmp = t_3
    else if (x <= (-10500000000.0d0)) then
        tmp = t_4
    else if (x <= (-8.5d-74)) then
        tmp = t_3
    else if (x <= (-4d-278)) then
        tmp = t_1 - (27.0d0 * (j * k))
    else if (x <= 9d-242) then
        tmp = (b * c) + t_2
    else if (x <= 8.5d-84) then
        tmp = t_3
    else if (x <= 4.2d-11) then
        tmp = t_1 + t_2
    else
        tmp = t_4
    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 = j * (k * -27.0);
	double t_3 = (b * c) + t_1;
	double t_4 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	double tmp;
	if (x <= -3.3e+128) {
		tmp = t_4;
	} else if (x <= -2.7e+95) {
		tmp = t_3;
	} else if (x <= -10500000000.0) {
		tmp = t_4;
	} else if (x <= -8.5e-74) {
		tmp = t_3;
	} else if (x <= -4e-278) {
		tmp = t_1 - (27.0 * (j * k));
	} else if (x <= 9e-242) {
		tmp = (b * c) + t_2;
	} else if (x <= 8.5e-84) {
		tmp = t_3;
	} else if (x <= 4.2e-11) {
		tmp = t_1 + t_2;
	} else {
		tmp = t_4;
	}
	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 = j * (k * -27.0)
	t_3 = (b * c) + t_1
	t_4 = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	tmp = 0
	if x <= -3.3e+128:
		tmp = t_4
	elif x <= -2.7e+95:
		tmp = t_3
	elif x <= -10500000000.0:
		tmp = t_4
	elif x <= -8.5e-74:
		tmp = t_3
	elif x <= -4e-278:
		tmp = t_1 - (27.0 * (j * k))
	elif x <= 9e-242:
		tmp = (b * c) + t_2
	elif x <= 8.5e-84:
		tmp = t_3
	elif x <= 4.2e-11:
		tmp = t_1 + t_2
	else:
		tmp = t_4
	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(j * Float64(k * -27.0))
	t_3 = Float64(Float64(b * c) + t_1)
	t_4 = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -3.3e+128)
		tmp = t_4;
	elseif (x <= -2.7e+95)
		tmp = t_3;
	elseif (x <= -10500000000.0)
		tmp = t_4;
	elseif (x <= -8.5e-74)
		tmp = t_3;
	elseif (x <= -4e-278)
		tmp = Float64(t_1 - Float64(27.0 * Float64(j * k)));
	elseif (x <= 9e-242)
		tmp = Float64(Float64(b * c) + t_2);
	elseif (x <= 8.5e-84)
		tmp = t_3;
	elseif (x <= 4.2e-11)
		tmp = Float64(t_1 + t_2);
	else
		tmp = t_4;
	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 = j * (k * -27.0);
	t_3 = (b * c) + t_1;
	t_4 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -3.3e+128)
		tmp = t_4;
	elseif (x <= -2.7e+95)
		tmp = t_3;
	elseif (x <= -10500000000.0)
		tmp = t_4;
	elseif (x <= -8.5e-74)
		tmp = t_3;
	elseif (x <= -4e-278)
		tmp = t_1 - (27.0 * (j * k));
	elseif (x <= 9e-242)
		tmp = (b * c) + t_2;
	elseif (x <= 8.5e-84)
		tmp = t_3;
	elseif (x <= 4.2e-11)
		tmp = t_1 + t_2;
	else
		tmp = t_4;
	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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.3e+128], t$95$4, If[LessEqual[x, -2.7e+95], t$95$3, If[LessEqual[x, -10500000000.0], t$95$4, If[LessEqual[x, -8.5e-74], t$95$3, If[LessEqual[x, -4e-278], N[(t$95$1 - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 9e-242], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], If[LessEqual[x, 8.5e-84], t$95$3, If[LessEqual[x, 4.2e-11], N[(t$95$1 + t$95$2), $MachinePrecision], t$95$4]]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 4: 59.3% 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)\\ t_2 := b \cdot c + -4 \cdot \left(t \cdot a + x \cdot i\right)\\ \mathbf{if}\;x \leq -2.6 \cdot 10^{+223}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -3.05 \cdot 10^{-74}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -8.2 \cdot 10^{-278}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) - 27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{-240}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{-78}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 41000000000:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(z \cdot \left(x \cdot y\right)\right) + t_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\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 (+ (* b c) (* -4.0 (+ (* t a) (* x i))))))
   (if (<= x -2.6e+223)
     (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))
     (if (<= x -3.05e-74)
       t_2
       (if (<= x -8.2e-278)
         (- (* -4.0 (* t a)) (* 27.0 (* j k)))
         (if (<= x 5.2e-240)
           (+ (* b c) t_1)
           (if (<= x 1.2e-78)
             t_2
             (if (<= x 41000000000.0)
               (+ (* (* 18.0 t) (* z (* x y))) t_1)
               (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))))))))))

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 = (b * c) + (-4.0 * ((t * a) + (x * i)));
	double tmp;
	if (x <= -2.6e+223) {
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	} else if (x <= -3.05e-74) {
		tmp = t_2;
	} else if (x <= -8.2e-278) {
		tmp = (-4.0 * (t * a)) - (27.0 * (j * k));
	} else if (x <= 5.2e-240) {
		tmp = (b * c) + t_1;
	} else if (x <= 1.2e-78) {
		tmp = t_2;
	} else if (x <= 41000000000.0) {
		tmp = ((18.0 * t) * (z * (x * y))) + t_1;
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 = (b * c) + ((-4.0d0) * ((t * a) + (x * i)))
    if (x <= (-2.6d+223)) then
        tmp = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    else if (x <= (-3.05d-74)) then
        tmp = t_2
    else if (x <= (-8.2d-278)) then
        tmp = ((-4.0d0) * (t * a)) - (27.0d0 * (j * k))
    else if (x <= 5.2d-240) then
        tmp = (b * c) + t_1
    else if (x <= 1.2d-78) then
        tmp = t_2
    else if (x <= 41000000000.0d0) then
        tmp = ((18.0d0 * t) * (z * (x * y))) + t_1
    else
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    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 = (b * c) + (-4.0 * ((t * a) + (x * i)));
	double tmp;
	if (x <= -2.6e+223) {
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	} else if (x <= -3.05e-74) {
		tmp = t_2;
	} else if (x <= -8.2e-278) {
		tmp = (-4.0 * (t * a)) - (27.0 * (j * k));
	} else if (x <= 5.2e-240) {
		tmp = (b * c) + t_1;
	} else if (x <= 1.2e-78) {
		tmp = t_2;
	} else if (x <= 41000000000.0) {
		tmp = ((18.0 * t) * (z * (x * y))) + t_1;
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 = (b * c) + (-4.0 * ((t * a) + (x * i)))
	tmp = 0
	if x <= -2.6e+223:
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	elif x <= -3.05e-74:
		tmp = t_2
	elif x <= -8.2e-278:
		tmp = (-4.0 * (t * a)) - (27.0 * (j * k))
	elif x <= 5.2e-240:
		tmp = (b * c) + t_1
	elif x <= 1.2e-78:
		tmp = t_2
	elif x <= 41000000000.0:
		tmp = ((18.0 * t) * (z * (x * y))) + t_1
	else:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	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(b * c) + Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))))
	tmp = 0.0
	if (x <= -2.6e+223)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)));
	elseif (x <= -3.05e-74)
		tmp = t_2;
	elseif (x <= -8.2e-278)
		tmp = Float64(Float64(-4.0 * Float64(t * a)) - Float64(27.0 * Float64(j * k)));
	elseif (x <= 5.2e-240)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (x <= 1.2e-78)
		tmp = t_2;
	elseif (x <= 41000000000.0)
		tmp = Float64(Float64(Float64(18.0 * t) * Float64(z * Float64(x * y))) + t_1);
	else
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	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 = (b * c) + (-4.0 * ((t * a) + (x * i)));
	tmp = 0.0;
	if (x <= -2.6e+223)
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	elseif (x <= -3.05e-74)
		tmp = t_2;
	elseif (x <= -8.2e-278)
		tmp = (-4.0 * (t * a)) - (27.0 * (j * k));
	elseif (x <= 5.2e-240)
		tmp = (b * c) + t_1;
	elseif (x <= 1.2e-78)
		tmp = t_2;
	elseif (x <= 41000000000.0)
		tmp = ((18.0 * t) * (z * (x * y))) + t_1;
	else
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	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[(b * c), $MachinePrecision] + N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.6e+223], N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.05e-74], t$95$2, If[LessEqual[x, -8.2e-278], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.2e-240], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 1.2e-78], t$95$2, If[LessEqual[x, 41000000000.0], N[(N[(N[(18.0 * t), $MachinePrecision] * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 5: 82.6% 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} \mathbf{if}\;t \leq -4.6 \cdot 10^{+29} \lor \neg \left(t \leq 5.8 \cdot 10^{+89}\right):\\ \;\;\;\;\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{else}:\\ \;\;\;\;\left(\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\ \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 -4.6e+29) (not (<= t 5.8e+89)))
   (- (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))) (* 4.0 (* x i)))
   (- (- (- (* b c) (* 4.0 (* t a))) (* (* x 4.0) i)) (* (* j 27.0) 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 <= -4.6e+29) || !(t <= 5.8e+89)) {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - (4.0 * (x * i));
	} else {
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * 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 <= (-4.6d+29)) .or. (.not. (t <= 5.8d+89))) then
        tmp = ((b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))) - (4.0d0 * (x * i))
    else
        tmp = (((b * c) - (4.0d0 * (t * a))) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * 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 <= -4.6e+29) || !(t <= 5.8e+89)) {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - (4.0 * (x * i));
	} else {
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * 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 <= -4.6e+29) or not (t <= 5.8e+89):
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - (4.0 * (x * i))
	else:
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * 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 <= -4.6e+29) || !(t <= 5.8e+89))
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))) - Float64(4.0 * Float64(x * i)));
	else
		tmp = Float64(Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * 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 <= -4.6e+29) || ~((t <= 5.8e+89)))
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - (4.0 * (x * i));
	else
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * 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, -4.6e+29], N[Not[LessEqual[t, 5.8e+89]], $MachinePrecision]], 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] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 6: 49.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} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ t_3 := j \cdot \left(k \cdot -27\right)\\ t_4 := t_1 + t_3\\ \mathbf{if}\;x \leq -2.7 \cdot 10^{+271}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -7.4 \cdot 10^{+62}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -3.9 \cdot 10^{-278}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-239}:\\ \;\;\;\;b \cdot c + t_3\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-83}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;x \leq 10^{+30}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.7 \cdot 10^{+119} \lor \neg \left(x \leq 2.3 \cdot 10^{+181}\right):\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(t \cdot \left(x \cdot \left(18 \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 (* -4.0 (* t a)))
        (t_2 (- (* b c) (* 4.0 (* x i))))
        (t_3 (* j (* k -27.0)))
        (t_4 (+ t_1 t_3)))
   (if (<= x -2.7e+271)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -7.4e+62)
       t_2
       (if (<= x -3.9e-278)
         t_4
         (if (<= x 1.35e-239)
           (+ (* b c) t_3)
           (if (<= x 7.8e-83)
             (+ (* b c) t_1)
             (if (<= x 1e+30)
               t_4
               (if (or (<= x 1.7e+119) (not (<= x 2.3e+181)))
                 t_2
                 (* y (* t (* x (* 18.0 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 = -4.0 * (t * a);
	double t_2 = (b * c) - (4.0 * (x * i));
	double t_3 = j * (k * -27.0);
	double t_4 = t_1 + t_3;
	double tmp;
	if (x <= -2.7e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -7.4e+62) {
		tmp = t_2;
	} else if (x <= -3.9e-278) {
		tmp = t_4;
	} else if (x <= 1.35e-239) {
		tmp = (b * c) + t_3;
	} else if (x <= 7.8e-83) {
		tmp = (b * c) + t_1;
	} else if (x <= 1e+30) {
		tmp = t_4;
	} else if ((x <= 1.7e+119) || !(x <= 2.3e+181)) {
		tmp = t_2;
	} else {
		tmp = y * (t * (x * (18.0 * 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) :: t_4
    real(8) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = (b * c) - (4.0d0 * (x * i))
    t_3 = j * (k * (-27.0d0))
    t_4 = t_1 + t_3
    if (x <= (-2.7d+271)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-7.4d+62)) then
        tmp = t_2
    else if (x <= (-3.9d-278)) then
        tmp = t_4
    else if (x <= 1.35d-239) then
        tmp = (b * c) + t_3
    else if (x <= 7.8d-83) then
        tmp = (b * c) + t_1
    else if (x <= 1d+30) then
        tmp = t_4
    else if ((x <= 1.7d+119) .or. (.not. (x <= 2.3d+181))) then
        tmp = t_2
    else
        tmp = y * (t * (x * (18.0d0 * 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 = -4.0 * (t * a);
	double t_2 = (b * c) - (4.0 * (x * i));
	double t_3 = j * (k * -27.0);
	double t_4 = t_1 + t_3;
	double tmp;
	if (x <= -2.7e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -7.4e+62) {
		tmp = t_2;
	} else if (x <= -3.9e-278) {
		tmp = t_4;
	} else if (x <= 1.35e-239) {
		tmp = (b * c) + t_3;
	} else if (x <= 7.8e-83) {
		tmp = (b * c) + t_1;
	} else if (x <= 1e+30) {
		tmp = t_4;
	} else if ((x <= 1.7e+119) || !(x <= 2.3e+181)) {
		tmp = t_2;
	} else {
		tmp = y * (t * (x * (18.0 * 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 = -4.0 * (t * a)
	t_2 = (b * c) - (4.0 * (x * i))
	t_3 = j * (k * -27.0)
	t_4 = t_1 + t_3
	tmp = 0
	if x <= -2.7e+271:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -7.4e+62:
		tmp = t_2
	elif x <= -3.9e-278:
		tmp = t_4
	elif x <= 1.35e-239:
		tmp = (b * c) + t_3
	elif x <= 7.8e-83:
		tmp = (b * c) + t_1
	elif x <= 1e+30:
		tmp = t_4
	elif (x <= 1.7e+119) or not (x <= 2.3e+181):
		tmp = t_2
	else:
		tmp = y * (t * (x * (18.0 * 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(-4.0 * Float64(t * a))
	t_2 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	t_3 = Float64(j * Float64(k * -27.0))
	t_4 = Float64(t_1 + t_3)
	tmp = 0.0
	if (x <= -2.7e+271)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -7.4e+62)
		tmp = t_2;
	elseif (x <= -3.9e-278)
		tmp = t_4;
	elseif (x <= 1.35e-239)
		tmp = Float64(Float64(b * c) + t_3);
	elseif (x <= 7.8e-83)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (x <= 1e+30)
		tmp = t_4;
	elseif ((x <= 1.7e+119) || !(x <= 2.3e+181))
		tmp = t_2;
	else
		tmp = Float64(y * Float64(t * Float64(x * Float64(18.0 * 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 = -4.0 * (t * a);
	t_2 = (b * c) - (4.0 * (x * i));
	t_3 = j * (k * -27.0);
	t_4 = t_1 + t_3;
	tmp = 0.0;
	if (x <= -2.7e+271)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -7.4e+62)
		tmp = t_2;
	elseif (x <= -3.9e-278)
		tmp = t_4;
	elseif (x <= 1.35e-239)
		tmp = (b * c) + t_3;
	elseif (x <= 7.8e-83)
		tmp = (b * c) + t_1;
	elseif (x <= 1e+30)
		tmp = t_4;
	elseif ((x <= 1.7e+119) || ~((x <= 2.3e+181)))
		tmp = t_2;
	else
		tmp = y * (t * (x * (18.0 * 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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$1 + t$95$3), $MachinePrecision]}, If[LessEqual[x, -2.7e+271], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -7.4e+62], t$95$2, If[LessEqual[x, -3.9e-278], t$95$4, If[LessEqual[x, 1.35e-239], N[(N[(b * c), $MachinePrecision] + t$95$3), $MachinePrecision], If[LessEqual[x, 7.8e-83], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 1e+30], t$95$4, If[Or[LessEqual[x, 1.7e+119], N[Not[LessEqual[x, 2.3e+181]], $MachinePrecision]], t$95$2, N[(y * N[(t * N[(x * N[(18.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 7: 47.2% 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} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := b \cdot c + t_1\\ t_3 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ t_4 := b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;x \leq -5.8 \cdot 10^{+273}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{+201}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{-221}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-243}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 4.1 \cdot 10^{-77}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-13}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+19}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.8 \cdot 10^{+117}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(y \cdot \left(x \cdot z\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))
        (t_3 (- (* b c) (* 4.0 (* x i))))
        (t_4 (+ (* b c) (* j (* k -27.0)))))
   (if (<= x -5.8e+273)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -1.7e+201)
       t_3
       (if (<= x -1.55e-221)
         t_2
         (if (<= x 8.6e-243)
           t_4
           (if (<= x 4.1e-77)
             t_2
             (if (<= x 3.8e-13)
               t_4
               (if (<= x 1.3e+19)
                 t_1
                 (if (<= x 1.8e+117) t_3 (* (* 18.0 t) (* y (* x 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 = -4.0 * (t * a);
	double t_2 = (b * c) + t_1;
	double t_3 = (b * c) - (4.0 * (x * i));
	double t_4 = (b * c) + (j * (k * -27.0));
	double tmp;
	if (x <= -5.8e+273) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.7e+201) {
		tmp = t_3;
	} else if (x <= -1.55e-221) {
		tmp = t_2;
	} else if (x <= 8.6e-243) {
		tmp = t_4;
	} else if (x <= 4.1e-77) {
		tmp = t_2;
	} else if (x <= 3.8e-13) {
		tmp = t_4;
	} else if (x <= 1.3e+19) {
		tmp = t_1;
	} else if (x <= 1.8e+117) {
		tmp = t_3;
	} else {
		tmp = (18.0 * t) * (y * (x * 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) :: t_4
    real(8) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = (b * c) + t_1
    t_3 = (b * c) - (4.0d0 * (x * i))
    t_4 = (b * c) + (j * (k * (-27.0d0)))
    if (x <= (-5.8d+273)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-1.7d+201)) then
        tmp = t_3
    else if (x <= (-1.55d-221)) then
        tmp = t_2
    else if (x <= 8.6d-243) then
        tmp = t_4
    else if (x <= 4.1d-77) then
        tmp = t_2
    else if (x <= 3.8d-13) then
        tmp = t_4
    else if (x <= 1.3d+19) then
        tmp = t_1
    else if (x <= 1.8d+117) then
        tmp = t_3
    else
        tmp = (18.0d0 * t) * (y * (x * 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 = -4.0 * (t * a);
	double t_2 = (b * c) + t_1;
	double t_3 = (b * c) - (4.0 * (x * i));
	double t_4 = (b * c) + (j * (k * -27.0));
	double tmp;
	if (x <= -5.8e+273) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.7e+201) {
		tmp = t_3;
	} else if (x <= -1.55e-221) {
		tmp = t_2;
	} else if (x <= 8.6e-243) {
		tmp = t_4;
	} else if (x <= 4.1e-77) {
		tmp = t_2;
	} else if (x <= 3.8e-13) {
		tmp = t_4;
	} else if (x <= 1.3e+19) {
		tmp = t_1;
	} else if (x <= 1.8e+117) {
		tmp = t_3;
	} else {
		tmp = (18.0 * t) * (y * (x * 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 = -4.0 * (t * a)
	t_2 = (b * c) + t_1
	t_3 = (b * c) - (4.0 * (x * i))
	t_4 = (b * c) + (j * (k * -27.0))
	tmp = 0
	if x <= -5.8e+273:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -1.7e+201:
		tmp = t_3
	elif x <= -1.55e-221:
		tmp = t_2
	elif x <= 8.6e-243:
		tmp = t_4
	elif x <= 4.1e-77:
		tmp = t_2
	elif x <= 3.8e-13:
		tmp = t_4
	elif x <= 1.3e+19:
		tmp = t_1
	elif x <= 1.8e+117:
		tmp = t_3
	else:
		tmp = (18.0 * t) * (y * (x * 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(-4.0 * Float64(t * a))
	t_2 = Float64(Float64(b * c) + t_1)
	t_3 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	t_4 = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)))
	tmp = 0.0
	if (x <= -5.8e+273)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -1.7e+201)
		tmp = t_3;
	elseif (x <= -1.55e-221)
		tmp = t_2;
	elseif (x <= 8.6e-243)
		tmp = t_4;
	elseif (x <= 4.1e-77)
		tmp = t_2;
	elseif (x <= 3.8e-13)
		tmp = t_4;
	elseif (x <= 1.3e+19)
		tmp = t_1;
	elseif (x <= 1.8e+117)
		tmp = t_3;
	else
		tmp = Float64(Float64(18.0 * t) * Float64(y * Float64(x * 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 = -4.0 * (t * a);
	t_2 = (b * c) + t_1;
	t_3 = (b * c) - (4.0 * (x * i));
	t_4 = (b * c) + (j * (k * -27.0));
	tmp = 0.0;
	if (x <= -5.8e+273)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -1.7e+201)
		tmp = t_3;
	elseif (x <= -1.55e-221)
		tmp = t_2;
	elseif (x <= 8.6e-243)
		tmp = t_4;
	elseif (x <= 4.1e-77)
		tmp = t_2;
	elseif (x <= 3.8e-13)
		tmp = t_4;
	elseif (x <= 1.3e+19)
		tmp = t_1;
	elseif (x <= 1.8e+117)
		tmp = t_3;
	else
		tmp = (18.0 * t) * (y * (x * 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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.8e+273], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.7e+201], t$95$3, If[LessEqual[x, -1.55e-221], t$95$2, If[LessEqual[x, 8.6e-243], t$95$4, If[LessEqual[x, 4.1e-77], t$95$2, If[LessEqual[x, 3.8e-13], t$95$4, If[LessEqual[x, 1.3e+19], t$95$1, If[LessEqual[x, 1.8e+117], t$95$3, N[(N[(18.0 * t), $MachinePrecision] * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 8: 47.2% 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} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := b \cdot c + t_1\\ t_3 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;x \leq -8.8 \cdot 10^{+272}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{+201}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -5.5 \cdot 10^{-222}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 3.5 \cdot 10^{-243}:\\ \;\;\;\;b \cdot c - 27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{-78}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{+24}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.22 \cdot 10^{+119}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(y \cdot \left(x \cdot z\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))
        (t_3 (- (* b c) (* 4.0 (* x i)))))
   (if (<= x -8.8e+272)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -1.7e+201)
       t_3
       (if (<= x -5.5e-222)
         t_2
         (if (<= x 3.5e-243)
           (- (* b c) (* 27.0 (* j k)))
           (if (<= x 4.5e-78)
             t_2
             (if (<= x 2.6e-11)
               (+ (* b c) (* j (* k -27.0)))
               (if (<= x 2.45e+24)
                 t_1
                 (if (<= x 1.22e+119)
                   t_3
                   (* (* 18.0 t) (* y (* x 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 = -4.0 * (t * a);
	double t_2 = (b * c) + t_1;
	double t_3 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (x <= -8.8e+272) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.7e+201) {
		tmp = t_3;
	} else if (x <= -5.5e-222) {
		tmp = t_2;
	} else if (x <= 3.5e-243) {
		tmp = (b * c) - (27.0 * (j * k));
	} else if (x <= 4.5e-78) {
		tmp = t_2;
	} else if (x <= 2.6e-11) {
		tmp = (b * c) + (j * (k * -27.0));
	} else if (x <= 2.45e+24) {
		tmp = t_1;
	} else if (x <= 1.22e+119) {
		tmp = t_3;
	} else {
		tmp = (18.0 * t) * (y * (x * 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 = (-4.0d0) * (t * a)
    t_2 = (b * c) + t_1
    t_3 = (b * c) - (4.0d0 * (x * i))
    if (x <= (-8.8d+272)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-1.7d+201)) then
        tmp = t_3
    else if (x <= (-5.5d-222)) then
        tmp = t_2
    else if (x <= 3.5d-243) then
        tmp = (b * c) - (27.0d0 * (j * k))
    else if (x <= 4.5d-78) then
        tmp = t_2
    else if (x <= 2.6d-11) then
        tmp = (b * c) + (j * (k * (-27.0d0)))
    else if (x <= 2.45d+24) then
        tmp = t_1
    else if (x <= 1.22d+119) then
        tmp = t_3
    else
        tmp = (18.0d0 * t) * (y * (x * 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 = -4.0 * (t * a);
	double t_2 = (b * c) + t_1;
	double t_3 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (x <= -8.8e+272) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.7e+201) {
		tmp = t_3;
	} else if (x <= -5.5e-222) {
		tmp = t_2;
	} else if (x <= 3.5e-243) {
		tmp = (b * c) - (27.0 * (j * k));
	} else if (x <= 4.5e-78) {
		tmp = t_2;
	} else if (x <= 2.6e-11) {
		tmp = (b * c) + (j * (k * -27.0));
	} else if (x <= 2.45e+24) {
		tmp = t_1;
	} else if (x <= 1.22e+119) {
		tmp = t_3;
	} else {
		tmp = (18.0 * t) * (y * (x * 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 = -4.0 * (t * a)
	t_2 = (b * c) + t_1
	t_3 = (b * c) - (4.0 * (x * i))
	tmp = 0
	if x <= -8.8e+272:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -1.7e+201:
		tmp = t_3
	elif x <= -5.5e-222:
		tmp = t_2
	elif x <= 3.5e-243:
		tmp = (b * c) - (27.0 * (j * k))
	elif x <= 4.5e-78:
		tmp = t_2
	elif x <= 2.6e-11:
		tmp = (b * c) + (j * (k * -27.0))
	elif x <= 2.45e+24:
		tmp = t_1
	elif x <= 1.22e+119:
		tmp = t_3
	else:
		tmp = (18.0 * t) * (y * (x * 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(-4.0 * Float64(t * a))
	t_2 = Float64(Float64(b * c) + t_1)
	t_3 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	tmp = 0.0
	if (x <= -8.8e+272)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -1.7e+201)
		tmp = t_3;
	elseif (x <= -5.5e-222)
		tmp = t_2;
	elseif (x <= 3.5e-243)
		tmp = Float64(Float64(b * c) - Float64(27.0 * Float64(j * k)));
	elseif (x <= 4.5e-78)
		tmp = t_2;
	elseif (x <= 2.6e-11)
		tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)));
	elseif (x <= 2.45e+24)
		tmp = t_1;
	elseif (x <= 1.22e+119)
		tmp = t_3;
	else
		tmp = Float64(Float64(18.0 * t) * Float64(y * Float64(x * 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 = -4.0 * (t * a);
	t_2 = (b * c) + t_1;
	t_3 = (b * c) - (4.0 * (x * i));
	tmp = 0.0;
	if (x <= -8.8e+272)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -1.7e+201)
		tmp = t_3;
	elseif (x <= -5.5e-222)
		tmp = t_2;
	elseif (x <= 3.5e-243)
		tmp = (b * c) - (27.0 * (j * k));
	elseif (x <= 4.5e-78)
		tmp = t_2;
	elseif (x <= 2.6e-11)
		tmp = (b * c) + (j * (k * -27.0));
	elseif (x <= 2.45e+24)
		tmp = t_1;
	elseif (x <= 1.22e+119)
		tmp = t_3;
	else
		tmp = (18.0 * t) * (y * (x * 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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.8e+272], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.7e+201], t$95$3, If[LessEqual[x, -5.5e-222], t$95$2, If[LessEqual[x, 3.5e-243], N[(N[(b * c), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.5e-78], t$95$2, If[LessEqual[x, 2.6e-11], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.45e+24], t$95$1, If[LessEqual[x, 1.22e+119], t$95$3, N[(N[(18.0 * t), $MachinePrecision] * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 9: 49.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} t_1 := -4 \cdot \left(t \cdot a\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;x \leq -3.7 \cdot 10^{+271}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -1.2 \cdot 10^{+63}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;x \leq -1.1 \cdot 10^{-277}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{-240}:\\ \;\;\;\;b \cdot c + t_2\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-77}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{+122} \lor \neg \left(x \leq 1.1 \cdot 10^{+184}\right):\\ \;\;\;\;t_2 + x \cdot \left(i \cdot -4\right)\\ \mathbf{else}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot t\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 (* j (* k -27.0))))
   (if (<= x -3.7e+271)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -1.2e+63)
       (- (* b c) (* 4.0 (* x i)))
       (if (<= x -1.1e-277)
         (+ t_1 t_2)
         (if (<= x 1.6e-240)
           (+ (* b c) t_2)
           (if (<= x 6.5e-77)
             (+ (* b c) t_1)
             (if (or (<= x 8.2e+122) (not (<= x 1.1e+184)))
               (+ t_2 (* x (* i -4.0)))
               (* 18.0 (* (* y z) (* x t)))))))))))

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 = j * (k * -27.0);
	double tmp;
	if (x <= -3.7e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.2e+63) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (x <= -1.1e-277) {
		tmp = t_1 + t_2;
	} else if (x <= 1.6e-240) {
		tmp = (b * c) + t_2;
	} else if (x <= 6.5e-77) {
		tmp = (b * c) + t_1;
	} else if ((x <= 8.2e+122) || !(x <= 1.1e+184)) {
		tmp = t_2 + (x * (i * -4.0));
	} else {
		tmp = 18.0 * ((y * z) * (x * t));
	}
	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 = j * (k * (-27.0d0))
    if (x <= (-3.7d+271)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-1.2d+63)) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (x <= (-1.1d-277)) then
        tmp = t_1 + t_2
    else if (x <= 1.6d-240) then
        tmp = (b * c) + t_2
    else if (x <= 6.5d-77) then
        tmp = (b * c) + t_1
    else if ((x <= 8.2d+122) .or. (.not. (x <= 1.1d+184))) then
        tmp = t_2 + (x * (i * (-4.0d0)))
    else
        tmp = 18.0d0 * ((y * z) * (x * t))
    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 = j * (k * -27.0);
	double tmp;
	if (x <= -3.7e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.2e+63) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (x <= -1.1e-277) {
		tmp = t_1 + t_2;
	} else if (x <= 1.6e-240) {
		tmp = (b * c) + t_2;
	} else if (x <= 6.5e-77) {
		tmp = (b * c) + t_1;
	} else if ((x <= 8.2e+122) || !(x <= 1.1e+184)) {
		tmp = t_2 + (x * (i * -4.0));
	} else {
		tmp = 18.0 * ((y * z) * (x * t));
	}
	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 = j * (k * -27.0)
	tmp = 0
	if x <= -3.7e+271:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -1.2e+63:
		tmp = (b * c) - (4.0 * (x * i))
	elif x <= -1.1e-277:
		tmp = t_1 + t_2
	elif x <= 1.6e-240:
		tmp = (b * c) + t_2
	elif x <= 6.5e-77:
		tmp = (b * c) + t_1
	elif (x <= 8.2e+122) or not (x <= 1.1e+184):
		tmp = t_2 + (x * (i * -4.0))
	else:
		tmp = 18.0 * ((y * z) * (x * t))
	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(j * Float64(k * -27.0))
	tmp = 0.0
	if (x <= -3.7e+271)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -1.2e+63)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (x <= -1.1e-277)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.6e-240)
		tmp = Float64(Float64(b * c) + t_2);
	elseif (x <= 6.5e-77)
		tmp = Float64(Float64(b * c) + t_1);
	elseif ((x <= 8.2e+122) || !(x <= 1.1e+184))
		tmp = Float64(t_2 + Float64(x * Float64(i * -4.0)));
	else
		tmp = Float64(18.0 * Float64(Float64(y * z) * Float64(x * t)));
	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 = j * (k * -27.0);
	tmp = 0.0;
	if (x <= -3.7e+271)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -1.2e+63)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (x <= -1.1e-277)
		tmp = t_1 + t_2;
	elseif (x <= 1.6e-240)
		tmp = (b * c) + t_2;
	elseif (x <= 6.5e-77)
		tmp = (b * c) + t_1;
	elseif ((x <= 8.2e+122) || ~((x <= 1.1e+184)))
		tmp = t_2 + (x * (i * -4.0));
	else
		tmp = 18.0 * ((y * z) * (x * t));
	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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.7e+271], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.2e+63], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.1e-277], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.6e-240], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], If[LessEqual[x, 6.5e-77], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[Or[LessEqual[x, 8.2e+122], N[Not[LessEqual[x, 1.1e+184]], $MachinePrecision]], N[(t$95$2 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(18.0 * N[(N[(y * z), $MachinePrecision] * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 10: 49.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} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;x \leq -5 \cdot 10^{+271}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -1.35 \cdot 10^{+63}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;x \leq -3.8 \cdot 10^{-278}:\\ \;\;\;\;t_2 - 27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 8.8 \cdot 10^{-240}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;x \leq 7 \cdot 10^{-77}:\\ \;\;\;\;b \cdot c + t_2\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{+122} \lor \neg \left(x \leq 4 \cdot 10^{+186}\right):\\ \;\;\;\;t_1 + x \cdot \left(i \cdot -4\right)\\ \mathbf{else}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot t\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 (* -4.0 (* t a))))
   (if (<= x -5e+271)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -1.35e+63)
       (- (* b c) (* 4.0 (* x i)))
       (if (<= x -3.8e-278)
         (- t_2 (* 27.0 (* j k)))
         (if (<= x 8.8e-240)
           (+ (* b c) t_1)
           (if (<= x 7e-77)
             (+ (* b c) t_2)
             (if (or (<= x 3.1e+122) (not (<= x 4e+186)))
               (+ t_1 (* x (* i -4.0)))
               (* 18.0 (* (* y z) (* x t)))))))))))

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 = -4.0 * (t * a);
	double tmp;
	if (x <= -5e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.35e+63) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (x <= -3.8e-278) {
		tmp = t_2 - (27.0 * (j * k));
	} else if (x <= 8.8e-240) {
		tmp = (b * c) + t_1;
	} else if (x <= 7e-77) {
		tmp = (b * c) + t_2;
	} else if ((x <= 3.1e+122) || !(x <= 4e+186)) {
		tmp = t_1 + (x * (i * -4.0));
	} else {
		tmp = 18.0 * ((y * z) * (x * t));
	}
	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 = (-4.0d0) * (t * a)
    if (x <= (-5d+271)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-1.35d+63)) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (x <= (-3.8d-278)) then
        tmp = t_2 - (27.0d0 * (j * k))
    else if (x <= 8.8d-240) then
        tmp = (b * c) + t_1
    else if (x <= 7d-77) then
        tmp = (b * c) + t_2
    else if ((x <= 3.1d+122) .or. (.not. (x <= 4d+186))) then
        tmp = t_1 + (x * (i * (-4.0d0)))
    else
        tmp = 18.0d0 * ((y * z) * (x * t))
    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 = -4.0 * (t * a);
	double tmp;
	if (x <= -5e+271) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.35e+63) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (x <= -3.8e-278) {
		tmp = t_2 - (27.0 * (j * k));
	} else if (x <= 8.8e-240) {
		tmp = (b * c) + t_1;
	} else if (x <= 7e-77) {
		tmp = (b * c) + t_2;
	} else if ((x <= 3.1e+122) || !(x <= 4e+186)) {
		tmp = t_1 + (x * (i * -4.0));
	} else {
		tmp = 18.0 * ((y * z) * (x * t));
	}
	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 = -4.0 * (t * a)
	tmp = 0
	if x <= -5e+271:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -1.35e+63:
		tmp = (b * c) - (4.0 * (x * i))
	elif x <= -3.8e-278:
		tmp = t_2 - (27.0 * (j * k))
	elif x <= 8.8e-240:
		tmp = (b * c) + t_1
	elif x <= 7e-77:
		tmp = (b * c) + t_2
	elif (x <= 3.1e+122) or not (x <= 4e+186):
		tmp = t_1 + (x * (i * -4.0))
	else:
		tmp = 18.0 * ((y * z) * (x * t))
	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(-4.0 * Float64(t * a))
	tmp = 0.0
	if (x <= -5e+271)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -1.35e+63)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (x <= -3.8e-278)
		tmp = Float64(t_2 - Float64(27.0 * Float64(j * k)));
	elseif (x <= 8.8e-240)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (x <= 7e-77)
		tmp = Float64(Float64(b * c) + t_2);
	elseif ((x <= 3.1e+122) || !(x <= 4e+186))
		tmp = Float64(t_1 + Float64(x * Float64(i * -4.0)));
	else
		tmp = Float64(18.0 * Float64(Float64(y * z) * Float64(x * t)));
	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 = -4.0 * (t * a);
	tmp = 0.0;
	if (x <= -5e+271)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -1.35e+63)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (x <= -3.8e-278)
		tmp = t_2 - (27.0 * (j * k));
	elseif (x <= 8.8e-240)
		tmp = (b * c) + t_1;
	elseif (x <= 7e-77)
		tmp = (b * c) + t_2;
	elseif ((x <= 3.1e+122) || ~((x <= 4e+186)))
		tmp = t_1 + (x * (i * -4.0));
	else
		tmp = 18.0 * ((y * z) * (x * t));
	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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5e+271], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.35e+63], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.8e-278], N[(t$95$2 - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8.8e-240], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 7e-77], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], If[Or[LessEqual[x, 3.1e+122], N[Not[LessEqual[x, 4e+186]], $MachinePrecision]], N[(t$95$1 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(18.0 * N[(N[(y * z), $MachinePrecision] * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 11: 71.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} t_1 := x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ t_2 := b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ t_3 := 27 \cdot \left(j \cdot k\right)\\ \mathbf{if}\;x \leq -5.8 \cdot 10^{+190}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{+59}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -0.95:\\ \;\;\;\;b \cdot c - \left(t_3 + 4 \cdot \left(x \cdot i\right)\right)\\ \mathbf{elif}\;x \leq -5.8 \cdot 10^{-69}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 4.8 \cdot 10^{-11}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - t_3\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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 (- (* 18.0 (* y (* z t))) (* 4.0 i))))
        (t_2 (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))))
        (t_3 (* 27.0 (* j k))))
   (if (<= x -5.8e+190)
     t_1
     (if (<= x -1.25e+59)
       t_2
       (if (<= x -0.95)
         (- (* b c) (+ t_3 (* 4.0 (* x i))))
         (if (<= x -5.8e-69)
           t_2
           (if (<= x 4.8e-11) (- (+ (* b c) (* -4.0 (* t a))) t_3) t_1)))))))

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 * ((18.0 * (y * (z * t))) - (4.0 * i));
	double t_2 = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	double t_3 = 27.0 * (j * k);
	double tmp;
	if (x <= -5.8e+190) {
		tmp = t_1;
	} else if (x <= -1.25e+59) {
		tmp = t_2;
	} else if (x <= -0.95) {
		tmp = (b * c) - (t_3 + (4.0 * (x * i)));
	} else if (x <= -5.8e-69) {
		tmp = t_2;
	} else if (x <= 4.8e-11) {
		tmp = ((b * c) + (-4.0 * (t * a))) - t_3;
	} else {
		tmp = t_1;
	}
	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 = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    t_2 = (b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))
    t_3 = 27.0d0 * (j * k)
    if (x <= (-5.8d+190)) then
        tmp = t_1
    else if (x <= (-1.25d+59)) then
        tmp = t_2
    else if (x <= (-0.95d0)) then
        tmp = (b * c) - (t_3 + (4.0d0 * (x * i)))
    else if (x <= (-5.8d-69)) then
        tmp = t_2
    else if (x <= 4.8d-11) then
        tmp = ((b * c) + ((-4.0d0) * (t * a))) - t_3
    else
        tmp = t_1
    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 * ((18.0 * (y * (z * t))) - (4.0 * i));
	double t_2 = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	double t_3 = 27.0 * (j * k);
	double tmp;
	if (x <= -5.8e+190) {
		tmp = t_1;
	} else if (x <= -1.25e+59) {
		tmp = t_2;
	} else if (x <= -0.95) {
		tmp = (b * c) - (t_3 + (4.0 * (x * i)));
	} else if (x <= -5.8e-69) {
		tmp = t_2;
	} else if (x <= 4.8e-11) {
		tmp = ((b * c) + (-4.0 * (t * a))) - t_3;
	} else {
		tmp = t_1;
	}
	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 * ((18.0 * (y * (z * t))) - (4.0 * i))
	t_2 = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))
	t_3 = 27.0 * (j * k)
	tmp = 0
	if x <= -5.8e+190:
		tmp = t_1
	elif x <= -1.25e+59:
		tmp = t_2
	elif x <= -0.95:
		tmp = (b * c) - (t_3 + (4.0 * (x * i)))
	elif x <= -5.8e-69:
		tmp = t_2
	elif x <= 4.8e-11:
		tmp = ((b * c) + (-4.0 * (t * a))) - t_3
	else:
		tmp = t_1
	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(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)))
	t_2 = Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0))))
	t_3 = Float64(27.0 * Float64(j * k))
	tmp = 0.0
	if (x <= -5.8e+190)
		tmp = t_1;
	elseif (x <= -1.25e+59)
		tmp = t_2;
	elseif (x <= -0.95)
		tmp = Float64(Float64(b * c) - Float64(t_3 + Float64(4.0 * Float64(x * i))));
	elseif (x <= -5.8e-69)
		tmp = t_2;
	elseif (x <= 4.8e-11)
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - t_3);
	else
		tmp = t_1;
	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 * ((18.0 * (y * (z * t))) - (4.0 * i));
	t_2 = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	t_3 = 27.0 * (j * k);
	tmp = 0.0;
	if (x <= -5.8e+190)
		tmp = t_1;
	elseif (x <= -1.25e+59)
		tmp = t_2;
	elseif (x <= -0.95)
		tmp = (b * c) - (t_3 + (4.0 * (x * i)));
	elseif (x <= -5.8e-69)
		tmp = t_2;
	elseif (x <= 4.8e-11)
		tmp = ((b * c) + (-4.0 * (t * a))) - t_3;
	else
		tmp = t_1;
	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[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = 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]}, Block[{t$95$3 = N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.8e+190], t$95$1, If[LessEqual[x, -1.25e+59], t$95$2, If[LessEqual[x, -0.95], N[(N[(b * c), $MachinePrecision] - N[(t$95$3 + N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.8e-69], t$95$2, If[LessEqual[x, 4.8e-11], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision], t$95$1]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 12: 78.3% 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}\;z \leq -2.5 \cdot 10^{-25}:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(z \cdot \left(x \cdot y\right)\right) + j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;z \leq 1.52 \cdot 10^{+254}:\\ \;\;\;\;\left(\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\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 (<= z -2.5e-25)
   (+ (* (* 18.0 t) (* z (* x y))) (* j (* k -27.0)))
   (if (<= z 1.52e+254)
     (- (- (- (* b c) (* 4.0 (* t a))) (* (* x 4.0) i)) (* (* j 27.0) k))
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i))))))

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 (z <= -2.5e-25) {
		tmp = ((18.0 * t) * (z * (x * y))) + (j * (k * -27.0));
	} else if (z <= 1.52e+254) {
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 (z <= (-2.5d-25)) then
        tmp = ((18.0d0 * t) * (z * (x * y))) + (j * (k * (-27.0d0)))
    else if (z <= 1.52d+254) then
        tmp = (((b * c) - (4.0d0 * (t * a))) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
    else
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    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 (z <= -2.5e-25) {
		tmp = ((18.0 * t) * (z * (x * y))) + (j * (k * -27.0));
	} else if (z <= 1.52e+254) {
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	} else {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	}
	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 z <= -2.5e-25:
		tmp = ((18.0 * t) * (z * (x * y))) + (j * (k * -27.0))
	elif z <= 1.52e+254:
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * k)
	else:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	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 (z <= -2.5e-25)
		tmp = Float64(Float64(Float64(18.0 * t) * Float64(z * Float64(x * y))) + Float64(j * Float64(k * -27.0)));
	elseif (z <= 1.52e+254)
		tmp = Float64(Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k));
	else
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	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 (z <= -2.5e-25)
		tmp = ((18.0 * t) * (z * (x * y))) + (j * (k * -27.0));
	elseif (z <= 1.52e+254)
		tmp = (((b * c) - (4.0 * (t * a))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	else
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	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[z, -2.5e-25], N[(N[(N[(18.0 * t), $MachinePrecision] * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.52e+254], N[(N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 13: 57.0% 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} t_1 := j \cdot \left(k \cdot -27\right) + x \cdot \left(i \cdot -4\right)\\ t_2 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{if}\;t \leq -2.65 \cdot 10^{-34}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq -1.2 \cdot 10^{-241}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 1.9 \cdot 10^{-250}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;t \leq 7.6 \cdot 10^{-173}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 1.2 \cdot 10^{+37}:\\ \;\;\;\;b \cdot c - 27 \cdot \left(j \cdot k\right)\\ \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)) (* x (* i -4.0))))
        (t_2 (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))))
   (if (<= t -2.65e-34)
     t_2
     (if (<= t -1.2e-241)
       t_1
       (if (<= t 1.9e-250)
         (+ (* b c) (* -4.0 (* t a)))
         (if (<= t 7.6e-173)
           t_1
           (if (<= t 1.2e+37) (- (* b c) (* 27.0 (* j k))) 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)) + (x * (i * -4.0));
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -2.65e-34) {
		tmp = t_2;
	} else if (t <= -1.2e-241) {
		tmp = t_1;
	} else if (t <= 1.9e-250) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (t <= 7.6e-173) {
		tmp = t_1;
	} else if (t <= 1.2e+37) {
		tmp = (b * c) - (27.0 * (j * k));
	} 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))) + (x * (i * (-4.0d0)))
    t_2 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    if (t <= (-2.65d-34)) then
        tmp = t_2
    else if (t <= (-1.2d-241)) then
        tmp = t_1
    else if (t <= 1.9d-250) then
        tmp = (b * c) + ((-4.0d0) * (t * a))
    else if (t <= 7.6d-173) then
        tmp = t_1
    else if (t <= 1.2d+37) then
        tmp = (b * c) - (27.0d0 * (j * k))
    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)) + (x * (i * -4.0));
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -2.65e-34) {
		tmp = t_2;
	} else if (t <= -1.2e-241) {
		tmp = t_1;
	} else if (t <= 1.9e-250) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (t <= 7.6e-173) {
		tmp = t_1;
	} else if (t <= 1.2e+37) {
		tmp = (b * c) - (27.0 * (j * k));
	} 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)) + (x * (i * -4.0))
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	tmp = 0
	if t <= -2.65e-34:
		tmp = t_2
	elif t <= -1.2e-241:
		tmp = t_1
	elif t <= 1.9e-250:
		tmp = (b * c) + (-4.0 * (t * a))
	elif t <= 7.6e-173:
		tmp = t_1
	elif t <= 1.2e+37:
		tmp = (b * c) - (27.0 * (j * k))
	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(x * Float64(i * -4.0)))
	t_2 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	tmp = 0.0
	if (t <= -2.65e-34)
		tmp = t_2;
	elseif (t <= -1.2e-241)
		tmp = t_1;
	elseif (t <= 1.9e-250)
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)));
	elseif (t <= 7.6e-173)
		tmp = t_1;
	elseif (t <= 1.2e+37)
		tmp = Float64(Float64(b * c) - Float64(27.0 * Float64(j * k)));
	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)) + (x * (i * -4.0));
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	tmp = 0.0;
	if (t <= -2.65e-34)
		tmp = t_2;
	elseif (t <= -1.2e-241)
		tmp = t_1;
	elseif (t <= 1.9e-250)
		tmp = (b * c) + (-4.0 * (t * a));
	elseif (t <= 7.6e-173)
		tmp = t_1;
	elseif (t <= 1.2e+37)
		tmp = (b * c) - (27.0 * (j * k));
	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[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.65e-34], t$95$2, If[LessEqual[t, -1.2e-241], t$95$1, If[LessEqual[t, 1.9e-250], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7.6e-173], t$95$1, If[LessEqual[t, 1.2e+37], N[(N[(b * c), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 14: 71.9% 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} t_1 := b \cdot c - \left(27 \cdot \left(j \cdot k\right) + 4 \cdot \left(x \cdot i\right)\right)\\ t_2 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{if}\;t \leq -8 \cdot 10^{+51}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq -2.5 \cdot 10^{-242}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq -2 \cdot 10^{-271}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;t \leq 3.3 \cdot 10^{+37}:\\ \;\;\;\;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 (- (* b c) (+ (* 27.0 (* j k)) (* 4.0 (* x i)))))
        (t_2 (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))))
   (if (<= t -8e+51)
     t_2
     (if (<= t -2.5e-242)
       t_1
       (if (<= t -2e-271)
         (+ (* b c) (* -4.0 (* t a)))
         (if (<= t 3.3e+37) 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 = (b * c) - ((27.0 * (j * k)) + (4.0 * (x * i)));
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -8e+51) {
		tmp = t_2;
	} else if (t <= -2.5e-242) {
		tmp = t_1;
	} else if (t <= -2e-271) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (t <= 3.3e+37) {
		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 = (b * c) - ((27.0d0 * (j * k)) + (4.0d0 * (x * i)))
    t_2 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    if (t <= (-8d+51)) then
        tmp = t_2
    else if (t <= (-2.5d-242)) then
        tmp = t_1
    else if (t <= (-2d-271)) then
        tmp = (b * c) + ((-4.0d0) * (t * a))
    else if (t <= 3.3d+37) 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 = (b * c) - ((27.0 * (j * k)) + (4.0 * (x * i)));
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -8e+51) {
		tmp = t_2;
	} else if (t <= -2.5e-242) {
		tmp = t_1;
	} else if (t <= -2e-271) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (t <= 3.3e+37) {
		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 = (b * c) - ((27.0 * (j * k)) + (4.0 * (x * i)))
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	tmp = 0
	if t <= -8e+51:
		tmp = t_2
	elif t <= -2.5e-242:
		tmp = t_1
	elif t <= -2e-271:
		tmp = (b * c) + (-4.0 * (t * a))
	elif t <= 3.3e+37:
		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(b * c) - Float64(Float64(27.0 * Float64(j * k)) + Float64(4.0 * Float64(x * i))))
	t_2 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	tmp = 0.0
	if (t <= -8e+51)
		tmp = t_2;
	elseif (t <= -2.5e-242)
		tmp = t_1;
	elseif (t <= -2e-271)
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)));
	elseif (t <= 3.3e+37)
		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 = (b * c) - ((27.0 * (j * k)) + (4.0 * (x * i)));
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	tmp = 0.0;
	if (t <= -8e+51)
		tmp = t_2;
	elseif (t <= -2.5e-242)
		tmp = t_1;
	elseif (t <= -2e-271)
		tmp = (b * c) + (-4.0 * (t * a));
	elseif (t <= 3.3e+37)
		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[(b * c), $MachinePrecision] - N[(N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8e+51], t$95$2, If[LessEqual[t, -2.5e-242], t$95$1, If[LessEqual[t, -2e-271], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.3e+37], t$95$1, t$95$2]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 15: 34.0% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ t_2 := 18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{if}\;a \leq -1.15 \cdot 10^{+95}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -4.4 \cdot 10^{+82}:\\ \;\;\;\;-4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;a \leq -8.5 \cdot 10^{+78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -1.2 \cdot 10^{-59}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq -6.2 \cdot 10^{-217}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;a \leq 3.5 \cdot 10^{-25}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 6.5 \cdot 10^{+98}:\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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 (* 18.0 (* t (* z (* x y))))))
   (if (<= a -1.15e+95)
     t_1
     (if (<= a -4.4e+82)
       (* -4.0 (* x i))
       (if (<= a -8.5e+78)
         t_1
         (if (<= a -1.2e-59)
           t_2
           (if (<= a -6.2e-217)
             (* b c)
             (if (<= a 3.5e-25) t_2 (if (<= a 6.5e+98) (* b c) t_1)))))))))

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 = 18.0 * (t * (z * (x * y)));
	double tmp;
	if (a <= -1.15e+95) {
		tmp = t_1;
	} else if (a <= -4.4e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -8.5e+78) {
		tmp = t_1;
	} else if (a <= -1.2e-59) {
		tmp = t_2;
	} else if (a <= -6.2e-217) {
		tmp = b * c;
	} else if (a <= 3.5e-25) {
		tmp = t_2;
	} else if (a <= 6.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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 = 18.0d0 * (t * (z * (x * y)))
    if (a <= (-1.15d+95)) then
        tmp = t_1
    else if (a <= (-4.4d+82)) then
        tmp = (-4.0d0) * (x * i)
    else if (a <= (-8.5d+78)) then
        tmp = t_1
    else if (a <= (-1.2d-59)) then
        tmp = t_2
    else if (a <= (-6.2d-217)) then
        tmp = b * c
    else if (a <= 3.5d-25) then
        tmp = t_2
    else if (a <= 6.5d+98) then
        tmp = b * c
    else
        tmp = t_1
    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 = 18.0 * (t * (z * (x * y)));
	double tmp;
	if (a <= -1.15e+95) {
		tmp = t_1;
	} else if (a <= -4.4e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -8.5e+78) {
		tmp = t_1;
	} else if (a <= -1.2e-59) {
		tmp = t_2;
	} else if (a <= -6.2e-217) {
		tmp = b * c;
	} else if (a <= 3.5e-25) {
		tmp = t_2;
	} else if (a <= 6.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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 = 18.0 * (t * (z * (x * y)))
	tmp = 0
	if a <= -1.15e+95:
		tmp = t_1
	elif a <= -4.4e+82:
		tmp = -4.0 * (x * i)
	elif a <= -8.5e+78:
		tmp = t_1
	elif a <= -1.2e-59:
		tmp = t_2
	elif a <= -6.2e-217:
		tmp = b * c
	elif a <= 3.5e-25:
		tmp = t_2
	elif a <= 6.5e+98:
		tmp = b * c
	else:
		tmp = t_1
	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(18.0 * Float64(t * Float64(z * Float64(x * y))))
	tmp = 0.0
	if (a <= -1.15e+95)
		tmp = t_1;
	elseif (a <= -4.4e+82)
		tmp = Float64(-4.0 * Float64(x * i));
	elseif (a <= -8.5e+78)
		tmp = t_1;
	elseif (a <= -1.2e-59)
		tmp = t_2;
	elseif (a <= -6.2e-217)
		tmp = Float64(b * c);
	elseif (a <= 3.5e-25)
		tmp = t_2;
	elseif (a <= 6.5e+98)
		tmp = Float64(b * c);
	else
		tmp = t_1;
	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 = 18.0 * (t * (z * (x * y)));
	tmp = 0.0;
	if (a <= -1.15e+95)
		tmp = t_1;
	elseif (a <= -4.4e+82)
		tmp = -4.0 * (x * i);
	elseif (a <= -8.5e+78)
		tmp = t_1;
	elseif (a <= -1.2e-59)
		tmp = t_2;
	elseif (a <= -6.2e-217)
		tmp = b * c;
	elseif (a <= 3.5e-25)
		tmp = t_2;
	elseif (a <= 6.5e+98)
		tmp = b * c;
	else
		tmp = t_1;
	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[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1.15e+95], t$95$1, If[LessEqual[a, -4.4e+82], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -8.5e+78], t$95$1, If[LessEqual[a, -1.2e-59], t$95$2, If[LessEqual[a, -6.2e-217], N[(b * c), $MachinePrecision], If[LessEqual[a, 3.5e-25], t$95$2, If[LessEqual[a, 6.5e+98], N[(b * c), $MachinePrecision], t$95$1]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 16: 33.9% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;a \leq -1.6 \cdot 10^{+96}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -5 \cdot 10^{+82}:\\ \;\;\;\;-4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;a \leq -2.55 \cdot 10^{+79}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -1.32 \cdot 10^{-68}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;a \leq -6.2 \cdot 10^{-222}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;a \leq 510:\\ \;\;\;\;y \cdot \left(t \cdot \left(x \cdot \left(18 \cdot z\right)\right)\right)\\ \mathbf{elif}\;a \leq 5.5 \cdot 10^{+98}:\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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))))
   (if (<= a -1.6e+96)
     t_1
     (if (<= a -5e+82)
       (* -4.0 (* x i))
       (if (<= a -2.55e+79)
         t_1
         (if (<= a -1.32e-68)
           (* 18.0 (* t (* z (* x y))))
           (if (<= a -6.2e-222)
             (* b c)
             (if (<= a 510.0)
               (* y (* t (* x (* 18.0 z))))
               (if (<= a 5.5e+98) (* b c) t_1)))))))))

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 tmp;
	if (a <= -1.6e+96) {
		tmp = t_1;
	} else if (a <= -5e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -2.55e+79) {
		tmp = t_1;
	} else if (a <= -1.32e-68) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (a <= -6.2e-222) {
		tmp = b * c;
	} else if (a <= 510.0) {
		tmp = y * (t * (x * (18.0 * z)));
	} else if (a <= 5.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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 = (-4.0d0) * (t * a)
    if (a <= (-1.6d+96)) then
        tmp = t_1
    else if (a <= (-5d+82)) then
        tmp = (-4.0d0) * (x * i)
    else if (a <= (-2.55d+79)) then
        tmp = t_1
    else if (a <= (-1.32d-68)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (a <= (-6.2d-222)) then
        tmp = b * c
    else if (a <= 510.0d0) then
        tmp = y * (t * (x * (18.0d0 * z)))
    else if (a <= 5.5d+98) then
        tmp = b * c
    else
        tmp = t_1
    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 tmp;
	if (a <= -1.6e+96) {
		tmp = t_1;
	} else if (a <= -5e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -2.55e+79) {
		tmp = t_1;
	} else if (a <= -1.32e-68) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (a <= -6.2e-222) {
		tmp = b * c;
	} else if (a <= 510.0) {
		tmp = y * (t * (x * (18.0 * z)));
	} else if (a <= 5.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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)
	tmp = 0
	if a <= -1.6e+96:
		tmp = t_1
	elif a <= -5e+82:
		tmp = -4.0 * (x * i)
	elif a <= -2.55e+79:
		tmp = t_1
	elif a <= -1.32e-68:
		tmp = 18.0 * (t * (z * (x * y)))
	elif a <= -6.2e-222:
		tmp = b * c
	elif a <= 510.0:
		tmp = y * (t * (x * (18.0 * z)))
	elif a <= 5.5e+98:
		tmp = b * c
	else:
		tmp = t_1
	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))
	tmp = 0.0
	if (a <= -1.6e+96)
		tmp = t_1;
	elseif (a <= -5e+82)
		tmp = Float64(-4.0 * Float64(x * i));
	elseif (a <= -2.55e+79)
		tmp = t_1;
	elseif (a <= -1.32e-68)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (a <= -6.2e-222)
		tmp = Float64(b * c);
	elseif (a <= 510.0)
		tmp = Float64(y * Float64(t * Float64(x * Float64(18.0 * z))));
	elseif (a <= 5.5e+98)
		tmp = Float64(b * c);
	else
		tmp = t_1;
	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);
	tmp = 0.0;
	if (a <= -1.6e+96)
		tmp = t_1;
	elseif (a <= -5e+82)
		tmp = -4.0 * (x * i);
	elseif (a <= -2.55e+79)
		tmp = t_1;
	elseif (a <= -1.32e-68)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (a <= -6.2e-222)
		tmp = b * c;
	elseif (a <= 510.0)
		tmp = y * (t * (x * (18.0 * z)));
	elseif (a <= 5.5e+98)
		tmp = b * c;
	else
		tmp = t_1;
	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]}, If[LessEqual[a, -1.6e+96], t$95$1, If[LessEqual[a, -5e+82], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -2.55e+79], t$95$1, If[LessEqual[a, -1.32e-68], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -6.2e-222], N[(b * c), $MachinePrecision], If[LessEqual[a, 510.0], N[(y * N[(t * N[(x * N[(18.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.5e+98], N[(b * c), $MachinePrecision], t$95$1]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 17: 33.7% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;a \leq -1.1 \cdot 10^{+97}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -4.4 \cdot 10^{+82}:\\ \;\;\;\;-4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;a \leq -1.15 \cdot 10^{+79}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;a \leq -2.1 \cdot 10^{-67}:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(y \cdot \left(x \cdot z\right)\right)\\ \mathbf{elif}\;a \leq -1.5 \cdot 10^{-219}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;a \leq 82000:\\ \;\;\;\;y \cdot \left(t \cdot \left(x \cdot \left(18 \cdot z\right)\right)\right)\\ \mathbf{elif}\;a \leq 5.5 \cdot 10^{+98}:\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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))))
   (if (<= a -1.1e+97)
     t_1
     (if (<= a -4.4e+82)
       (* -4.0 (* x i))
       (if (<= a -1.15e+79)
         t_1
         (if (<= a -2.1e-67)
           (* (* 18.0 t) (* y (* x z)))
           (if (<= a -1.5e-219)
             (* b c)
             (if (<= a 82000.0)
               (* y (* t (* x (* 18.0 z))))
               (if (<= a 5.5e+98) (* b c) t_1)))))))))

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 tmp;
	if (a <= -1.1e+97) {
		tmp = t_1;
	} else if (a <= -4.4e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -1.15e+79) {
		tmp = t_1;
	} else if (a <= -2.1e-67) {
		tmp = (18.0 * t) * (y * (x * z));
	} else if (a <= -1.5e-219) {
		tmp = b * c;
	} else if (a <= 82000.0) {
		tmp = y * (t * (x * (18.0 * z)));
	} else if (a <= 5.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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 = (-4.0d0) * (t * a)
    if (a <= (-1.1d+97)) then
        tmp = t_1
    else if (a <= (-4.4d+82)) then
        tmp = (-4.0d0) * (x * i)
    else if (a <= (-1.15d+79)) then
        tmp = t_1
    else if (a <= (-2.1d-67)) then
        tmp = (18.0d0 * t) * (y * (x * z))
    else if (a <= (-1.5d-219)) then
        tmp = b * c
    else if (a <= 82000.0d0) then
        tmp = y * (t * (x * (18.0d0 * z)))
    else if (a <= 5.5d+98) then
        tmp = b * c
    else
        tmp = t_1
    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 tmp;
	if (a <= -1.1e+97) {
		tmp = t_1;
	} else if (a <= -4.4e+82) {
		tmp = -4.0 * (x * i);
	} else if (a <= -1.15e+79) {
		tmp = t_1;
	} else if (a <= -2.1e-67) {
		tmp = (18.0 * t) * (y * (x * z));
	} else if (a <= -1.5e-219) {
		tmp = b * c;
	} else if (a <= 82000.0) {
		tmp = y * (t * (x * (18.0 * z)));
	} else if (a <= 5.5e+98) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	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)
	tmp = 0
	if a <= -1.1e+97:
		tmp = t_1
	elif a <= -4.4e+82:
		tmp = -4.0 * (x * i)
	elif a <= -1.15e+79:
		tmp = t_1
	elif a <= -2.1e-67:
		tmp = (18.0 * t) * (y * (x * z))
	elif a <= -1.5e-219:
		tmp = b * c
	elif a <= 82000.0:
		tmp = y * (t * (x * (18.0 * z)))
	elif a <= 5.5e+98:
		tmp = b * c
	else:
		tmp = t_1
	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))
	tmp = 0.0
	if (a <= -1.1e+97)
		tmp = t_1;
	elseif (a <= -4.4e+82)
		tmp = Float64(-4.0 * Float64(x * i));
	elseif (a <= -1.15e+79)
		tmp = t_1;
	elseif (a <= -2.1e-67)
		tmp = Float64(Float64(18.0 * t) * Float64(y * Float64(x * z)));
	elseif (a <= -1.5e-219)
		tmp = Float64(b * c);
	elseif (a <= 82000.0)
		tmp = Float64(y * Float64(t * Float64(x * Float64(18.0 * z))));
	elseif (a <= 5.5e+98)
		tmp = Float64(b * c);
	else
		tmp = t_1;
	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);
	tmp = 0.0;
	if (a <= -1.1e+97)
		tmp = t_1;
	elseif (a <= -4.4e+82)
		tmp = -4.0 * (x * i);
	elseif (a <= -1.15e+79)
		tmp = t_1;
	elseif (a <= -2.1e-67)
		tmp = (18.0 * t) * (y * (x * z));
	elseif (a <= -1.5e-219)
		tmp = b * c;
	elseif (a <= 82000.0)
		tmp = y * (t * (x * (18.0 * z)));
	elseif (a <= 5.5e+98)
		tmp = b * c;
	else
		tmp = t_1;
	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]}, If[LessEqual[a, -1.1e+97], t$95$1, If[LessEqual[a, -4.4e+82], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -1.15e+79], t$95$1, If[LessEqual[a, -2.1e-67], N[(N[(18.0 * t), $MachinePrecision] * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -1.5e-219], N[(b * c), $MachinePrecision], If[LessEqual[a, 82000.0], N[(y * N[(t * N[(x * N[(18.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.5e+98], N[(b * c), $MachinePrecision], t$95$1]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 18: 44.2% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ t_2 := -4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;x \leq -5.2 \cdot 10^{+273}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\\ \mathbf{elif}\;x \leq -1.72 \cdot 10^{+201}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{-77}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;x \leq 1.08 \cdot 10^{-15}:\\ \;\;\;\;\left(j \cdot k\right) \cdot -27\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{+29}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 6.6 \cdot 10^{+117}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;\left(18 \cdot t\right) \cdot \left(y \cdot \left(x \cdot z\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 (* -4.0 (* x i))))
   (if (<= x -5.2e+273)
     (* 18.0 (* t (* z (* x y))))
     (if (<= x -1.72e+201)
       t_2
       (if (<= x 5.5e-77)
         (+ (* b c) t_1)
         (if (<= x 1.08e-15)
           (* (* j k) -27.0)
           (if (<= x 1.25e+29)
             t_1
             (if (<= x 6.6e+117) t_2 (* (* 18.0 t) (* y (* x 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 = -4.0 * (t * a);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if (x <= -5.2e+273) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.72e+201) {
		tmp = t_2;
	} else if (x <= 5.5e-77) {
		tmp = (b * c) + t_1;
	} else if (x <= 1.08e-15) {
		tmp = (j * k) * -27.0;
	} else if (x <= 1.25e+29) {
		tmp = t_1;
	} else if (x <= 6.6e+117) {
		tmp = t_2;
	} else {
		tmp = (18.0 * t) * (y * (x * 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) :: tmp
    t_1 = (-4.0d0) * (t * a)
    t_2 = (-4.0d0) * (x * i)
    if (x <= (-5.2d+273)) then
        tmp = 18.0d0 * (t * (z * (x * y)))
    else if (x <= (-1.72d+201)) then
        tmp = t_2
    else if (x <= 5.5d-77) then
        tmp = (b * c) + t_1
    else if (x <= 1.08d-15) then
        tmp = (j * k) * (-27.0d0)
    else if (x <= 1.25d+29) then
        tmp = t_1
    else if (x <= 6.6d+117) then
        tmp = t_2
    else
        tmp = (18.0d0 * t) * (y * (x * 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 = -4.0 * (t * a);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if (x <= -5.2e+273) {
		tmp = 18.0 * (t * (z * (x * y)));
	} else if (x <= -1.72e+201) {
		tmp = t_2;
	} else if (x <= 5.5e-77) {
		tmp = (b * c) + t_1;
	} else if (x <= 1.08e-15) {
		tmp = (j * k) * -27.0;
	} else if (x <= 1.25e+29) {
		tmp = t_1;
	} else if (x <= 6.6e+117) {
		tmp = t_2;
	} else {
		tmp = (18.0 * t) * (y * (x * 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 = -4.0 * (t * a)
	t_2 = -4.0 * (x * i)
	tmp = 0
	if x <= -5.2e+273:
		tmp = 18.0 * (t * (z * (x * y)))
	elif x <= -1.72e+201:
		tmp = t_2
	elif x <= 5.5e-77:
		tmp = (b * c) + t_1
	elif x <= 1.08e-15:
		tmp = (j * k) * -27.0
	elif x <= 1.25e+29:
		tmp = t_1
	elif x <= 6.6e+117:
		tmp = t_2
	else:
		tmp = (18.0 * t) * (y * (x * 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(-4.0 * Float64(t * a))
	t_2 = Float64(-4.0 * Float64(x * i))
	tmp = 0.0
	if (x <= -5.2e+273)
		tmp = Float64(18.0 * Float64(t * Float64(z * Float64(x * y))));
	elseif (x <= -1.72e+201)
		tmp = t_2;
	elseif (x <= 5.5e-77)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (x <= 1.08e-15)
		tmp = Float64(Float64(j * k) * -27.0);
	elseif (x <= 1.25e+29)
		tmp = t_1;
	elseif (x <= 6.6e+117)
		tmp = t_2;
	else
		tmp = Float64(Float64(18.0 * t) * Float64(y * Float64(x * 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 = -4.0 * (t * a);
	t_2 = -4.0 * (x * i);
	tmp = 0.0;
	if (x <= -5.2e+273)
		tmp = 18.0 * (t * (z * (x * y)));
	elseif (x <= -1.72e+201)
		tmp = t_2;
	elseif (x <= 5.5e-77)
		tmp = (b * c) + t_1;
	elseif (x <= 1.08e-15)
		tmp = (j * k) * -27.0;
	elseif (x <= 1.25e+29)
		tmp = t_1;
	elseif (x <= 6.6e+117)
		tmp = t_2;
	else
		tmp = (18.0 * t) * (y * (x * 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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.2e+273], N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.72e+201], t$95$2, If[LessEqual[x, 5.5e-77], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 1.08e-15], N[(N[(j * k), $MachinePrecision] * -27.0), $MachinePrecision], If[LessEqual[x, 1.25e+29], t$95$1, If[LessEqual[x, 6.6e+117], t$95$2, N[(N[(18.0 * t), $MachinePrecision] * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 19: 35.8% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;b \cdot c \leq -1.6 \cdot 10^{+48}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -4.5 \cdot 10^{-149}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 7 \cdot 10^{-308}:\\ \;\;\;\;\left(j \cdot k\right) \cdot -27\\ \mathbf{elif}\;b \cdot c \leq 1.6 \cdot 10^{+149}:\\ \;\;\;\;t_1\\ \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 (* -4.0 (* t a))))
   (if (<= (* b c) -1.6e+48)
     (* b c)
     (if (<= (* b c) -4.5e-149)
       t_1
       (if (<= (* b c) 7e-308)
         (* (* j k) -27.0)
         (if (<= (* b c) 1.6e+149) t_1 (* 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 = -4.0 * (t * a);
	double tmp;
	if ((b * c) <= -1.6e+48) {
		tmp = b * c;
	} else if ((b * c) <= -4.5e-149) {
		tmp = t_1;
	} else if ((b * c) <= 7e-308) {
		tmp = (j * k) * -27.0;
	} else if ((b * c) <= 1.6e+149) {
		tmp = t_1;
	} 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 = (-4.0d0) * (t * a)
    if ((b * c) <= (-1.6d+48)) then
        tmp = b * c
    else if ((b * c) <= (-4.5d-149)) then
        tmp = t_1
    else if ((b * c) <= 7d-308) then
        tmp = (j * k) * (-27.0d0)
    else if ((b * c) <= 1.6d+149) then
        tmp = t_1
    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 = -4.0 * (t * a);
	double tmp;
	if ((b * c) <= -1.6e+48) {
		tmp = b * c;
	} else if ((b * c) <= -4.5e-149) {
		tmp = t_1;
	} else if ((b * c) <= 7e-308) {
		tmp = (j * k) * -27.0;
	} else if ((b * c) <= 1.6e+149) {
		tmp = t_1;
	} 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 = -4.0 * (t * a)
	tmp = 0
	if (b * c) <= -1.6e+48:
		tmp = b * c
	elif (b * c) <= -4.5e-149:
		tmp = t_1
	elif (b * c) <= 7e-308:
		tmp = (j * k) * -27.0
	elif (b * c) <= 1.6e+149:
		tmp = t_1
	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(-4.0 * Float64(t * a))
	tmp = 0.0
	if (Float64(b * c) <= -1.6e+48)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -4.5e-149)
		tmp = t_1;
	elseif (Float64(b * c) <= 7e-308)
		tmp = Float64(Float64(j * k) * -27.0);
	elseif (Float64(b * c) <= 1.6e+149)
		tmp = t_1;
	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 = -4.0 * (t * a);
	tmp = 0.0;
	if ((b * c) <= -1.6e+48)
		tmp = b * c;
	elseif ((b * c) <= -4.5e-149)
		tmp = t_1;
	elseif ((b * c) <= 7e-308)
		tmp = (j * k) * -27.0;
	elseif ((b * c) <= 1.6e+149)
		tmp = t_1;
	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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.6e+48], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -4.5e-149], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 7e-308], N[(N[(j * k), $MachinePrecision] * -27.0), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.6e+149], t$95$1, N[(b * c), $MachinePrecision]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 20: 29.6% accurate, 1.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 := -4 \cdot \left(t \cdot a\right)\\ t_2 := -4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;x \leq -1.05 \cdot 10^{+190}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -1.3 \cdot 10^{-18}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;x \leq -7 \cdot 10^{-278}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 4.4 \cdot 10^{-204}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{-78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 4.6 \cdot 10^{-12}:\\ \;\;\;\;\left(j \cdot k\right) \cdot -27\\ \mathbf{elif}\;x \leq 2.05 \cdot 10^{+30}:\\ \;\;\;\;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 (* -4.0 (* t a))) (t_2 (* -4.0 (* x i))))
   (if (<= x -1.05e+190)
     t_2
     (if (<= x -1.3e-18)
       (* b c)
       (if (<= x -7e-278)
         t_1
         (if (<= x 4.4e-204)
           (* b c)
           (if (<= x 1.3e-78)
             t_1
             (if (<= x 4.6e-12)
               (* (* j k) -27.0)
               (if (<= x 2.05e+30) 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 = -4.0 * (t * a);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if (x <= -1.05e+190) {
		tmp = t_2;
	} else if (x <= -1.3e-18) {
		tmp = b * c;
	} else if (x <= -7e-278) {
		tmp = t_1;
	} else if (x <= 4.4e-204) {
		tmp = b * c;
	} else if (x <= 1.3e-78) {
		tmp = t_1;
	} else if (x <= 4.6e-12) {
		tmp = (j * k) * -27.0;
	} else if (x <= 2.05e+30) {
		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 = (-4.0d0) * (t * a)
    t_2 = (-4.0d0) * (x * i)
    if (x <= (-1.05d+190)) then
        tmp = t_2
    else if (x <= (-1.3d-18)) then
        tmp = b * c
    else if (x <= (-7d-278)) then
        tmp = t_1
    else if (x <= 4.4d-204) then
        tmp = b * c
    else if (x <= 1.3d-78) then
        tmp = t_1
    else if (x <= 4.6d-12) then
        tmp = (j * k) * (-27.0d0)
    else if (x <= 2.05d+30) 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 = -4.0 * (t * a);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if (x <= -1.05e+190) {
		tmp = t_2;
	} else if (x <= -1.3e-18) {
		tmp = b * c;
	} else if (x <= -7e-278) {
		tmp = t_1;
	} else if (x <= 4.4e-204) {
		tmp = b * c;
	} else if (x <= 1.3e-78) {
		tmp = t_1;
	} else if (x <= 4.6e-12) {
		tmp = (j * k) * -27.0;
	} else if (x <= 2.05e+30) {
		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 = -4.0 * (t * a)
	t_2 = -4.0 * (x * i)
	tmp = 0
	if x <= -1.05e+190:
		tmp = t_2
	elif x <= -1.3e-18:
		tmp = b * c
	elif x <= -7e-278:
		tmp = t_1
	elif x <= 4.4e-204:
		tmp = b * c
	elif x <= 1.3e-78:
		tmp = t_1
	elif x <= 4.6e-12:
		tmp = (j * k) * -27.0
	elif x <= 2.05e+30:
		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(-4.0 * Float64(t * a))
	t_2 = Float64(-4.0 * Float64(x * i))
	tmp = 0.0
	if (x <= -1.05e+190)
		tmp = t_2;
	elseif (x <= -1.3e-18)
		tmp = Float64(b * c);
	elseif (x <= -7e-278)
		tmp = t_1;
	elseif (x <= 4.4e-204)
		tmp = Float64(b * c);
	elseif (x <= 1.3e-78)
		tmp = t_1;
	elseif (x <= 4.6e-12)
		tmp = Float64(Float64(j * k) * -27.0);
	elseif (x <= 2.05e+30)
		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 = -4.0 * (t * a);
	t_2 = -4.0 * (x * i);
	tmp = 0.0;
	if (x <= -1.05e+190)
		tmp = t_2;
	elseif (x <= -1.3e-18)
		tmp = b * c;
	elseif (x <= -7e-278)
		tmp = t_1;
	elseif (x <= 4.4e-204)
		tmp = b * c;
	elseif (x <= 1.3e-78)
		tmp = t_1;
	elseif (x <= 4.6e-12)
		tmp = (j * k) * -27.0;
	elseif (x <= 2.05e+30)
		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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.05e+190], t$95$2, If[LessEqual[x, -1.3e-18], N[(b * c), $MachinePrecision], If[LessEqual[x, -7e-278], t$95$1, If[LessEqual[x, 4.4e-204], N[(b * c), $MachinePrecision], If[LessEqual[x, 1.3e-78], t$95$1, If[LessEqual[x, 4.6e-12], N[(N[(j * k), $MachinePrecision] * -27.0), $MachinePrecision], If[LessEqual[x, 2.05e+30], t$95$1, t$95$2]]]]]]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 21: 70.5% accurate, 1.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} \mathbf{if}\;x \leq -7 \cdot 10^{+176} \lor \neg \left(x \leq 3.2 \cdot 10^{-11}\right):\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - 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 (<= x -7e+176) (not (<= x 3.2e-11)))
   (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
   (- (+ (* b c) (* -4.0 (* t a))) (* 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 ((x <= -7e+176) || !(x <= 3.2e-11)) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 ((x <= (-7d+176)) .or. (.not. (x <= 3.2d-11))) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else
        tmp = ((b * c) + ((-4.0d0) * (t * a))) - (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 ((x <= -7e+176) || !(x <= 3.2e-11)) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else {
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 (x <= -7e+176) or not (x <= 3.2e-11):
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	else:
		tmp = ((b * c) + (-4.0 * (t * a))) - (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 ((x <= -7e+176) || !(x <= 3.2e-11))
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - 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 ((x <= -7e+176) || ~((x <= 3.2e-11)))
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	else
		tmp = ((b * c) + (-4.0 * (t * a))) - (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[x, -7e+176], N[Not[LessEqual[x, 3.2e-11]], $MachinePrecision]], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 22: 62.9% accurate, 1.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)\\ \mathbf{if}\;j \leq -1.8 \cdot 10^{+131}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + t_1\\ \mathbf{elif}\;j \leq 1.9 \cdot 10^{-120}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a + x \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;t_1 + x \cdot \left(z \cdot \left(18 \cdot \left(y \cdot t\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))))
   (if (<= j -1.8e+131)
     (+ (* -4.0 (* t a)) t_1)
     (if (<= j 1.9e-120)
       (+ (* b c) (* -4.0 (+ (* t a) (* x i))))
       (+ t_1 (* x (* z (* 18.0 (* y t)))))))))

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 (j <= -1.8e+131) {
		tmp = (-4.0 * (t * a)) + t_1;
	} else if (j <= 1.9e-120) {
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	} else {
		tmp = t_1 + (x * (z * (18.0 * (y * t))));
	}
	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 (j <= (-1.8d+131)) then
        tmp = ((-4.0d0) * (t * a)) + t_1
    else if (j <= 1.9d-120) then
        tmp = (b * c) + ((-4.0d0) * ((t * a) + (x * i)))
    else
        tmp = t_1 + (x * (z * (18.0d0 * (y * t))))
    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 (j <= -1.8e+131) {
		tmp = (-4.0 * (t * a)) + t_1;
	} else if (j <= 1.9e-120) {
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	} else {
		tmp = t_1 + (x * (z * (18.0 * (y * t))));
	}
	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 j <= -1.8e+131:
		tmp = (-4.0 * (t * a)) + t_1
	elif j <= 1.9e-120:
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)))
	else:
		tmp = t_1 + (x * (z * (18.0 * (y * t))))
	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 (j <= -1.8e+131)
		tmp = Float64(Float64(-4.0 * Float64(t * a)) + t_1);
	elseif (j <= 1.9e-120)
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))));
	else
		tmp = Float64(t_1 + Float64(x * Float64(z * Float64(18.0 * Float64(y * t)))));
	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 (j <= -1.8e+131)
		tmp = (-4.0 * (t * a)) + t_1;
	elseif (j <= 1.9e-120)
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	else
		tmp = t_1 + (x * (z * (18.0 * (y * t))));
	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[j, -1.8e+131], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[j, 1.9e-120], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + N[(x * N[(z * N[(18.0 * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 23: 61.8% accurate, 2.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}\;j \leq -1.75 \cdot 10^{+131}:\\ \;\;\;\;-4 \cdot \left(t \cdot a\right) + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a + x \cdot i\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 (<= j -1.75e+131)
   (+ (* -4.0 (* t a)) (* j (* k -27.0)))
   (+ (* b c) (* -4.0 (+ (* t a) (* x i))))))

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 (j <= -1.75e+131) {
		tmp = (-4.0 * (t * a)) + (j * (k * -27.0));
	} else {
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	}
	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 (j <= (-1.75d+131)) then
        tmp = ((-4.0d0) * (t * a)) + (j * (k * (-27.0d0)))
    else
        tmp = (b * c) + ((-4.0d0) * ((t * a) + (x * i)))
    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 (j <= -1.75e+131) {
		tmp = (-4.0 * (t * a)) + (j * (k * -27.0));
	} else {
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	}
	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 j <= -1.75e+131:
		tmp = (-4.0 * (t * a)) + (j * (k * -27.0))
	else:
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)))
	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 (j <= -1.75e+131)
		tmp = Float64(Float64(-4.0 * Float64(t * a)) + Float64(j * Float64(k * -27.0)));
	else
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))));
	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 (j <= -1.75e+131)
		tmp = (-4.0 * (t * a)) + (j * (k * -27.0));
	else
		tmp = (b * c) + (-4.0 * ((t * a) + (x * i)));
	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[j, -1.75e+131], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 24: 51.3% accurate, 2.4× 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}\;j \leq -4.1 \cdot 10^{+132} \lor \neg \left(j \leq 7.8 \cdot 10^{-203}\right):\\ \;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\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 (<= j -4.1e+132) (not (<= j 7.8e-203)))
   (+ (* b c) (* j (* k -27.0)))
   (+ (* b c) (* -4.0 (* t a)))))

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 ((j <= -4.1e+132) || !(j <= 7.8e-203)) {
		tmp = (b * c) + (j * (k * -27.0));
	} else {
		tmp = (b * c) + (-4.0 * (t * a));
	}
	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 ((j <= (-4.1d+132)) .or. (.not. (j <= 7.8d-203))) then
        tmp = (b * c) + (j * (k * (-27.0d0)))
    else
        tmp = (b * c) + ((-4.0d0) * (t * a))
    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 ((j <= -4.1e+132) || !(j <= 7.8e-203)) {
		tmp = (b * c) + (j * (k * -27.0));
	} else {
		tmp = (b * c) + (-4.0 * (t * a));
	}
	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 (j <= -4.1e+132) or not (j <= 7.8e-203):
		tmp = (b * c) + (j * (k * -27.0))
	else:
		tmp = (b * c) + (-4.0 * (t * a))
	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 ((j <= -4.1e+132) || !(j <= 7.8e-203))
		tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)));
	else
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)));
	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 ((j <= -4.1e+132) || ~((j <= 7.8e-203)))
		tmp = (b * c) + (j * (k * -27.0));
	else
		tmp = (b * c) + (-4.0 * (t * a));
	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[j, -4.1e+132], N[Not[LessEqual[j, 7.8e-203]], $MachinePrecision]], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 25: 33.8% accurate, 3.4× 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}\;j \leq -1.75 \cdot 10^{+131} \lor \neg \left(j \leq 7.4 \cdot 10^{-51}\right):\\ \;\;\;\;\left(j \cdot k\right) \cdot -27\\ \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
 (if (or (<= j -1.75e+131) (not (<= j 7.4e-51))) (* (* 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 ((j <= -1.75e+131) || !(j <= 7.4e-51)) {
		tmp = (j * k) * -27.0;
	} 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) :: tmp
    if ((j <= (-1.75d+131)) .or. (.not. (j <= 7.4d-51))) then
        tmp = (j * k) * (-27.0d0)
    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 tmp;
	if ((j <= -1.75e+131) || !(j <= 7.4e-51)) {
		tmp = (j * k) * -27.0;
	} 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):
	tmp = 0
	if (j <= -1.75e+131) or not (j <= 7.4e-51):
		tmp = (j * k) * -27.0
	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)
	tmp = 0.0
	if ((j <= -1.75e+131) || !(j <= 7.4e-51))
		tmp = Float64(Float64(j * k) * -27.0);
	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)
	tmp = 0.0;
	if ((j <= -1.75e+131) || ~((j <= 7.4e-51)))
		tmp = (j * k) * -27.0;
	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_] := If[Or[LessEqual[j, -1.75e+131], N[Not[LessEqual[j, 7.4e-51]], $MachinePrecision]], N[(N[(j * k), $MachinePrecision] * -27.0), $MachinePrecision], N[(b * c), $MachinePrecision]]

Derivation

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Alternative 26: 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

&prev;&pcontext;&pcontext2;&ctx;
1. Add Preprocessing

Developer target: 89.5% accurate, 0.9× 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 2023348 
(FPCore (x y z t a b c i j k)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, E"
  :precision binary64

  :herbie-target
  (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)))