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

Percentage Accurate: 84.8% → 90.9%

Time: 35.4s

Alternatives: 24

Speedup: 0.9×

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

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 90.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := \left(j \cdot 27\right) \cdot k\\ t_2 := \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - t_1\\ \mathbf{if}\;t_2 \leq \infty:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\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 (* (* j 27.0) k))
        (t_2
         (-
          (-
           (+ (- (* (* (* (* x 18.0) y) z) t) (* t (* a 4.0))) (* b c))
           (* (* x 4.0) i))
          t_1)))
   (if (<= t_2 INFINITY)
     t_2
     (- (* x (- (* 18.0 (* t (* y z))) (* 4.0 i))) 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 * 27.0) * k;
	double t_2 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - t_1;
	double tmp;
	if (t_2 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = (x * ((18.0 * (t * (y * z))) - (4.0 * i))) - t_1;
	}
	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 = (j * 27.0) * k;
	double t_2 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - t_1;
	double tmp;
	if (t_2 <= Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else {
		tmp = (x * ((18.0 * (t * (y * z))) - (4.0 * i))) - t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, Infinity], t$95$2, N[(N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]

Derivation

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

Alternative 2: 50.3% 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 := j \cdot \left(k \cdot -27\right)\\ t_2 := t_1 + -4 \cdot \left(t \cdot a\right)\\ t_3 := \left(j \cdot 27\right) \cdot k\\ t_4 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;t_3 \leq -1 \cdot 10^{+213}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t_3 \leq -2 \cdot 10^{-33}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;t_3 \leq -5 \cdot 10^{-141}:\\ \;\;\;\;18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{elif}\;t_3 \leq 5 \cdot 10^{-239}:\\ \;\;\;\;b \cdot c + a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;t_3 \leq 2 \cdot 10^{-103}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;t_3 \leq 4 \cdot 10^{-9}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t_3 \leq 10^{+85}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;t_3 \leq 10^{+247}:\\ \;\;\;\;t_2\\ \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)))
        (t_2 (+ t_1 (* -4.0 (* t a))))
        (t_3 (* (* j 27.0) k))
        (t_4 (- (* b c) (* 4.0 (* x i)))))
   (if (<= t_3 -1e+213)
     t_2
     (if (<= t_3 -2e-33)
       t_4
       (if (<= t_3 -5e-141)
         (* 18.0 (* t (* x (* y z))))
         (if (<= t_3 5e-239)
           (+ (* b c) (* a (* t -4.0)))
           (if (<= t_3 2e-103)
             t_4
             (if (<= t_3 4e-9)
               t_2
               (if (<= t_3 1e+85)
                 t_4
                 (if (<= t_3 1e+247) t_2 (+ (* 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 t_2 = t_1 + (-4.0 * (t * a));
	double t_3 = (j * 27.0) * k;
	double t_4 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (t_3 <= -1e+213) {
		tmp = t_2;
	} else if (t_3 <= -2e-33) {
		tmp = t_4;
	} else if (t_3 <= -5e-141) {
		tmp = 18.0 * (t * (x * (y * z)));
	} else if (t_3 <= 5e-239) {
		tmp = (b * c) + (a * (t * -4.0));
	} else if (t_3 <= 2e-103) {
		tmp = t_4;
	} else if (t_3 <= 4e-9) {
		tmp = t_2;
	} else if (t_3 <= 1e+85) {
		tmp = t_4;
	} else if (t_3 <= 1e+247) {
		tmp = t_2;
	} 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) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = t_1 + ((-4.0d0) * (t * a))
    t_3 = (j * 27.0d0) * k
    t_4 = (b * c) - (4.0d0 * (x * i))
    if (t_3 <= (-1d+213)) then
        tmp = t_2
    else if (t_3 <= (-2d-33)) then
        tmp = t_4
    else if (t_3 <= (-5d-141)) then
        tmp = 18.0d0 * (t * (x * (y * z)))
    else if (t_3 <= 5d-239) then
        tmp = (b * c) + (a * (t * (-4.0d0)))
    else if (t_3 <= 2d-103) then
        tmp = t_4
    else if (t_3 <= 4d-9) then
        tmp = t_2
    else if (t_3 <= 1d+85) then
        tmp = t_4
    else if (t_3 <= 1d+247) then
        tmp = t_2
    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 t_2 = t_1 + (-4.0 * (t * a));
	double t_3 = (j * 27.0) * k;
	double t_4 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (t_3 <= -1e+213) {
		tmp = t_2;
	} else if (t_3 <= -2e-33) {
		tmp = t_4;
	} else if (t_3 <= -5e-141) {
		tmp = 18.0 * (t * (x * (y * z)));
	} else if (t_3 <= 5e-239) {
		tmp = (b * c) + (a * (t * -4.0));
	} else if (t_3 <= 2e-103) {
		tmp = t_4;
	} else if (t_3 <= 4e-9) {
		tmp = t_2;
	} else if (t_3 <= 1e+85) {
		tmp = t_4;
	} else if (t_3 <= 1e+247) {
		tmp = t_2;
	} 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)
	t_2 = t_1 + (-4.0 * (t * a))
	t_3 = (j * 27.0) * k
	t_4 = (b * c) - (4.0 * (x * i))
	tmp = 0
	if t_3 <= -1e+213:
		tmp = t_2
	elif t_3 <= -2e-33:
		tmp = t_4
	elif t_3 <= -5e-141:
		tmp = 18.0 * (t * (x * (y * z)))
	elif t_3 <= 5e-239:
		tmp = (b * c) + (a * (t * -4.0))
	elif t_3 <= 2e-103:
		tmp = t_4
	elif t_3 <= 4e-9:
		tmp = t_2
	elif t_3 <= 1e+85:
		tmp = t_4
	elif t_3 <= 1e+247:
		tmp = t_2
	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))
	t_2 = Float64(t_1 + Float64(-4.0 * Float64(t * a)))
	t_3 = Float64(Float64(j * 27.0) * k)
	t_4 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	tmp = 0.0
	if (t_3 <= -1e+213)
		tmp = t_2;
	elseif (t_3 <= -2e-33)
		tmp = t_4;
	elseif (t_3 <= -5e-141)
		tmp = Float64(18.0 * Float64(t * Float64(x * Float64(y * z))));
	elseif (t_3 <= 5e-239)
		tmp = Float64(Float64(b * c) + Float64(a * Float64(t * -4.0)));
	elseif (t_3 <= 2e-103)
		tmp = t_4;
	elseif (t_3 <= 4e-9)
		tmp = t_2;
	elseif (t_3 <= 1e+85)
		tmp = t_4;
	elseif (t_3 <= 1e+247)
		tmp = t_2;
	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);
	t_2 = t_1 + (-4.0 * (t * a));
	t_3 = (j * 27.0) * k;
	t_4 = (b * c) - (4.0 * (x * i));
	tmp = 0.0;
	if (t_3 <= -1e+213)
		tmp = t_2;
	elseif (t_3 <= -2e-33)
		tmp = t_4;
	elseif (t_3 <= -5e-141)
		tmp = 18.0 * (t * (x * (y * z)));
	elseif (t_3 <= 5e-239)
		tmp = (b * c) + (a * (t * -4.0));
	elseif (t_3 <= 2e-103)
		tmp = t_4;
	elseif (t_3 <= 4e-9)
		tmp = t_2;
	elseif (t_3 <= 1e+85)
		tmp = t_4;
	elseif (t_3 <= 1e+247)
		tmp = t_2;
	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]}, Block[{t$95$2 = N[(t$95$1 + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+213], t$95$2, If[LessEqual[t$95$3, -2e-33], t$95$4, If[LessEqual[t$95$3, -5e-141], N[(18.0 * N[(t * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e-239], N[(N[(b * c), $MachinePrecision] + N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e-103], t$95$4, If[LessEqual[t$95$3, 4e-9], t$95$2, If[LessEqual[t$95$3, 1e+85], t$95$4, If[LessEqual[t$95$3, 1e+247], t$95$2, N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]]]]]]]]]]]]]

Derivation

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

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

Derivation

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

Alternative 4: 53.2% accurate, 0.7× 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\\ t_3 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ t_4 := t_1 + x \cdot \left(i \cdot -4\right)\\ \mathbf{if}\;b \cdot c \leq -6.4 \cdot 10^{+121}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq -1.8 \cdot 10^{+24}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq -8 \cdot 10^{-10}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq -8.5 \cdot 10^{-205}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq 7 \cdot 10^{-76}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq 6.2 \cdot 10^{-30}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq 2.7 \cdot 10^{+48}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq 4.7 \cdot 10^{+136}:\\ \;\;\;\;t_3\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0)))
        (t_2 (+ (* b c) t_1))
        (t_3 (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
        (t_4 (+ t_1 (* x (* i -4.0)))))
   (if (<= (* b c) -6.4e+121)
     t_2
     (if (<= (* b c) -1.8e+24)
       t_3
       (if (<= (* b c) -8e-10)
         t_4
         (if (<= (* b c) -8.5e-205)
           t_3
           (if (<= (* b c) 7e-76)
             t_4
             (if (<= (* b c) 6.2e-30)
               t_3
               (if (<= (* b c) 2.7e+48)
                 t_4
                 (if (<= (* b c) 4.7e+136) t_3 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 * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_4 = t_1 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -6.4e+121) {
		tmp = t_2;
	} else if ((b * c) <= -1.8e+24) {
		tmp = t_3;
	} else if ((b * c) <= -8e-10) {
		tmp = t_4;
	} else if ((b * c) <= -8.5e-205) {
		tmp = t_3;
	} else if ((b * c) <= 7e-76) {
		tmp = t_4;
	} else if ((b * c) <= 6.2e-30) {
		tmp = t_3;
	} else if ((b * c) <= 2.7e+48) {
		tmp = t_4;
	} else if ((b * c) <= 4.7e+136) {
		tmp = t_3;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (b * c) + t_1
    t_3 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    t_4 = t_1 + (x * (i * (-4.0d0)))
    if ((b * c) <= (-6.4d+121)) then
        tmp = t_2
    else if ((b * c) <= (-1.8d+24)) then
        tmp = t_3
    else if ((b * c) <= (-8d-10)) then
        tmp = t_4
    else if ((b * c) <= (-8.5d-205)) then
        tmp = t_3
    else if ((b * c) <= 7d-76) then
        tmp = t_4
    else if ((b * c) <= 6.2d-30) then
        tmp = t_3
    else if ((b * c) <= 2.7d+48) then
        tmp = t_4
    else if ((b * c) <= 4.7d+136) then
        tmp = t_3
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_4 = t_1 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -6.4e+121) {
		tmp = t_2;
	} else if ((b * c) <= -1.8e+24) {
		tmp = t_3;
	} else if ((b * c) <= -8e-10) {
		tmp = t_4;
	} else if ((b * c) <= -8.5e-205) {
		tmp = t_3;
	} else if ((b * c) <= 7e-76) {
		tmp = t_4;
	} else if ((b * c) <= 6.2e-30) {
		tmp = t_3;
	} else if ((b * c) <= 2.7e+48) {
		tmp = t_4;
	} else if ((b * c) <= 4.7e+136) {
		tmp = t_3;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (b * c) + t_1
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	t_4 = t_1 + (x * (i * -4.0))
	tmp = 0
	if (b * c) <= -6.4e+121:
		tmp = t_2
	elif (b * c) <= -1.8e+24:
		tmp = t_3
	elif (b * c) <= -8e-10:
		tmp = t_4
	elif (b * c) <= -8.5e-205:
		tmp = t_3
	elif (b * c) <= 7e-76:
		tmp = t_4
	elif (b * c) <= 6.2e-30:
		tmp = t_3
	elif (b * c) <= 2.7e+48:
		tmp = t_4
	elif (b * c) <= 4.7e+136:
		tmp = t_3
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(b * c) + t_1)
	t_3 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	t_4 = Float64(t_1 + Float64(x * Float64(i * -4.0)))
	tmp = 0.0
	if (Float64(b * c) <= -6.4e+121)
		tmp = t_2;
	elseif (Float64(b * c) <= -1.8e+24)
		tmp = t_3;
	elseif (Float64(b * c) <= -8e-10)
		tmp = t_4;
	elseif (Float64(b * c) <= -8.5e-205)
		tmp = t_3;
	elseif (Float64(b * c) <= 7e-76)
		tmp = t_4;
	elseif (Float64(b * c) <= 6.2e-30)
		tmp = t_3;
	elseif (Float64(b * c) <= 2.7e+48)
		tmp = t_4;
	elseif (Float64(b * c) <= 4.7e+136)
		tmp = t_3;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (b * c) + t_1;
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	t_4 = t_1 + (x * (i * -4.0));
	tmp = 0.0;
	if ((b * c) <= -6.4e+121)
		tmp = t_2;
	elseif ((b * c) <= -1.8e+24)
		tmp = t_3;
	elseif ((b * c) <= -8e-10)
		tmp = t_4;
	elseif ((b * c) <= -8.5e-205)
		tmp = t_3;
	elseif ((b * c) <= 7e-76)
		tmp = t_4;
	elseif ((b * c) <= 6.2e-30)
		tmp = t_3;
	elseif ((b * c) <= 2.7e+48)
		tmp = t_4;
	elseif ((b * c) <= 4.7e+136)
		tmp = t_3;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$1 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -6.4e+121], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -1.8e+24], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], -8e-10], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], -8.5e-205], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 7e-76], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], 6.2e-30], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 2.7e+48], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], 4.7e+136], t$95$3, t$95$2]]]]]]]]]]]]

Derivation

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

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

Derivation

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

Alternative 6: 53.5% accurate, 0.7× 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 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ t_2 := z \cdot \left(18 \cdot y\right)\\ t_3 := j \cdot \left(k \cdot -27\right)\\ t_4 := b \cdot c + t_3\\ t_5 := t_3 + x \cdot \left(i \cdot -4\right)\\ \mathbf{if}\;b \cdot c \leq -2.9 \cdot 10^{+122}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq -2.7 \cdot 10^{-296}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 1.9 \cdot 10^{-275}:\\ \;\;\;\;t_3 + x \cdot \left(t \cdot t_2\right)\\ \mathbf{elif}\;b \cdot c \leq 3.5 \cdot 10^{-64}:\\ \;\;\;\;t_5\\ \mathbf{elif}\;b \cdot c \leq 1.25 \cdot 10^{-29}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 2.1 \cdot 10^{+70}:\\ \;\;\;\;t_5\\ \mathbf{elif}\;b \cdot c \leq 4.3 \cdot 10^{+206}:\\ \;\;\;\;b \cdot c + t \cdot \left(x \cdot t_2\right)\\ \mathbf{else}:\\ \;\;\;\;t_4\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
        (t_2 (* z (* 18.0 y)))
        (t_3 (* j (* k -27.0)))
        (t_4 (+ (* b c) t_3))
        (t_5 (+ t_3 (* x (* i -4.0)))))
   (if (<= (* b c) -2.9e+122)
     t_4
     (if (<= (* b c) -2.7e-296)
       t_1
       (if (<= (* b c) 1.9e-275)
         (+ t_3 (* x (* t t_2)))
         (if (<= (* b c) 3.5e-64)
           t_5
           (if (<= (* b c) 1.25e-29)
             t_1
             (if (<= (* b c) 2.1e+70)
               t_5
               (if (<= (* b c) 4.3e+206)
                 (+ (* b c) (* t (* x t_2)))
                 t_4)))))))))

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 * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_2 = z * (18.0 * y);
	double t_3 = j * (k * -27.0);
	double t_4 = (b * c) + t_3;
	double t_5 = t_3 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -2.9e+122) {
		tmp = t_4;
	} else if ((b * c) <= -2.7e-296) {
		tmp = t_1;
	} else if ((b * c) <= 1.9e-275) {
		tmp = t_3 + (x * (t * t_2));
	} else if ((b * c) <= 3.5e-64) {
		tmp = t_5;
	} else if ((b * c) <= 1.25e-29) {
		tmp = t_1;
	} else if ((b * c) <= 2.1e+70) {
		tmp = t_5;
	} else if ((b * c) <= 4.3e+206) {
		tmp = (b * c) + (t * (x * t_2));
	} else {
		tmp = t_4;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    t_2 = z * (18.0d0 * y)
    t_3 = j * (k * (-27.0d0))
    t_4 = (b * c) + t_3
    t_5 = t_3 + (x * (i * (-4.0d0)))
    if ((b * c) <= (-2.9d+122)) then
        tmp = t_4
    else if ((b * c) <= (-2.7d-296)) then
        tmp = t_1
    else if ((b * c) <= 1.9d-275) then
        tmp = t_3 + (x * (t * t_2))
    else if ((b * c) <= 3.5d-64) then
        tmp = t_5
    else if ((b * c) <= 1.25d-29) then
        tmp = t_1
    else if ((b * c) <= 2.1d+70) then
        tmp = t_5
    else if ((b * c) <= 4.3d+206) then
        tmp = (b * c) + (t * (x * t_2))
    else
        tmp = t_4
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_2 = z * (18.0 * y);
	double t_3 = j * (k * -27.0);
	double t_4 = (b * c) + t_3;
	double t_5 = t_3 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -2.9e+122) {
		tmp = t_4;
	} else if ((b * c) <= -2.7e-296) {
		tmp = t_1;
	} else if ((b * c) <= 1.9e-275) {
		tmp = t_3 + (x * (t * t_2));
	} else if ((b * c) <= 3.5e-64) {
		tmp = t_5;
	} else if ((b * c) <= 1.25e-29) {
		tmp = t_1;
	} else if ((b * c) <= 2.1e+70) {
		tmp = t_5;
	} else if ((b * c) <= 4.3e+206) {
		tmp = (b * c) + (t * (x * t_2));
	} else {
		tmp = t_4;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	t_2 = z * (18.0 * y)
	t_3 = j * (k * -27.0)
	t_4 = (b * c) + t_3
	t_5 = t_3 + (x * (i * -4.0))
	tmp = 0
	if (b * c) <= -2.9e+122:
		tmp = t_4
	elif (b * c) <= -2.7e-296:
		tmp = t_1
	elif (b * c) <= 1.9e-275:
		tmp = t_3 + (x * (t * t_2))
	elif (b * c) <= 3.5e-64:
		tmp = t_5
	elif (b * c) <= 1.25e-29:
		tmp = t_1
	elif (b * c) <= 2.1e+70:
		tmp = t_5
	elif (b * c) <= 4.3e+206:
		tmp = (b * c) + (t * (x * t_2))
	else:
		tmp = t_4
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	t_2 = Float64(z * Float64(18.0 * y))
	t_3 = Float64(j * Float64(k * -27.0))
	t_4 = Float64(Float64(b * c) + t_3)
	t_5 = Float64(t_3 + Float64(x * Float64(i * -4.0)))
	tmp = 0.0
	if (Float64(b * c) <= -2.9e+122)
		tmp = t_4;
	elseif (Float64(b * c) <= -2.7e-296)
		tmp = t_1;
	elseif (Float64(b * c) <= 1.9e-275)
		tmp = Float64(t_3 + Float64(x * Float64(t * t_2)));
	elseif (Float64(b * c) <= 3.5e-64)
		tmp = t_5;
	elseif (Float64(b * c) <= 1.25e-29)
		tmp = t_1;
	elseif (Float64(b * c) <= 2.1e+70)
		tmp = t_5;
	elseif (Float64(b * c) <= 4.3e+206)
		tmp = Float64(Float64(b * c) + Float64(t * Float64(x * t_2)));
	else
		tmp = t_4;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	t_2 = z * (18.0 * y);
	t_3 = j * (k * -27.0);
	t_4 = (b * c) + t_3;
	t_5 = t_3 + (x * (i * -4.0));
	tmp = 0.0;
	if ((b * c) <= -2.9e+122)
		tmp = t_4;
	elseif ((b * c) <= -2.7e-296)
		tmp = t_1;
	elseif ((b * c) <= 1.9e-275)
		tmp = t_3 + (x * (t * t_2));
	elseif ((b * c) <= 3.5e-64)
		tmp = t_5;
	elseif ((b * c) <= 1.25e-29)
		tmp = t_1;
	elseif ((b * c) <= 2.1e+70)
		tmp = t_5;
	elseif ((b * c) <= 4.3e+206)
		tmp = (b * c) + (t * (x * t_2));
	else
		tmp = t_4;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] + t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$3 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -2.9e+122], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], -2.7e-296], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1.9e-275], N[(t$95$3 + N[(x * N[(t * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 3.5e-64], t$95$5, If[LessEqual[N[(b * c), $MachinePrecision], 1.25e-29], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.1e+70], t$95$5, If[LessEqual[N[(b * c), $MachinePrecision], 4.3e+206], N[(N[(b * c), $MachinePrecision] + N[(t * N[(x * t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$4]]]]]]]]]]]]

Derivation

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

Alternative 7: 53.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := j \cdot \left(k \cdot -27\right)\\ t_2 := b \cdot c + t_1\\ t_3 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ t_4 := t_1 + x \cdot \left(i \cdot -4\right)\\ \mathbf{if}\;b \cdot c \leq -2.85 \cdot 10^{+122}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq -1.15 \cdot 10^{-201}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq 8.8 \cdot 10^{-66}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq 1.02 \cdot 10^{-30}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{+70}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;b \cdot c \leq 9.6 \cdot 10^{+205}:\\ \;\;\;\;b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* j (* k -27.0)))
        (t_2 (+ (* b c) t_1))
        (t_3 (* t (- (* 18.0 (* x (* y z))) (* a 4.0))))
        (t_4 (+ t_1 (* x (* i -4.0)))))
   (if (<= (* b c) -2.85e+122)
     t_2
     (if (<= (* b c) -1.15e-201)
       t_3
       (if (<= (* b c) 8.8e-66)
         t_4
         (if (<= (* b c) 1.02e-30)
           t_3
           (if (<= (* b c) 2e+70)
             t_4
             (if (<= (* b c) 9.6e+205)
               (+ (* b c) (* t (* x (* z (* 18.0 y)))))
               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 * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_4 = t_1 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -2.85e+122) {
		tmp = t_2;
	} else if ((b * c) <= -1.15e-201) {
		tmp = t_3;
	} else if ((b * c) <= 8.8e-66) {
		tmp = t_4;
	} else if ((b * c) <= 1.02e-30) {
		tmp = t_3;
	} else if ((b * c) <= 2e+70) {
		tmp = t_4;
	} else if ((b * c) <= 9.6e+205) {
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8), intent (in) :: k
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_1 = j * (k * (-27.0d0))
    t_2 = (b * c) + t_1
    t_3 = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
    t_4 = t_1 + (x * (i * (-4.0d0)))
    if ((b * c) <= (-2.85d+122)) then
        tmp = t_2
    else if ((b * c) <= (-1.15d-201)) then
        tmp = t_3
    else if ((b * c) <= 8.8d-66) then
        tmp = t_4
    else if ((b * c) <= 1.02d-30) then
        tmp = t_3
    else if ((b * c) <= 2d+70) then
        tmp = t_4
    else if ((b * c) <= 9.6d+205) then
        tmp = (b * c) + (t * (x * (z * (18.0d0 * y))))
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = j * (k * -27.0);
	double t_2 = (b * c) + t_1;
	double t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	double t_4 = t_1 + (x * (i * -4.0));
	double tmp;
	if ((b * c) <= -2.85e+122) {
		tmp = t_2;
	} else if ((b * c) <= -1.15e-201) {
		tmp = t_3;
	} else if ((b * c) <= 8.8e-66) {
		tmp = t_4;
	} else if ((b * c) <= 1.02e-30) {
		tmp = t_3;
	} else if ((b * c) <= 2e+70) {
		tmp = t_4;
	} else if ((b * c) <= 9.6e+205) {
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = j * (k * -27.0)
	t_2 = (b * c) + t_1
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	t_4 = t_1 + (x * (i * -4.0))
	tmp = 0
	if (b * c) <= -2.85e+122:
		tmp = t_2
	elif (b * c) <= -1.15e-201:
		tmp = t_3
	elif (b * c) <= 8.8e-66:
		tmp = t_4
	elif (b * c) <= 1.02e-30:
		tmp = t_3
	elif (b * c) <= 2e+70:
		tmp = t_4
	elif (b * c) <= 9.6e+205:
		tmp = (b * c) + (t * (x * (z * (18.0 * y))))
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(j * Float64(k * -27.0))
	t_2 = Float64(Float64(b * c) + t_1)
	t_3 = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)))
	t_4 = Float64(t_1 + Float64(x * Float64(i * -4.0)))
	tmp = 0.0
	if (Float64(b * c) <= -2.85e+122)
		tmp = t_2;
	elseif (Float64(b * c) <= -1.15e-201)
		tmp = t_3;
	elseif (Float64(b * c) <= 8.8e-66)
		tmp = t_4;
	elseif (Float64(b * c) <= 1.02e-30)
		tmp = t_3;
	elseif (Float64(b * c) <= 2e+70)
		tmp = t_4;
	elseif (Float64(b * c) <= 9.6e+205)
		tmp = Float64(Float64(b * c) + Float64(t * Float64(x * Float64(z * Float64(18.0 * y)))));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = j * (k * -27.0);
	t_2 = (b * c) + t_1;
	t_3 = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	t_4 = t_1 + (x * (i * -4.0));
	tmp = 0.0;
	if ((b * c) <= -2.85e+122)
		tmp = t_2;
	elseif ((b * c) <= -1.15e-201)
		tmp = t_3;
	elseif ((b * c) <= 8.8e-66)
		tmp = t_4;
	elseif ((b * c) <= 1.02e-30)
		tmp = t_3;
	elseif ((b * c) <= 2e+70)
		tmp = t_4;
	elseif ((b * c) <= 9.6e+205)
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$1 + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -2.85e+122], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -1.15e-201], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 8.8e-66], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], 1.02e-30], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 2e+70], t$95$4, If[LessEqual[N[(b * c), $MachinePrecision], 9.6e+205], N[(N[(b * c), $MachinePrecision] + N[(t * N[(x * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]]]

Derivation

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

Alternative 8: 86.6% 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 := \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;t_1 \leq -5 \cdot 10^{+276}:\\ \;\;\;\;18 \cdot \left(y \cdot \left(x \cdot \left(z \cdot t\right)\right)\right) + j \cdot \left(k \cdot -27\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t \cdot \left(\left(x \cdot 18\right) \cdot \left(y \cdot z\right) - a \cdot 4\right) + \left(b \cdot c - x \cdot \left(4 \cdot i\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 (* (* j 27.0) k)))
   (if (<= t_1 -5e+276)
     (+ (* 18.0 (* y (* x (* z t)))) (* j (* k -27.0)))
     (-
      (+
       (* t (- (* (* x 18.0) (* y z)) (* a 4.0)))
       (- (* b c) (* x (* 4.0 i))))
      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 * 27.0) * k;
	double tmp;
	if (t_1 <= -5e+276) {
		tmp = (18.0 * (y * (x * (z * t)))) + (j * (k * -27.0));
	} else {
		tmp = ((t * (((x * 18.0) * (y * z)) - (a * 4.0))) + ((b * c) - (x * (4.0 * i)))) - t_1;
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Alternative 9: 81.6% 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 := \left(j \cdot 27\right) \cdot k\\ \mathbf{if}\;b \cdot c \leq -2.4 \cdot 10^{+31} \lor \neg \left(b \cdot c \leq 2.75 \cdot 10^{+43}\right):\\ \;\;\;\;\left(b \cdot c + t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\right) - t_1\\ \mathbf{else}:\\ \;\;\;\;\left(t \cdot \left(a \cdot \left(-4\right) - \left(y \cdot z\right) \cdot \left(x \cdot -18\right)\right) - \left(x \cdot 4\right) \cdot i\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 (* (* j 27.0) k)))
   (if (or (<= (* b c) -2.4e+31) (not (<= (* b c) 2.75e+43)))
     (- (+ (* b c) (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))) t_1)
     (-
      (- (* t (- (* a (- 4.0)) (* (* y z) (* x -18.0)))) (* (* x 4.0) i))
      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 * 27.0) * k;
	double tmp;
	if (((b * c) <= -2.4e+31) || !((b * c) <= 2.75e+43)) {
		tmp = ((b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)))) - t_1;
	} else {
		tmp = ((t * ((a * -4.0) - ((y * z) * (x * -18.0)))) - ((x * 4.0) * i)) - t_1;
	}
	return tmp;
}

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[Or[LessEqual[N[(b * c), $MachinePrecision], -2.4e+31], N[Not[LessEqual[N[(b * c), $MachinePrecision], 2.75e+43]], $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], N[(N[(N[(t * N[(N[(a * (-4.0)), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(x * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 10: 36.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := -27 \cdot \left(j \cdot k\right)\\ t_2 := -4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;b \cdot c \leq -1.1 \cdot 10^{+130}:\\ \;\;\;\;b \cdot c\\ \mathbf{elif}\;b \cdot c \leq -2.4 \cdot 10^{-75}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq -3.3 \cdot 10^{-296}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq 1.45 \cdot 10^{-307}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \cdot c \leq 1.65 \cdot 10^{+40}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \cdot c \leq 4.4 \cdot 10^{+71}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;b \cdot c\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* -27.0 (* j k))) (t_2 (* -4.0 (* x i))))
   (if (<= (* b c) -1.1e+130)
     (* b c)
     (if (<= (* b c) -2.4e-75)
       t_1
       (if (<= (* b c) -3.3e-296)
         t_2
         (if (<= (* b c) 1.45e-307)
           t_1
           (if (<= (* b c) 1.65e+40)
             t_2
             (if (<= (* b c) 4.4e+71) t_1 (* 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 t_1 = -27.0 * (j * k);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if ((b * c) <= -1.1e+130) {
		tmp = b * c;
	} else if ((b * c) <= -2.4e-75) {
		tmp = t_1;
	} else if ((b * c) <= -3.3e-296) {
		tmp = t_2;
	} else if ((b * c) <= 1.45e-307) {
		tmp = t_1;
	} else if ((b * c) <= 1.65e+40) {
		tmp = t_2;
	} else if ((b * c) <= 4.4e+71) {
		tmp = t_1;
	} else {
		tmp = b * c;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = (-27.0d0) * (j * k)
    t_2 = (-4.0d0) * (x * i)
    if ((b * c) <= (-1.1d+130)) then
        tmp = b * c
    else if ((b * c) <= (-2.4d-75)) then
        tmp = t_1
    else if ((b * c) <= (-3.3d-296)) then
        tmp = t_2
    else if ((b * c) <= 1.45d-307) then
        tmp = t_1
    else if ((b * c) <= 1.65d+40) then
        tmp = t_2
    else if ((b * c) <= 4.4d+71) then
        tmp = t_1
    else
        tmp = b * c
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -27.0 * (j * k);
	double t_2 = -4.0 * (x * i);
	double tmp;
	if ((b * c) <= -1.1e+130) {
		tmp = b * c;
	} else if ((b * c) <= -2.4e-75) {
		tmp = t_1;
	} else if ((b * c) <= -3.3e-296) {
		tmp = t_2;
	} else if ((b * c) <= 1.45e-307) {
		tmp = t_1;
	} else if ((b * c) <= 1.65e+40) {
		tmp = t_2;
	} else if ((b * c) <= 4.4e+71) {
		tmp = t_1;
	} else {
		tmp = b * c;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = -27.0 * (j * k)
	t_2 = -4.0 * (x * i)
	tmp = 0
	if (b * c) <= -1.1e+130:
		tmp = b * c
	elif (b * c) <= -2.4e-75:
		tmp = t_1
	elif (b * c) <= -3.3e-296:
		tmp = t_2
	elif (b * c) <= 1.45e-307:
		tmp = t_1
	elif (b * c) <= 1.65e+40:
		tmp = t_2
	elif (b * c) <= 4.4e+71:
		tmp = t_1
	else:
		tmp = b * c
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(-27.0 * Float64(j * k))
	t_2 = Float64(-4.0 * Float64(x * i))
	tmp = 0.0
	if (Float64(b * c) <= -1.1e+130)
		tmp = Float64(b * c);
	elseif (Float64(b * c) <= -2.4e-75)
		tmp = t_1;
	elseif (Float64(b * c) <= -3.3e-296)
		tmp = t_2;
	elseif (Float64(b * c) <= 1.45e-307)
		tmp = t_1;
	elseif (Float64(b * c) <= 1.65e+40)
		tmp = t_2;
	elseif (Float64(b * c) <= 4.4e+71)
		tmp = t_1;
	else
		tmp = Float64(b * c);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = -27.0 * (j * k);
	t_2 = -4.0 * (x * i);
	tmp = 0.0;
	if ((b * c) <= -1.1e+130)
		tmp = b * c;
	elseif ((b * c) <= -2.4e-75)
		tmp = t_1;
	elseif ((b * c) <= -3.3e-296)
		tmp = t_2;
	elseif ((b * c) <= 1.45e-307)
		tmp = t_1;
	elseif ((b * c) <= 1.65e+40)
		tmp = t_2;
	elseif ((b * c) <= 4.4e+71)
		tmp = t_1;
	else
		tmp = b * c;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.1e+130], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -2.4e-75], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], -3.3e-296], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], 1.45e-307], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1.65e+40], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], 4.4e+71], t$95$1, N[(b * c), $MachinePrecision]]]]]]]]]

Derivation

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

Alternative 11: 80.0% accurate, 1.1× speedup

Math

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

Derivation

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

Alternative 12: 44.4% accurate, 1.2× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* -27.0 (* j k))) (t_2 (+ (* b c) (* a (* t -4.0)))))
   (if (<= (* j 27.0) -1e+166)
     t_1
     (if (<= (* j 27.0) -5e-51)
       t_2
       (if (<= (* j 27.0) -2e-68)
         (* y (* z (* x (* 18.0 t))))
         (if (<= (* j 27.0) 5.0) t_2 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 = -27.0 * (j * k);
	double t_2 = (b * c) + (a * (t * -4.0));
	double tmp;
	if ((j * 27.0) <= -1e+166) {
		tmp = t_1;
	} else if ((j * 27.0) <= -5e-51) {
		tmp = t_2;
	} else if ((j * 27.0) <= -2e-68) {
		tmp = y * (z * (x * (18.0 * t)));
	} else if ((j * 27.0) <= 5.0) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = (-27.0d0) * (j * k)
    t_2 = (b * c) + (a * (t * (-4.0d0)))
    if ((j * 27.0d0) <= (-1d+166)) then
        tmp = t_1
    else if ((j * 27.0d0) <= (-5d-51)) then
        tmp = t_2
    else if ((j * 27.0d0) <= (-2d-68)) then
        tmp = y * (z * (x * (18.0d0 * t)))
    else if ((j * 27.0d0) <= 5.0d0) then
        tmp = t_2
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double t_1 = -27.0 * (j * k);
	double t_2 = (b * c) + (a * (t * -4.0));
	double tmp;
	if ((j * 27.0) <= -1e+166) {
		tmp = t_1;
	} else if ((j * 27.0) <= -5e-51) {
		tmp = t_2;
	} else if ((j * 27.0) <= -2e-68) {
		tmp = y * (z * (x * (18.0 * t)));
	} else if ((j * 27.0) <= 5.0) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = -27.0 * (j * k)
	t_2 = (b * c) + (a * (t * -4.0))
	tmp = 0
	if (j * 27.0) <= -1e+166:
		tmp = t_1
	elif (j * 27.0) <= -5e-51:
		tmp = t_2
	elif (j * 27.0) <= -2e-68:
		tmp = y * (z * (x * (18.0 * t)))
	elif (j * 27.0) <= 5.0:
		tmp = t_2
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(-27.0 * Float64(j * k))
	t_2 = Float64(Float64(b * c) + Float64(a * Float64(t * -4.0)))
	tmp = 0.0
	if (Float64(j * 27.0) <= -1e+166)
		tmp = t_1;
	elseif (Float64(j * 27.0) <= -5e-51)
		tmp = t_2;
	elseif (Float64(j * 27.0) <= -2e-68)
		tmp = Float64(y * Float64(z * Float64(x * Float64(18.0 * t))));
	elseif (Float64(j * 27.0) <= 5.0)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

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

Alternative 13: 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 := 18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ t_2 := b \cdot c + a \cdot \left(t \cdot -4\right)\\ t_3 := b \cdot c + j \cdot \left(k \cdot -27\right)\\ t_4 := b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{if}\;i \leq -1.8 \cdot 10^{+100}:\\ \;\;\;\;t_4\\ \mathbf{elif}\;i \leq -0.00011:\\ \;\;\;\;t_2\\ \mathbf{elif}\;i \leq -9 \cdot 10^{-67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;i \leq -4.1 \cdot 10^{-165}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;i \leq -1.75 \cdot 10^{-209}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;i \leq 1.08 \cdot 10^{+50}:\\ \;\;\;\;t_3\\ \mathbf{elif}\;i \leq 5.5 \cdot 10^{+109}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;t_4\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 18.0 (* t (* x (* y z)))))
        (t_2 (+ (* b c) (* a (* t -4.0))))
        (t_3 (+ (* b c) (* j (* k -27.0))))
        (t_4 (- (* b c) (* 4.0 (* x i)))))
   (if (<= i -1.8e+100)
     t_4
     (if (<= i -0.00011)
       t_2
       (if (<= i -9e-67)
         t_1
         (if (<= i -4.1e-165)
           t_3
           (if (<= i -1.75e-209)
             t_1
             (if (<= i 1.08e+50) t_3 (if (<= i 5.5e+109) t_2 t_4)))))))))

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 = 18.0 * (t * (x * (y * z)));
	double t_2 = (b * c) + (a * (t * -4.0));
	double t_3 = (b * c) + (j * (k * -27.0));
	double t_4 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (i <= -1.8e+100) {
		tmp = t_4;
	} else if (i <= -0.00011) {
		tmp = t_2;
	} else if (i <= -9e-67) {
		tmp = t_1;
	} else if (i <= -4.1e-165) {
		tmp = t_3;
	} else if (i <= -1.75e-209) {
		tmp = t_1;
	} else if (i <= 1.08e+50) {
		tmp = t_3;
	} else if (i <= 5.5e+109) {
		tmp = t_2;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = 18.0d0 * (t * (x * (y * z)))
    t_2 = (b * c) + (a * (t * (-4.0d0)))
    t_3 = (b * c) + (j * (k * (-27.0d0)))
    t_4 = (b * c) - (4.0d0 * (x * i))
    if (i <= (-1.8d+100)) then
        tmp = t_4
    else if (i <= (-0.00011d0)) then
        tmp = t_2
    else if (i <= (-9d-67)) then
        tmp = t_1
    else if (i <= (-4.1d-165)) then
        tmp = t_3
    else if (i <= (-1.75d-209)) then
        tmp = t_1
    else if (i <= 1.08d+50) then
        tmp = t_3
    else if (i <= 5.5d+109) then
        tmp = t_2
    else
        tmp = t_4
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 = 18.0 * (t * (x * (y * z)));
	double t_2 = (b * c) + (a * (t * -4.0));
	double t_3 = (b * c) + (j * (k * -27.0));
	double t_4 = (b * c) - (4.0 * (x * i));
	double tmp;
	if (i <= -1.8e+100) {
		tmp = t_4;
	} else if (i <= -0.00011) {
		tmp = t_2;
	} else if (i <= -9e-67) {
		tmp = t_1;
	} else if (i <= -4.1e-165) {
		tmp = t_3;
	} else if (i <= -1.75e-209) {
		tmp = t_1;
	} else if (i <= 1.08e+50) {
		tmp = t_3;
	} else if (i <= 5.5e+109) {
		tmp = t_2;
	} else {
		tmp = t_4;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 18.0 * (t * (x * (y * z)))
	t_2 = (b * c) + (a * (t * -4.0))
	t_3 = (b * c) + (j * (k * -27.0))
	t_4 = (b * c) - (4.0 * (x * i))
	tmp = 0
	if i <= -1.8e+100:
		tmp = t_4
	elif i <= -0.00011:
		tmp = t_2
	elif i <= -9e-67:
		tmp = t_1
	elif i <= -4.1e-165:
		tmp = t_3
	elif i <= -1.75e-209:
		tmp = t_1
	elif i <= 1.08e+50:
		tmp = t_3
	elif i <= 5.5e+109:
		tmp = t_2
	else:
		tmp = t_4
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(18.0 * Float64(t * Float64(x * Float64(y * z))))
	t_2 = Float64(Float64(b * c) + Float64(a * Float64(t * -4.0)))
	t_3 = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)))
	t_4 = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)))
	tmp = 0.0
	if (i <= -1.8e+100)
		tmp = t_4;
	elseif (i <= -0.00011)
		tmp = t_2;
	elseif (i <= -9e-67)
		tmp = t_1;
	elseif (i <= -4.1e-165)
		tmp = t_3;
	elseif (i <= -1.75e-209)
		tmp = t_1;
	elseif (i <= 1.08e+50)
		tmp = t_3;
	elseif (i <= 5.5e+109)
		tmp = t_2;
	else
		tmp = t_4;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 18.0 * (t * (x * (y * z)));
	t_2 = (b * c) + (a * (t * -4.0));
	t_3 = (b * c) + (j * (k * -27.0));
	t_4 = (b * c) - (4.0 * (x * i));
	tmp = 0.0;
	if (i <= -1.8e+100)
		tmp = t_4;
	elseif (i <= -0.00011)
		tmp = t_2;
	elseif (i <= -9e-67)
		tmp = t_1;
	elseif (i <= -4.1e-165)
		tmp = t_3;
	elseif (i <= -1.75e-209)
		tmp = t_1;
	elseif (i <= 1.08e+50)
		tmp = t_3;
	elseif (i <= 5.5e+109)
		tmp = t_2;
	else
		tmp = t_4;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(18.0 * N[(t * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -1.8e+100], t$95$4, If[LessEqual[i, -0.00011], t$95$2, If[LessEqual[i, -9e-67], t$95$1, If[LessEqual[i, -4.1e-165], t$95$3, If[LessEqual[i, -1.75e-209], t$95$1, If[LessEqual[i, 1.08e+50], t$95$3, If[LessEqual[i, 5.5e+109], t$95$2, t$95$4]]]]]]]]]]]

Derivation

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

Alternative 14: 68.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -3.2 \cdot 10^{+149} \lor \neg \left(t \leq -9 \cdot 10^{-11} \lor \neg \left(t \leq -1.45 \cdot 10^{-104}\right) \land t \leq 9.6 \cdot 10^{+58}\right):\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot c - 4 \cdot \left(x \cdot i\right)\right) - \left(j \cdot 27\right) \cdot k\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= t -3.2e+149)
         (not (or (<= t -9e-11) (and (not (<= t -1.45e-104)) (<= t 9.6e+58)))))
   (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
   (- (- (* b c) (* 4.0 (* x i))) (* (* j 27.0) k))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -3.2e+149) || !((t <= -9e-11) || (!(t <= -1.45e-104) && (t <= 9.6e+58)))) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else {
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if ((t <= -3.2e+149) || !((t <= -9e-11) || (!(t <= -1.45e-104) && (t <= 9.6e+58)))) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else {
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if (t <= -3.2e+149) or not ((t <= -9e-11) or (not (t <= -1.45e-104) and (t <= 9.6e+58))):
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	else:
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k)
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -3.2e+149) || !((t <= -9e-11) || (!(t <= -1.45e-104) && (t <= 9.6e+58))))
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)));
	else
		tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(x * i))) - Float64(Float64(j * 27.0) * k));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if ((t <= -3.2e+149) || ~(((t <= -9e-11) || (~((t <= -1.45e-104)) && (t <= 9.6e+58)))))
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	else
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 15: 75.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

Derivation

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

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

Derivation

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

Alternative 18: 63.8% accurate, 1.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -7.2 \cdot 10^{+58}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\ \mathbf{elif}\;x \leq 5 \cdot 10^{+64}:\\ \;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - 27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;x \leq 1.8 \cdot 10^{+164}:\\ \;\;\;\;t \cdot \left(18 \cdot \left(z \cdot \left(x \cdot y\right)\right)\right) - \left(j \cdot 27\right) \cdot k\\ \mathbf{elif}\;x \leq 1.7 \cdot 10^{+279}:\\ \;\;\;\;b \cdot c - 4 \cdot \left(x \cdot i\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot c + t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (<= x -7.2e+58)
   (* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
   (if (<= x 5e+64)
     (- (+ (* b c) (* -4.0 (* t a))) (* 27.0 (* j k)))
     (if (<= x 1.8e+164)
       (- (* t (* 18.0 (* z (* x y)))) (* (* j 27.0) k))
       (if (<= x 1.7e+279)
         (- (* b c) (* 4.0 (* x i)))
         (+ (* b c) (* t (* x (* z (* 18.0 y))))))))))

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 (x <= -7.2e+58) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else if (x <= 5e+64) {
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	} else if (x <= 1.8e+164) {
		tmp = (t * (18.0 * (z * (x * y)))) - ((j * 27.0) * k);
	} else if (x <= 1.7e+279) {
		tmp = (b * c) - (4.0 * (x * i));
	} else {
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
	double tmp;
	if (x <= -7.2e+58) {
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	} else if (x <= 5e+64) {
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	} else if (x <= 1.8e+164) {
		tmp = (t * (18.0 * (z * (x * y)))) - ((j * 27.0) * k);
	} else if (x <= 1.7e+279) {
		tmp = (b * c) - (4.0 * (x * i));
	} else {
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	tmp = 0
	if x <= -7.2e+58:
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0))
	elif x <= 5e+64:
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k))
	elif x <= 1.8e+164:
		tmp = (t * (18.0 * (z * (x * y)))) - ((j * 27.0) * k)
	elif x <= 1.7e+279:
		tmp = (b * c) - (4.0 * (x * i))
	else:
		tmp = (b * c) + (t * (x * (z * (18.0 * y))))
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if (x <= -7.2e+58)
		tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0)));
	elseif (x <= 5e+64)
		tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(27.0 * Float64(j * k)));
	elseif (x <= 1.8e+164)
		tmp = Float64(Float64(t * Float64(18.0 * Float64(z * Float64(x * y)))) - Float64(Float64(j * 27.0) * k));
	elseif (x <= 1.7e+279)
		tmp = Float64(Float64(b * c) - Float64(4.0 * Float64(x * i)));
	else
		tmp = Float64(Float64(b * c) + Float64(t * Float64(x * Float64(z * Float64(18.0 * y)))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0;
	if (x <= -7.2e+58)
		tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
	elseif (x <= 5e+64)
		tmp = ((b * c) + (-4.0 * (t * a))) - (27.0 * (j * k));
	elseif (x <= 1.8e+164)
		tmp = (t * (18.0 * (z * (x * y)))) - ((j * 27.0) * k);
	elseif (x <= 1.7e+279)
		tmp = (b * c) - (4.0 * (x * i));
	else
		tmp = (b * c) + (t * (x * (z * (18.0 * y))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 19: 74.3% accurate, 1.5× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -6.9 \cdot 10^{-105} \lor \neg \left(t \leq 7.4 \cdot 10^{+58}\right):\\ \;\;\;\;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 - 4 \cdot \left(x \cdot i\right)\right) - \left(j \cdot 27\right) \cdot k\\ \end{array} \end{array} \]

FPCore

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

C

assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 <= -6.9e-105) || !(t <= 7.4e+58)) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} else {
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	}
	return tmp;
}

Fortran

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

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 <= -6.9e-105) || !(t <= 7.4e+58)) {
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	} else {
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	}
	return tmp;
}

Python

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

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	tmp = 0.0
	if ((t <= -6.9e-105) || !(t <= 7.4e+58))
		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(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 <= -6.9e-105) || ~((t <= 7.4e+58)))
		tmp = (b * c) + (t * ((18.0 * (x * (y * z))) - (a * 4.0)));
	else
		tmp = ((b * c) - (4.0 * (x * i))) - ((j * 27.0) * k);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[Or[LessEqual[t, -6.9e-105], N[Not[LessEqual[t, 7.4e+58]], $MachinePrecision]], 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[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 20: 47.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\ \\ \begin{array}{l} t_1 := b \cdot c + j \cdot \left(k \cdot -27\right)\\ t_2 := 18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{if}\;x \leq -5.5 \cdot 10^{+53}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -4.1 \cdot 10^{-91}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 2.5 \cdot 10^{-249}:\\ \;\;\;\;b \cdot c + a \cdot \left(t \cdot -4\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{+67}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (+ (* b c) (* j (* k -27.0)))) (t_2 (* 18.0 (* t (* x (* y z))))))
   (if (<= x -5.5e+53)
     t_2
     (if (<= x -4.1e-91)
       t_1
       (if (<= x 2.5e-249)
         (+ (* b c) (* a (* t -4.0)))
         (if (<= x 1.1e+67) t_1 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 = (b * c) + (j * (k * -27.0));
	double t_2 = 18.0 * (t * (x * (y * z)));
	double tmp;
	if (x <= -5.5e+53) {
		tmp = t_2;
	} else if (x <= -4.1e-91) {
		tmp = t_1;
	} else if (x <= 2.5e-249) {
		tmp = (b * c) + (a * (t * -4.0));
	} else if (x <= 1.1e+67) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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) + (j * (k * (-27.0d0)))
    t_2 = 18.0d0 * (t * (x * (y * z)))
    if (x <= (-5.5d+53)) then
        tmp = t_2
    else if (x <= (-4.1d-91)) then
        tmp = t_1
    else if (x <= 2.5d-249) then
        tmp = (b * c) + (a * (t * (-4.0d0)))
    else if (x <= 1.1d+67) then
        tmp = t_1
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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) + (j * (k * -27.0));
	double t_2 = 18.0 * (t * (x * (y * z)));
	double tmp;
	if (x <= -5.5e+53) {
		tmp = t_2;
	} else if (x <= -4.1e-91) {
		tmp = t_1;
	} else if (x <= 2.5e-249) {
		tmp = (b * c) + (a * (t * -4.0));
	} else if (x <= 1.1e+67) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = (b * c) + (j * (k * -27.0))
	t_2 = 18.0 * (t * (x * (y * z)))
	tmp = 0
	if x <= -5.5e+53:
		tmp = t_2
	elif x <= -4.1e-91:
		tmp = t_1
	elif x <= 2.5e-249:
		tmp = (b * c) + (a * (t * -4.0))
	elif x <= 1.1e+67:
		tmp = t_1
	else:
		tmp = t_2
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0)))
	t_2 = Float64(18.0 * Float64(t * Float64(x * Float64(y * z))))
	tmp = 0.0
	if (x <= -5.5e+53)
		tmp = t_2;
	elseif (x <= -4.1e-91)
		tmp = t_1;
	elseif (x <= 2.5e-249)
		tmp = Float64(Float64(b * c) + Float64(a * Float64(t * -4.0)));
	elseif (x <= 1.1e+67)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = (b * c) + (j * (k * -27.0));
	t_2 = 18.0 * (t * (x * (y * z)));
	tmp = 0.0;
	if (x <= -5.5e+53)
		tmp = t_2;
	elseif (x <= -4.1e-91)
		tmp = t_1;
	elseif (x <= 2.5e-249)
		tmp = (b * c) + (a * (t * -4.0));
	elseif (x <= 1.1e+67)
		tmp = t_1;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 21: 33.7% accurate, 2.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 := y \cdot \left(z \cdot \left(x \cdot \left(18 \cdot t\right)\right)\right)\\ \mathbf{if}\;t \leq -1.28 \cdot 10^{-104}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 1.15 \cdot 10^{-126}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;t \leq 1.65 \cdot 10^{+66}:\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* y (* z (* x (* 18.0 t))))))
   (if (<= t -1.28e-104)
     t_1
     (if (<= t 1.15e-126)
       (* -27.0 (* j k))
       (if (<= t 1.65e+66) (* 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 = y * (z * (x * (18.0 * t)));
	double tmp;
	if (t <= -1.28e-104) {
		tmp = t_1;
	} else if (t <= 1.15e-126) {
		tmp = -27.0 * (j * k);
	} else if (t <= 1.65e+66) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = y * (z * (x * (18.0d0 * t)))
    if (t <= (-1.28d-104)) then
        tmp = t_1
    else if (t <= 1.15d-126) then
        tmp = (-27.0d0) * (j * k)
    else if (t <= 1.65d+66) then
        tmp = b * c
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = y * (z * (x * (18.0 * t)))
	tmp = 0
	if t <= -1.28e-104:
		tmp = t_1
	elif t <= 1.15e-126:
		tmp = -27.0 * (j * k)
	elif t <= 1.65e+66:
		tmp = b * c
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(y * Float64(z * Float64(x * Float64(18.0 * t))))
	tmp = 0.0
	if (t <= -1.28e-104)
		tmp = t_1;
	elseif (t <= 1.15e-126)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (t <= 1.65e+66)
		tmp = Float64(b * c);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = y * (z * (x * (18.0 * t)));
	tmp = 0.0;
	if (t <= -1.28e-104)
		tmp = t_1;
	elseif (t <= 1.15e-126)
		tmp = -27.0 * (j * k);
	elseif (t <= 1.65e+66)
		tmp = b * c;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 22: 32.6% accurate, 2.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 := 18 \cdot \left(t \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\ \mathbf{if}\;t \leq -2.9 \cdot 10^{-105}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 7.5 \cdot 10^{-126}:\\ \;\;\;\;-27 \cdot \left(j \cdot k\right)\\ \mathbf{elif}\;t \leq 1.9 \cdot 10^{-27}:\\ \;\;\;\;b \cdot c\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (let* ((t_1 (* 18.0 (* t (* x (* y z))))))
   (if (<= t -2.9e-105)
     t_1
     (if (<= t 7.5e-126) (* -27.0 (* j k)) (if (<= t 1.9e-27) (* 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 = 18.0 * (t * (x * (y * z)));
	double tmp;
	if (t <= -2.9e-105) {
		tmp = t_1;
	} else if (t <= 7.5e-126) {
		tmp = -27.0 * (j * k);
	} else if (t <= 1.9e-27) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = 18.0d0 * (t * (x * (y * z)))
    if (t <= (-2.9d-105)) then
        tmp = t_1
    else if (t <= 7.5d-126) then
        tmp = (-27.0d0) * (j * k)
    else if (t <= 1.9d-27) then
        tmp = b * c
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 = 18.0 * (t * (x * (y * z)));
	double tmp;
	if (t <= -2.9e-105) {
		tmp = t_1;
	} else if (t <= 7.5e-126) {
		tmp = -27.0 * (j * k);
	} else if (t <= 1.9e-27) {
		tmp = b * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k])
def code(x, y, z, t, a, b, c, i, j, k):
	t_1 = 18.0 * (t * (x * (y * z)))
	tmp = 0
	if t <= -2.9e-105:
		tmp = t_1
	elif t <= 7.5e-126:
		tmp = -27.0 * (j * k)
	elif t <= 1.9e-27:
		tmp = b * c
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k])
function code(x, y, z, t, a, b, c, i, j, k)
	t_1 = Float64(18.0 * Float64(t * Float64(x * Float64(y * z))))
	tmp = 0.0
	if (t <= -2.9e-105)
		tmp = t_1;
	elseif (t <= 7.5e-126)
		tmp = Float64(-27.0 * Float64(j * k));
	elseif (t <= 1.9e-27)
		tmp = Float64(b * c);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
	t_1 = 18.0 * (t * (x * (y * z)));
	tmp = 0.0;
	if (t <= -2.9e-105)
		tmp = t_1;
	elseif (t <= 7.5e-126)
		tmp = -27.0 * (j * k);
	elseif (t <= 1.9e-27)
		tmp = b * c;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 23: 36.8% accurate, 2.4× speedup

Math

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

FPCore

NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
 :precision binary64
 (if (or (<= (* b c) -1.4e+129) (not (<= (* b c) 1.1e+71)))
   (* 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 (((b * c) <= -1.4e+129) || !((b * c) <= 1.1e+71)) {
		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 (((b * c) <= (-1.4d+129)) .or. (.not. ((b * c) <= 1.1d+71))) 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 (((b * c) <= -1.4e+129) || !((b * c) <= 1.1e+71)) {
		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 ((b * c) <= -1.4e+129) or not ((b * c) <= 1.1e+71):
		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 ((Float64(b * c) <= -1.4e+129) || !(Float64(b * c) <= 1.1e+71))
		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 (((b * c) <= -1.4e+129) || ~(((b * c) <= 1.1e+71)))
		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[Or[LessEqual[N[(b * c), $MachinePrecision], -1.4e+129], N[Not[LessEqual[N[(b * c), $MachinePrecision], 1.1e+71]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 24: 23.4% 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.8% 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 2024010 
(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)))