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

Percentage Accurate: 84.6% → 91.4%

Time: 33.8s

Alternatives: 28

Speedup: 1.0×

• 50.2% 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.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 91.4% accurate, 0.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])\\ \\ \begin{array}{l} t_1 := \left(\left(\left(\left(z \cdot \left(\left(x \cdot 18\right) \cdot y\right)\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_1 \leq \infty:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;j \cdot \left(k \cdot -27\right) - x \cdot \mathsf{fma}\left(i, 4, z \cdot \left(y \cdot \left(t \cdot -18\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

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

C

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 = (((((z * ((x * 18.0) * y)) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = (j * (k * -27.0)) - (x * fma(i, 4.0, (z * (y * (t * -18.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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(z * Float64(Float64(x * 18.0) * y)) * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(Float64(j * Float64(k * -27.0)) - Float64(x * fma(i, 4.0, Float64(z * Float64(y * Float64(t * -18.0))))));
	end
	return tmp
end

Wolfram

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

Derivation

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

Alternative 2: 91.8% 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])\\ \\ \begin{array}{l} t_1 := \left(\left(\left(\left(z \cdot \left(\left(x \cdot 18\right) \cdot y\right)\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_1 \leq \infty:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\ \end{array} \end{array} \]

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 = (((((z * ((x * 18.0) * y)) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 = (((((z * ((x * 18.0) * y)) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 3: 66.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := 4 \cdot \left(x \cdot i\right)\\ t_2 := 4 \cdot \left(t \cdot a\right)\\ t_3 := \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_3 \leq -2 \cdot 10^{+120}:\\ \;\;\;\;\left(b \cdot c - t_2\right) - t_3\\ \mathbf{elif}\;t_3 \leq 10^{-319}:\\ \;\;\;\;b \cdot c - \left(t_2 + t_1\right)\\ \mathbf{elif}\;t_3 \leq 5 \cdot 10^{-207}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\right)\right) - 4 \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c - t_1\right) - 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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 4.0 (* x i))) (t_2 (* 4.0 (* t a))) (t_3 (* (* j 27.0) k)))
   (if (<= t_3 -2e+120)
     (- (- (* b c) t_2) t_3)
     (if (<= t_3 1e-319)
       (- (* b c) (+ t_2 t_1))
       (if (<= t_3 5e-207)
         (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))
         (- (- (* b c) t_1) t_3))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double t_2 = 4.0 * (t * a);
	double t_3 = (j * 27.0) * k;
	double tmp;
	if (t_3 <= -2e+120) {
		tmp = ((b * c) - t_2) - t_3;
	} else if (t_3 <= 1e-319) {
		tmp = (b * c) - (t_2 + t_1);
	} else if (t_3 <= 5e-207) {
		tmp = x * ((t * (z * (18.0 * y))) - (4.0 * i));
	} else {
		tmp = ((b * c) - t_1) - 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = 4.0d0 * (x * i)
    t_2 = 4.0d0 * (t * a)
    t_3 = (j * 27.0d0) * k
    if (t_3 <= (-2d+120)) then
        tmp = ((b * c) - t_2) - t_3
    else if (t_3 <= 1d-319) then
        tmp = (b * c) - (t_2 + t_1)
    else if (t_3 <= 5d-207) then
        tmp = x * ((t * (z * (18.0d0 * y))) - (4.0d0 * i))
    else
        tmp = ((b * c) - t_1) - 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double t_2 = 4.0 * (t * a);
	double t_3 = (j * 27.0) * k;
	double tmp;
	if (t_3 <= -2e+120) {
		tmp = ((b * c) - t_2) - t_3;
	} else if (t_3 <= 1e-319) {
		tmp = (b * c) - (t_2 + t_1);
	} else if (t_3 <= 5e-207) {
		tmp = x * ((t * (z * (18.0 * y))) - (4.0 * i));
	} else {
		tmp = ((b * c) - t_1) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 4.0 * (x * i)
	t_2 = 4.0 * (t * a)
	t_3 = (j * 27.0) * k
	tmp = 0
	if t_3 <= -2e+120:
		tmp = ((b * c) - t_2) - t_3
	elif t_3 <= 1e-319:
		tmp = (b * c) - (t_2 + t_1)
	elif t_3 <= 5e-207:
		tmp = x * ((t * (z * (18.0 * y))) - (4.0 * i))
	else:
		tmp = ((b * c) - t_1) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(4.0 * Float64(x * i))
	t_2 = Float64(4.0 * Float64(t * a))
	t_3 = Float64(Float64(j * 27.0) * k)
	tmp = 0.0
	if (t_3 <= -2e+120)
		tmp = Float64(Float64(Float64(b * c) - t_2) - t_3);
	elseif (t_3 <= 1e-319)
		tmp = Float64(Float64(b * c) - Float64(t_2 + t_1));
	elseif (t_3 <= 5e-207)
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - Float64(4.0 * i)));
	else
		tmp = Float64(Float64(Float64(b * c) - t_1) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 4.0 * (x * i);
	t_2 = 4.0 * (t * a);
	t_3 = (j * 27.0) * k;
	tmp = 0.0;
	if (t_3 <= -2e+120)
		tmp = ((b * c) - t_2) - t_3;
	elseif (t_3 <= 1e-319)
		tmp = (b * c) - (t_2 + t_1);
	elseif (t_3 <= 5e-207)
		tmp = x * ((t * (z * (18.0 * y))) - (4.0 * i));
	else
		tmp = ((b * c) - t_1) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t$95$3, -2e+120], N[(N[(N[(b * c), $MachinePrecision] - t$95$2), $MachinePrecision] - t$95$3), $MachinePrecision], If[LessEqual[t$95$3, 1e-319], N[(N[(b * c), $MachinePrecision] - N[(t$95$2 + t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e-207], N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]

Derivation

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

Alternative 4: 86.5% 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])\\ \\ \begin{array}{l} t_1 := x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\\ \mathbf{if}\;z \leq 4.8 \cdot 10^{+164}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right)\right) - t_1\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot \left(z \cdot t\right) - t \cdot \left(a \cdot 4\right)\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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* x (* 4.0 i)) (* j (* 27.0 k)))))
   (if (<= z 4.8e+164)
     (- (+ (* b c) (* t (- (* (* x 18.0) (* y z)) (* a 4.0)))) t_1)
     (- (+ (* b c) (- (* (* (* x 18.0) y) (* z t)) (* t (* a 4.0)))) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (x * (4.0 * i)) + (j * (27.0 * k));
	double tmp;
	if (z <= 4.8e+164) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - t_1;
	} else {
		tmp = ((b * c) + ((((x * 18.0) * y) * (z * t)) - (t * (a * 4.0)))) - 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * (4.0d0 * i)) + (j * (27.0d0 * k))
    if (z <= 4.8d+164) then
        tmp = ((b * c) + (t * (((x * 18.0d0) * (y * z)) - (a * 4.0d0)))) - t_1
    else
        tmp = ((b * c) + ((((x * 18.0d0) * y) * (z * t)) - (t * (a * 4.0d0)))) - 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (x * (4.0 * i)) + (j * (27.0 * k));
	double tmp;
	if (z <= 4.8e+164) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - t_1;
	} else {
		tmp = ((b * c) + ((((x * 18.0) * y) * (z * t)) - (t * (a * 4.0)))) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (x * (4.0 * i)) + (j * (27.0 * k))
	tmp = 0
	if z <= 4.8e+164:
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - t_1
	else:
		tmp = ((b * c) + ((((x * 18.0) * y) * (z * t)) - (t * (a * 4.0)))) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(x * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k)))
	tmp = 0.0
	if (z <= 4.8e+164)
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(x * 18.0) * Float64(y * z)) - Float64(a * 4.0)))) - t_1);
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(Float64(Float64(Float64(x * 18.0) * y) * Float64(z * t)) - Float64(t * Float64(a * 4.0)))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (x * (4.0 * i)) + (j * (27.0 * k));
	tmp = 0.0;
	if (z <= 4.8e+164)
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - t_1;
	else
		tmp = ((b * c) + ((((x * 18.0) * y) * (z * t)) - (t * (a * 4.0)))) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, 4.8e+164], 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] - t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 5: 79.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;j \cdot 27 \leq -1 \cdot 10^{-64} \lor \neg \left(j \cdot 27 \leq 2 \cdot 10^{-117}\right):\\ \;\;\;\;\left(b \cdot c - \left(4 \cdot \left(t \cdot a\right) + t_1\right)\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - t_1\\ \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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 4.0 (* x i))))
   (if (or (<= (* j 27.0) -1e-64) (not (<= (* j 27.0) 2e-117)))
     (- (- (* b c) (+ (* 4.0 (* t a)) t_1)) (* (* j 27.0) k))
     (- (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double tmp;
	if (((j * 27.0) <= -1e-64) || !((j * 27.0) <= 2e-117)) {
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	} else {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 4.0d0 * (x * i)
    if (((j * 27.0d0) <= (-1d-64)) .or. (.not. ((j * 27.0d0) <= 2d-117))) then
        tmp = ((b * c) - ((4.0d0 * (t * a)) + t_1)) - ((j * 27.0d0) * k)
    else
        tmp = ((b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))) - 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double tmp;
	if (((j * 27.0) <= -1e-64) || !((j * 27.0) <= 2e-117)) {
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	} else {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 4.0 * (x * i)
	tmp = 0
	if ((j * 27.0) <= -1e-64) or not ((j * 27.0) <= 2e-117):
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k)
	else:
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(4.0 * Float64(x * i))
	tmp = 0.0
	if ((Float64(j * 27.0) <= -1e-64) || !(Float64(j * 27.0) <= 2e-117))
		tmp = Float64(Float64(Float64(b * c) - Float64(Float64(4.0 * Float64(t * a)) + t_1)) - Float64(Float64(j * 27.0) * k));
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 4.0 * (x * i);
	tmp = 0.0;
	if (((j * 27.0) <= -1e-64) || ~(((j * 27.0) <= 2e-117)))
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	else
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[N[(j * 27.0), $MachinePrecision], -1e-64], N[Not[LessEqual[N[(j * 27.0), $MachinePrecision], 2e-117]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 6: 79.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;j \cdot 27 \leq -1 \cdot 10^{-64} \lor \neg \left(j \cdot 27 \leq 2 \cdot 10^{-117}\right):\\ \;\;\;\;\left(b \cdot c - \left(4 \cdot \left(t \cdot a\right) + t_1\right)\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(z \cdot \left(x \cdot y\right)\right) - a \cdot 4\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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 4.0 (* x i))))
   (if (or (<= (* j 27.0) -1e-64) (not (<= (* j 27.0) 2e-117)))
     (- (- (* b c) (+ (* 4.0 (* t a)) t_1)) (* (* j 27.0) k))
     (- (+ (* b c) (* t (- (* 18.0 (* z (* x y))) (* a 4.0)))) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double tmp;
	if (((j * 27.0) <= -1e-64) || !((j * 27.0) <= 2e-117)) {
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	} else {
		tmp = ((b * c) + (t * ((18.0 * (z * (x * y))) - (a * 4.0)))) - 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 4.0d0 * (x * i)
    if (((j * 27.0d0) <= (-1d-64)) .or. (.not. ((j * 27.0d0) <= 2d-117))) then
        tmp = ((b * c) - ((4.0d0 * (t * a)) + t_1)) - ((j * 27.0d0) * k)
    else
        tmp = ((b * c) + (t * ((18.0d0 * (z * (x * y))) - (a * 4.0d0)))) - 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = 4.0 * (x * i);
	double tmp;
	if (((j * 27.0) <= -1e-64) || !((j * 27.0) <= 2e-117)) {
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	} else {
		tmp = ((b * c) + (t * ((18.0 * (z * (x * y))) - (a * 4.0)))) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 4.0 * (x * i)
	tmp = 0
	if ((j * 27.0) <= -1e-64) or not ((j * 27.0) <= 2e-117):
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k)
	else:
		tmp = ((b * c) + (t * ((18.0 * (z * (x * y))) - (a * 4.0)))) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(4.0 * Float64(x * i))
	tmp = 0.0
	if ((Float64(j * 27.0) <= -1e-64) || !(Float64(j * 27.0) <= 2e-117))
		tmp = Float64(Float64(Float64(b * c) - Float64(Float64(4.0 * Float64(t * a)) + t_1)) - Float64(Float64(j * 27.0) * k));
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(z * Float64(x * y))) - Float64(a * 4.0)))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 4.0 * (x * i);
	tmp = 0.0;
	if (((j * 27.0) <= -1e-64) || ~(((j * 27.0) <= 2e-117)))
		tmp = ((b * c) - ((4.0 * (t * a)) + t_1)) - ((j * 27.0) * k);
	else
		tmp = ((b * c) + (t * ((18.0 * (z * (x * y))) - (a * 4.0)))) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[N[(j * 27.0), $MachinePrecision], -1e-64], N[Not[LessEqual[N[(j * 27.0), $MachinePrecision], 2e-117]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 7: 85.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 1.7 \cdot 10^{+218}:\\ \;\;\;\;\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(\left(b \cdot c + 18 \cdot \left(x \cdot \left(y \cdot \left(z \cdot t\right)\right)\right)\right) - 4 \cdot \left(t \cdot a\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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= z 1.7e+218)
   (-
    (+ (* b c) (* t (- (* (* x 18.0) (* y z)) (* a 4.0))))
    (+ (* x (* 4.0 i)) (* j (* 27.0 k))))
   (-
    (- (+ (* b c) (* 18.0 (* x (* y (* z t))))) (* 4.0 (* t a)))
    (* (* j 27.0) k))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (z <= 1.7e+218) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = (((b * c) + (18.0 * (x * (y * (z * t))))) - (4.0 * (t * a))) - ((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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (z <= 1.7d+218) 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) + (18.0d0 * (x * (y * (z * t))))) - (4.0d0 * (t * a))) - ((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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (z <= 1.7e+218) {
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	} else {
		tmp = (((b * c) + (18.0 * (x * (y * (z * t))))) - (4.0 * (t * a))) - ((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])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if z <= 1.7e+218:
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)))
	else:
		tmp = (((b * c) + (18.0 * (x * (y * (z * t))))) - (4.0 * (t * a))) - ((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])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (z <= 1.7e+218)
		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(Float64(b * c) + Float64(18.0 * Float64(x * Float64(y * Float64(z * t))))) - Float64(4.0 * Float64(t * a))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (z <= 1.7e+218)
		tmp = ((b * c) + (t * (((x * 18.0) * (y * z)) - (a * 4.0)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
	else
		tmp = (((b * c) + (18.0 * (x * (y * (z * t))))) - (4.0 * (t * a))) - ((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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[z, 1.7e+218], 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[(N[(b * c), $MachinePrecision] + N[(18.0 * N[(x * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 8: 58.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ \mathbf{if}\;x \leq -1.6 \cdot 10^{+47}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -7.8 \cdot 10^{-198}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 9.8 \cdot 10^{-281}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 4.4 \cdot 10^{-203}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 7 \cdot 10^{-94}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 1.05 \cdot 10^{+125}:\\ \;\;\;\;t_1 + 18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{elif}\;x \leq 4.3 \cdot 10^{+133}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1)))
   (if (<= x -1.6e+47)
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
     (if (<= x -7.8e-198)
       t_4
       (if (<= x 9.8e-281)
         t_3
         (if (<= x 4.4e-203)
           t_4
           (if (<= x 7e-94)
             (+ t_1 t_2)
             (if (<= x 1.65e-32)
               t_3
               (if (<= x 1.05e+125)
                 (+ t_1 (* 18.0 (* t (* x (* y z)))))
                 (if (<= x 4.3e+133)
                   t_3
                   (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))))))))))))

C

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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.6e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -7.8e-198) {
		tmp = t_4;
	} else if (x <= 9.8e-281) {
		tmp = t_3;
	} else if (x <= 4.4e-203) {
		tmp = t_4;
	} else if (x <= 7e-94) {
		tmp = t_1 + t_2;
	} else if (x <= 1.65e-32) {
		tmp = t_3;
	} else if (x <= 1.05e+125) {
		tmp = t_1 + (18.0 * (t * (x * (y * z))));
	} else if (x <= 4.3e+133) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    if (x <= (-1.6d+47)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if (x <= (-7.8d-198)) then
        tmp = t_4
    else if (x <= 9.8d-281) then
        tmp = t_3
    else if (x <= 4.4d-203) then
        tmp = t_4
    else if (x <= 7d-94) then
        tmp = t_1 + t_2
    else if (x <= 1.65d-32) then
        tmp = t_3
    else if (x <= 1.05d+125) then
        tmp = t_1 + (18.0d0 * (t * (x * (y * z))))
    else if (x <= 4.3d+133) then
        tmp = t_3
    else
        tmp = x * ((t * (z * (18.0d0 * y))) - (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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.6e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -7.8e-198) {
		tmp = t_4;
	} else if (x <= 9.8e-281) {
		tmp = t_3;
	} else if (x <= 4.4e-203) {
		tmp = t_4;
	} else if (x <= 7e-94) {
		tmp = t_1 + t_2;
	} else if (x <= 1.65e-32) {
		tmp = t_3;
	} else if (x <= 1.05e+125) {
		tmp = t_1 + (18.0 * (t * (x * (y * z))));
	} else if (x <= 4.3e+133) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	tmp = 0
	if x <= -1.6e+47:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif x <= -7.8e-198:
		tmp = t_4
	elif x <= 9.8e-281:
		tmp = t_3
	elif x <= 4.4e-203:
		tmp = t_4
	elif x <= 7e-94:
		tmp = t_1 + t_2
	elif x <= 1.65e-32:
		tmp = t_3
	elif x <= 1.05e+125:
		tmp = t_1 + (18.0 * (t * (x * (y * z))))
	elif x <= 4.3e+133:
		tmp = t_3
	else:
		tmp = x * ((t * (z * (18.0 * y))) - (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])
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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (x <= -1.6e+47)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif (x <= -7.8e-198)
		tmp = t_4;
	elseif (x <= 9.8e-281)
		tmp = t_3;
	elseif (x <= 4.4e-203)
		tmp = t_4;
	elseif (x <= 7e-94)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.65e-32)
		tmp = t_3;
	elseif (x <= 1.05e+125)
		tmp = Float64(t_1 + Float64(18.0 * Float64(t * Float64(x * Float64(y * z)))));
	elseif (x <= 4.3e+133)
		tmp = t_3;
	else
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - 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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	tmp = 0.0;
	if (x <= -1.6e+47)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif (x <= -7.8e-198)
		tmp = t_4;
	elseif (x <= 9.8e-281)
		tmp = t_3;
	elseif (x <= 4.4e-203)
		tmp = t_4;
	elseif (x <= 7e-94)
		tmp = t_1 + t_2;
	elseif (x <= 1.65e-32)
		tmp = t_3;
	elseif (x <= 1.05e+125)
		tmp = t_1 + (18.0 * (t * (x * (y * z))));
	elseif (x <= 4.3e+133)
		tmp = t_3;
	else
		tmp = x * ((t * (z * (18.0 * y))) - (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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -1.6e+47], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -7.8e-198], t$95$4, If[LessEqual[x, 9.8e-281], t$95$3, If[LessEqual[x, 4.4e-203], t$95$4, If[LessEqual[x, 7e-94], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.65e-32], t$95$3, If[LessEqual[x, 1.05e+125], N[(t$95$1 + N[(18.0 * N[(t * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.3e+133], t$95$3, N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]

Derivation

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

Alternative 9: 58.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ \mathbf{if}\;x \leq -1.75 \cdot 10^{+50}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -5.4 \cdot 10^{-197}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 4.15 \cdot 10^{-280}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 2 \cdot 10^{-204}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 5 \cdot 10^{-94}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.72 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 5.8 \cdot 10^{+123}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right) + k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{+130}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1)))
   (if (<= x -1.75e+50)
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
     (if (<= x -5.4e-197)
       t_4
       (if (<= x 4.15e-280)
         t_3
         (if (<= x 2e-204)
           t_4
           (if (<= x 5e-94)
             (+ t_1 t_2)
             (if (<= x 1.72e-32)
               t_3
               (if (<= x 5.8e+123)
                 (+ (* 18.0 (* t (* x (* y z)))) (* k (* j -27.0)))
                 (if (<= x 1.95e+130)
                   t_3
                   (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))))))))))))

C

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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.75e+50) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -5.4e-197) {
		tmp = t_4;
	} else if (x <= 4.15e-280) {
		tmp = t_3;
	} else if (x <= 2e-204) {
		tmp = t_4;
	} else if (x <= 5e-94) {
		tmp = t_1 + t_2;
	} else if (x <= 1.72e-32) {
		tmp = t_3;
	} else if (x <= 5.8e+123) {
		tmp = (18.0 * (t * (x * (y * z)))) + (k * (j * -27.0));
	} else if (x <= 1.95e+130) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    if (x <= (-1.75d+50)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if (x <= (-5.4d-197)) then
        tmp = t_4
    else if (x <= 4.15d-280) then
        tmp = t_3
    else if (x <= 2d-204) then
        tmp = t_4
    else if (x <= 5d-94) then
        tmp = t_1 + t_2
    else if (x <= 1.72d-32) then
        tmp = t_3
    else if (x <= 5.8d+123) then
        tmp = (18.0d0 * (t * (x * (y * z)))) + (k * (j * (-27.0d0)))
    else if (x <= 1.95d+130) then
        tmp = t_3
    else
        tmp = x * ((t * (z * (18.0d0 * y))) - (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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.75e+50) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -5.4e-197) {
		tmp = t_4;
	} else if (x <= 4.15e-280) {
		tmp = t_3;
	} else if (x <= 2e-204) {
		tmp = t_4;
	} else if (x <= 5e-94) {
		tmp = t_1 + t_2;
	} else if (x <= 1.72e-32) {
		tmp = t_3;
	} else if (x <= 5.8e+123) {
		tmp = (18.0 * (t * (x * (y * z)))) + (k * (j * -27.0));
	} else if (x <= 1.95e+130) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	tmp = 0
	if x <= -1.75e+50:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif x <= -5.4e-197:
		tmp = t_4
	elif x <= 4.15e-280:
		tmp = t_3
	elif x <= 2e-204:
		tmp = t_4
	elif x <= 5e-94:
		tmp = t_1 + t_2
	elif x <= 1.72e-32:
		tmp = t_3
	elif x <= 5.8e+123:
		tmp = (18.0 * (t * (x * (y * z)))) + (k * (j * -27.0))
	elif x <= 1.95e+130:
		tmp = t_3
	else:
		tmp = x * ((t * (z * (18.0 * y))) - (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])
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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (x <= -1.75e+50)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif (x <= -5.4e-197)
		tmp = t_4;
	elseif (x <= 4.15e-280)
		tmp = t_3;
	elseif (x <= 2e-204)
		tmp = t_4;
	elseif (x <= 5e-94)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.72e-32)
		tmp = t_3;
	elseif (x <= 5.8e+123)
		tmp = Float64(Float64(18.0 * Float64(t * Float64(x * Float64(y * z)))) + Float64(k * Float64(j * -27.0)));
	elseif (x <= 1.95e+130)
		tmp = t_3;
	else
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - 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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	tmp = 0.0;
	if (x <= -1.75e+50)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif (x <= -5.4e-197)
		tmp = t_4;
	elseif (x <= 4.15e-280)
		tmp = t_3;
	elseif (x <= 2e-204)
		tmp = t_4;
	elseif (x <= 5e-94)
		tmp = t_1 + t_2;
	elseif (x <= 1.72e-32)
		tmp = t_3;
	elseif (x <= 5.8e+123)
		tmp = (18.0 * (t * (x * (y * z)))) + (k * (j * -27.0));
	elseif (x <= 1.95e+130)
		tmp = t_3;
	else
		tmp = x * ((t * (z * (18.0 * y))) - (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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -1.75e+50], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.4e-197], t$95$4, If[LessEqual[x, 4.15e-280], t$95$3, If[LessEqual[x, 2e-204], t$95$4, If[LessEqual[x, 5e-94], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.72e-32], t$95$3, If[LessEqual[x, 5.8e+123], N[(N[(18.0 * N[(t * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.95e+130], t$95$3, N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]

Derivation

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

Alternative 10: 58.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ \mathbf{if}\;x \leq -1.1 \cdot 10^{+51}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -4.7 \cdot 10^{-197}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 2.6 \cdot 10^{-280}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 2.1 \cdot 10^{-203}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-93}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 9.8 \cdot 10^{+124}:\\ \;\;\;\;18 \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot t\right)\right) + k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{+130}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1)))
   (if (<= x -1.1e+51)
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
     (if (<= x -4.7e-197)
       t_4
       (if (<= x 2.6e-280)
         t_3
         (if (<= x 2.1e-203)
           t_4
           (if (<= x 1.35e-93)
             (+ t_1 t_2)
             (if (<= x 1.65e-32)
               t_3
               (if (<= x 9.8e+124)
                 (+ (* 18.0 (* (* y z) (* x t))) (* k (* j -27.0)))
                 (if (<= x 1.95e+130)
                   t_3
                   (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))))))))))))

C

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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.1e+51) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -4.7e-197) {
		tmp = t_4;
	} else if (x <= 2.6e-280) {
		tmp = t_3;
	} else if (x <= 2.1e-203) {
		tmp = t_4;
	} else if (x <= 1.35e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.65e-32) {
		tmp = t_3;
	} else if (x <= 9.8e+124) {
		tmp = (18.0 * ((y * z) * (x * t))) + (k * (j * -27.0));
	} else if (x <= 1.95e+130) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    if (x <= (-1.1d+51)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if (x <= (-4.7d-197)) then
        tmp = t_4
    else if (x <= 2.6d-280) then
        tmp = t_3
    else if (x <= 2.1d-203) then
        tmp = t_4
    else if (x <= 1.35d-93) then
        tmp = t_1 + t_2
    else if (x <= 1.65d-32) then
        tmp = t_3
    else if (x <= 9.8d+124) then
        tmp = (18.0d0 * ((y * z) * (x * t))) + (k * (j * (-27.0d0)))
    else if (x <= 1.95d+130) then
        tmp = t_3
    else
        tmp = x * ((t * (z * (18.0d0 * y))) - (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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.1e+51) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -4.7e-197) {
		tmp = t_4;
	} else if (x <= 2.6e-280) {
		tmp = t_3;
	} else if (x <= 2.1e-203) {
		tmp = t_4;
	} else if (x <= 1.35e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.65e-32) {
		tmp = t_3;
	} else if (x <= 9.8e+124) {
		tmp = (18.0 * ((y * z) * (x * t))) + (k * (j * -27.0));
	} else if (x <= 1.95e+130) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	tmp = 0
	if x <= -1.1e+51:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif x <= -4.7e-197:
		tmp = t_4
	elif x <= 2.6e-280:
		tmp = t_3
	elif x <= 2.1e-203:
		tmp = t_4
	elif x <= 1.35e-93:
		tmp = t_1 + t_2
	elif x <= 1.65e-32:
		tmp = t_3
	elif x <= 9.8e+124:
		tmp = (18.0 * ((y * z) * (x * t))) + (k * (j * -27.0))
	elif x <= 1.95e+130:
		tmp = t_3
	else:
		tmp = x * ((t * (z * (18.0 * y))) - (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])
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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (x <= -1.1e+51)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif (x <= -4.7e-197)
		tmp = t_4;
	elseif (x <= 2.6e-280)
		tmp = t_3;
	elseif (x <= 2.1e-203)
		tmp = t_4;
	elseif (x <= 1.35e-93)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.65e-32)
		tmp = t_3;
	elseif (x <= 9.8e+124)
		tmp = Float64(Float64(18.0 * Float64(Float64(y * z) * Float64(x * t))) + Float64(k * Float64(j * -27.0)));
	elseif (x <= 1.95e+130)
		tmp = t_3;
	else
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - 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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	tmp = 0.0;
	if (x <= -1.1e+51)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif (x <= -4.7e-197)
		tmp = t_4;
	elseif (x <= 2.6e-280)
		tmp = t_3;
	elseif (x <= 2.1e-203)
		tmp = t_4;
	elseif (x <= 1.35e-93)
		tmp = t_1 + t_2;
	elseif (x <= 1.65e-32)
		tmp = t_3;
	elseif (x <= 9.8e+124)
		tmp = (18.0 * ((y * z) * (x * t))) + (k * (j * -27.0));
	elseif (x <= 1.95e+130)
		tmp = t_3;
	else
		tmp = x * ((t * (z * (18.0 * y))) - (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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -1.1e+51], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.7e-197], t$95$4, If[LessEqual[x, 2.6e-280], t$95$3, If[LessEqual[x, 2.1e-203], t$95$4, If[LessEqual[x, 1.35e-93], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.65e-32], t$95$3, If[LessEqual[x, 9.8e+124], N[(N[(18.0 * N[(N[(y * z), $MachinePrecision] * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.95e+130], t$95$3, N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]

Derivation

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

Alternative 11: 81.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := \left(j \cdot 27\right) \cdot k\\ t_2 := x \cdot \left(y \cdot z\right)\\ t_3 := 4 \cdot \left(x \cdot i\right)\\ t_4 := 4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;t \leq -7400:\\ \;\;\;\;\left(\left(b \cdot c + 18 \cdot \left(t \cdot t_2\right)\right) - t_4\right) - t_1\\ \mathbf{elif}\;t \leq 8.4 \cdot 10^{+133}:\\ \;\;\;\;\left(b \cdot c - \left(t_4 + t_3\right)\right) - t_1\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot t_2 - a \cdot 4\right)\right) - 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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* (* j 27.0) k))
        (t_2 (* x (* y z)))
        (t_3 (* 4.0 (* x i)))
        (t_4 (* 4.0 (* t a))))
   (if (<= t -7400.0)
     (- (- (+ (* b c) (* 18.0 (* t t_2))) t_4) t_1)
     (if (<= t 8.4e+133)
       (- (- (* b c) (+ t_4 t_3)) t_1)
       (- (+ (* b c) (* t (- (* 18.0 t_2) (* a 4.0)))) t_3)))))

C

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 t_2 = x * (y * z);
	double t_3 = 4.0 * (x * i);
	double t_4 = 4.0 * (t * a);
	double tmp;
	if (t <= -7400.0) {
		tmp = (((b * c) + (18.0 * (t * t_2))) - t_4) - t_1;
	} else if (t <= 8.4e+133) {
		tmp = ((b * c) - (t_4 + t_3)) - t_1;
	} else {
		tmp = ((b * c) + (t * ((18.0 * t_2) - (a * 4.0)))) - 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.
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 * 27.0d0) * k
    t_2 = x * (y * z)
    t_3 = 4.0d0 * (x * i)
    t_4 = 4.0d0 * (t * a)
    if (t <= (-7400.0d0)) then
        tmp = (((b * c) + (18.0d0 * (t * t_2))) - t_4) - t_1
    else if (t <= 8.4d+133) then
        tmp = ((b * c) - (t_4 + t_3)) - t_1
    else
        tmp = ((b * c) + (t * ((18.0d0 * t_2) - (a * 4.0d0)))) - 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;
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 t_2 = x * (y * z);
	double t_3 = 4.0 * (x * i);
	double t_4 = 4.0 * (t * a);
	double tmp;
	if (t <= -7400.0) {
		tmp = (((b * c) + (18.0 * (t * t_2))) - t_4) - t_1;
	} else if (t <= 8.4e+133) {
		tmp = ((b * c) - (t_4 + t_3)) - t_1;
	} else {
		tmp = ((b * c) + (t * ((18.0 * t_2) - (a * 4.0)))) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (j * 27.0) * k
	t_2 = x * (y * z)
	t_3 = 4.0 * (x * i)
	t_4 = 4.0 * (t * a)
	tmp = 0
	if t <= -7400.0:
		tmp = (((b * c) + (18.0 * (t * t_2))) - t_4) - t_1
	elif t <= 8.4e+133:
		tmp = ((b * c) - (t_4 + t_3)) - t_1
	else:
		tmp = ((b * c) + (t * ((18.0 * t_2) - (a * 4.0)))) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(j * 27.0) * k)
	t_2 = Float64(x * Float64(y * z))
	t_3 = Float64(4.0 * Float64(x * i))
	t_4 = Float64(4.0 * Float64(t * a))
	tmp = 0.0
	if (t <= -7400.0)
		tmp = Float64(Float64(Float64(Float64(b * c) + Float64(18.0 * Float64(t * t_2))) - t_4) - t_1);
	elseif (t <= 8.4e+133)
		tmp = Float64(Float64(Float64(b * c) - Float64(t_4 + t_3)) - t_1);
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * t_2) - Float64(a * 4.0)))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (j * 27.0) * k;
	t_2 = x * (y * z);
	t_3 = 4.0 * (x * i);
	t_4 = 4.0 * (t * a);
	tmp = 0.0;
	if (t <= -7400.0)
		tmp = (((b * c) + (18.0 * (t * t_2))) - t_4) - t_1;
	elseif (t <= 8.4e+133)
		tmp = ((b * c) - (t_4 + t_3)) - t_1;
	else
		tmp = ((b * c) + (t * ((18.0 * t_2) - (a * 4.0)))) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -7400.0], N[(N[(N[(N[(b * c), $MachinePrecision] + N[(18.0 * N[(t * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$4), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t, 8.4e+133], N[(N[(N[(b * c), $MachinePrecision] - N[(t$95$4 + t$95$3), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * t$95$2), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]]]]]]]

Derivation

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

Alternative 12: 81.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := \left(j \cdot 27\right) \cdot k\\ t_2 := 4 \cdot \left(x \cdot i\right)\\ t_3 := 4 \cdot \left(t \cdot a\right)\\ \mathbf{if}\;t \leq -580:\\ \;\;\;\;\left(\left(b \cdot c + 18 \cdot \left(t \cdot \left(z \cdot \left(x \cdot y\right)\right)\right)\right) - t_3\right) - t_1\\ \mathbf{elif}\;t \leq 1.05 \cdot 10^{+124}:\\ \;\;\;\;\left(b \cdot c - \left(t_3 + t_2\right)\right) - t_1\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - 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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* (* j 27.0) k)) (t_2 (* 4.0 (* x i))) (t_3 (* 4.0 (* t a))))
   (if (<= t -580.0)
     (- (- (+ (* b c) (* 18.0 (* t (* z (* x y))))) t_3) t_1)
     (if (<= t 1.05e+124)
       (- (- (* b c) (+ t_3 t_2)) t_1)
       (- (+ (* b c) (* 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);
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 t_2 = 4.0 * (x * i);
	double t_3 = 4.0 * (t * a);
	double tmp;
	if (t <= -580.0) {
		tmp = (((b * c) + (18.0 * (t * (z * (x * y))))) - t_3) - t_1;
	} else if (t <= 1.05e+124) {
		tmp = ((b * c) - (t_3 + t_2)) - t_1;
	} else {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = (j * 27.0d0) * k
    t_2 = 4.0d0 * (x * i)
    t_3 = 4.0d0 * (t * a)
    if (t <= (-580.0d0)) then
        tmp = (((b * c) + (18.0d0 * (t * (z * (x * y))))) - t_3) - t_1
    else if (t <= 1.05d+124) then
        tmp = ((b * c) - (t_3 + t_2)) - t_1
    else
        tmp = ((b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))) - 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;
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 t_2 = 4.0 * (x * i);
	double t_3 = 4.0 * (t * a);
	double tmp;
	if (t <= -580.0) {
		tmp = (((b * c) + (18.0 * (t * (z * (x * y))))) - t_3) - t_1;
	} else if (t <= 1.05e+124) {
		tmp = ((b * c) - (t_3 + t_2)) - t_1;
	} else {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (j * 27.0) * k
	t_2 = 4.0 * (x * i)
	t_3 = 4.0 * (t * a)
	tmp = 0
	if t <= -580.0:
		tmp = (((b * c) + (18.0 * (t * (z * (x * y))))) - t_3) - t_1
	elif t <= 1.05e+124:
		tmp = ((b * c) - (t_3 + t_2)) - t_1
	else:
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(j * 27.0) * k)
	t_2 = Float64(4.0 * Float64(x * i))
	t_3 = Float64(4.0 * Float64(t * a))
	tmp = 0.0
	if (t <= -580.0)
		tmp = Float64(Float64(Float64(Float64(b * c) + Float64(18.0 * Float64(t * Float64(z * Float64(x * y))))) - t_3) - t_1);
	elseif (t <= 1.05e+124)
		tmp = Float64(Float64(Float64(b * c) - Float64(t_3 + t_2)) - t_1);
	else
		tmp = Float64(Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (j * 27.0) * k;
	t_2 = 4.0 * (x * i);
	t_3 = 4.0 * (t * a);
	tmp = 0.0;
	if (t <= -580.0)
		tmp = (((b * c) + (18.0 * (t * (z * (x * y))))) - t_3) - t_1;
	elseif (t <= 1.05e+124)
		tmp = ((b * c) - (t_3 + t_2)) - t_1;
	else
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - 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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -580.0], N[(N[(N[(N[(b * c), $MachinePrecision] + N[(18.0 * N[(t * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t, 1.05e+124], N[(N[(N[(b * c), $MachinePrecision] - N[(t$95$3 + t$95$2), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]

Derivation

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

Alternative 13: 59.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])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ t_5 := 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^{+47}:\\ \;\;\;\;t_5\\ \mathbf{elif}\;x \leq -8.2 \cdot 10^{-198}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{-279}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 9 \cdot 10^{-204}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 7.5 \cdot 10^{-93}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;t_5\\ \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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1))
        (t_5 (* x (- (* 18.0 (* t (* y z))) (* 4.0 i)))))
   (if (<= x -1.15e+47)
     t_5
     (if (<= x -8.2e-198)
       t_4
       (if (<= x 2.3e-279)
         t_3
         (if (<= x 9e-204)
           t_4
           (if (<= x 7.5e-93) (+ t_1 t_2) (if (<= x 1.95e-32) t_3 t_5))))))))

C

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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double t_5 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -1.15e+47) {
		tmp = t_5;
	} else if (x <= -8.2e-198) {
		tmp = t_4;
	} else if (x <= 2.3e-279) {
		tmp = t_3;
	} else if (x <= 9e-204) {
		tmp = t_4;
	} else if (x <= 7.5e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.95e-32) {
		tmp = t_3;
	} else {
		tmp = t_5;
	}
	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.
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) :: t_5
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    t_5 = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
    if (x <= (-1.15d+47)) then
        tmp = t_5
    else if (x <= (-8.2d-198)) then
        tmp = t_4
    else if (x <= 2.3d-279) then
        tmp = t_3
    else if (x <= 9d-204) then
        tmp = t_4
    else if (x <= 7.5d-93) then
        tmp = t_1 + t_2
    else if (x <= 1.95d-32) then
        tmp = t_3
    else
        tmp = t_5
    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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double t_5 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	double tmp;
	if (x <= -1.15e+47) {
		tmp = t_5;
	} else if (x <= -8.2e-198) {
		tmp = t_4;
	} else if (x <= 2.3e-279) {
		tmp = t_3;
	} else if (x <= 9e-204) {
		tmp = t_4;
	} else if (x <= 7.5e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.95e-32) {
		tmp = t_3;
	} else {
		tmp = t_5;
	}
	return tmp;
}

Python

[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
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	t_5 = x * ((18.0 * (t * (y * z))) - (4.0 * i))
	tmp = 0
	if x <= -1.15e+47:
		tmp = t_5
	elif x <= -8.2e-198:
		tmp = t_4
	elif x <= 2.3e-279:
		tmp = t_3
	elif x <= 9e-204:
		tmp = t_4
	elif x <= 7.5e-93:
		tmp = t_1 + t_2
	elif x <= 1.95e-32:
		tmp = t_3
	else:
		tmp = t_5
	return tmp

Julia

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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	t_5 = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -1.15e+47)
		tmp = t_5;
	elseif (x <= -8.2e-198)
		tmp = t_4;
	elseif (x <= 2.3e-279)
		tmp = t_3;
	elseif (x <= 9e-204)
		tmp = t_4;
	elseif (x <= 7.5e-93)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.95e-32)
		tmp = t_3;
	else
		tmp = t_5;
	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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	t_5 = x * ((18.0 * (t * (y * z))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -1.15e+47)
		tmp = t_5;
	elseif (x <= -8.2e-198)
		tmp = t_4;
	elseif (x <= 2.3e-279)
		tmp = t_3;
	elseif (x <= 9e-204)
		tmp = t_4;
	elseif (x <= 7.5e-93)
		tmp = t_1 + t_2;
	elseif (x <= 1.95e-32)
		tmp = t_3;
	else
		tmp = t_5;
	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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$5 = 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+47], t$95$5, If[LessEqual[x, -8.2e-198], t$95$4, If[LessEqual[x, 2.3e-279], t$95$3, If[LessEqual[x, 9e-204], t$95$4, If[LessEqual[x, 7.5e-93], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.95e-32], t$95$3, t$95$5]]]]]]]]]]]

Derivation

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

Alternative 14: 59.1% 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])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ \mathbf{if}\;x \leq -1.1 \cdot 10^{+47}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -5.4 \cdot 10^{-197}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{-279}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 2 \cdot 10^{-205}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.26 \cdot 10^{-92}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.9 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1)))
   (if (<= x -1.1e+47)
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
     (if (<= x -5.4e-197)
       t_4
       (if (<= x 5.5e-279)
         t_3
         (if (<= x 2e-205)
           t_4
           (if (<= x 1.26e-92)
             (+ t_1 t_2)
             (if (<= x 1.9e-32)
               t_3
               (* 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);
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.1e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -5.4e-197) {
		tmp = t_4;
	} else if (x <= 5.5e-279) {
		tmp = t_3;
	} else if (x <= 2e-205) {
		tmp = t_4;
	} else if (x <= 1.26e-92) {
		tmp = t_1 + t_2;
	} else if (x <= 1.9e-32) {
		tmp = t_3;
	} 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    if (x <= (-1.1d+47)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if (x <= (-5.4d-197)) then
        tmp = t_4
    else if (x <= 5.5d-279) then
        tmp = t_3
    else if (x <= 2d-205) then
        tmp = t_4
    else if (x <= 1.26d-92) then
        tmp = t_1 + t_2
    else if (x <= 1.9d-32) then
        tmp = t_3
    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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -1.1e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -5.4e-197) {
		tmp = t_4;
	} else if (x <= 5.5e-279) {
		tmp = t_3;
	} else if (x <= 2e-205) {
		tmp = t_4;
	} else if (x <= 1.26e-92) {
		tmp = t_1 + t_2;
	} else if (x <= 1.9e-32) {
		tmp = t_3;
	} 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	tmp = 0
	if x <= -1.1e+47:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif x <= -5.4e-197:
		tmp = t_4
	elif x <= 5.5e-279:
		tmp = t_3
	elif x <= 2e-205:
		tmp = t_4
	elif x <= 1.26e-92:
		tmp = t_1 + t_2
	elif x <= 1.9e-32:
		tmp = t_3
	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])
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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (x <= -1.1e+47)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif (x <= -5.4e-197)
		tmp = t_4;
	elseif (x <= 5.5e-279)
		tmp = t_3;
	elseif (x <= 2e-205)
		tmp = t_4;
	elseif (x <= 1.26e-92)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.9e-32)
		tmp = t_3;
	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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	tmp = 0.0;
	if (x <= -1.1e+47)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif (x <= -5.4e-197)
		tmp = t_4;
	elseif (x <= 5.5e-279)
		tmp = t_3;
	elseif (x <= 2e-205)
		tmp = t_4;
	elseif (x <= 1.26e-92)
		tmp = t_1 + t_2;
	elseif (x <= 1.9e-32)
		tmp = t_3;
	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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -1.1e+47], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -5.4e-197], t$95$4, If[LessEqual[x, 5.5e-279], t$95$3, If[LessEqual[x, 2e-205], t$95$4, If[LessEqual[x, 1.26e-92], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.9e-32], t$95$3, 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 15: 59.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])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := \left(t \cdot a\right) \cdot -4\\ t_3 := b \cdot c + t_2\\ t_4 := b \cdot c + t_1\\ \mathbf{if}\;x \leq -3.5 \cdot 10^{+47}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{elif}\;x \leq -2.05 \cdot 10^{-197}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 1.95 \cdot 10^{-276}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq 2.7 \cdot 10^{-203}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;x \leq 8.6 \cdot 10^{-93}:\\ \;\;\;\;t_1 + t_2\\ \mathbf{elif}\;x \leq 1.75 \cdot 10^{-32}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\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.
(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))
        (t_3 (+ (* b c) t_2))
        (t_4 (+ (* b c) t_1)))
   (if (<= x -3.5e+47)
     (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))
     (if (<= x -2.05e-197)
       t_4
       (if (<= x 1.95e-276)
         t_3
         (if (<= x 2.7e-203)
           t_4
           (if (<= x 8.6e-93)
             (+ t_1 t_2)
             (if (<= x 1.75e-32)
               t_3
               (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))))))))))

C

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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -3.5e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -2.05e-197) {
		tmp = t_4;
	} else if (x <= 1.95e-276) {
		tmp = t_3;
	} else if (x <= 2.7e-203) {
		tmp = t_4;
	} else if (x <= 8.6e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.75e-32) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (t * a) * (-4.0d0)
    t_3 = (b * c) + t_2
    t_4 = (b * c) + t_1
    if (x <= (-3.5d+47)) then
        tmp = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    else if (x <= (-2.05d-197)) then
        tmp = t_4
    else if (x <= 1.95d-276) then
        tmp = t_3
    else if (x <= 2.7d-203) then
        tmp = t_4
    else if (x <= 8.6d-93) then
        tmp = t_1 + t_2
    else if (x <= 1.75d-32) then
        tmp = t_3
    else
        tmp = x * ((t * (z * (18.0d0 * y))) - (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;
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 t_3 = (b * c) + t_2;
	double t_4 = (b * c) + t_1;
	double tmp;
	if (x <= -3.5e+47) {
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	} else if (x <= -2.05e-197) {
		tmp = t_4;
	} else if (x <= 1.95e-276) {
		tmp = t_3;
	} else if (x <= 2.7e-203) {
		tmp = t_4;
	} else if (x <= 8.6e-93) {
		tmp = t_1 + t_2;
	} else if (x <= 1.75e-32) {
		tmp = t_3;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (t * a) * -4.0
	t_3 = (b * c) + t_2
	t_4 = (b * c) + t_1
	tmp = 0
	if x <= -3.5e+47:
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	elif x <= -2.05e-197:
		tmp = t_4
	elif x <= 1.95e-276:
		tmp = t_3
	elif x <= 2.7e-203:
		tmp = t_4
	elif x <= 8.6e-93:
		tmp = t_1 + t_2
	elif x <= 1.75e-32:
		tmp = t_3
	else:
		tmp = x * ((t * (z * (18.0 * y))) - (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])
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)
	t_3 = Float64(Float64(b * c) + t_2)
	t_4 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (x <= -3.5e+47)
		tmp = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)));
	elseif (x <= -2.05e-197)
		tmp = t_4;
	elseif (x <= 1.95e-276)
		tmp = t_3;
	elseif (x <= 2.7e-203)
		tmp = t_4;
	elseif (x <= 8.6e-93)
		tmp = Float64(t_1 + t_2);
	elseif (x <= 1.75e-32)
		tmp = t_3;
	else
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - 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])){:}
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;
	t_3 = (b * c) + t_2;
	t_4 = (b * c) + t_1;
	tmp = 0.0;
	if (x <= -3.5e+47)
		tmp = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	elseif (x <= -2.05e-197)
		tmp = t_4;
	elseif (x <= 1.95e-276)
		tmp = t_3;
	elseif (x <= 2.7e-203)
		tmp = t_4;
	elseif (x <= 8.6e-93)
		tmp = t_1 + t_2;
	elseif (x <= 1.75e-32)
		tmp = t_3;
	else
		tmp = x * ((t * (z * (18.0 * y))) - (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.
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]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -3.5e+47], N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2.05e-197], t$95$4, If[LessEqual[x, 1.95e-276], t$95$3, If[LessEqual[x, 2.7e-203], t$95$4, If[LessEqual[x, 8.6e-93], N[(t$95$1 + t$95$2), $MachinePrecision], If[LessEqual[x, 1.75e-32], t$95$3, N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

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

Alternative 16: 60.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := b \cdot c - \left(4 \cdot \left(t \cdot a\right) + 4 \cdot \left(x \cdot i\right)\right)\\ t_2 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;j \leq -1.85 \cdot 10^{+202}:\\ \;\;\;\;t_2 + \left(x \cdot i\right) \cdot -4\\ \mathbf{elif}\;j \leq -4 \cdot 10^{+136}:\\ \;\;\;\;t_2 + \left(t \cdot a\right) \cdot -4\\ \mathbf{elif}\;j \leq -3.5 \cdot 10^{-188}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -2.15 \cdot 10^{-231}:\\ \;\;\;\;t_2 + 18 \cdot \left(\left(y \cdot z\right) \cdot \left(x \cdot t\right)\right)\\ \mathbf{elif}\;j \leq 1.1 \cdot 10^{+14}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2 + 18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (- (* b c) (+ (* 4.0 (* t a)) (* 4.0 (* x i)))))
        (t_2 (* j (* k -27.0))))
   (if (<= j -1.85e+202)
     (+ t_2 (* (* x i) -4.0))
     (if (<= j -4e+136)
       (+ t_2 (* (* t a) -4.0))
       (if (<= j -3.5e-188)
         t_1
         (if (<= j -2.15e-231)
           (+ t_2 (* 18.0 (* (* y z) (* x t))))
           (if (<= j 1.1e+14) t_1 (+ t_2 (* 18.0 (* t (* x (* y z))))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) - ((4.0 * (t * a)) + (4.0 * (x * i)));
	double t_2 = j * (k * -27.0);
	double tmp;
	if (j <= -1.85e+202) {
		tmp = t_2 + ((x * i) * -4.0);
	} else if (j <= -4e+136) {
		tmp = t_2 + ((t * a) * -4.0);
	} else if (j <= -3.5e-188) {
		tmp = t_1;
	} else if (j <= -2.15e-231) {
		tmp = t_2 + (18.0 * ((y * z) * (x * t)));
	} else if (j <= 1.1e+14) {
		tmp = t_1;
	} else {
		tmp = t_2 + (18.0 * (t * (x * (y * z))));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (b * c) - ((4.0d0 * (t * a)) + (4.0d0 * (x * i)))
    t_2 = j * (k * (-27.0d0))
    if (j <= (-1.85d+202)) then
        tmp = t_2 + ((x * i) * (-4.0d0))
    else if (j <= (-4d+136)) then
        tmp = t_2 + ((t * a) * (-4.0d0))
    else if (j <= (-3.5d-188)) then
        tmp = t_1
    else if (j <= (-2.15d-231)) then
        tmp = t_2 + (18.0d0 * ((y * z) * (x * t)))
    else if (j <= 1.1d+14) then
        tmp = t_1
    else
        tmp = t_2 + (18.0d0 * (t * (x * (y * z))))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) - ((4.0 * (t * a)) + (4.0 * (x * i)));
	double t_2 = j * (k * -27.0);
	double tmp;
	if (j <= -1.85e+202) {
		tmp = t_2 + ((x * i) * -4.0);
	} else if (j <= -4e+136) {
		tmp = t_2 + ((t * a) * -4.0);
	} else if (j <= -3.5e-188) {
		tmp = t_1;
	} else if (j <= -2.15e-231) {
		tmp = t_2 + (18.0 * ((y * z) * (x * t)));
	} else if (j <= 1.1e+14) {
		tmp = t_1;
	} else {
		tmp = t_2 + (18.0 * (t * (x * (y * z))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) - ((4.0 * (t * a)) + (4.0 * (x * i)))
	t_2 = j * (k * -27.0)
	tmp = 0
	if j <= -1.85e+202:
		tmp = t_2 + ((x * i) * -4.0)
	elif j <= -4e+136:
		tmp = t_2 + ((t * a) * -4.0)
	elif j <= -3.5e-188:
		tmp = t_1
	elif j <= -2.15e-231:
		tmp = t_2 + (18.0 * ((y * z) * (x * t)))
	elif j <= 1.1e+14:
		tmp = t_1
	else:
		tmp = t_2 + (18.0 * (t * (x * (y * z))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) - Float64(Float64(4.0 * Float64(t * a)) + Float64(4.0 * Float64(x * i))))
	t_2 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (j <= -1.85e+202)
		tmp = Float64(t_2 + Float64(Float64(x * i) * -4.0));
	elseif (j <= -4e+136)
		tmp = Float64(t_2 + Float64(Float64(t * a) * -4.0));
	elseif (j <= -3.5e-188)
		tmp = t_1;
	elseif (j <= -2.15e-231)
		tmp = Float64(t_2 + Float64(18.0 * Float64(Float64(y * z) * Float64(x * t))));
	elseif (j <= 1.1e+14)
		tmp = t_1;
	else
		tmp = Float64(t_2 + Float64(18.0 * Float64(t * Float64(x * Float64(y * z)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) - ((4.0 * (t * a)) + (4.0 * (x * i)));
	t_2 = j * (k * -27.0);
	tmp = 0.0;
	if (j <= -1.85e+202)
		tmp = t_2 + ((x * i) * -4.0);
	elseif (j <= -4e+136)
		tmp = t_2 + ((t * a) * -4.0);
	elseif (j <= -3.5e-188)
		tmp = t_1;
	elseif (j <= -2.15e-231)
		tmp = t_2 + (18.0 * ((y * z) * (x * t)));
	elseif (j <= 1.1e+14)
		tmp = t_1;
	else
		tmp = t_2 + (18.0 * (t * (x * (y * z))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 17: 49.2% 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])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := b \cdot c + t_1\\ \mathbf{if}\;k \leq -9.2 \cdot 10^{-88}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;k \leq 3.5 \cdot 10^{-306}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;k \leq 8.2 \cdot 10^{-41}:\\ \;\;\;\;b \cdot c + \left(t \cdot a\right) \cdot -4\\ \mathbf{elif}\;k \leq 1.6 \cdot 10^{-22}:\\ \;\;\;\;\left(z \cdot \left(x \cdot y\right)\right) \cdot \left(18 \cdot t\right)\\ \mathbf{elif}\;k \leq 10^{+42} \lor \neg \left(k \leq 1.75 \cdot 10^{+193}\right):\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;t_1 + \left(x \cdot i\right) \cdot -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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))) (t_2 (+ (* b c) t_1)))
   (if (<= k -9.2e-88)
     t_2
     (if (<= k 3.5e-306)
       (- (* b c) (* 4.0 (* x i)))
       (if (<= k 8.2e-41)
         (+ (* b c) (* (* t a) -4.0))
         (if (<= k 1.6e-22)
           (* (* z (* x y)) (* 18.0 t))
           (if (or (<= k 1e+42) (not (<= k 1.75e+193)))
             t_2
             (+ t_1 (* (* x i) -4.0)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double tmp;
	if (k <= -9.2e-88) {
		tmp = t_2;
	} else if (k <= 3.5e-306) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 8.2e-41) {
		tmp = (b * c) + ((t * a) * -4.0);
	} else if (k <= 1.6e-22) {
		tmp = (z * (x * y)) * (18.0 * t);
	} else if ((k <= 1e+42) || !(k <= 1.75e+193)) {
		tmp = t_2;
	} else {
		tmp = t_1 + ((x * i) * -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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (b * c) + t_1
    if (k <= (-9.2d-88)) then
        tmp = t_2
    else if (k <= 3.5d-306) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (k <= 8.2d-41) then
        tmp = (b * c) + ((t * a) * (-4.0d0))
    else if (k <= 1.6d-22) then
        tmp = (z * (x * y)) * (18.0d0 * t)
    else if ((k <= 1d+42) .or. (.not. (k <= 1.75d+193))) then
        tmp = t_2
    else
        tmp = t_1 + ((x * i) * (-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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double tmp;
	if (k <= -9.2e-88) {
		tmp = t_2;
	} else if (k <= 3.5e-306) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 8.2e-41) {
		tmp = (b * c) + ((t * a) * -4.0);
	} else if (k <= 1.6e-22) {
		tmp = (z * (x * y)) * (18.0 * t);
	} else if ((k <= 1e+42) || !(k <= 1.75e+193)) {
		tmp = t_2;
	} else {
		tmp = t_1 + ((x * i) * -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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (b * c) + t_1
	tmp = 0
	if k <= -9.2e-88:
		tmp = t_2
	elif k <= 3.5e-306:
		tmp = (b * c) - (4.0 * (x * i))
	elif k <= 8.2e-41:
		tmp = (b * c) + ((t * a) * -4.0)
	elif k <= 1.6e-22:
		tmp = (z * (x * y)) * (18.0 * t)
	elif (k <= 1e+42) or not (k <= 1.75e+193):
		tmp = t_2
	else:
		tmp = t_1 + ((x * i) * -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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(b * c) + t_1)
	tmp = 0.0
	if (k <= -9.2e-88)
		tmp = t_2;
	elseif (k <= 3.5e-306)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (k <= 8.2e-41)
		tmp = Float64(Float64(b * c) + Float64(Float64(t * a) * -4.0));
	elseif (k <= 1.6e-22)
		tmp = Float64(Float64(z * Float64(x * y)) * Float64(18.0 * t));
	elseif ((k <= 1e+42) || !(k <= 1.75e+193))
		tmp = t_2;
	else
		tmp = Float64(t_1 + Float64(Float64(x * i) * -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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (b * c) + t_1;
	tmp = 0.0;
	if (k <= -9.2e-88)
		tmp = t_2;
	elseif (k <= 3.5e-306)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (k <= 8.2e-41)
		tmp = (b * c) + ((t * a) * -4.0);
	elseif (k <= 1.6e-22)
		tmp = (z * (x * y)) * (18.0 * t);
	elseif ((k <= 1e+42) || ~((k <= 1.75e+193)))
		tmp = t_2;
	else
		tmp = t_1 + ((x * i) * -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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[k, -9.2e-88], t$95$2, If[LessEqual[k, 3.5e-306], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 8.2e-41], N[(N[(b * c), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 1.6e-22], N[(N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(18.0 * t), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[k, 1e+42], N[Not[LessEqual[k, 1.75e+193]], $MachinePrecision]], t$95$2, N[(t$95$1 + N[(N[(x * i), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 18: 49.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])\\ \\ \begin{array}{l} t_1 := \left(t \cdot a\right) \cdot -4\\ t_2 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;k \leq -9.8 \cdot 10^{-86}:\\ \;\;\;\;t_2 + t_1\\ \mathbf{elif}\;k \leq 2.3 \cdot 10^{-301}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;k \leq 8 \cdot 10^{-41}:\\ \;\;\;\;b \cdot c + t_1\\ \mathbf{elif}\;k \leq 1.15 \cdot 10^{-20}:\\ \;\;\;\;\left(z \cdot \left(x \cdot y\right)\right) \cdot \left(18 \cdot t\right)\\ \mathbf{elif}\;k \leq 6.2 \cdot 10^{+41} \lor \neg \left(k \leq 2.3 \cdot 10^{+193}\right):\\ \;\;\;\;b \cdot c + t_2\\ \mathbf{else}:\\ \;\;\;\;t_2 + \left(x \cdot i\right) \cdot -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.
(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 (<= k -9.8e-86)
     (+ t_2 t_1)
     (if (<= k 2.3e-301)
       (- (* b c) (* 4.0 (* x i)))
       (if (<= k 8e-41)
         (+ (* b c) t_1)
         (if (<= k 1.15e-20)
           (* (* z (* x y)) (* 18.0 t))
           (if (or (<= k 6.2e+41) (not (<= k 2.3e+193)))
             (+ (* b c) t_2)
             (+ t_2 (* (* x i) -4.0)))))))))

C

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 (k <= -9.8e-86) {
		tmp = t_2 + t_1;
	} else if (k <= 2.3e-301) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 8e-41) {
		tmp = (b * c) + t_1;
	} else if (k <= 1.15e-20) {
		tmp = (z * (x * y)) * (18.0 * t);
	} else if ((k <= 6.2e+41) || !(k <= 2.3e+193)) {
		tmp = (b * c) + t_2;
	} else {
		tmp = t_2 + ((x * i) * -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.
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 (k <= (-9.8d-86)) then
        tmp = t_2 + t_1
    else if (k <= 2.3d-301) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (k <= 8d-41) then
        tmp = (b * c) + t_1
    else if (k <= 1.15d-20) then
        tmp = (z * (x * y)) * (18.0d0 * t)
    else if ((k <= 6.2d+41) .or. (.not. (k <= 2.3d+193))) then
        tmp = (b * c) + t_2
    else
        tmp = t_2 + ((x * i) * (-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;
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 (k <= -9.8e-86) {
		tmp = t_2 + t_1;
	} else if (k <= 2.3e-301) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 8e-41) {
		tmp = (b * c) + t_1;
	} else if (k <= 1.15e-20) {
		tmp = (z * (x * y)) * (18.0 * t);
	} else if ((k <= 6.2e+41) || !(k <= 2.3e+193)) {
		tmp = (b * c) + t_2;
	} else {
		tmp = t_2 + ((x * i) * -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])
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 k <= -9.8e-86:
		tmp = t_2 + t_1
	elif k <= 2.3e-301:
		tmp = (b * c) - (4.0 * (x * i))
	elif k <= 8e-41:
		tmp = (b * c) + t_1
	elif k <= 1.15e-20:
		tmp = (z * (x * y)) * (18.0 * t)
	elif (k <= 6.2e+41) or not (k <= 2.3e+193):
		tmp = (b * c) + t_2
	else:
		tmp = t_2 + ((x * i) * -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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(t * a) * -4.0)
	t_2 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (k <= -9.8e-86)
		tmp = Float64(t_2 + t_1);
	elseif (k <= 2.3e-301)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (k <= 8e-41)
		tmp = Float64(Float64(b * c) + t_1);
	elseif (k <= 1.15e-20)
		tmp = Float64(Float64(z * Float64(x * y)) * Float64(18.0 * t));
	elseif ((k <= 6.2e+41) || !(k <= 2.3e+193))
		tmp = Float64(Float64(b * c) + t_2);
	else
		tmp = Float64(t_2 + Float64(Float64(x * i) * -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])){:}
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 (k <= -9.8e-86)
		tmp = t_2 + t_1;
	elseif (k <= 2.3e-301)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (k <= 8e-41)
		tmp = (b * c) + t_1;
	elseif (k <= 1.15e-20)
		tmp = (z * (x * y)) * (18.0 * t);
	elseif ((k <= 6.2e+41) || ~((k <= 2.3e+193)))
		tmp = (b * c) + t_2;
	else
		tmp = t_2 + ((x * i) * -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.
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[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, -9.8e-86], N[(t$95$2 + t$95$1), $MachinePrecision], If[LessEqual[k, 2.3e-301], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 8e-41], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[k, 1.15e-20], N[(N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(18.0 * t), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[k, 6.2e+41], N[Not[LessEqual[k, 2.3e+193]], $MachinePrecision]], N[(N[(b * c), $MachinePrecision] + t$95$2), $MachinePrecision], N[(t$95$2 + N[(N[(x * i), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 19: 71.8% 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])\\ \\ \begin{array}{l} t_1 := \left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\ t_2 := x \cdot \left(18 \cdot \left(y \cdot \left(z \cdot t\right)\right) - 4 \cdot i\right)\\ \mathbf{if}\;x \leq -2.65 \cdot 10^{+51}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 2.2 \cdot 10^{+37}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 2.5 \cdot 10^{+122}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{+137}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(t \cdot \left(z \cdot \left(18 \cdot y\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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (- (- (* b c) (* 4.0 (* t a))) (* (* j 27.0) k)))
        (t_2 (* x (- (* 18.0 (* y (* z t))) (* 4.0 i)))))
   (if (<= x -2.65e+51)
     t_2
     (if (<= x 2.2e+37)
       t_1
       (if (<= x 2.5e+122)
         t_2
         (if (<= x 1.2e+137)
           t_1
           (* x (- (* t (* z (* 18.0 y))) (* 4.0 i)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	double t_2 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	double tmp;
	if (x <= -2.65e+51) {
		tmp = t_2;
	} else if (x <= 2.2e+37) {
		tmp = t_1;
	} else if (x <= 2.5e+122) {
		tmp = t_2;
	} else if (x <= 1.2e+137) {
		tmp = t_1;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = ((b * c) - (4.0d0 * (t * a))) - ((j * 27.0d0) * k)
    t_2 = x * ((18.0d0 * (y * (z * t))) - (4.0d0 * i))
    if (x <= (-2.65d+51)) then
        tmp = t_2
    else if (x <= 2.2d+37) then
        tmp = t_1
    else if (x <= 2.5d+122) then
        tmp = t_2
    else if (x <= 1.2d+137) then
        tmp = t_1
    else
        tmp = x * ((t * (z * (18.0d0 * y))) - (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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	double t_2 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	double tmp;
	if (x <= -2.65e+51) {
		tmp = t_2;
	} else if (x <= 2.2e+37) {
		tmp = t_1;
	} else if (x <= 2.5e+122) {
		tmp = t_2;
	} else if (x <= 1.2e+137) {
		tmp = t_1;
	} else {
		tmp = x * ((t * (z * (18.0 * y))) - (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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k)
	t_2 = x * ((18.0 * (y * (z * t))) - (4.0 * i))
	tmp = 0
	if x <= -2.65e+51:
		tmp = t_2
	elif x <= 2.2e+37:
		tmp = t_1
	elif x <= 2.5e+122:
		tmp = t_2
	elif x <= 1.2e+137:
		tmp = t_1
	else:
		tmp = x * ((t * (z * (18.0 * y))) - (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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(j * 27.0) * k))
	t_2 = Float64(x * Float64(Float64(18.0 * Float64(y * Float64(z * t))) - Float64(4.0 * i)))
	tmp = 0.0
	if (x <= -2.65e+51)
		tmp = t_2;
	elseif (x <= 2.2e+37)
		tmp = t_1;
	elseif (x <= 2.5e+122)
		tmp = t_2;
	elseif (x <= 1.2e+137)
		tmp = t_1;
	else
		tmp = Float64(x * Float64(Float64(t * Float64(z * Float64(18.0 * y))) - 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
	t_2 = x * ((18.0 * (y * (z * t))) - (4.0 * i));
	tmp = 0.0;
	if (x <= -2.65e+51)
		tmp = t_2;
	elseif (x <= 2.2e+37)
		tmp = t_1;
	elseif (x <= 2.5e+122)
		tmp = t_2;
	elseif (x <= 1.2e+137)
		tmp = t_1;
	else
		tmp = x * ((t * (z * (18.0 * y))) - (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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(18.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.65e+51], t$95$2, If[LessEqual[x, 2.2e+37], t$95$1, If[LessEqual[x, 2.5e+122], t$95$2, If[LessEqual[x, 1.2e+137], t$95$1, N[(x * N[(N[(t * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

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

Alternative 20: 78.2% 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])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -5.2 \cdot 10^{+117}:\\ \;\;\;\;b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c - \left(4 \cdot \left(t \cdot a\right) + 4 \cdot \left(x \cdot i\right)\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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= t -5.2e+117)
   (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
   (- (- (* b c) (+ (* 4.0 (* t a)) (* 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);
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 <= -5.2e+117) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} else {
		tmp = ((b * c) - ((4.0 * (t * a)) + (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.
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 <= (-5.2d+117)) then
        tmp = (b * c) + (t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0)))
    else
        tmp = ((b * c) - ((4.0d0 * (t * a)) + (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;
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 <= -5.2e+117) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} else {
		tmp = ((b * c) - ((4.0 * (t * a)) + (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])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if t <= -5.2e+117:
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))
	else:
		tmp = ((b * c) - ((4.0 * (t * a)) + (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])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (t <= -5.2e+117)
		tmp = Float64(Float64(b * c) + Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0))));
	else
		tmp = Float64(Float64(Float64(b * c) - Float64(Float64(4.0 * Float64(t * a)) + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (t <= -5.2e+117)
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	else
		tmp = ((b * c) - ((4.0 * (t * a)) + (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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[t, -5.2e+117], N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 21: 50.2% 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])\\ \\ \begin{array}{l} t_1 := b \cdot c + \left(t \cdot a\right) \cdot -4\\ t_2 := b \cdot c + j \cdot \left(k \cdot -27\right)\\ t_3 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;x \leq -1.15 \cdot 10^{+49}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;x \leq -1.95 \cdot 10^{-197}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 1.7 \cdot 10^{-280}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-197}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+20}:\\ \;\;\;\;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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* b c) (* (* t a) -4.0)))
        (t_2 (+ (* b c) (* j (* k -27.0))))
        (t_3 (- (* b c) (* 4.0 (* x i)))))
   (if (<= x -1.15e+49)
     t_3
     (if (<= x -1.95e-197)
       t_2
       (if (<= x 1.7e-280)
         t_1
         (if (<= x 8e-197) t_2 (if (<= x 8e+20) t_1 t_3)))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + ((t * a) * -4.0);
	double t_2 = (b * c) + (j * (k * -27.0));
	double t_3 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (x <= -1.15e+49) {
		tmp = t_3;
	} else if (x <= -1.95e-197) {
		tmp = t_2;
	} else if (x <= 1.7e-280) {
		tmp = t_1;
	} else if (x <= 8e-197) {
		tmp = t_2;
	} else if (x <= 8e+20) {
		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.
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) + ((t * a) * (-4.0d0))
    t_2 = (b * c) + (j * (k * (-27.0d0)))
    t_3 = (b * c) - (4.0d0 * (x * i))
    if (x <= (-1.15d+49)) then
        tmp = t_3
    else if (x <= (-1.95d-197)) then
        tmp = t_2
    else if (x <= 1.7d-280) then
        tmp = t_1
    else if (x <= 8d-197) then
        tmp = t_2
    else if (x <= 8d+20) 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + ((t * a) * -4.0);
	double t_2 = (b * c) + (j * (k * -27.0));
	double t_3 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (x <= -1.15e+49) {
		tmp = t_3;
	} else if (x <= -1.95e-197) {
		tmp = t_2;
	} else if (x <= 1.7e-280) {
		tmp = t_1;
	} else if (x <= 8e-197) {
		tmp = t_2;
	} else if (x <= 8e+20) {
		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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) + ((t * a) * -4.0)
	t_2 = (b * c) + (j * (k * -27.0))
	t_3 = (b * c) - (4.0 * (x * i))
	tmp = 0
	if x <= -1.15e+49:
		tmp = t_3
	elif x <= -1.95e-197:
		tmp = t_2
	elif x <= 1.7e-280:
		tmp = t_1
	elif x <= 8e-197:
		tmp = t_2
	elif x <= 8e+20:
		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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) + Float64(Float64(t * a) * -4.0))
	t_2 = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)))
	t_3 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	tmp = 0.0
	if (x <= -1.15e+49)
		tmp = t_3;
	elseif (x <= -1.95e-197)
		tmp = t_2;
	elseif (x <= 1.7e-280)
		tmp = t_1;
	elseif (x <= 8e-197)
		tmp = t_2;
	elseif (x <= 8e+20)
		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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) + ((t * a) * -4.0);
	t_2 = (b * c) + (j * (k * -27.0));
	t_3 = (b * c) - (4.0 * (x * i));
	tmp = 0.0;
	if (x <= -1.15e+49)
		tmp = t_3;
	elseif (x <= -1.95e-197)
		tmp = t_2;
	elseif (x <= 1.7e-280)
		tmp = t_1;
	elseif (x <= 8e-197)
		tmp = t_2;
	elseif (x <= 8e+20)
		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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(b * c), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.15e+49], t$95$3, If[LessEqual[x, -1.95e-197], t$95$2, If[LessEqual[x, 1.7e-280], t$95$1, If[LessEqual[x, 8e-197], t$95$2, If[LessEqual[x, 8e+20], t$95$1, t$95$3]]]]]]]]

Derivation

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

Alternative 22: 50.0% 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])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ \mathbf{if}\;k \leq -9.5 \cdot 10^{-86}:\\ \;\;\;\;t_1 + \left(t \cdot a\right) \cdot -4\\ \mathbf{elif}\;k \leq 7 \cdot 10^{-87}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{elif}\;k \leq 7.8 \cdot 10^{+28}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{elif}\;k \leq 3.5 \cdot 10^{+193}:\\ \;\;\;\;t_1 + \left(x \cdot i\right) \cdot -4\\ \mathbf{else}:\\ \;\;\;\;b \cdot c + 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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0))))
   (if (<= k -9.5e-86)
     (+ t_1 (* (* t a) -4.0))
     (if (<= k 7e-87)
       (- (* b c) (* 4.0 (* x i)))
       (if (<= k 7.8e+28)
         (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
         (if (<= k 3.5e+193) (+ t_1 (* (* x i) -4.0)) (+ (* b c) t_1)))))))

C

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 (k <= -9.5e-86) {
		tmp = t_1 + ((t * a) * -4.0);
	} else if (k <= 7e-87) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 7.8e+28) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else if (k <= 3.5e+193) {
		tmp = t_1 + ((x * i) * -4.0);
	} else {
		tmp = (b * c) + 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.
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 (k <= (-9.5d-86)) then
        tmp = t_1 + ((t * a) * (-4.0d0))
    else if (k <= 7d-87) then
        tmp = (b * c) - (4.0d0 * (x * i))
    else if (k <= 7.8d+28) then
        tmp = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    else if (k <= 3.5d+193) then
        tmp = t_1 + ((x * i) * (-4.0d0))
    else
        tmp = (b * c) + 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;
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 (k <= -9.5e-86) {
		tmp = t_1 + ((t * a) * -4.0);
	} else if (k <= 7e-87) {
		tmp = (b * c) - (4.0 * (x * i));
	} else if (k <= 7.8e+28) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else if (k <= 3.5e+193) {
		tmp = t_1 + ((x * i) * -4.0);
	} else {
		tmp = (b * c) + 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	tmp = 0
	if k <= -9.5e-86:
		tmp = t_1 + ((t * a) * -4.0)
	elif k <= 7e-87:
		tmp = (b * c) - (4.0 * (x * i))
	elif k <= 7.8e+28:
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	elif k <= 3.5e+193:
		tmp = t_1 + ((x * i) * -4.0)
	else:
		tmp = (b * c) + 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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	tmp = 0.0
	if (k <= -9.5e-86)
		tmp = Float64(t_1 + Float64(Float64(t * a) * -4.0));
	elseif (k <= 7e-87)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	elseif (k <= 7.8e+28)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)));
	elseif (k <= 3.5e+193)
		tmp = Float64(t_1 + Float64(Float64(x * i) * -4.0));
	else
		tmp = Float64(Float64(b * c) + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	tmp = 0.0;
	if (k <= -9.5e-86)
		tmp = t_1 + ((t * a) * -4.0);
	elseif (k <= 7e-87)
		tmp = (b * c) - (4.0 * (x * i));
	elseif (k <= 7.8e+28)
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	elseif (k <= 3.5e+193)
		tmp = t_1 + ((x * i) * -4.0);
	else
		tmp = (b * c) + 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.
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[k, -9.5e-86], N[(t$95$1 + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 7e-87], N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 7.8e+28], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 3.5e+193], N[(t$95$1 + N[(N[(x * i), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]]]]]]

Derivation

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

Alternative 23: 44.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := b \cdot c + \left(t \cdot a\right) \cdot -4\\ \mathbf{if}\;j \leq -1.45 \cdot 10^{+168}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;j \leq -3.4 \cdot 10^{-116}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;j \leq -1.12 \cdot 10^{-131}:\\ \;\;\;\;\left(x \cdot i\right) \cdot -4\\ \mathbf{elif}\;j \leq 62000000000000:\\ \;\;\;\;t_1\\ \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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* b c) (* (* t a) -4.0))))
   (if (<= j -1.45e+168)
     (* k (* j -27.0))
     (if (<= j -3.4e-116)
       t_1
       (if (<= j -1.12e-131)
         (* (* x i) -4.0)
         (if (<= j 62000000000000.0) t_1 (* -27.0 (* j k))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + ((t * a) * -4.0);
	double tmp;
	if (j <= -1.45e+168) {
		tmp = k * (j * -27.0);
	} else if (j <= -3.4e-116) {
		tmp = t_1;
	} else if (j <= -1.12e-131) {
		tmp = (x * i) * -4.0;
	} else if (j <= 62000000000000.0) {
		tmp = t_1;
	} 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.
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 = (b * c) + ((t * a) * (-4.0d0))
    if (j <= (-1.45d+168)) then
        tmp = k * (j * (-27.0d0))
    else if (j <= (-3.4d-116)) then
        tmp = t_1
    else if (j <= (-1.12d-131)) then
        tmp = (x * i) * (-4.0d0)
    else if (j <= 62000000000000.0d0) then
        tmp = t_1
    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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = (b * c) + ((t * a) * -4.0);
	double tmp;
	if (j <= -1.45e+168) {
		tmp = k * (j * -27.0);
	} else if (j <= -3.4e-116) {
		tmp = t_1;
	} else if (j <= -1.12e-131) {
		tmp = (x * i) * -4.0;
	} else if (j <= 62000000000000.0) {
		tmp = t_1;
	} 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])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) + ((t * a) * -4.0)
	tmp = 0
	if j <= -1.45e+168:
		tmp = k * (j * -27.0)
	elif j <= -3.4e-116:
		tmp = t_1
	elif j <= -1.12e-131:
		tmp = (x * i) * -4.0
	elif j <= 62000000000000.0:
		tmp = t_1
	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])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) + Float64(Float64(t * a) * -4.0))
	tmp = 0.0
	if (j <= -1.45e+168)
		tmp = Float64(k * Float64(j * -27.0));
	elseif (j <= -3.4e-116)
		tmp = t_1;
	elseif (j <= -1.12e-131)
		tmp = Float64(Float64(x * i) * -4.0);
	elseif (j <= 62000000000000.0)
		tmp = t_1;
	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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) + ((t * a) * -4.0);
	tmp = 0.0;
	if (j <= -1.45e+168)
		tmp = k * (j * -27.0);
	elseif (j <= -3.4e-116)
		tmp = t_1;
	elseif (j <= -1.12e-131)
		tmp = (x * i) * -4.0;
	elseif (j <= 62000000000000.0)
		tmp = t_1;
	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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(b * c), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -1.45e+168], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, -3.4e-116], t$95$1, If[LessEqual[j, -1.12e-131], N[(N[(x * i), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[j, 62000000000000.0], t$95$1, N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 24: 27.0% accurate, 2.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])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{+130}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \leq -5.7 \cdot 10^{-115}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-158}:\\ \;\;\;\;\left(x \cdot i\right) \cdot -4\\ \mathbf{else}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= b -1.7e+130)
   (* b c)
   (if (<= b -5.7e-115)
     (* -27.0 (* j k))
     (if (<= b 1.35e-158) (* (* x i) -4.0) (* k (* j -27.0))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 <= -1.7e+130) {
		tmp = b * c;
	} else if (b <= -5.7e-115) {
		tmp = -27.0 * (j * k);
	} else if (b <= 1.35e-158) {
		tmp = (x * i) * -4.0;
	} else {
		tmp = k * (j * -27.0);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 <= (-1.7d+130)) then
        tmp = b * c
    else if (b <= (-5.7d-115)) then
        tmp = (-27.0d0) * (j * k)
    else if (b <= 1.35d-158) then
        tmp = (x * i) * (-4.0d0)
    else
        tmp = k * (j * (-27.0d0))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 <= -1.7e+130) {
		tmp = b * c;
	} else if (b <= -5.7e-115) {
		tmp = -27.0 * (j * k);
	} else if (b <= 1.35e-158) {
		tmp = (x * i) * -4.0;
	} else {
		tmp = k * (j * -27.0);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if b <= -1.7e+130:
		tmp = b * c
	elif b <= -5.7e-115:
		tmp = -27.0 * (j * k)
	elif b <= 1.35e-158:
		tmp = (x * i) * -4.0
	else:
		tmp = k * (j * -27.0)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (b <= -1.7e+130)
		tmp = Float64(b * c);
	elseif (b <= -5.7e-115)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (b <= 1.35e-158)
		tmp = Float64(Float64(x * i) * -4.0);
	else
		tmp = Float64(k * Float64(j * -27.0));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (b <= -1.7e+130)
		tmp = b * c;
	elseif (b <= -5.7e-115)
		tmp = -27.0 * (j * k);
	elseif (b <= 1.35e-158)
		tmp = (x * i) * -4.0;
	else
		tmp = k * (j * -27.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 25: 46.9% accurate, 2.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])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -2.9 \cdot 10^{+63}:\\ \;\;\;\;b \cdot c + \left(t \cdot a\right) \cdot -4\\ \mathbf{else}:\\ \;\;\;\;b \cdot c + 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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= a -2.9e+63)
   (+ (* b c) (* (* t a) -4.0))
   (+ (* 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);
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 (a <= -2.9e+63) {
		tmp = (b * c) + ((t * a) * -4.0);
	} else {
		tmp = (b * c) + (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.
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 (a <= (-2.9d+63)) then
        tmp = (b * c) + ((t * a) * (-4.0d0))
    else
        tmp = (b * c) + (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;
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 (a <= -2.9e+63) {
		tmp = (b * c) + ((t * a) * -4.0);
	} else {
		tmp = (b * c) + (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])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if a <= -2.9e+63:
		tmp = (b * c) + ((t * a) * -4.0)
	else:
		tmp = (b * c) + (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])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (a <= -2.9e+63)
		tmp = Float64(Float64(b * c) + Float64(Float64(t * a) * -4.0));
	else
		tmp = Float64(Float64(b * c) + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (a <= -2.9e+63)
		tmp = (b * c) + ((t * a) * -4.0);
	else
		tmp = (b * c) + (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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[a, -2.9e+63], N[(N[(b * c), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 26: 32.3% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 27: 32.3% accurate, 3.4× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;j \leq -9.2 \cdot 10^{+137}:\\ \;\;\;\;k \cdot \left(j \cdot -27\right)\\ \mathbf{elif}\;j \leq 1.7 \cdot 10^{-18}:\\ \;\;\;\;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.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= j -9.2e+137)
   (* k (* j -27.0))
   (if (<= j 1.7e-18) (* 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);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (j <= -9.2e+137) {
		tmp = k * (j * -27.0);
	} else if (j <= 1.7e-18) {
		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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: tmp
    if (j <= (-9.2d+137)) then
        tmp = k * (j * (-27.0d0))
    else if (j <= 1.7d-18) 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (j <= -9.2e+137) {
		tmp = k * (j * -27.0);
	} else if (j <= 1.7e-18) {
		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])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if j <= -9.2e+137:
		tmp = k * (j * -27.0)
	elif j <= 1.7e-18:
		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])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (j <= -9.2e+137)
		tmp = Float64(k * Float64(j * -27.0));
	elseif (j <= 1.7e-18)
		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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (j <= -9.2e+137)
		tmp = k * (j * -27.0);
	elseif (j <= 1.7e-18)
		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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[j, -9.2e+137], N[(k * N[(j * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 1.7e-18], N[(b * c), $MachinePrecision], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 28: 23.6% 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])\\ \\ 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.
(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);
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.
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;
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])
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])
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])){:}
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.
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.9% 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 2023343 
(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)))