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

Percentage Accurate: 84.4% → 90.4%

Time: 29.3s

Alternatives: 22

Speedup: 0.5×

• 50.9% 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: 84.4% 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: 90.4% 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 := t \cdot \left(a \cdot 4\right)\\ \mathbf{if}\;\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t_1\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k \leq \infty:\\ \;\;\;\;\left(b \cdot c + \left(18 \cdot \left(z \cdot \left(y \cdot \left(x \cdot t\right)\right)\right) - t_1\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
 (let* ((t_1 (* t (* a 4.0))))
   (if (<=
        (-
         (- (+ (- (* (* (* (* x 18.0) y) z) t) t_1) (* b c)) (* (* x 4.0) i))
         (* (* j 27.0) k))
        INFINITY)
     (-
      (+ (* b c) (- (* 18.0 (* z (* y (* x t)))) t_1))
      (+ (* 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 t_1 = t * (a * 4.0);
	double tmp;
	if (((((((((x * 18.0) * y) * z) * t) - t_1) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= ((double) INFINITY)) {
		tmp = ((b * c) + ((18.0 * (z * (y * (x * t)))) - t_1)) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} 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 = t * (a * 4.0);
	double tmp;
	if (((((((((x * 18.0) * y) * z) * t) - t_1) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= Double.POSITIVE_INFINITY) {
		tmp = ((b * c) + ((18.0 * (z * (y * (x * t)))) - t_1)) - ((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):
	t_1 = t * (a * 4.0)
	tmp = 0
	if ((((((((x * 18.0) * y) * z) * t) - t_1) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= math.inf:
		tmp = ((b * c) + ((18.0 * (z * (y * (x * t)))) - t_1)) - ((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)
	t_1 = Float64(t * Float64(a * 4.0))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - t_1) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) <= Inf)
		tmp = Float64(Float64(Float64(b * c) + Float64(Float64(18.0 * Float64(z * Float64(y * Float64(x * t)))) - t_1)) - 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)
	t_1 = t * (a * 4.0);
	tmp = 0.0;
	if (((((((((x * 18.0) * y) * z) * t) - t_1) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= Inf)
		tmp = ((b * c) + ((18.0 * (z * (y * (x * t)))) - t_1)) - ((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_] := Block[{t$95$1 = N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - t$95$1), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(18.0 * N[(z * N[(y * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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 2: 84.4% 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 := \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_1 \leq 2 \cdot 10^{+133}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right)\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - 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 (* (* j 27.0) k)))
   (if (<= t_1 2e+133)
     (-
      (+ (* b c) (* t (- (* (* x 18.0) (* y z)) (* a 4.0))))
      (+ (* x (* 4.0 i)) (* j (* 27.0 k))))
     (- (- (* b c) (* 4.0 (* t a))) 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 = (j * 27.0) * k;
	double tmp;
	if (t_1 <= 2e+133) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = ((b * c) - (4.0 * (t * a))) - 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 = (j * 27.0d0) * k
    if (t_1 <= 2d+133) then
        tmp = ((b * c) + (t * (((x * 18.0d0) * (y * z)) - (a * 4.0d0)))) - ((x * (4.0d0 * i)) + (j * (27.0d0 * k)))
    else
        tmp = ((b * c) - (4.0d0 * (t * a))) - 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 = (j * 27.0) * k;
	double tmp;
	if (t_1 <= 2e+133) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = ((b * c) - (4.0 * (t * a))) - 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 = (j * 27.0) * k
	tmp = 0
	if t_1 <= 2e+133:
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)))
	else:
		tmp = ((b * c) - (4.0 * (t * a))) - 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(Float64(j * 27.0) * k)
	tmp = 0.0
	if (t_1 <= 2e+133)
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(x * 18.0) * Float64(y * z)) - Float64(a * 4.0)))) - Float64(Float64(x * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k))));
	else
		tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - 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 = (j * 27.0) * k;
	tmp = 0.0;
	if (t_1 <= 2e+133)
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	else
		tmp = ((b * c) - (4.0 * (t * a))) - 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[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t$95$1, 2e+133], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(x * 18.0), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 3: 78.8% accurate, 1.1× speedup

Math

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

Derivation

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

Alternative 4: 54.9% 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 := -27 \cdot \left(j \cdot k\right) + \left(t \cdot a\right) \cdot -4\\ \mathbf{if}\;b \cdot c \leq -6.3 \cdot 10^{+38}:\\ \;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{elif}\;b \cdot c \leq -3.9 \cdot 10^{-45}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq -3.4 \cdot 10^{-64}:\\ \;\;\;\;18 \cdot \left(y \cdot \left(x \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq 2.3 \cdot 10^{+140}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* -27.0 (* j k)) (* (* t a) -4.0))))
   (if (<= (* b c) -6.3e+38)
     (+ (* b c) (* j (* k -27.0)))
     (if (<= (* b c) -3.9e-45)
       t_1
       (if (<= (* b c) -3.4e-64)
         (* 18.0 (* y (* x (* z t))))
         (if (<= (* b c) 2.3e+140) t_1 (- (* b c) (* 4.0 (* x i)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	double tmp;
	if ((b * c) <= -6.3e+38) {
		tmp = (b * c) + (j * (k * -27.0));
	} else if ((b * c) <= -3.9e-45) {
		tmp = t_1;
	} else if ((b * c) <= -3.4e-64) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 2.3e+140) {
		tmp = t_1;
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((-27.0d0) * (j * k)) + ((t * a) * (-4.0d0))
    if ((b * c) <= (-6.3d+38)) then
        tmp = (b * c) + (j * (k * (-27.0d0)))
    else if ((b * c) <= (-3.9d-45)) then
        tmp = t_1
    else if ((b * c) <= (-3.4d-64)) then
        tmp = 18.0d0 * (y * (x * (z * t)))
    else if ((b * c) <= 2.3d+140) then
        tmp = t_1
    else
        tmp = (b * c) - (4.0d0 * (x * i))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	double tmp;
	if ((b * c) <= -6.3e+38) {
		tmp = (b * c) + (j * (k * -27.0));
	} else if ((b * c) <= -3.9e-45) {
		tmp = t_1;
	} else if ((b * c) <= -3.4e-64) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 2.3e+140) {
		tmp = t_1;
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (-27.0 * (j * k)) + ((t * a) * -4.0)
	tmp = 0
	if (b * c) <= -6.3e+38:
		tmp = (b * c) + (j * (k * -27.0))
	elif (b * c) <= -3.9e-45:
		tmp = t_1
	elif (b * c) <= -3.4e-64:
		tmp = 18.0 * (y * (x * (z * t)))
	elif (b * c) <= 2.3e+140:
		tmp = t_1
	else:
		tmp = (b * c) - (4.0 * (x * i))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(t * a) * -4.0))
	tmp = 0.0
	if (Float64(b * c) <= -6.3e+38)
		tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)));
	elseif (Float64(b * c) <= -3.9e-45)
		tmp = t_1;
	elseif (Float64(b * c) <= -3.4e-64)
		tmp = Float64(18.0 * Float64(y * Float64(x * Float64(z * t))));
	elseif (Float64(b * c) <= 2.3e+140)
		tmp = t_1;
	else
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	tmp = 0.0;
	if ((b * c) <= -6.3e+38)
		tmp = (b * c) + (j * (k * -27.0));
	elseif ((b * c) <= -3.9e-45)
		tmp = t_1;
	elseif ((b * c) <= -3.4e-64)
		tmp = 18.0 * (y * (x * (z * t)));
	elseif ((b * c) <= 2.3e+140)
		tmp = t_1;
	else
		tmp = (b * c) - (4.0 * (x * i));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 5: 55.1% 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 := \left(t \cdot a\right) \cdot -4\\ \mathbf{if}\;b \cdot c \leq -1.08 \cdot 10^{+39}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;b \cdot c \leq -1.55 \cdot 10^{-46}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;b \cdot c \leq -3.1 \cdot 10^{-64}:\\ \;\;\;\;18 \cdot \left(y \cdot \left(x \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq 7.8 \cdot 10^{+126}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right) + t_2\\ \mathbf{else}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))) (t_2 (* (* t a) -4.0)))
   (if (<= (* b c) -1.08e+39)
     (+ (* b c) t_1)
     (if (<= (* b c) -1.55e-46)
       (+ t_1 t_2)
       (if (<= (* b c) -3.1e-64)
         (* 18.0 (* y (* x (* z t))))
         (if (<= (* b c) 7.8e+126)
           (+ (* -27.0 (* j k)) t_2)
           (- (* b c) (* 4.0 (* x i)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (t * a) * -4.0;
	double tmp;
	if ((b * c) <= -1.08e+39) {
		tmp = (b * c) + t_1;
	} else if ((b * c) <= -1.55e-46) {
		tmp = t_1 + t_2;
	} else if ((b * c) <= -3.1e-64) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 7.8e+126) {
		tmp = (-27.0 * (j * k)) + t_2;
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    if ((b * c) <= (-1.08d+39)) then
        tmp = (b * c) + t_1
    else if ((b * c) <= (-1.55d-46)) then
        tmp = t_1 + t_2
    else if ((b * c) <= (-3.1d-64)) then
        tmp = 18.0d0 * (y * (x * (z * t)))
    else if ((b * c) <= 7.8d+126) then
        tmp = ((-27.0d0) * (j * k)) + t_2
    else
        tmp = (b * c) - (4.0d0 * (x * i))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (t * a) * -4.0;
	double tmp;
	if ((b * c) <= -1.08e+39) {
		tmp = (b * c) + t_1;
	} else if ((b * c) <= -1.55e-46) {
		tmp = t_1 + t_2;
	} else if ((b * c) <= -3.1e-64) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 7.8e+126) {
		tmp = (-27.0 * (j * k)) + t_2;
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	tmp = 0
	if (b * c) <= -1.08e+39:
		tmp = (b * c) + t_1
	elif (b * c) <= -1.55e-46:
		tmp = t_1 + t_2
	elif (b * c) <= -3.1e-64:
		tmp = 18.0 * (y * (x * (z * t)))
	elif (b * c) <= 7.8e+126:
		tmp = (-27.0 * (j * k)) + t_2
	else:
		tmp = (b * c) - (4.0 * (x * i))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(t * a) * -4.0)
	tmp = 0.0
	if (Float64(b * c) <= -1.08e+39)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (Float64(b * c) <= -1.55e-46)
		tmp = Float64(t_1 + t_2);
	elseif (Float64(b * c) <= -3.1e-64)
		tmp = Float64(18.0 * Float64(y * Float64(x * Float64(z * t))));
	elseif (Float64(b * c) <= 7.8e+126)
		tmp = Float64(Float64(-27.0 * Float64(j * k)) + t_2);
	else
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (t * a) * -4.0;
	tmp = 0.0;
	if ((b * c) <= -1.08e+39)
		tmp = (b * c) + t_1;
	elseif ((b * c) <= -1.55e-46)
		tmp = t_1 + t_2;
	elseif ((b * c) <= -3.1e-64)
		tmp = 18.0 * (y * (x * (z * t)));
	elseif ((b * c) <= 7.8e+126)
		tmp = (-27.0 * (j * k)) + t_2;
	else
		tmp = (b * c) - (4.0 * (x * i));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 6: 55.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 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;b \cdot c \leq -1.6 \cdot 10^{+39}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;b \cdot c \leq -4.8 \cdot 10^{-45}:\\ \;\;\;\;t_1 + \left(t \cdot a\right) \cdot -4\\ \mathbf{elif}\;b \cdot c \leq -6 \cdot 10^{-71}:\\ \;\;\;\;18 \cdot \left(y \cdot \left(x \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;b \cdot c \leq 4.5 \cdot 10^{+131}:\\ \;\;\;\;t \cdot \left(a \cdot -4\right) + k \cdot \left(j \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))))
   (if (<= (* b c) -1.6e+39)
     (+ (* b c) t_1)
     (if (<= (* b c) -4.8e-45)
       (+ t_1 (* (* t a) -4.0))
       (if (<= (* b c) -6e-71)
         (* 18.0 (* y (* x (* z t))))
         (if (<= (* b c) 4.5e+131)
           (+ (* t (* a -4.0)) (* k (* j -27.0)))
           (- (* b c) (* 4.0 (* x i)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double tmp;
	if ((b * c) <= -1.6e+39) {
		tmp = (b * c) + t_1;
	} else if ((b * c) <= -4.8e-45) {
		tmp = t_1 + ((t * a) * -4.0);
	} else if ((b * c) <= -6e-71) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 4.5e+131) {
		tmp = (t * (a * -4.0)) + (k * (j * -27.0));
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    if ((b * c) <= (-1.6d+39)) then
        tmp = (b * c) + t_1
    else if ((b * c) <= (-4.8d-45)) then
        tmp = t_1 + ((t * a) * (-4.0d0))
    else if ((b * c) <= (-6d-71)) then
        tmp = 18.0d0 * (y * (x * (z * t)))
    else if ((b * c) <= 4.5d+131) then
        tmp = (t * (a * (-4.0d0))) + (k * (j * (-27.0d0)))
    else
        tmp = (b * c) - (4.0d0 * (x * i))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double tmp;
	if ((b * c) <= -1.6e+39) {
		tmp = (b * c) + t_1;
	} else if ((b * c) <= -4.8e-45) {
		tmp = t_1 + ((t * a) * -4.0);
	} else if ((b * c) <= -6e-71) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if ((b * c) <= 4.5e+131) {
		tmp = (t * (a * -4.0)) + (k * (j * -27.0));
	} else {
		tmp = (b * c) - (4.0 * (x * i));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	tmp = 0
	if (b * c) <= -1.6e+39:
		tmp = (b * c) + t_1
	elif (b * c) <= -4.8e-45:
		tmp = t_1 + ((t * a) * -4.0)
	elif (b * c) <= -6e-71:
		tmp = 18.0 * (y * (x * (z * t)))
	elif (b * c) <= 4.5e+131:
		tmp = (t * (a * -4.0)) + (k * (j * -27.0))
	else:
		tmp = (b * c) - (4.0 * (x * i))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (Float64(b * c) <= -1.6e+39)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (Float64(b * c) <= -4.8e-45)
		tmp = Float64(t_1 + Float64(Float64(t * a) * -4.0));
	elseif (Float64(b * c) <= -6e-71)
		tmp = Float64(18.0 * Float64(y * Float64(x * Float64(z * t))));
	elseif (Float64(b * c) <= 4.5e+131)
		tmp = Float64(Float64(t * Float64(a * -4.0)) + Float64(k * Float64(j * -27.0)));
	else
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	tmp = 0.0;
	if ((b * c) <= -1.6e+39)
		tmp = (b * c) + t_1;
	elseif ((b * c) <= -4.8e-45)
		tmp = t_1 + ((t * a) * -4.0);
	elseif ((b * c) <= -6e-71)
		tmp = 18.0 * (y * (x * (z * t)));
	elseif ((b * c) <= 4.5e+131)
		tmp = (t * (a * -4.0)) + (k * (j * -27.0));
	else
		tmp = (b * c) - (4.0 * (x * i));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 7: 48.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := b \cdot c + t_1\\ t_3 := 18 \cdot \left(\left(x \cdot t\right) \cdot \left(y \cdot z\right)\right)\\ t_4 := -27 \cdot \left(j \cdot k\right) + \left(t \cdot a\right) \cdot -4\\ \mathbf{if}\;a \leq -5 \cdot 10^{-26}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;a \leq -2.6 \cdot 10^{-70}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;a \leq -2.1 \cdot 10^{-266}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 4.2 \cdot 10^{-208}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;a \leq 1.9 \cdot 10^{-164}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;a \leq 5.6 \cdot 10^{-95}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;a \leq 2.1 \cdot 10^{+160}:\\ \;\;\;\;t_1 + x \cdot \left(i \cdot -4\right)\\ \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 (+ (* b c) t_1))
        (t_3 (* 18.0 (* (* x t) (* y z))))
        (t_4 (+ (* -27.0 (* j k)) (* (* t a) -4.0))))
   (if (<= a -5e-26)
     t_4
     (if (<= a -2.6e-70)
       t_3
       (if (<= a -2.1e-266)
         t_2
         (if (<= a 4.2e-208)
           (- (* b c) (* 4.0 (* x i)))
           (if (<= a 1.9e-164)
             t_2
             (if (<= a 5.6e-95)
               t_3
               (if (<= a 2.1e+160) (+ t_1 (* x (* i -4.0))) 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 = (b * c) + t_1;
	double t_3 = 18.0 * ((x * t) * (y * z));
	double t_4 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	double tmp;
	if (a <= -5e-26) {
		tmp = t_4;
	} else if (a <= -2.6e-70) {
		tmp = t_3;
	} else if (a <= -2.1e-266) {
		tmp = t_2;
	} else if (a <= 4.2e-208) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (a <= 1.9e-164) {
		tmp = t_2;
	} else if (a <= 5.6e-95) {
		tmp = t_3;
	} else if (a <= 2.1e+160) {
		tmp = t_1 + (x * (i * -4.0));
	} 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 = (b * c) + t_1
    t_3 = 18.0d0 * ((x * t) * (y * z))
    t_4 = ((-27.0d0) * (j * k)) + ((t * a) * (-4.0d0))
    if (a <= (-5d-26)) then
        tmp = t_4
    else if (a <= (-2.6d-70)) then
        tmp = t_3
    else if (a <= (-2.1d-266)) then
        tmp = t_2
    else if (a <= 4.2d-208) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (a <= 1.9d-164) then
        tmp = t_2
    else if (a <= 5.6d-95) then
        tmp = t_3
    else if (a <= 2.1d+160) then
        tmp = t_1 + (x * (i * (-4.0d0)))
    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 = (b * c) + t_1;
	double t_3 = 18.0 * ((x * t) * (y * z));
	double t_4 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	double tmp;
	if (a <= -5e-26) {
		tmp = t_4;
	} else if (a <= -2.6e-70) {
		tmp = t_3;
	} else if (a <= -2.1e-266) {
		tmp = t_2;
	} else if (a <= 4.2e-208) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (a <= 1.9e-164) {
		tmp = t_2;
	} else if (a <= 5.6e-95) {
		tmp = t_3;
	} else if (a <= 2.1e+160) {
		tmp = t_1 + (x * (i * -4.0));
	} 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 = (b * c) + t_1
	t_3 = 18.0 * ((x * t) * (y * z))
	t_4 = (-27.0 * (j * k)) + ((t * a) * -4.0)
	tmp = 0
	if a <= -5e-26:
		tmp = t_4
	elif a <= -2.6e-70:
		tmp = t_3
	elif a <= -2.1e-266:
		tmp = t_2
	elif a <= 4.2e-208:
		tmp = (b * c) - (4.0 * (x * i))
	elif a <= 1.9e-164:
		tmp = t_2
	elif a <= 5.6e-95:
		tmp = t_3
	elif a <= 2.1e+160:
		tmp = t_1 + (x * (i * -4.0))
	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(Float64(b * c) + t_1)
	t_3 = Float64(18.0 * Float64(Float64(x * t) * Float64(y * z)))
	t_4 = Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(t * a) * -4.0))
	tmp = 0.0
	if (a <= -5e-26)
		tmp = t_4;
	elseif (a <= -2.6e-70)
		tmp = t_3;
	elseif (a <= -2.1e-266)
		tmp = t_2;
	elseif (a <= 4.2e-208)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (a <= 1.9e-164)
		tmp = t_2;
	elseif (a <= 5.6e-95)
		tmp = t_3;
	elseif (a <= 2.1e+160)
		tmp = Float64(t_1 + Float64(x * Float64(i * -4.0)));
	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 = (b * c) + t_1;
	t_3 = 18.0 * ((x * t) * (y * z));
	t_4 = (-27.0 * (j * k)) + ((t * a) * -4.0);
	tmp = 0.0;
	if (a <= -5e-26)
		tmp = t_4;
	elseif (a <= -2.6e-70)
		tmp = t_3;
	elseif (a <= -2.1e-266)
		tmp = t_2;
	elseif (a <= 4.2e-208)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (a <= 1.9e-164)
		tmp = t_2;
	elseif (a <= 5.6e-95)
		tmp = t_3;
	elseif (a <= 2.1e+160)
		tmp = t_1 + (x * (i * -4.0));
	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[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(18.0 * N[(N[(x * t), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -5e-26], t$95$4, If[LessEqual[a, -2.6e-70], t$95$3, If[LessEqual[a, -2.1e-266], t$95$2, If[LessEqual[a, 4.2e-208], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.9e-164], t$95$2, If[LessEqual[a, 5.6e-95], t$95$3, If[LessEqual[a, 2.1e+160], N[(t$95$1 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$4]]]]]]]]]]]

Derivation

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

Alternative 8: 58.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ t_2 := j \cdot \left(k \cdot -27\right) + x \cdot \left(i \cdot -4\right)\\ t_3 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{if}\;t \leq -3.7 \cdot 10^{+25}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;t \leq -9 \cdot 10^{-136}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq -2.75 \cdot 10^{-306}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{-228}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 0.42:\\ \;\;\;\;t_1\\ \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 (- (* b c) (* 4.0 (* x i))))
        (t_2 (+ (* j (* k -27.0)) (* x (* i -4.0))))
        (t_3 (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))))
   (if (<= t -3.7e+25)
     t_3
     (if (<= t -9e-136)
       t_2
       (if (<= t -2.75e-306)
         t_1
         (if (<= t 3.8e-228) t_2 (if (<= t 0.42) t_1 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 = (b * c) - (4.0 * (x * i));
	double t_2 = (j * (k * -27.0)) + (x * (i * -4.0));
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -3.7e+25) {
		tmp = t_3;
	} else if (t <= -9e-136) {
		tmp = t_2;
	} else if (t <= -2.75e-306) {
		tmp = t_1;
	} else if (t <= 3.8e-228) {
		tmp = t_2;
	} else if (t <= 0.42) {
		tmp = t_1;
	} 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 = (b * c) - (4.0d0 * (x * i))
    t_2 = (j * (k * (-27.0d0))) + (x * (i * (-4.0d0)))
    t_3 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    if (t <= (-3.7d+25)) then
        tmp = t_3
    else if (t <= (-9d-136)) then
        tmp = t_2
    else if (t <= (-2.75d-306)) then
        tmp = t_1
    else if (t <= 3.8d-228) then
        tmp = t_2
    else if (t <= 0.42d0) then
        tmp = t_1
    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 = (b * c) - (4.0 * (x * i));
	double t_2 = (j * (k * -27.0)) + (x * (i * -4.0));
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double tmp;
	if (t <= -3.7e+25) {
		tmp = t_3;
	} else if (t <= -9e-136) {
		tmp = t_2;
	} else if (t <= -2.75e-306) {
		tmp = t_1;
	} else if (t <= 3.8e-228) {
		tmp = t_2;
	} else if (t <= 0.42) {
		tmp = t_1;
	} 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 = (b * c) - (4.0 * (x * i))
	t_2 = (j * (k * -27.0)) + (x * (i * -4.0))
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	tmp = 0
	if t <= -3.7e+25:
		tmp = t_3
	elif t <= -9e-136:
		tmp = t_2
	elif t <= -2.75e-306:
		tmp = t_1
	elif t <= 3.8e-228:
		tmp = t_2
	elif t <= 0.42:
		tmp = t_1
	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(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	t_2 = Float64(Float64(j * Float64(k * -27.0)) + Float64(x * Float64(i * -4.0)))
	t_3 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	tmp = 0.0
	if (t <= -3.7e+25)
		tmp = t_3;
	elseif (t <= -9e-136)
		tmp = t_2;
	elseif (t <= -2.75e-306)
		tmp = t_1;
	elseif (t <= 3.8e-228)
		tmp = t_2;
	elseif (t <= 0.42)
		tmp = t_1;
	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 = (b * c) - (4.0 * (x * i));
	t_2 = (j * (k * -27.0)) + (x * (i * -4.0));
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	tmp = 0.0;
	if (t <= -3.7e+25)
		tmp = t_3;
	elseif (t <= -9e-136)
		tmp = t_2;
	elseif (t <= -2.75e-306)
		tmp = t_1;
	elseif (t <= 3.8e-228)
		tmp = t_2;
	elseif (t <= 0.42)
		tmp = t_1;
	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[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.7e+25], t$95$3, If[LessEqual[t, -9e-136], t$95$2, If[LessEqual[t, -2.75e-306], t$95$1, If[LessEqual[t, 3.8e-228], t$95$2, If[LessEqual[t, 0.42], t$95$1, t$95$3]]]]]]]]

Derivation

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

Alternative 9: 57.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\ [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := \left(t \cdot a\right) \cdot -4\\ t_2 := x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -9.5 \cdot 10^{-41}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{-23}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + t_1\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+84}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 7 \cdot 10^{+130}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right) + t_1\\ \mathbf{elif}\;x \leq 6.1 \cdot 10^{+144}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\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 (* (* t a) -4.0))
        (t_2 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -9.5e-41)
     t_2
     (if (<= x 9.2e-23)
       (+ (* j (* k -27.0)) t_1)
       (if (<= x 6.2e+84)
         t_2
         (if (<= x 7e+130)
           (+ (* -27.0 (* j k)) t_1)
           (if (<= x 6.1e+144)
             (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
             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 = (t * a) * -4.0;
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -9.5e-41) {
		tmp = t_2;
	} else if (x <= 9.2e-23) {
		tmp = (j * (k * -27.0)) + t_1;
	} else if (x <= 6.2e+84) {
		tmp = t_2;
	} else if (x <= 7e+130) {
		tmp = (-27.0 * (j * k)) + t_1;
	} else if (x <= 6.1e+144) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} 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 = (t * a) * (-4.0d0)
    t_2 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-9.5d-41)) then
        tmp = t_2
    else if (x <= 9.2d-23) then
        tmp = (j * (k * (-27.0d0))) + t_1
    else if (x <= 6.2d+84) then
        tmp = t_2
    else if (x <= 7d+130) then
        tmp = ((-27.0d0) * (j * k)) + t_1
    else if (x <= 6.1d+144) then
        tmp = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    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 = (t * a) * -4.0;
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -9.5e-41) {
		tmp = t_2;
	} else if (x <= 9.2e-23) {
		tmp = (j * (k * -27.0)) + t_1;
	} else if (x <= 6.2e+84) {
		tmp = t_2;
	} else if (x <= 7e+130) {
		tmp = (-27.0 * (j * k)) + t_1;
	} else if (x <= 6.1e+144) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} 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 = (t * a) * -4.0
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -9.5e-41:
		tmp = t_2
	elif x <= 9.2e-23:
		tmp = (j * (k * -27.0)) + t_1
	elif x <= 6.2e+84:
		tmp = t_2
	elif x <= 7e+130:
		tmp = (-27.0 * (j * k)) + t_1
	elif x <= 6.1e+144:
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	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(t * a) * -4.0)
	t_2 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -9.5e-41)
		tmp = t_2;
	elseif (x <= 9.2e-23)
		tmp = Float64(Float64(j * Float64(k * -27.0)) + t_1);
	elseif (x <= 6.2e+84)
		tmp = t_2;
	elseif (x <= 7e+130)
		tmp = Float64(Float64(-27.0 * Float64(j * k)) + t_1);
	elseif (x <= 6.1e+144)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)));
	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 = (t * a) * -4.0;
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -9.5e-41)
		tmp = t_2;
	elseif (x <= 9.2e-23)
		tmp = (j * (k * -27.0)) + t_1;
	elseif (x <= 6.2e+84)
		tmp = t_2;
	elseif (x <= 7e+130)
		tmp = (-27.0 * (j * k)) + t_1;
	elseif (x <= 6.1e+144)
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	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[(t * a), $MachinePrecision] * -4.0), $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, -9.5e-41], t$95$2, If[LessEqual[x, 9.2e-23], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 6.2e+84], t$95$2, If[LessEqual[x, 7e+130], N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 6.1e+144], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]

Derivation

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

Alternative 10: 57.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(t \cdot a\right) \cdot -4\\ 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.15 \cdot 10^{-40}:\\ \;\;\;\;x \cdot \left(\left(y \cdot t\right) \cdot \left(18 \cdot z\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{-23}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) + t_1\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{+85}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 9.8 \cdot 10^{+131}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right) + t_1\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{+145}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\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 (* (* t a) -4.0))
        (t_2 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -1.15e-40)
     (* x (- (* (* y t) (* 18.0 z)) (* 4.0 i)))
     (if (<= x 6.2e-23)
       (+ (* j (* k -27.0)) t_1)
       (if (<= x 1.2e+85)
         t_2
         (if (<= x 9.8e+131)
           (+ (* -27.0 (* j k)) t_1)
           (if (<= x 2.2e+145)
             (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
             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 = (t * a) * -4.0;
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -1.15e-40) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= 6.2e-23) {
		tmp = (j * (k * -27.0)) + t_1;
	} else if (x <= 1.2e+85) {
		tmp = t_2;
	} else if (x <= 9.8e+131) {
		tmp = (-27.0 * (j * k)) + t_1;
	} else if (x <= 2.2e+145) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} 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 = (t * a) * (-4.0d0)
    t_2 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-1.15d-40)) then
        tmp = x * (((y * t) * (18.0d0 * z)) - (4.0d0 * i))
    else if (x <= 6.2d-23) then
        tmp = (j * (k * (-27.0d0))) + t_1
    else if (x <= 1.2d+85) then
        tmp = t_2
    else if (x <= 9.8d+131) then
        tmp = ((-27.0d0) * (j * k)) + t_1
    else if (x <= 2.2d+145) then
        tmp = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    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 = (t * a) * -4.0;
	double t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -1.15e-40) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= 6.2e-23) {
		tmp = (j * (k * -27.0)) + t_1;
	} else if (x <= 1.2e+85) {
		tmp = t_2;
	} else if (x <= 9.8e+131) {
		tmp = (-27.0 * (j * k)) + t_1;
	} else if (x <= 2.2e+145) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} 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 = (t * a) * -4.0
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -1.15e-40:
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i))
	elif x <= 6.2e-23:
		tmp = (j * (k * -27.0)) + t_1
	elif x <= 1.2e+85:
		tmp = t_2
	elif x <= 9.8e+131:
		tmp = (-27.0 * (j * k)) + t_1
	elif x <= 2.2e+145:
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	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(t * a) * -4.0)
	t_2 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -1.15e-40)
		tmp = Float64(x * Float64(Float64(Float64(y * t) * Float64(18.0 * z)) - Float64(4.0 * i)));
	elseif (x <= 6.2e-23)
		tmp = Float64(Float64(j * Float64(k * -27.0)) + t_1);
	elseif (x <= 1.2e+85)
		tmp = t_2;
	elseif (x <= 9.8e+131)
		tmp = Float64(Float64(-27.0 * Float64(j * k)) + t_1);
	elseif (x <= 2.2e+145)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)));
	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 = (t * a) * -4.0;
	t_2 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -1.15e-40)
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	elseif (x <= 6.2e-23)
		tmp = (j * (k * -27.0)) + t_1;
	elseif (x <= 1.2e+85)
		tmp = t_2;
	elseif (x <= 9.8e+131)
		tmp = (-27.0 * (j * k)) + t_1;
	elseif (x <= 2.2e+145)
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	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[(t * a), $MachinePrecision] * -4.0), $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.15e-40], N[(x * N[(N[(N[(y * t), $MachinePrecision] * N[(18.0 * z), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 6.2e-23], N[(N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 1.2e+85], t$95$2, If[LessEqual[x, 9.8e+131], N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 2.2e+145], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]

Derivation

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

Alternative 11: 75.5% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 12: 32.2% accurate, 1.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} t_1 := x \cdot \left(i \cdot -4\right)\\ t_2 := t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;j \leq -5.2 \cdot 10^{+176}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;j \leq -2.45 \cdot 10^{+142}:\\ \;\;\;\;18 \cdot \left(y \cdot \left(x \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{elif}\;j \leq -4.2 \cdot 10^{-102}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -5.2 \cdot 10^{-198}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;j \leq -1.55 \cdot 10^{-223}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq 4.6 \cdot 10^{-272}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(y \cdot \left(x \cdot z\right)\right)\right)\\ \mathbf{elif}\;j \leq 7.5 \cdot 10^{-216}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq 2.1 \cdot 10^{-57}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* x (* i -4.0))) (t_2 (* t (* a -4.0))))
   (if (<= j -5.2e+176)
     (* k (* j -27.0))
     (if (<= j -2.45e+142)
       (* 18.0 (* y (* x (* z t))))
       (if (<= j -4.2e-102)
         t_1
         (if (<= j -5.2e-198)
           t_2
           (if (<= j -1.55e-223)
             (* b c)
             (if (<= j 4.6e-272)
               (* 18.0 (* t (* y (* x z))))
               (if (<= j 7.5e-216)
                 t_1
                 (if (<= j 2.1e-57) t_2 (* j (* k -27.0))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = x * (i * -4.0);
	double t_2 = t * (a * -4.0);
	double tmp;
	if (j <= -5.2e+176) {
		tmp = k * (j * -27.0);
	} else if (j <= -2.45e+142) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if (j <= -4.2e-102) {
		tmp = t_1;
	} else if (j <= -5.2e-198) {
		tmp = t_2;
	} else if (j <= -1.55e-223) {
		tmp = b * c;
	} else if (j <= 4.6e-272) {
		tmp = 18.0 * (t * (y * (x * z)));
	} else if (j <= 7.5e-216) {
		tmp = t_1;
	} else if (j <= 2.1e-57) {
		tmp = t_2;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = x * (i * (-4.0d0))
    t_2 = t * (a * (-4.0d0))
    if (j <= (-5.2d+176)) then
        tmp = k * (j * (-27.0d0))
    else if (j <= (-2.45d+142)) then
        tmp = 18.0d0 * (y * (x * (z * t)))
    else if (j <= (-4.2d-102)) then
        tmp = t_1
    else if (j <= (-5.2d-198)) then
        tmp = t_2
    else if (j <= (-1.55d-223)) then
        tmp = b * c
    else if (j <= 4.6d-272) then
        tmp = 18.0d0 * (t * (y * (x * z)))
    else if (j <= 7.5d-216) then
        tmp = t_1
    else if (j <= 2.1d-57) then
        tmp = t_2
    else
        tmp = j * (k * (-27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = x * (i * -4.0);
	double t_2 = t * (a * -4.0);
	double tmp;
	if (j <= -5.2e+176) {
		tmp = k * (j * -27.0);
	} else if (j <= -2.45e+142) {
		tmp = 18.0 * (y * (x * (z * t)));
	} else if (j <= -4.2e-102) {
		tmp = t_1;
	} else if (j <= -5.2e-198) {
		tmp = t_2;
	} else if (j <= -1.55e-223) {
		tmp = b * c;
	} else if (j <= 4.6e-272) {
		tmp = 18.0 * (t * (y * (x * z)));
	} else if (j <= 7.5e-216) {
		tmp = t_1;
	} else if (j <= 2.1e-57) {
		tmp = t_2;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = x * (i * -4.0)
	t_2 = t * (a * -4.0)
	tmp = 0
	if j <= -5.2e+176:
		tmp = k * (j * -27.0)
	elif j <= -2.45e+142:
		tmp = 18.0 * (y * (x * (z * t)))
	elif j <= -4.2e-102:
		tmp = t_1
	elif j <= -5.2e-198:
		tmp = t_2
	elif j <= -1.55e-223:
		tmp = b * c
	elif j <= 4.6e-272:
		tmp = 18.0 * (t * (y * (x * z)))
	elif j <= 7.5e-216:
		tmp = t_1
	elif j <= 2.1e-57:
		tmp = t_2
	else:
		tmp = j * (k * -27.0)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(x * Float64(i * -4.0))
	t_2 = Float64(t * Float64(a * -4.0))
	tmp = 0.0
	if (j <= -5.2e+176)
		tmp = Float64(k * Float64(j * -27.0));
	elseif (j <= -2.45e+142)
		tmp = Float64(18.0 * Float64(y * Float64(x * Float64(z * t))));
	elseif (j <= -4.2e-102)
		tmp = t_1;
	elseif (j <= -5.2e-198)
		tmp = t_2;
	elseif (j <= -1.55e-223)
		tmp = Float64(b * c);
	elseif (j <= 4.6e-272)
		tmp = Float64(18.0 * Float64(t * Float64(y * Float64(x * z))));
	elseif (j <= 7.5e-216)
		tmp = t_1;
	elseif (j <= 2.1e-57)
		tmp = t_2;
	else
		tmp = Float64(j * Float64(k * -27.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = x * (i * -4.0);
	t_2 = t * (a * -4.0);
	tmp = 0.0;
	if (j <= -5.2e+176)
		tmp = k * (j * -27.0);
	elseif (j <= -2.45e+142)
		tmp = 18.0 * (y * (x * (z * t)));
	elseif (j <= -4.2e-102)
		tmp = t_1;
	elseif (j <= -5.2e-198)
		tmp = t_2;
	elseif (j <= -1.55e-223)
		tmp = b * c;
	elseif (j <= 4.6e-272)
		tmp = 18.0 * (t * (y * (x * z)));
	elseif (j <= 7.5e-216)
		tmp = t_1;
	elseif (j <= 2.1e-57)
		tmp = t_2;
	else
		tmp = j * (k * -27.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -5.2e+176], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, -2.45e+142], N[(18.0 * N[(y * N[(x * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, -4.2e-102], t$95$1, If[LessEqual[j, -5.2e-198], t$95$2, If[LessEqual[j, -1.55e-223], N[(b * c), $MachinePrecision], If[LessEqual[j, 4.6e-272], N[(18.0 * N[(t * N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 7.5e-216], t$95$1, If[LessEqual[j, 2.1e-57], t$95$2, N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

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

Alternative 13: 46.7% 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(x \cdot i\right)\\ t_2 := b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;t \leq -1.42 \cdot 10^{+29}:\\ \;\;\;\;18 \cdot \left(\left(x \cdot t\right) \cdot \left(y \cdot z\right)\right)\\ \mathbf{elif}\;t \leq -6.4 \cdot 10^{-155}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 2.9 \cdot 10^{-301}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 3 \cdot 10^{-234}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t \leq 4.5 \cdot 10^{+77}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(a \cdot -4\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 (* x i)))) (t_2 (+ (* b c) (* j (* k -27.0)))))
   (if (<= t -1.42e+29)
     (* 18.0 (* (* x t) (* y z)))
     (if (<= t -6.4e-155)
       t_2
       (if (<= t 2.9e-301)
         t_1
         (if (<= t 3e-234) t_2 (if (<= t 4.5e+77) t_1 (* t (* a -4.0)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) - (4.0 * (x * i));
	double t_2 = (b * c) + (j * (k * -27.0));
	double tmp;
	if (t <= -1.42e+29) {
		tmp = 18.0 * ((x * t) * (y * z));
	} else if (t <= -6.4e-155) {
		tmp = t_2;
	} else if (t <= 2.9e-301) {
		tmp = t_1;
	} else if (t <= 3e-234) {
		tmp = t_2;
	} else if (t <= 4.5e+77) {
		tmp = t_1;
	} else {
		tmp = t * (a * -4.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (b * c) - (4.0d0 * (x * i))
    t_2 = (b * c) + (j * (k * (-27.0d0)))
    if (t <= (-1.42d+29)) then
        tmp = 18.0d0 * ((x * t) * (y * z))
    else if (t <= (-6.4d-155)) then
        tmp = t_2
    else if (t <= 2.9d-301) then
        tmp = t_1
    else if (t <= 3d-234) then
        tmp = t_2
    else if (t <= 4.5d+77) then
        tmp = t_1
    else
        tmp = t * (a * (-4.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) - (4.0 * (x * i));
	double t_2 = (b * c) + (j * (k * -27.0));
	double tmp;
	if (t <= -1.42e+29) {
		tmp = 18.0 * ((x * t) * (y * z));
	} else if (t <= -6.4e-155) {
		tmp = t_2;
	} else if (t <= 2.9e-301) {
		tmp = t_1;
	} else if (t <= 3e-234) {
		tmp = t_2;
	} else if (t <= 4.5e+77) {
		tmp = t_1;
	} else {
		tmp = t * (a * -4.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) - (4.0 * (x * i))
	t_2 = (b * c) + (j * (k * -27.0))
	tmp = 0
	if t <= -1.42e+29:
		tmp = 18.0 * ((x * t) * (y * z))
	elif t <= -6.4e-155:
		tmp = t_2
	elif t <= 2.9e-301:
		tmp = t_1
	elif t <= 3e-234:
		tmp = t_2
	elif t <= 4.5e+77:
		tmp = t_1
	else:
		tmp = t * (a * -4.0)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	t_2 = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)))
	tmp = 0.0
	if (t <= -1.42e+29)
		tmp = Float64(18.0 * Float64(Float64(x * t) * Float64(y * z)));
	elseif (t <= -6.4e-155)
		tmp = t_2;
	elseif (t <= 2.9e-301)
		tmp = t_1;
	elseif (t <= 3e-234)
		tmp = t_2;
	elseif (t <= 4.5e+77)
		tmp = t_1;
	else
		tmp = Float64(t * Float64(a * -4.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) - (4.0 * (x * i));
	t_2 = (b * c) + (j * (k * -27.0));
	tmp = 0.0;
	if (t <= -1.42e+29)
		tmp = 18.0 * ((x * t) * (y * z));
	elseif (t <= -6.4e-155)
		tmp = t_2;
	elseif (t <= 2.9e-301)
		tmp = t_1;
	elseif (t <= 3e-234)
		tmp = t_2;
	elseif (t <= 4.5e+77)
		tmp = t_1;
	else
		tmp = t * (a * -4.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 14: 70.8% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 15: 70.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} \mathbf{if}\;x \leq -1.15 \cdot 10^{-40}:\\ \;\;\;\;x \cdot \left(\left(y \cdot t\right) \cdot \left(18 \cdot z\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{-22}:\\ \;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\ \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.15e-40)
   (* x (- (* (* y t) (* 18.0 z)) (* 4.0 i)))
   (if (<= x 1.1e-22)
     (- (- (* b c) (* 4.0 (* t a))) (* (* 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.15e-40) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= 1.1e-22) {
		tmp = ((b * c) - (4.0 * (t * a))) - ((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.15d-40)) then
        tmp = x * (((y * t) * (18.0d0 * z)) - (4.0d0 * i))
    else if (x <= 1.1d-22) then
        tmp = ((b * c) - (4.0d0 * (t * a))) - ((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.15e-40) {
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	} else if (x <= 1.1e-22) {
		tmp = ((b * c) - (4.0 * (t * a))) - ((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.15e-40:
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i))
	elif x <= 1.1e-22:
		tmp = ((b * c) - (4.0 * (t * a))) - ((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.15e-40)
		tmp = Float64(x * Float64(Float64(Float64(y * t) * Float64(18.0 * z)) - Float64(4.0 * i)));
	elseif (x <= 1.1e-22)
		tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(j * 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.15e-40)
		tmp = x * (((y * t) * (18.0 * z)) - (4.0 * i));
	elseif (x <= 1.1e-22)
		tmp = ((b * c) - (4.0 * (t * a))) - ((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.15e-40], 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.1e-22], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $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 16: 31.9% 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} t_1 := t \cdot \left(a \cdot -4\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;j \leq -5.5 \cdot 10^{+175}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;j \leq -7.8 \cdot 10^{+135}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -1.06 \cdot 10^{+86}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq -2.8 \cdot 10^{-200}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq 3 \cdot 10^{-236}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq 1.15 \cdot 10^{-72}:\\ \;\;\;\;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 (* t (* a -4.0))) (t_2 (* j (* k -27.0))))
   (if (<= j -5.5e+175)
     t_2
     (if (<= j -7.8e+135)
       t_1
       (if (<= j -1.06e+86)
         (* b c)
         (if (<= j -2.8e-200)
           t_1
           (if (<= j 3e-236) (* b c) (if (<= j 1.15e-72) 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 = t * (a * -4.0);
	double t_2 = j * (k * -27.0);
	double tmp;
	if (j <= -5.5e+175) {
		tmp = t_2;
	} else if (j <= -7.8e+135) {
		tmp = t_1;
	} else if (j <= -1.06e+86) {
		tmp = b * c;
	} else if (j <= -2.8e-200) {
		tmp = t_1;
	} else if (j <= 3e-236) {
		tmp = b * c;
	} else if (j <= 1.15e-72) {
		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 = t * (a * (-4.0d0))
    t_2 = j * (k * (-27.0d0))
    if (j <= (-5.5d+175)) then
        tmp = t_2
    else if (j <= (-7.8d+135)) then
        tmp = t_1
    else if (j <= (-1.06d+86)) then
        tmp = b * c
    else if (j <= (-2.8d-200)) then
        tmp = t_1
    else if (j <= 3d-236) then
        tmp = b * c
    else if (j <= 1.15d-72) 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 = t * (a * -4.0);
	double t_2 = j * (k * -27.0);
	double tmp;
	if (j <= -5.5e+175) {
		tmp = t_2;
	} else if (j <= -7.8e+135) {
		tmp = t_1;
	} else if (j <= -1.06e+86) {
		tmp = b * c;
	} else if (j <= -2.8e-200) {
		tmp = t_1;
	} else if (j <= 3e-236) {
		tmp = b * c;
	} else if (j <= 1.15e-72) {
		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 = t * (a * -4.0)
	t_2 = j * (k * -27.0)
	tmp = 0
	if j <= -5.5e+175:
		tmp = t_2
	elif j <= -7.8e+135:
		tmp = t_1
	elif j <= -1.06e+86:
		tmp = b * c
	elif j <= -2.8e-200:
		tmp = t_1
	elif j <= 3e-236:
		tmp = b * c
	elif j <= 1.15e-72:
		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(t * Float64(a * -4.0))
	t_2 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (j <= -5.5e+175)
		tmp = t_2;
	elseif (j <= -7.8e+135)
		tmp = t_1;
	elseif (j <= -1.06e+86)
		tmp = Float64(b * c);
	elseif (j <= -2.8e-200)
		tmp = t_1;
	elseif (j <= 3e-236)
		tmp = Float64(b * c);
	elseif (j <= 1.15e-72)
		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 = t * (a * -4.0);
	t_2 = j * (k * -27.0);
	tmp = 0.0;
	if (j <= -5.5e+175)
		tmp = t_2;
	elseif (j <= -7.8e+135)
		tmp = t_1;
	elseif (j <= -1.06e+86)
		tmp = b * c;
	elseif (j <= -2.8e-200)
		tmp = t_1;
	elseif (j <= 3e-236)
		tmp = b * c;
	elseif (j <= 1.15e-72)
		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[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -5.5e+175], t$95$2, If[LessEqual[j, -7.8e+135], t$95$1, If[LessEqual[j, -1.06e+86], N[(b * c), $MachinePrecision], If[LessEqual[j, -2.8e-200], t$95$1, If[LessEqual[j, 3e-236], N[(b * c), $MachinePrecision], If[LessEqual[j, 1.15e-72], t$95$1, t$95$2]]]]]]]]

Derivation

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

Alternative 17: 32.0% 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} t_1 := t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;j \leq -5.5 \cdot 10^{+175}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;j \leq -6.2 \cdot 10^{+135}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -7 \cdot 10^{+80}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq -3.6 \cdot 10^{-200}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq 1.45 \cdot 10^{-238}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq 7.5 \cdot 10^{-80}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* t (* a -4.0))))
   (if (<= j -5.5e+175)
     (* k (* j -27.0))
     (if (<= j -6.2e+135)
       t_1
       (if (<= j -7e+80)
         (* b c)
         (if (<= j -3.6e-200)
           t_1
           (if (<= j 1.45e-238)
             (* b c)
             (if (<= j 7.5e-80) t_1 (* j (* k -27.0))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = t * (a * -4.0);
	double tmp;
	if (j <= -5.5e+175) {
		tmp = k * (j * -27.0);
	} else if (j <= -6.2e+135) {
		tmp = t_1;
	} else if (j <= -7e+80) {
		tmp = b * c;
	} else if (j <= -3.6e-200) {
		tmp = t_1;
	} else if (j <= 1.45e-238) {
		tmp = b * c;
	} else if (j <= 7.5e-80) {
		tmp = t_1;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = t * (a * (-4.0d0))
    if (j <= (-5.5d+175)) then
        tmp = k * (j * (-27.0d0))
    else if (j <= (-6.2d+135)) then
        tmp = t_1
    else if (j <= (-7d+80)) then
        tmp = b * c
    else if (j <= (-3.6d-200)) then
        tmp = t_1
    else if (j <= 1.45d-238) then
        tmp = b * c
    else if (j <= 7.5d-80) then
        tmp = t_1
    else
        tmp = j * (k * (-27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = t * (a * -4.0);
	double tmp;
	if (j <= -5.5e+175) {
		tmp = k * (j * -27.0);
	} else if (j <= -6.2e+135) {
		tmp = t_1;
	} else if (j <= -7e+80) {
		tmp = b * c;
	} else if (j <= -3.6e-200) {
		tmp = t_1;
	} else if (j <= 1.45e-238) {
		tmp = b * c;
	} else if (j <= 7.5e-80) {
		tmp = t_1;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = t * (a * -4.0)
	tmp = 0
	if j <= -5.5e+175:
		tmp = k * (j * -27.0)
	elif j <= -6.2e+135:
		tmp = t_1
	elif j <= -7e+80:
		tmp = b * c
	elif j <= -3.6e-200:
		tmp = t_1
	elif j <= 1.45e-238:
		tmp = b * c
	elif j <= 7.5e-80:
		tmp = t_1
	else:
		tmp = j * (k * -27.0)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(t * Float64(a * -4.0))
	tmp = 0.0
	if (j <= -5.5e+175)
		tmp = Float64(k * Float64(j * -27.0));
	elseif (j <= -6.2e+135)
		tmp = t_1;
	elseif (j <= -7e+80)
		tmp = Float64(b * c);
	elseif (j <= -3.6e-200)
		tmp = t_1;
	elseif (j <= 1.45e-238)
		tmp = Float64(b * c);
	elseif (j <= 7.5e-80)
		tmp = t_1;
	else
		tmp = Float64(j * Float64(k * -27.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = t * (a * -4.0);
	tmp = 0.0;
	if (j <= -5.5e+175)
		tmp = k * (j * -27.0);
	elseif (j <= -6.2e+135)
		tmp = t_1;
	elseif (j <= -7e+80)
		tmp = b * c;
	elseif (j <= -3.6e-200)
		tmp = t_1;
	elseif (j <= 1.45e-238)
		tmp = b * c;
	elseif (j <= 7.5e-80)
		tmp = t_1;
	else
		tmp = j * (k * -27.0);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -5.5e+175], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, -6.2e+135], t$95$1, If[LessEqual[j, -7e+80], N[(b * c), $MachinePrecision], If[LessEqual[j, -3.6e-200], t$95$1, If[LessEqual[j, 1.45e-238], N[(b * c), $MachinePrecision], If[LessEqual[j, 7.5e-80], t$95$1, N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 18: 31.7% 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} t_1 := t \cdot \left(a \cdot -4\right)\\ \mathbf{if}\;j \leq -7.2 \cdot 10^{+175}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;j \leq -6.2 \cdot 10^{-196}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -6.6 \cdot 10^{-222}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;j \leq 4.6 \cdot 10^{-272}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(y \cdot \left(x \cdot z\right)\right)\right)\\ \mathbf{elif}\;j \leq 2.1 \cdot 10^{-216}:\\ \;\;\;\;x \cdot \left(i \cdot -4\right)\\ \mathbf{elif}\;j \leq 2.1 \cdot 10^{-57}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* t (* a -4.0))))
   (if (<= j -7.2e+175)
     (* k (* j -27.0))
     (if (<= j -6.2e-196)
       t_1
       (if (<= j -6.6e-222)
         (* b c)
         (if (<= j 4.6e-272)
           (* 18.0 (* t (* y (* x z))))
           (if (<= j 2.1e-216)
             (* x (* i -4.0))
             (if (<= j 2.1e-57) t_1 (* j (* k -27.0))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = t * (a * -4.0);
	double tmp;
	if (j <= -7.2e+175) {
		tmp = k * (j * -27.0);
	} else if (j <= -6.2e-196) {
		tmp = t_1;
	} else if (j <= -6.6e-222) {
		tmp = b * c;
	} else if (j <= 4.6e-272) {
		tmp = 18.0 * (t * (y * (x * z)));
	} else if (j <= 2.1e-216) {
		tmp = x * (i * -4.0);
	} else if (j <= 2.1e-57) {
		tmp = t_1;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = t * (a * (-4.0d0))
    if (j <= (-7.2d+175)) then
        tmp = k * (j * (-27.0d0))
    else if (j <= (-6.2d-196)) then
        tmp = t_1
    else if (j <= (-6.6d-222)) then
        tmp = b * c
    else if (j <= 4.6d-272) then
        tmp = 18.0d0 * (t * (y * (x * z)))
    else if (j <= 2.1d-216) then
        tmp = x * (i * (-4.0d0))
    else if (j <= 2.1d-57) then
        tmp = t_1
    else
        tmp = j * (k * (-27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = t * (a * -4.0);
	double tmp;
	if (j <= -7.2e+175) {
		tmp = k * (j * -27.0);
	} else if (j <= -6.2e-196) {
		tmp = t_1;
	} else if (j <= -6.6e-222) {
		tmp = b * c;
	} else if (j <= 4.6e-272) {
		tmp = 18.0 * (t * (y * (x * z)));
	} else if (j <= 2.1e-216) {
		tmp = x * (i * -4.0);
	} else if (j <= 2.1e-57) {
		tmp = t_1;
	} else {
		tmp = j * (k * -27.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = t * (a * -4.0)
	tmp = 0
	if j <= -7.2e+175:
		tmp = k * (j * -27.0)
	elif j <= -6.2e-196:
		tmp = t_1
	elif j <= -6.6e-222:
		tmp = b * c
	elif j <= 4.6e-272:
		tmp = 18.0 * (t * (y * (x * z)))
	elif j <= 2.1e-216:
		tmp = x * (i * -4.0)
	elif j <= 2.1e-57:
		tmp = t_1
	else:
		tmp = j * (k * -27.0)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(t * Float64(a * -4.0))
	tmp = 0.0
	if (j <= -7.2e+175)
		tmp = Float64(k * Float64(j * -27.0));
	elseif (j <= -6.2e-196)
		tmp = t_1;
	elseif (j <= -6.6e-222)
		tmp = Float64(b * c);
	elseif (j <= 4.6e-272)
		tmp = Float64(18.0 * Float64(t * Float64(y * Float64(x * z))));
	elseif (j <= 2.1e-216)
		tmp = Float64(x * Float64(i * -4.0));
	elseif (j <= 2.1e-57)
		tmp = t_1;
	else
		tmp = Float64(j * Float64(k * -27.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = t * (a * -4.0);
	tmp = 0.0;
	if (j <= -7.2e+175)
		tmp = k * (j * -27.0);
	elseif (j <= -6.2e-196)
		tmp = t_1;
	elseif (j <= -6.6e-222)
		tmp = b * c;
	elseif (j <= 4.6e-272)
		tmp = 18.0 * (t * (y * (x * z)));
	elseif (j <= 2.1e-216)
		tmp = x * (i * -4.0);
	elseif (j <= 2.1e-57)
		tmp = t_1;
	else
		tmp = j * (k * -27.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 19: 37.7% 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 -3.1 \cdot 10^{+124} \lor \neg \left(b \cdot c \leq 6 \cdot 10^{+124}\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) -3.1e+124) (not (<= (* b c) 6e+124)))
   (* 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) <= -3.1e+124) || !((b * c) <= 6e+124)) {
		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) <= (-3.1d+124)) .or. (.not. ((b * c) <= 6d+124))) 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) <= -3.1e+124) || !((b * c) <= 6e+124)) {
		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) <= -3.1e+124) or not ((b * c) <= 6e+124):
		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) <= -3.1e+124) || !(Float64(b * c) <= 6e+124))
		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) <= -3.1e+124) || ~(((b * c) <= 6e+124)))
		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], -3.1e+124], N[Not[LessEqual[N[(b * c), $MachinePrecision], 6e+124]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 20: 37.7% 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.3 \cdot 10^{+124} \lor \neg \left(b \cdot c \leq 4.3 \cdot 10^{+124}\right):\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 21: 47.7% 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}\;t \leq -8 \cdot 10^{+28}:\\ \;\;\;\;18 \cdot \left(\left(x \cdot t\right) \cdot \left(y \cdot z\right)\right)\\ \mathbf{elif}\;t \leq 4.4 \cdot 10^{+77}:\\ \;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(a \cdot -4\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 (<= t -8e+28)
   (* 18.0 (* (* x t) (* y z)))
   (if (<= t 4.4e+77) (+ (* b c) (* j (* k -27.0))) (* t (* a -4.0)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 22: 24.9% 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: 88.6% 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 2024003 
(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)))