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

Percentage Accurate: 85.1% → 91.5%

Time: 28.5s

Alternatives: 21

Speedup: 1.0×

• 49.7% 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.1% 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: 91.5% 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(t \cdot \left(y \cdot z\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 (* t (* y z))) (* 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 * (t * (y * z))) - (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 * (t * (y * z))) - (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 * (t * (y * z))) - (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(t * Float64(y * z))) - 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 * (t * (y * z))) - (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[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

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

Derivation

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

Alternative 3: 87.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq 1.35 \cdot 10^{+201}:\\ \;\;\;\;\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}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\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 (<= x 1.35e+201)
   (-
    (+ (* b c) (* t (- (* (* x 18.0) (* y z)) (* a 4.0))))
    (+ (* x (* 4.0 i)) (* j (* 27.0 k))))
   (* x (- (* 18.0 (* t (* y z))) (* 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 (x <= 1.35e+201) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = x * ((18.0 * (t * (y * z))) - (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 (x <= 1.35d+201) then
        tmp = ((b * c) + (t * (((x * 18.0d0) * (y * z)) - (a * 4.0d0)))) - ((x * (4.0d0 * i)) + (j * (27.0d0 * k)))
    else
        tmp = x * ((18.0d0 * (t * (y * z))) - (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 (x <= 1.35e+201) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = x * ((18.0 * (t * (y * z))) - (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 x <= 1.35e+201:
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)))
	else:
		tmp = x * ((18.0 * (t * (y * z))) - (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 (x <= 1.35e+201)
		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(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - 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 (x <= 1.35e+201)
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	else
		tmp = x * ((18.0 * (t * (y * z))) - (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[x, 1.35e+201], 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[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 4: 58.0% 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 := b \cdot c + -4 \cdot \left(t \cdot a\right)\\ t_2 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ t_3 := j \cdot \left(k \cdot -27\right)\\ t_4 := t_3 + t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{-10}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -2.2 \cdot 10^{-36}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{-81}:\\ \;\;\;\;x \cdot \left(\left(y \cdot t\right) \cdot \left(18 \cdot z\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -3.6 \cdot 10^{-202}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 6.6 \cdot 10^{-274}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-82}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 5 \cdot 10^{+70}:\\ \;\;\;\;t_3 + 18 \cdot \left(x \cdot \left(y \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;x \leq 5.3 \cdot 10^{+82}:\\ \;\;\;\;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) (* -4.0 (* t a))))
        (t_2 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i))))
        (t_3 (* j (* k -27.0)))
        (t_4 (+ t_3 (* t (* a -4.0)))))
   (if (<= x -8.5e-10)
     t_2
     (if (<= x -2.2e-36)
       t_4
       (if (<= x -1.7e-81)
         (* x (- (* (* y t) (* 18.0 z)) (* 4.0 i)))
         (if (<= x -3.6e-202)
           t_1
           (if (<= x 6.6e-274)
             t_4
             (if (<= x 2.4e-82)
               t_1
               (if (<= x 5e+70)
                 (+ t_3 (* 18.0 (* x (* y (* z t)))))
                 (if (<= x 5.3e+82) 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) + (-4.0 * (t * a));
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double t_3 = j * (k * -27.0);
	double t_4 = t_3 + (t * (a * -4.0));
	double tmp;
	if (x <= -8.5e-10) {
		tmp = t_2;
	} else if (x <= -2.2e-36) {
		tmp = t_4;
	} else if (x <= -1.7e-81) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= -3.6e-202) {
		tmp = t_1;
	} else if (x <= 6.6e-274) {
		tmp = t_4;
	} else if (x <= 2.4e-82) {
		tmp = t_1;
	} else if (x <= 5e+70) {
		tmp = t_3 + (18.0 * (x * (y * (z * t))));
	} else if (x <= 5.3e+82) {
		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) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = (b * c) + ((-4.0d0) * (t * a))
    t_2 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    t_3 = j * (k * (-27.0d0))
    t_4 = t_3 + (t * (a * (-4.0d0)))
    if (x <= (-8.5d-10)) then
        tmp = t_2
    else if (x <= (-2.2d-36)) then
        tmp = t_4
    else if (x <= (-1.7d-81)) then
        tmp = x * (((y * t) * (18.0d0 * z)) - (4.0d0 * i))
    else if (x <= (-3.6d-202)) then
        tmp = t_1
    else if (x <= 6.6d-274) then
        tmp = t_4
    else if (x <= 2.4d-82) then
        tmp = t_1
    else if (x <= 5d+70) then
        tmp = t_3 + (18.0d0 * (x * (y * (z * t))))
    else if (x <= 5.3d+82) 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) + (-4.0 * (t * a));
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double t_3 = j * (k * -27.0);
	double t_4 = t_3 + (t * (a * -4.0));
	double tmp;
	if (x <= -8.5e-10) {
		tmp = t_2;
	} else if (x <= -2.2e-36) {
		tmp = t_4;
	} else if (x <= -1.7e-81) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= -3.6e-202) {
		tmp = t_1;
	} else if (x <= 6.6e-274) {
		tmp = t_4;
	} else if (x <= 2.4e-82) {
		tmp = t_1;
	} else if (x <= 5e+70) {
		tmp = t_3 + (18.0 * (x * (y * (z * t))));
	} else if (x <= 5.3e+82) {
		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) + (-4.0 * (t * a))
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	t_3 = j * (k * -27.0)
	t_4 = t_3 + (t * (a * -4.0))
	tmp = 0
	if x <= -8.5e-10:
		tmp = t_2
	elif x <= -2.2e-36:
		tmp = t_4
	elif x <= -1.7e-81:
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i))
	elif x <= -3.6e-202:
		tmp = t_1
	elif x <= 6.6e-274:
		tmp = t_4
	elif x <= 2.4e-82:
		tmp = t_1
	elif x <= 5e+70:
		tmp = t_3 + (18.0 * (x * (y * (z * t))))
	elif x <= 5.3e+82:
		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(-4.0 * Float64(t * a)))
	t_2 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	t_3 = Float64(j * Float64(k * -27.0))
	t_4 = Float64(t_3 + Float64(t * Float64(a * -4.0)))
	tmp = 0.0
	if (x <= -8.5e-10)
		tmp = t_2;
	elseif (x <= -2.2e-36)
		tmp = t_4;
	elseif (x <= -1.7e-81)
		tmp = Float64(x * Float64(Float64(Float64(y * t) * Float64(18.0 * z)) - Float64(4.0 * i)));
	elseif (x <= -3.6e-202)
		tmp = t_1;
	elseif (x <= 6.6e-274)
		tmp = t_4;
	elseif (x <= 2.4e-82)
		tmp = t_1;
	elseif (x <= 5e+70)
		tmp = Float64(t_3 + Float64(18.0 * Float64(x * Float64(y * Float64(z * t)))));
	elseif (x <= 5.3e+82)
		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) + (-4.0 * (t * a));
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	t_3 = j * (k * -27.0);
	t_4 = t_3 + (t * (a * -4.0));
	tmp = 0.0;
	if (x <= -8.5e-10)
		tmp = t_2;
	elseif (x <= -2.2e-36)
		tmp = t_4;
	elseif (x <= -1.7e-81)
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	elseif (x <= -3.6e-202)
		tmp = t_1;
	elseif (x <= 6.6e-274)
		tmp = t_4;
	elseif (x <= 2.4e-82)
		tmp = t_1;
	elseif (x <= 5e+70)
		tmp = t_3 + (18.0 * (x * (y * (z * t))));
	elseif (x <= 5.3e+82)
		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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e-10], t$95$2, If[LessEqual[x, -2.2e-36], t$95$4, If[LessEqual[x, -1.7e-81], N[(x * N[(N[(N[(y * t), $MachinePrecision] * N[(18.0 * z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.6e-202], t$95$1, If[LessEqual[x, 6.6e-274], t$95$4, If[LessEqual[x, 2.4e-82], t$95$1, If[LessEqual[x, 5e+70], N[(t$95$3 + N[(18.0 * N[(x * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.3e+82], t$95$1, t$95$2]]]]]]]]]]]]

Derivation

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

Alternative 5: 37.4% 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(x \cdot i\right)\\ \mathbf{if}\;b \cdot c \leq -3.9 \cdot 10^{+59}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -7.2 \cdot 10^{-65}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 2.15 \cdot 10^{-116}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;b \cdot c \leq 1.75 \cdot 10^{-50}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 5.2 \cdot 10^{+72}:\\ \;\;\;\;t \cdot \left(a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{+139}:\\ \;\;\;\;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 (* x i))))
   (if (<= (* b c) -3.9e+59)
     (* b c)
     (if (<= (* b c) -7.2e-65)
       t_1
       (if (<= (* b c) 2.15e-116)
         (* -27.0 (* j k))
         (if (<= (* b c) 1.75e-50)
           t_1
           (if (<= (* b c) 5.2e+72)
             (* t (* a -4.0))
             (if (<= (* b c) 2e+139) 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 * (x * i);
	double tmp;
	if ((b * c) <= -3.9e+59) {
		tmp = b * c;
	} else if ((b * c) <= -7.2e-65) {
		tmp = t_1;
	} else if ((b * c) <= 2.15e-116) {
		tmp = -27.0 * (j * k);
	} else if ((b * c) <= 1.75e-50) {
		tmp = t_1;
	} else if ((b * c) <= 5.2e+72) {
		tmp = t * (a * -4.0);
	} else if ((b * c) <= 2e+139) {
		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) * (x * i)
    if ((b * c) <= (-3.9d+59)) then
        tmp = b * c
    else if ((b * c) <= (-7.2d-65)) then
        tmp = t_1
    else if ((b * c) <= 2.15d-116) then
        tmp = (-27.0d0) * (j * k)
    else if ((b * c) <= 1.75d-50) then
        tmp = t_1
    else if ((b * c) <= 5.2d+72) then
        tmp = t * (a * (-4.0d0))
    else if ((b * c) <= 2d+139) 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 * (x * i);
	double tmp;
	if ((b * c) <= -3.9e+59) {
		tmp = b * c;
	} else if ((b * c) <= -7.2e-65) {
		tmp = t_1;
	} else if ((b * c) <= 2.15e-116) {
		tmp = -27.0 * (j * k);
	} else if ((b * c) <= 1.75e-50) {
		tmp = t_1;
	} else if ((b * c) <= 5.2e+72) {
		tmp = t * (a * -4.0);
	} else if ((b * c) <= 2e+139) {
		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 * (x * i)
	tmp = 0
	if (b * c) <= -3.9e+59:
		tmp = b * c
	elif (b * c) <= -7.2e-65:
		tmp = t_1
	elif (b * c) <= 2.15e-116:
		tmp = -27.0 * (j * k)
	elif (b * c) <= 1.75e-50:
		tmp = t_1
	elif (b * c) <= 5.2e+72:
		tmp = t * (a * -4.0)
	elif (b * c) <= 2e+139:
		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(x * i))
	tmp = 0.0
	if (Float64(b * c) <= -3.9e+59)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -7.2e-65)
		tmp = t_1;
	elseif (Float64(b * c) <= 2.15e-116)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (Float64(b * c) <= 1.75e-50)
		tmp = t_1;
	elseif (Float64(b * c) <= 5.2e+72)
		tmp = Float64(t * Float64(a * -4.0));
	elseif (Float64(b * c) <= 2e+139)
		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 * (x * i);
	tmp = 0.0;
	if ((b * c) <= -3.9e+59)
		tmp = b * c;
	elseif ((b * c) <= -7.2e-65)
		tmp = t_1;
	elseif ((b * c) <= 2.15e-116)
		tmp = -27.0 * (j * k);
	elseif ((b * c) <= 1.75e-50)
		tmp = t_1;
	elseif ((b * c) <= 5.2e+72)
		tmp = t * (a * -4.0);
	elseif ((b * c) <= 2e+139)
		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[(x * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -3.9e+59], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -7.2e-65], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.15e-116], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.75e-50], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 5.2e+72], N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2e+139], t$95$1, N[(b * c), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 6: 75.5% 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 := \left(b \cdot c - \left(4 \cdot \left(x \cdot i\right) + 4 \cdot \left(t \cdot a\right)\right)\right) - \left(j \cdot 27\right) \cdot k\\ t_2 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -2.3 \cdot 10^{+142}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{+70}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + 18 \cdot \left(x \cdot \left(y \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+115}:\\ \;\;\;\;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) (+ (* 4.0 (* x i)) (* 4.0 (* t a)))) (* (* j 27.0) k)))
        (t_2 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -2.3e+142)
     t_2
     (if (<= x 3.1e-78)
       t_1
       (if (<= x 2.3e+70)
         (+ (* j (* k -27.0)) (* 18.0 (* x (* y (* z t)))))
         (if (<= x 1.3e+115) 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) - ((4.0 * (x * i)) + (4.0 * (t * a)))) - ((j * 27.0) * k);
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -2.3e+142) {
		tmp = t_2;
	} else if (x <= 3.1e-78) {
		tmp = t_1;
	} else if (x <= 2.3e+70) {
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.3e+115) {
		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) - ((4.0d0 * (x * i)) + (4.0d0 * (t * a)))) - ((j * 27.0d0) * k)
    t_2 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-2.3d+142)) then
        tmp = t_2
    else if (x <= 3.1d-78) then
        tmp = t_1
    else if (x <= 2.3d+70) then
        tmp = (j * (k * (-27.0d0))) + (18.0d0 * (x * (y * (z * t))))
    else if (x <= 1.3d+115) 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) - ((4.0 * (x * i)) + (4.0 * (t * a)))) - ((j * 27.0) * k);
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -2.3e+142) {
		tmp = t_2;
	} else if (x <= 3.1e-78) {
		tmp = t_1;
	} else if (x <= 2.3e+70) {
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.3e+115) {
		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) - ((4.0 * (x * i)) + (4.0 * (t * a)))) - ((j * 27.0) * k)
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -2.3e+142:
		tmp = t_2
	elif x <= 3.1e-78:
		tmp = t_1
	elif x <= 2.3e+70:
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))))
	elif x <= 1.3e+115:
		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(Float64(b * c) - Float64(Float64(4.0 * Float64(x * i)) + Float64(4.0 * Float64(t * a)))) - Float64(Float64(j * 27.0) * k))
	t_2 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -2.3e+142)
		tmp = t_2;
	elseif (x <= 3.1e-78)
		tmp = t_1;
	elseif (x <= 2.3e+70)
		tmp = Float64(Float64(j * Float64(k * -27.0)) + Float64(18.0 * Float64(x * Float64(y * Float64(z * t)))));
	elseif (x <= 1.3e+115)
		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) - ((4.0 * (x * i)) + (4.0 * (t * a)))) - ((j * 27.0) * k);
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -2.3e+142)
		tmp = t_2;
	elseif (x <= 3.1e-78)
		tmp = t_1;
	elseif (x <= 2.3e+70)
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	elseif (x <= 1.3e+115)
		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[(N[(b * c), $MachinePrecision] - N[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.3e+142], t$95$2, If[LessEqual[x, 3.1e-78], t$95$1, If[LessEqual[x, 2.3e+70], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(x * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.3e+115], t$95$1, t$95$2]]]]]]

Derivation

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

Alternative 7: 62.2% 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 - \left(4 \cdot \left(x \cdot i\right) + 4 \cdot \left(t \cdot a\right)\right)\\ t_3 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -8.2 \cdot 10^{+68}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -3.9 \cdot 10^{-202}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{-279}:\\ \;\;\;\;t_1 + t \cdot \left(a \cdot -4\right)\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{-80}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 1.36 \cdot 10^{+70}:\\ \;\;\;\;t_1 + 18 \cdot \left(x \cdot \left(y \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;x \leq 1.75 \cdot 10^{+109}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 10^{+114}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;t_3\\ \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 (* x i)) (* 4.0 (* t a)))))
        (t_3 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -8.2e+68)
     t_3
     (if (<= x -3.9e-202)
       t_2
       (if (<= x 1.25e-279)
         (+ t_1 (* t (* a -4.0)))
         (if (<= x 1.3e-80)
           t_2
           (if (<= x 1.36e+70)
             (+ t_1 (* 18.0 (* x (* y (* z t)))))
             (if (<= x 1.75e+109)
               t_2
               (if (<= x 1e+114) (* k (* j -27.0)) t_3)))))))))

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 * (x * i)) + (4.0 * (t * a)));
	double t_3 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -8.2e+68) {
		tmp = t_3;
	} else if (x <= -3.9e-202) {
		tmp = t_2;
	} else if (x <= 1.25e-279) {
		tmp = t_1 + (t * (a * -4.0));
	} else if (x <= 1.3e-80) {
		tmp = t_2;
	} else if (x <= 1.36e+70) {
		tmp = t_1 + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.75e+109) {
		tmp = t_2;
	} else if (x <= 1e+114) {
		tmp = k * (j * -27.0);
	} else {
		tmp = t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (b * c) - ((4.0d0 * (x * i)) + (4.0d0 * (t * a)))
    t_3 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-8.2d+68)) then
        tmp = t_3
    else if (x <= (-3.9d-202)) then
        tmp = t_2
    else if (x <= 1.25d-279) then
        tmp = t_1 + (t * (a * (-4.0d0)))
    else if (x <= 1.3d-80) then
        tmp = t_2
    else if (x <= 1.36d+70) then
        tmp = t_1 + (18.0d0 * (x * (y * (z * t))))
    else if (x <= 1.75d+109) then
        tmp = t_2
    else if (x <= 1d+114) then
        tmp = k * (j * (-27.0d0))
    else
        tmp = t_3
    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 * (x * i)) + (4.0 * (t * a)));
	double t_3 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -8.2e+68) {
		tmp = t_3;
	} else if (x <= -3.9e-202) {
		tmp = t_2;
	} else if (x <= 1.25e-279) {
		tmp = t_1 + (t * (a * -4.0));
	} else if (x <= 1.3e-80) {
		tmp = t_2;
	} else if (x <= 1.36e+70) {
		tmp = t_1 + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.75e+109) {
		tmp = t_2;
	} else if (x <= 1e+114) {
		tmp = k * (j * -27.0);
	} else {
		tmp = t_3;
	}
	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 * (x * i)) + (4.0 * (t * a)))
	t_3 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -8.2e+68:
		tmp = t_3
	elif x <= -3.9e-202:
		tmp = t_2
	elif x <= 1.25e-279:
		tmp = t_1 + (t * (a * -4.0))
	elif x <= 1.3e-80:
		tmp = t_2
	elif x <= 1.36e+70:
		tmp = t_1 + (18.0 * (x * (y * (z * t))))
	elif x <= 1.75e+109:
		tmp = t_2
	elif x <= 1e+114:
		tmp = k * (j * -27.0)
	else:
		tmp = t_3
	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(Float64(4.0 * Float64(x * i)) + Float64(4.0 * Float64(t * a))))
	t_3 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -8.2e+68)
		tmp = t_3;
	elseif (x <= -3.9e-202)
		tmp = t_2;
	elseif (x <= 1.25e-279)
		tmp = Float64(t_1 + Float64(t * Float64(a * -4.0)));
	elseif (x <= 1.3e-80)
		tmp = t_2;
	elseif (x <= 1.36e+70)
		tmp = Float64(t_1 + Float64(18.0 * Float64(x * Float64(y * Float64(z * t)))));
	elseif (x <= 1.75e+109)
		tmp = t_2;
	elseif (x <= 1e+114)
		tmp = Float64(k * Float64(j * -27.0));
	else
		tmp = t_3;
	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 * (x * i)) + (4.0 * (t * a)));
	t_3 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -8.2e+68)
		tmp = t_3;
	elseif (x <= -3.9e-202)
		tmp = t_2;
	elseif (x <= 1.25e-279)
		tmp = t_1 + (t * (a * -4.0));
	elseif (x <= 1.3e-80)
		tmp = t_2;
	elseif (x <= 1.36e+70)
		tmp = t_1 + (18.0 * (x * (y * (z * t))));
	elseif (x <= 1.75e+109)
		tmp = t_2;
	elseif (x <= 1e+114)
		tmp = k * (j * -27.0);
	else
		tmp = t_3;
	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[(N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.2e+68], t$95$3, If[LessEqual[x, -3.9e-202], t$95$2, If[LessEqual[x, 1.25e-279], N[(t$95$1 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.3e-80], t$95$2, If[LessEqual[x, 1.36e+70], N[(t$95$1 + N[(18.0 * N[(x * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.75e+109], t$95$2, If[LessEqual[x, 1e+114], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], t$95$3]]]]]]]]]]

Derivation

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

Alternative 8: 58.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 := j \cdot \left(k \cdot -27\right)\\ t_2 := -4 \cdot \left(x \cdot i\right) + t_1\\ t_3 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{if}\;t \leq -1.06 \cdot 10^{+70}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;t \leq -1550000000000:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq -2.2 \cdot 10^{-41}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;t \leq 1.4 \cdot 10^{-62}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;t \leq 1.45 \cdot 10^{+15} \lor \neg \left(t \leq 4.8 \cdot 10^{+109}\right):\\ \;\;\;\;t_3\\ \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)))
        (t_2 (+ (* -4.0 (* x i)) t_1))
        (t_3 (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))))
   (if (<= t -1.06e+70)
     t_3
     (if (<= t -1550000000000.0)
       t_2
       (if (<= t -2.2e-41)
         t_3
         (if (<= t 1.4e-62)
           (+ (* b c) t_1)
           (if (or (<= t 1.45e+15) (not (<= t 4.8e+109))) t_3 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);
	double t_2 = (-4.0 * (x * i)) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -1.06e+70) {
		tmp = t_3;
	} else if (t <= -1550000000000.0) {
		tmp = t_2;
	} else if (t <= -2.2e-41) {
		tmp = t_3;
	} else if (t <= 1.4e-62) {
		tmp = (b * c) + t_1;
	} else if ((t <= 1.45e+15) || !(t <= 4.8e+109)) {
		tmp = t_3;
	} 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) :: t_3
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = ((-4.0d0) * (x * i)) + t_1
    t_3 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    if (t <= (-1.06d+70)) then
        tmp = t_3
    else if (t <= (-1550000000000.0d0)) then
        tmp = t_2
    else if (t <= (-2.2d-41)) then
        tmp = t_3
    else if (t <= 1.4d-62) then
        tmp = (b * c) + t_1
    else if ((t <= 1.45d+15) .or. (.not. (t <= 4.8d+109))) then
        tmp = t_3
    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);
	double t_2 = (-4.0 * (x * i)) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -1.06e+70) {
		tmp = t_3;
	} else if (t <= -1550000000000.0) {
		tmp = t_2;
	} else if (t <= -2.2e-41) {
		tmp = t_3;
	} else if (t <= 1.4e-62) {
		tmp = (b * c) + t_1;
	} else if ((t <= 1.45e+15) || !(t <= 4.8e+109)) {
		tmp = t_3;
	} 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)
	t_2 = (-4.0 * (x * i)) + t_1
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	tmp = 0
	if t <= -1.06e+70:
		tmp = t_3
	elif t <= -1550000000000.0:
		tmp = t_2
	elif t <= -2.2e-41:
		tmp = t_3
	elif t <= 1.4e-62:
		tmp = (b * c) + t_1
	elif (t <= 1.45e+15) or not (t <= 4.8e+109):
		tmp = t_3
	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(j * Float64(k * -27.0))
	t_2 = Float64(Float64(-4.0 * Float64(x * i)) + t_1)
	t_3 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	tmp = 0.0
	if (t <= -1.06e+70)
		tmp = t_3;
	elseif (t <= -1550000000000.0)
		tmp = t_2;
	elseif (t <= -2.2e-41)
		tmp = t_3;
	elseif (t <= 1.4e-62)
		tmp = Float64(Float64(b * c) + t_1);
	elseif ((t <= 1.45e+15) || !(t <= 4.8e+109))
		tmp = t_3;
	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);
	t_2 = (-4.0 * (x * i)) + t_1;
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	tmp = 0.0;
	if (t <= -1.06e+70)
		tmp = t_3;
	elseif (t <= -1550000000000.0)
		tmp = t_2;
	elseif (t <= -2.2e-41)
		tmp = t_3;
	elseif (t <= 1.4e-62)
		tmp = (b * c) + t_1;
	elseif ((t <= 1.45e+15) || ~((t <= 4.8e+109)))
		tmp = t_3;
	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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.06e+70], t$95$3, If[LessEqual[t, -1550000000000.0], t$95$2, If[LessEqual[t, -2.2e-41], t$95$3, If[LessEqual[t, 1.4e-62], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[Or[LessEqual[t, 1.45e+15], N[Not[LessEqual[t, 4.8e+109]], $MachinePrecision]], t$95$3, t$95$2]]]]]]]]

Derivation

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

Alternative 9: 58.4% 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 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ t_3 := -4 \cdot \left(x \cdot i\right) + t_1\\ t_4 := t \cdot \left(z \cdot \left(x \cdot \left(18 \cdot y\right)\right) - a \cdot 4\right)\\ \mathbf{if}\;t \leq -2.5 \cdot 10^{+70}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;t \leq -31000000000:\\ \;\;\;\;t_3\\ \mathbf{elif}\;t \leq -2.8 \cdot 10^{-41}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 1.75 \cdot 10^{-60}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;t \leq 1.08 \cdot 10^{+15}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 4.8 \cdot 10^{+109}:\\ \;\;\;\;t_3\\ \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 (* j (* k -27.0)))
        (t_2 (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
        (t_3 (+ (* -4.0 (* x i)) t_1))
        (t_4 (* t (- (* z (* x (* 18.0 y))) (* a 4.0)))))
   (if (<= t -2.5e+70)
     t_4
     (if (<= t -31000000000.0)
       t_3
       (if (<= t -2.8e-41)
         t_2
         (if (<= t 1.75e-60)
           (+ (* b c) t_1)
           (if (<= t 1.08e+15) t_2 (if (<= t 4.8e+109) t_3 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 = j * (k * -27.0);
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_3 = (-4.0 * (x * i)) + t_1;
	double t_4 = t * ((z * (x * (18.0 * y))) - (a * 4.0));
	double tmp;
	if (t <= -2.5e+70) {
		tmp = t_4;
	} else if (t <= -31000000000.0) {
		tmp = t_3;
	} else if (t <= -2.8e-41) {
		tmp = t_2;
	} else if (t <= 1.75e-60) {
		tmp = (b * c) + t_1;
	} else if (t <= 1.08e+15) {
		tmp = t_2;
	} else if (t <= 4.8e+109) {
		tmp = t_3;
	} 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 = j * (k * (-27.0d0))
    t_2 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    t_3 = ((-4.0d0) * (x * i)) + t_1
    t_4 = t * ((z * (x * (18.0d0 * y))) - (a * 4.0d0))
    if (t <= (-2.5d+70)) then
        tmp = t_4
    else if (t <= (-31000000000.0d0)) then
        tmp = t_3
    else if (t <= (-2.8d-41)) then
        tmp = t_2
    else if (t <= 1.75d-60) then
        tmp = (b * c) + t_1
    else if (t <= 1.08d+15) then
        tmp = t_2
    else if (t <= 4.8d+109) then
        tmp = t_3
    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 = j * (k * -27.0);
	double t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_3 = (-4.0 * (x * i)) + t_1;
	double t_4 = t * ((z * (x * (18.0 * y))) - (a * 4.0));
	double tmp;
	if (t <= -2.5e+70) {
		tmp = t_4;
	} else if (t <= -31000000000.0) {
		tmp = t_3;
	} else if (t <= -2.8e-41) {
		tmp = t_2;
	} else if (t <= 1.75e-60) {
		tmp = (b * c) + t_1;
	} else if (t <= 1.08e+15) {
		tmp = t_2;
	} else if (t <= 4.8e+109) {
		tmp = t_3;
	} 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 = j * (k * -27.0)
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	t_3 = (-4.0 * (x * i)) + t_1
	t_4 = t * ((z * (x * (18.0 * y))) - (a * 4.0))
	tmp = 0
	if t <= -2.5e+70:
		tmp = t_4
	elif t <= -31000000000.0:
		tmp = t_3
	elif t <= -2.8e-41:
		tmp = t_2
	elif t <= 1.75e-60:
		tmp = (b * c) + t_1
	elif t <= 1.08e+15:
		tmp = t_2
	elif t <= 4.8e+109:
		tmp = t_3
	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(j * Float64(k * -27.0))
	t_2 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	t_3 = Float64(Float64(-4.0 * Float64(x * i)) + t_1)
	t_4 = Float64(t * Float64(Float64(z * Float64(x * Float64(18.0 * y))) - Float64(a * 4.0)))
	tmp = 0.0
	if (t <= -2.5e+70)
		tmp = t_4;
	elseif (t <= -31000000000.0)
		tmp = t_3;
	elseif (t <= -2.8e-41)
		tmp = t_2;
	elseif (t <= 1.75e-60)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (t <= 1.08e+15)
		tmp = t_2;
	elseif (t <= 4.8e+109)
		tmp = t_3;
	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 = j * (k * -27.0);
	t_2 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	t_3 = (-4.0 * (x * i)) + t_1;
	t_4 = t * ((z * (x * (18.0 * y))) - (a * 4.0));
	tmp = 0.0;
	if (t <= -2.5e+70)
		tmp = t_4;
	elseif (t <= -31000000000.0)
		tmp = t_3;
	elseif (t <= -2.8e-41)
		tmp = t_2;
	elseif (t <= 1.75e-60)
		tmp = (b * c) + t_1;
	elseif (t <= 1.08e+15)
		tmp = t_2;
	elseif (t <= 4.8e+109)
		tmp = t_3;
	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[(j * N[(k * -27.0), $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]}, Block[{t$95$3 = N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(t * N[(N[(z * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.5e+70], t$95$4, If[LessEqual[t, -31000000000.0], t$95$3, If[LessEqual[t, -2.8e-41], t$95$2, If[LessEqual[t, 1.75e-60], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[t, 1.08e+15], t$95$2, If[LessEqual[t, 4.8e+109], t$95$3, t$95$4]]]]]]]]]]

Derivation

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

Alternative 10: 58.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ t_3 := t_2 + t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;x \leq -1.7 \cdot 10^{-9}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -1.85 \cdot 10^{-36}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{-81}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -2.8 \cdot 10^{-202}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-281}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 5 \cdot 10^{+84}:\\ \;\;\;\;b \cdot c + t_2\\ \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 (* t (* y z))) (* 4.0 i))))
        (t_2 (* j (* k -27.0)))
        (t_3 (+ t_2 (* t (* a -4.0)))))
   (if (<= x -1.7e-9)
     t_1
     (if (<= x -1.85e-36)
       t_3
       (if (<= x -1.7e-81)
         t_1
         (if (<= x -2.8e-202)
           (+ (* b c) (* -4.0 (* t a)))
           (if (<= x 2.45e-281)
             t_3
             (if (<= x 5e+84) (+ (* b c) t_2) 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 * (t * (y * z))) - (4.0 * i));
	double t_2 = j * (k * -27.0);
	double t_3 = t_2 + (t * (a * -4.0));
	double tmp;
	if (x <= -1.7e-9) {
		tmp = t_1;
	} else if (x <= -1.85e-36) {
		tmp = t_3;
	} else if (x <= -1.7e-81) {
		tmp = t_1;
	} else if (x <= -2.8e-202) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (x <= 2.45e-281) {
		tmp = t_3;
	} else if (x <= 5e+84) {
		tmp = (b * c) + t_2;
	} 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 * (t * (y * z))) - (4.0d0 * i))
    t_2 = j * (k * (-27.0d0))
    t_3 = t_2 + (t * (a * (-4.0d0)))
    if (x <= (-1.7d-9)) then
        tmp = t_1
    else if (x <= (-1.85d-36)) then
        tmp = t_3
    else if (x <= (-1.7d-81)) then
        tmp = t_1
    else if (x <= (-2.8d-202)) then
        tmp = (b * c) + ((-4.0d0) * (t * a))
    else if (x <= 2.45d-281) then
        tmp = t_3
    else if (x <= 5d+84) then
        tmp = (b * c) + t_2
    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 * (t * (y * z))) - (4.0 * i));
	double t_2 = j * (k * -27.0);
	double t_3 = t_2 + (t * (a * -4.0));
	double tmp;
	if (x <= -1.7e-9) {
		tmp = t_1;
	} else if (x <= -1.85e-36) {
		tmp = t_3;
	} else if (x <= -1.7e-81) {
		tmp = t_1;
	} else if (x <= -2.8e-202) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (x <= 2.45e-281) {
		tmp = t_3;
	} else if (x <= 5e+84) {
		tmp = (b * c) + t_2;
	} 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 * (t * (y * z))) - (4.0 * i))
	t_2 = j * (k * -27.0)
	t_3 = t_2 + (t * (a * -4.0))
	tmp = 0
	if x <= -1.7e-9:
		tmp = t_1
	elif x <= -1.85e-36:
		tmp = t_3
	elif x <= -1.7e-81:
		tmp = t_1
	elif x <= -2.8e-202:
		tmp = (b * c) + (-4.0 * (t * a))
	elif x <= 2.45e-281:
		tmp = t_3
	elif x <= 5e+84:
		tmp = (b * c) + t_2
	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(t * Float64(y * z))) - Float64(4.0 * i)))
	t_2 = Float64(j * Float64(k * -27.0))
	t_3 = Float64(t_2 + Float64(t * Float64(a * -4.0)))
	tmp = 0.0
	if (x <= -1.7e-9)
		tmp = t_1;
	elseif (x <= -1.85e-36)
		tmp = t_3;
	elseif (x <= -1.7e-81)
		tmp = t_1;
	elseif (x <= -2.8e-202)
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)));
	elseif (x <= 2.45e-281)
		tmp = t_3;
	elseif (x <= 5e+84)
		tmp = Float64(Float64(b * c) + t_2);
	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 * (t * (y * z))) - (4.0 * i));
	t_2 = j * (k * -27.0);
	t_3 = t_2 + (t * (a * -4.0));
	tmp = 0.0;
	if (x <= -1.7e-9)
		tmp = t_1;
	elseif (x <= -1.85e-36)
		tmp = t_3;
	elseif (x <= -1.7e-81)
		tmp = t_1;
	elseif (x <= -2.8e-202)
		tmp = (b * c) + (-4.0 * (t * a));
	elseif (x <= 2.45e-281)
		tmp = t_3;
	elseif (x <= 5e+84)
		tmp = (b * c) + t_2;
	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[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.7e-9], t$95$1, If[LessEqual[x, -1.85e-36], t$95$3, If[LessEqual[x, -1.7e-81], t$95$1, If[LessEqual[x, -2.8e-202], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.45e-281], t$95$3, If[LessEqual[x, 5e+84], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], t$95$1]]]]]]]]]

Derivation

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

Alternative 11: 58.8% 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(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ t_3 := t_2 + t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;x \leq -1.15 \cdot 10^{-11}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq -9.5 \cdot 10^{-37}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{-81}:\\ \;\;\;\;x \cdot \left(\left(y \cdot t\right) \cdot \left(18 \cdot z\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -1.35 \cdot 10^{-199}:\\ \;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\ \mathbf{elif}\;x \leq 2.7 \cdot 10^{-281}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+82}:\\ \;\;\;\;b \cdot c + t_2\\ \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 (* t (* y z))) (* 4.0 i))))
        (t_2 (* j (* k -27.0)))
        (t_3 (+ t_2 (* t (* a -4.0)))))
   (if (<= x -1.15e-11)
     t_1
     (if (<= x -9.5e-37)
       t_3
       (if (<= x -1.7e-81)
         (* x (- (* (* y t) (* 18.0 z)) (* 4.0 i)))
         (if (<= x -1.35e-199)
           (+ (* b c) (* -4.0 (* t a)))
           (if (<= x 2.7e-281)
             t_3
             (if (<= x 5.5e+82) (+ (* b c) t_2) 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 * (t * (y * z))) - (4.0 * i));
	double t_2 = j * (k * -27.0);
	double t_3 = t_2 + (t * (a * -4.0));
	double tmp;
	if (x <= -1.15e-11) {
		tmp = t_1;
	} else if (x <= -9.5e-37) {
		tmp = t_3;
	} else if (x <= -1.7e-81) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= -1.35e-199) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (x <= 2.7e-281) {
		tmp = t_3;
	} else if (x <= 5.5e+82) {
		tmp = (b * c) + t_2;
	} 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 * (t * (y * z))) - (4.0d0 * i))
    t_2 = j * (k * (-27.0d0))
    t_3 = t_2 + (t * (a * (-4.0d0)))
    if (x <= (-1.15d-11)) then
        tmp = t_1
    else if (x <= (-9.5d-37)) then
        tmp = t_3
    else if (x <= (-1.7d-81)) then
        tmp = x * (((y * t) * (18.0d0 * z)) - (4.0d0 * i))
    else if (x <= (-1.35d-199)) then
        tmp = (b * c) + ((-4.0d0) * (t * a))
    else if (x <= 2.7d-281) then
        tmp = t_3
    else if (x <= 5.5d+82) then
        tmp = (b * c) + t_2
    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 * (t * (y * z))) - (4.0 * i));
	double t_2 = j * (k * -27.0);
	double t_3 = t_2 + (t * (a * -4.0));
	double tmp;
	if (x <= -1.15e-11) {
		tmp = t_1;
	} else if (x <= -9.5e-37) {
		tmp = t_3;
	} else if (x <= -1.7e-81) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= -1.35e-199) {
		tmp = (b * c) + (-4.0 * (t * a));
	} else if (x <= 2.7e-281) {
		tmp = t_3;
	} else if (x <= 5.5e+82) {
		tmp = (b * c) + t_2;
	} 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 * (t * (y * z))) - (4.0 * i))
	t_2 = j * (k * -27.0)
	t_3 = t_2 + (t * (a * -4.0))
	tmp = 0
	if x <= -1.15e-11:
		tmp = t_1
	elif x <= -9.5e-37:
		tmp = t_3
	elif x <= -1.7e-81:
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i))
	elif x <= -1.35e-199:
		tmp = (b * c) + (-4.0 * (t * a))
	elif x <= 2.7e-281:
		tmp = t_3
	elif x <= 5.5e+82:
		tmp = (b * c) + t_2
	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(t * Float64(y * z))) - Float64(4.0 * i)))
	t_2 = Float64(j * Float64(k * -27.0))
	t_3 = Float64(t_2 + Float64(t * Float64(a * -4.0)))
	tmp = 0.0
	if (x <= -1.15e-11)
		tmp = t_1;
	elseif (x <= -9.5e-37)
		tmp = t_3;
	elseif (x <= -1.7e-81)
		tmp = Float64(x * Float64(Float64(Float64(y * t) * Float64(18.0 * z)) - Float64(4.0 * i)));
	elseif (x <= -1.35e-199)
		tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)));
	elseif (x <= 2.7e-281)
		tmp = t_3;
	elseif (x <= 5.5e+82)
		tmp = Float64(Float64(b * c) + t_2);
	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 * (t * (y * z))) - (4.0 * i));
	t_2 = j * (k * -27.0);
	t_3 = t_2 + (t * (a * -4.0));
	tmp = 0.0;
	if (x <= -1.15e-11)
		tmp = t_1;
	elseif (x <= -9.5e-37)
		tmp = t_3;
	elseif (x <= -1.7e-81)
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	elseif (x <= -1.35e-199)
		tmp = (b * c) + (-4.0 * (t * a));
	elseif (x <= 2.7e-281)
		tmp = t_3;
	elseif (x <= 5.5e+82)
		tmp = (b * c) + t_2;
	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[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.15e-11], t$95$1, If[LessEqual[x, -9.5e-37], t$95$3, If[LessEqual[x, -1.7e-81], N[(x * N[(N[(N[(y * t), $MachinePrecision] * N[(18.0 * z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.35e-199], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.7e-281], t$95$3, If[LessEqual[x, 5.5e+82], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], t$95$1]]]]]]]]]

Derivation

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

Alternative 12: 54.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 := j \cdot \left(k \cdot -27\right)\\ t_2 := b \cdot c + t_1\\ t_3 := -4 \cdot \left(x \cdot i + t \cdot a\right)\\ \mathbf{if}\;b \cdot c \leq -5.4 \cdot 10^{+48}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq -1.65 \cdot 10^{-65}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq 1.85 \cdot 10^{-116}:\\ \;\;\;\;t_1 + t \cdot \left(a \cdot -4\right)\\ \mathbf{elif}\;b \cdot c \leq 2.6 \cdot 10^{+137}:\\ \;\;\;\;t_3\\ \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)))
        (t_2 (+ (* b c) t_1))
        (t_3 (* -4.0 (+ (* x i) (* t a)))))
   (if (<= (* b c) -5.4e+48)
     t_2
     (if (<= (* b c) -1.65e-65)
       t_3
       (if (<= (* b c) 1.85e-116)
         (+ t_1 (* t (* a -4.0)))
         (if (<= (* b c) 2.6e+137) t_3 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);
	double t_2 = (b * c) + t_1;
	double t_3 = -4.0 * ((x * i) + (t * a));
	double tmp;
	if ((b * c) <= -5.4e+48) {
		tmp = t_2;
	} else if ((b * c) <= -1.65e-65) {
		tmp = t_3;
	} else if ((b * c) <= 1.85e-116) {
		tmp = t_1 + (t * (a * -4.0));
	} else if ((b * c) <= 2.6e+137) {
		tmp = t_3;
	} 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) :: t_3
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (b * c) + t_1
    t_3 = (-4.0d0) * ((x * i) + (t * a))
    if ((b * c) <= (-5.4d+48)) then
        tmp = t_2
    else if ((b * c) <= (-1.65d-65)) then
        tmp = t_3
    else if ((b * c) <= 1.85d-116) then
        tmp = t_1 + (t * (a * (-4.0d0)))
    else if ((b * c) <= 2.6d+137) then
        tmp = t_3
    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);
	double t_2 = (b * c) + t_1;
	double t_3 = -4.0 * ((x * i) + (t * a));
	double tmp;
	if ((b * c) <= -5.4e+48) {
		tmp = t_2;
	} else if ((b * c) <= -1.65e-65) {
		tmp = t_3;
	} else if ((b * c) <= 1.85e-116) {
		tmp = t_1 + (t * (a * -4.0));
	} else if ((b * c) <= 2.6e+137) {
		tmp = t_3;
	} 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)
	t_2 = (b * c) + t_1
	t_3 = -4.0 * ((x * i) + (t * a))
	tmp = 0
	if (b * c) <= -5.4e+48:
		tmp = t_2
	elif (b * c) <= -1.65e-65:
		tmp = t_3
	elif (b * c) <= 1.85e-116:
		tmp = t_1 + (t * (a * -4.0))
	elif (b * c) <= 2.6e+137:
		tmp = t_3
	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(j * Float64(k * -27.0))
	t_2 = Float64(Float64(b * c) + t_1)
	t_3 = Float64(-4.0 * Float64(Float64(x * i) + Float64(t * a)))
	tmp = 0.0
	if (Float64(b * c) <= -5.4e+48)
		tmp = t_2;
	elseif (Float64(b * c) <= -1.65e-65)
		tmp = t_3;
	elseif (Float64(b * c) <= 1.85e-116)
		tmp = Float64(t_1 + Float64(t * Float64(a * -4.0)));
	elseif (Float64(b * c) <= 2.6e+137)
		tmp = t_3;
	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);
	t_2 = (b * c) + t_1;
	t_3 = -4.0 * ((x * i) + (t * a));
	tmp = 0.0;
	if ((b * c) <= -5.4e+48)
		tmp = t_2;
	elseif ((b * c) <= -1.65e-65)
		tmp = t_3;
	elseif ((b * c) <= 1.85e-116)
		tmp = t_1 + (t * (a * -4.0));
	elseif ((b * c) <= 2.6e+137)
		tmp = t_3;
	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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(N[(x * i), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -5.4e+48], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -1.65e-65], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 1.85e-116], N[(t$95$1 + N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.6e+137], t$95$3, t$95$2]]]]]]]

Derivation

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

Alternative 13: 70.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 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -2.2 \cdot 10^{-9}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-78}:\\ \;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+69}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + 18 \cdot \left(x \cdot \left(y \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{+102}:\\ \;\;\;\;b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \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 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -2.2e-9)
     t_1
     (if (<= x 3.1e-78)
       (- (- (* b c) (* 4.0 (* t a))) (* (* j 27.0) k))
       (if (<= x 2e+69)
         (+ (* j (* k -27.0)) (* 18.0 (* x (* y (* z t)))))
         (if (<= x 1.55e+102)
           (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
           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 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -2.2e-9) {
		tmp = t_1;
	} else if (x <= 3.1e-78) {
		tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	} else if (x <= 2e+69) {
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.55e+102) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} 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 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-2.2d-9)) then
        tmp = t_1
    else if (x <= 3.1d-78) then
        tmp = ((b * c) - (4.0d0 * (t * a))) - ((j * 27.0d0) * k)
    else if (x <= 2d+69) then
        tmp = (j * (k * (-27.0d0))) + (18.0d0 * (x * (y * (z * t))))
    else if (x <= 1.55d+102) then
        tmp = (b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))
    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 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -2.2e-9) {
		tmp = t_1;
	} else if (x <= 3.1e-78) {
		tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	} else if (x <= 2e+69) {
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	} else if (x <= 1.55e+102) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} 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 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -2.2e-9:
		tmp = t_1
	elif x <= 3.1e-78:
		tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k)
	elif x <= 2e+69:
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))))
	elif x <= 1.55e+102:
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))
	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(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -2.2e-9)
		tmp = t_1;
	elseif (x <= 3.1e-78)
		tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(j * 27.0) * k));
	elseif (x <= 2e+69)
		tmp = Float64(Float64(j * Float64(k * -27.0)) + Float64(18.0 * Float64(x * Float64(y * Float64(z * t)))));
	elseif (x <= 1.55e+102)
		tmp = Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0))));
	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 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -2.2e-9)
		tmp = t_1;
	elseif (x <= 3.1e-78)
		tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	elseif (x <= 2e+69)
		tmp = (j * (k * -27.0)) + (18.0 * (x * (y * (z * t))));
	elseif (x <= 1.55e+102)
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	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[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.2e-9], t$95$1, If[LessEqual[x, 3.1e-78], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2e+69], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(18.0 * N[(x * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.55e+102], N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

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

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

Derivation

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

Alternative 15: 37.5% 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(x \cdot i\right)\\ \mathbf{if}\;b \cdot c \leq -1.75 \cdot 10^{+62}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -3.7 \cdot 10^{-65}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 1.25 \cdot 10^{-116}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;b \cdot c \leq 2.6 \cdot 10^{+140}:\\ \;\;\;\;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 (* x i))))
   (if (<= (* b c) -1.75e+62)
     (* b c)
     (if (<= (* b c) -3.7e-65)
       t_1
       (if (<= (* b c) 1.25e-116)
         (* -27.0 (* j k))
         (if (<= (* b c) 2.6e+140) 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 * (x * i);
	double tmp;
	if ((b * c) <= -1.75e+62) {
		tmp = b * c;
	} else if ((b * c) <= -3.7e-65) {
		tmp = t_1;
	} else if ((b * c) <= 1.25e-116) {
		tmp = -27.0 * (j * k);
	} else if ((b * c) <= 2.6e+140) {
		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) * (x * i)
    if ((b * c) <= (-1.75d+62)) then
        tmp = b * c
    else if ((b * c) <= (-3.7d-65)) then
        tmp = t_1
    else if ((b * c) <= 1.25d-116) then
        tmp = (-27.0d0) * (j * k)
    else if ((b * c) <= 2.6d+140) 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 * (x * i);
	double tmp;
	if ((b * c) <= -1.75e+62) {
		tmp = b * c;
	} else if ((b * c) <= -3.7e-65) {
		tmp = t_1;
	} else if ((b * c) <= 1.25e-116) {
		tmp = -27.0 * (j * k);
	} else if ((b * c) <= 2.6e+140) {
		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 * (x * i)
	tmp = 0
	if (b * c) <= -1.75e+62:
		tmp = b * c
	elif (b * c) <= -3.7e-65:
		tmp = t_1
	elif (b * c) <= 1.25e-116:
		tmp = -27.0 * (j * k)
	elif (b * c) <= 2.6e+140:
		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(x * i))
	tmp = 0.0
	if (Float64(b * c) <= -1.75e+62)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -3.7e-65)
		tmp = t_1;
	elseif (Float64(b * c) <= 1.25e-116)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (Float64(b * c) <= 2.6e+140)
		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 * (x * i);
	tmp = 0.0;
	if ((b * c) <= -1.75e+62)
		tmp = b * c;
	elseif ((b * c) <= -3.7e-65)
		tmp = t_1;
	elseif ((b * c) <= 1.25e-116)
		tmp = -27.0 * (j * k);
	elseif ((b * c) <= 2.6e+140)
		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[(x * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.75e+62], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -3.7e-65], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1.25e-116], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.6e+140], t$95$1, N[(b * c), $MachinePrecision]]]]]]

Derivation

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

Alternative 16: 54.6% 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 := j \cdot \left(k \cdot -27\right)\\ t_2 := b \cdot c + t_1\\ \mathbf{if}\;b \cdot c \leq -1100:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq 1.05 \cdot 10^{-32}:\\ \;\;\;\;-4 \cdot \left(x \cdot i\right) + t_1\\ \mathbf{elif}\;b \cdot c \leq 2.15 \cdot 10^{+138}:\\ \;\;\;\;-4 \cdot \left(x \cdot i + t \cdot a\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))) (t_2 (+ (* b c) t_1)))
   (if (<= (* b c) -1100.0)
     t_2
     (if (<= (* b c) 1.05e-32)
       (+ (* -4.0 (* x i)) t_1)
       (if (<= (* b c) 2.15e+138) (* -4.0 (+ (* x i) (* t a))) 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);
	double t_2 = (b * c) + t_1;
	double tmp;
	if ((b * c) <= -1100.0) {
		tmp = t_2;
	} else if ((b * c) <= 1.05e-32) {
		tmp = (-4.0 * (x * i)) + t_1;
	} else if ((b * c) <= 2.15e+138) {
		tmp = -4.0 * ((x * i) + (t * a));
	} 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))
    t_2 = (b * c) + t_1
    if ((b * c) <= (-1100.0d0)) then
        tmp = t_2
    else if ((b * c) <= 1.05d-32) then
        tmp = ((-4.0d0) * (x * i)) + t_1
    else if ((b * c) <= 2.15d+138) then
        tmp = (-4.0d0) * ((x * i) + (t * a))
    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);
	double t_2 = (b * c) + t_1;
	double tmp;
	if ((b * c) <= -1100.0) {
		tmp = t_2;
	} else if ((b * c) <= 1.05e-32) {
		tmp = (-4.0 * (x * i)) + t_1;
	} else if ((b * c) <= 2.15e+138) {
		tmp = -4.0 * ((x * i) + (t * a));
	} 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)
	t_2 = (b * c) + t_1
	tmp = 0
	if (b * c) <= -1100.0:
		tmp = t_2
	elif (b * c) <= 1.05e-32:
		tmp = (-4.0 * (x * i)) + t_1
	elif (b * c) <= 2.15e+138:
		tmp = -4.0 * ((x * i) + (t * a))
	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(j * Float64(k * -27.0))
	t_2 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (Float64(b * c) <= -1100.0)
		tmp = t_2;
	elseif (Float64(b * c) <= 1.05e-32)
		tmp = Float64(Float64(-4.0 * Float64(x * i)) + t_1);
	elseif (Float64(b * c) <= 2.15e+138)
		tmp = Float64(-4.0 * Float64(Float64(x * i) + Float64(t * a)));
	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);
	t_2 = (b * c) + t_1;
	tmp = 0.0;
	if ((b * c) <= -1100.0)
		tmp = t_2;
	elseif ((b * c) <= 1.05e-32)
		tmp = (-4.0 * (x * i)) + t_1;
	elseif ((b * c) <= 2.15e+138)
		tmp = -4.0 * ((x * i) + (t * a));
	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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1100.0], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], 1.05e-32], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.15e+138], N[(-4.0 * N[(N[(x * i), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

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

Alternative 17: 46.4% 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 := b \cdot c + -4 \cdot \left(t \cdot a\right)\\ t_2 := -4 \cdot \left(x \cdot i + t \cdot a\right)\\ \mathbf{if}\;x \leq -5.4 \cdot 10^{+42}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-78}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 5.8 \cdot 10^{+58}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 5.9 \cdot 10^{+99}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{+169}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot t\right) \cdot \left(x \cdot \left(18 \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* b c) (* -4.0 (* t a)))) (t_2 (* -4.0 (+ (* x i) (* t a)))))
   (if (<= x -5.4e+42)
     t_2
     (if (<= x 1.35e-78)
       t_1
       (if (<= x 5.8e+58)
         (* -27.0 (* j k))
         (if (<= x 5.9e+99)
           t_1
           (if (<= x 1.3e+169) t_2 (* (* z t) (* x (* 18.0 y))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + (-4.0 * (t * a));
	double t_2 = -4.0 * ((x * i) + (t * a));
	double tmp;
	if (x <= -5.4e+42) {
		tmp = t_2;
	} else if (x <= 1.35e-78) {
		tmp = t_1;
	} else if (x <= 5.8e+58) {
		tmp = -27.0 * (j * k);
	} else if (x <= 5.9e+99) {
		tmp = t_1;
	} else if (x <= 1.3e+169) {
		tmp = t_2;
	} else {
		tmp = (z * t) * (x * (18.0 * y));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (b * c) + ((-4.0d0) * (t * a))
    t_2 = (-4.0d0) * ((x * i) + (t * a))
    if (x <= (-5.4d+42)) then
        tmp = t_2
    else if (x <= 1.35d-78) then
        tmp = t_1
    else if (x <= 5.8d+58) then
        tmp = (-27.0d0) * (j * k)
    else if (x <= 5.9d+99) then
        tmp = t_1
    else if (x <= 1.3d+169) then
        tmp = t_2
    else
        tmp = (z * t) * (x * (18.0d0 * y))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + (-4.0 * (t * a));
	double t_2 = -4.0 * ((x * i) + (t * a));
	double tmp;
	if (x <= -5.4e+42) {
		tmp = t_2;
	} else if (x <= 1.35e-78) {
		tmp = t_1;
	} else if (x <= 5.8e+58) {
		tmp = -27.0 * (j * k);
	} else if (x <= 5.9e+99) {
		tmp = t_1;
	} else if (x <= 1.3e+169) {
		tmp = t_2;
	} else {
		tmp = (z * t) * (x * (18.0 * y));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) + (-4.0 * (t * a))
	t_2 = -4.0 * ((x * i) + (t * a))
	tmp = 0
	if x <= -5.4e+42:
		tmp = t_2
	elif x <= 1.35e-78:
		tmp = t_1
	elif x <= 5.8e+58:
		tmp = -27.0 * (j * k)
	elif x <= 5.9e+99:
		tmp = t_1
	elif x <= 1.3e+169:
		tmp = t_2
	else:
		tmp = (z * t) * (x * (18.0 * y))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)))
	t_2 = Float64(-4.0 * Float64(Float64(x * i) + Float64(t * a)))
	tmp = 0.0
	if (x <= -5.4e+42)
		tmp = t_2;
	elseif (x <= 1.35e-78)
		tmp = t_1;
	elseif (x <= 5.8e+58)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (x <= 5.9e+99)
		tmp = t_1;
	elseif (x <= 1.3e+169)
		tmp = t_2;
	else
		tmp = Float64(Float64(z * t) * Float64(x * Float64(18.0 * y)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) + (-4.0 * (t * a));
	t_2 = -4.0 * ((x * i) + (t * a));
	tmp = 0.0;
	if (x <= -5.4e+42)
		tmp = t_2;
	elseif (x <= 1.35e-78)
		tmp = t_1;
	elseif (x <= 5.8e+58)
		tmp = -27.0 * (j * k);
	elseif (x <= 5.9e+99)
		tmp = t_1;
	elseif (x <= 1.3e+169)
		tmp = t_2;
	else
		tmp = (z * t) * (x * (18.0 * y));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 18: 50.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;b \cdot c \leq -2.1 \cdot 10^{+170} \lor \neg \left(b \cdot c \leq 7.8 \cdot 10^{+139}\right):\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(x \cdot i + 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 (<= (* b c) -2.1e+170) (not (<= (* b c) 7.8e+139)))
   (* b c)
   (* -4.0 (+ (* x i) (* 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 (((b * c) <= -2.1e+170) || !((b * c) <= 7.8e+139)) {
		tmp = b * c;
	} else {
		tmp = -4.0 * ((x * i) + (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 (((b * c) <= (-2.1d+170)) .or. (.not. ((b * c) <= 7.8d+139))) then
        tmp = b * c
    else
        tmp = (-4.0d0) * ((x * i) + (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 (((b * c) <= -2.1e+170) || !((b * c) <= 7.8e+139)) {
		tmp = b * c;
	} else {
		tmp = -4.0 * ((x * i) + (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 ((b * c) <= -2.1e+170) or not ((b * c) <= 7.8e+139):
		tmp = b * c
	else:
		tmp = -4.0 * ((x * i) + (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 ((Float64(b * c) <= -2.1e+170) || !(Float64(b * c) <= 7.8e+139))
		tmp = Float64(b * c);
	else
		tmp = Float64(-4.0 * Float64(Float64(x * i) + 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 (((b * c) <= -2.1e+170) || ~(((b * c) <= 7.8e+139)))
		tmp = b * c;
	else
		tmp = -4.0 * ((x * i) + (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[N[(b * c), $MachinePrecision], -2.1e+170], N[Not[LessEqual[N[(b * c), $MachinePrecision], 7.8e+139]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(-4.0 * N[(N[(x * i), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 19: 52.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;b \cdot c \leq -2.7 \cdot 10^{+48} \lor \neg \left(b \cdot c \leq 2.7 \cdot 10^{+137}\right):\\ \;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \left(x \cdot i + 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 (<= (* b c) -2.7e+48) (not (<= (* b c) 2.7e+137)))
   (+ (* b c) (* j (* k -27.0)))
   (* -4.0 (+ (* x i) (* 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 (((b * c) <= -2.7e+48) || !((b * c) <= 2.7e+137)) {
		tmp = (b * c) + (j * (k * -27.0));
	} else {
		tmp = -4.0 * ((x * i) + (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 (((b * c) <= (-2.7d+48)) .or. (.not. ((b * c) <= 2.7d+137))) then
        tmp = (b * c) + (j * (k * (-27.0d0)))
    else
        tmp = (-4.0d0) * ((x * i) + (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 (((b * c) <= -2.7e+48) || !((b * c) <= 2.7e+137)) {
		tmp = (b * c) + (j * (k * -27.0));
	} else {
		tmp = -4.0 * ((x * i) + (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 ((b * c) <= -2.7e+48) or not ((b * c) <= 2.7e+137):
		tmp = (b * c) + (j * (k * -27.0))
	else:
		tmp = -4.0 * ((x * i) + (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 ((Float64(b * c) <= -2.7e+48) || !(Float64(b * c) <= 2.7e+137))
		tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)));
	else
		tmp = Float64(-4.0 * Float64(Float64(x * i) + 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 (((b * c) <= -2.7e+48) || ~(((b * c) <= 2.7e+137)))
		tmp = (b * c) + (j * (k * -27.0));
	else
		tmp = -4.0 * ((x * i) + (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[N[(b * c), $MachinePrecision], -2.7e+48], N[Not[LessEqual[N[(b * c), $MachinePrecision], 2.7e+137]], $MachinePrecision]], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(x * i), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 20: 36.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}\;b \cdot c \leq -1.15 \cdot 10^{-49} \lor \neg \left(b \cdot c \leq 1.04 \cdot 10^{+40}\right):\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (((b * c) <= (-1.15d-49)) .or. (.not. ((b * c) <= 1.04d+40))) then
        tmp = b * c
    else
        tmp = (-27.0d0) * (j * k)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 21: 23.7% 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 2024008 
(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)))