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

Percentage Accurate: 95.3% → 98.4%

Time: 15.5s

Alternatives: 16

Speedup: 0.8×

• 27.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}

Python

def code(x, y, z, t, a, b):
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]

Initial Program: 95.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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
    code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}

Python

def code(x, y, z, t, a, b):
	return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 2 \cdot 10^{-199}:\\ \;\;\;\;\left(27 \cdot \left(a \cdot b\right) + x \cdot 2\right) - y \cdot \left(\left(z \cdot 9\right) \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, t \cdot \left(y \cdot \left(z \cdot -9\right)\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z 2e-199)
   (- (+ (* 27.0 (* a b)) (* x 2.0)) (* y (* (* z 9.0) t)))
   (fma a (* 27.0 b) (fma x 2.0 (* t (* y (* z -9.0)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= 2e-199) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * ((z * 9.0) * t));
	} else {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (t * (y * (z * -9.0)))));
	}
	return tmp;
}

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= 2e-199)
		tmp = Float64(Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0)) - Float64(y * Float64(Float64(z * 9.0) * t)));
	else
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(t * Float64(y * Float64(z * -9.0)))));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 2e-199], N[(N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] - N[(y * N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(t * N[(y * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 2: 78.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := 27 \cdot \left(a \cdot b\right)\\ t_2 := 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ t_3 := t_1 - t_2\\ \mathbf{if}\;z \leq -6.2 \cdot 10^{+65}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq -0.58:\\ \;\;\;\;t_3\\ \mathbf{elif}\;z \leq 9 \cdot 10^{-178}:\\ \;\;\;\;t_1 + x \cdot 2\\ \mathbf{elif}\;z \leq 3.2 \cdot 10^{+30}:\\ \;\;\;\;x \cdot 2 - t_2\\ \mathbf{else}:\\ \;\;\;\;t_3\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* 27.0 (* a b))) (t_2 (* 9.0 (* t (* z y)))) (t_3 (- t_1 t_2)))
   (if (<= z -6.2e+65)
     (* y (* -9.0 (* z t)))
     (if (<= z -0.58)
       t_3
       (if (<= z 9e-178)
         (+ t_1 (* x 2.0))
         (if (<= z 3.2e+30) (- (* x 2.0) t_2) t_3))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = 9.0 * (t * (z * y));
	double t_3 = t_1 - t_2;
	double tmp;
	if (z <= -6.2e+65) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= -0.58) {
		tmp = t_3;
	} else if (z <= 9e-178) {
		tmp = t_1 + (x * 2.0);
	} else if (z <= 3.2e+30) {
		tmp = (x * 2.0) - t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = 9.0d0 * (t * (z * y))
    t_3 = t_1 - t_2
    if (z <= (-6.2d+65)) then
        tmp = y * ((-9.0d0) * (z * t))
    else if (z <= (-0.58d0)) then
        tmp = t_3
    else if (z <= 9d-178) then
        tmp = t_1 + (x * 2.0d0)
    else if (z <= 3.2d+30) then
        tmp = (x * 2.0d0) - t_2
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = 27.0 * (a * b);
	double t_2 = 9.0 * (t * (z * y));
	double t_3 = t_1 - t_2;
	double tmp;
	if (z <= -6.2e+65) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= -0.58) {
		tmp = t_3;
	} else if (z <= 9e-178) {
		tmp = t_1 + (x * 2.0);
	} else if (z <= 3.2e+30) {
		tmp = (x * 2.0) - t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = 27.0 * (a * b)
	t_2 = 9.0 * (t * (z * y))
	t_3 = t_1 - t_2
	tmp = 0
	if z <= -6.2e+65:
		tmp = y * (-9.0 * (z * t))
	elif z <= -0.58:
		tmp = t_3
	elif z <= 9e-178:
		tmp = t_1 + (x * 2.0)
	elif z <= 3.2e+30:
		tmp = (x * 2.0) - t_2
	else:
		tmp = t_3
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(27.0 * Float64(a * b))
	t_2 = Float64(9.0 * Float64(t * Float64(z * y)))
	t_3 = Float64(t_1 - t_2)
	tmp = 0.0
	if (z <= -6.2e+65)
		tmp = Float64(y * Float64(-9.0 * Float64(z * t)));
	elseif (z <= -0.58)
		tmp = t_3;
	elseif (z <= 9e-178)
		tmp = Float64(t_1 + Float64(x * 2.0));
	elseif (z <= 3.2e+30)
		tmp = Float64(Float64(x * 2.0) - t_2);
	else
		tmp = t_3;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = 27.0 * (a * b);
	t_2 = 9.0 * (t * (z * y));
	t_3 = t_1 - t_2;
	tmp = 0.0;
	if (z <= -6.2e+65)
		tmp = y * (-9.0 * (z * t));
	elseif (z <= -0.58)
		tmp = t_3;
	elseif (z <= 9e-178)
		tmp = t_1 + (x * 2.0);
	elseif (z <= 3.2e+30)
		tmp = (x * 2.0) - t_2;
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 - t$95$2), $MachinePrecision]}, If[LessEqual[z, -6.2e+65], N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -0.58], t$95$3, If[LessEqual[z, 9e-178], N[(t$95$1 + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.2e+30], N[(N[(x * 2.0), $MachinePrecision] - t$95$2), $MachinePrecision], t$95$3]]]]]]]

Derivation

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

Alternative 3: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := a \cdot \left(27 \cdot b\right)\\ \mathbf{if}\;y \cdot 9 \leq -400000000000:\\ \;\;\;\;t_1 + \left(x \cdot 2 - y \cdot \left(9 \cdot \left(z \cdot t\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right) + t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* a (* 27.0 b))))
   (if (<= (* y 9.0) -400000000000.0)
     (+ t_1 (- (* x 2.0) (* y (* 9.0 (* z t)))))
     (+ (- (* x 2.0) (* 9.0 (* z (* y t)))) t_1))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * (27.0 * b);
	double tmp;
	if ((y * 9.0) <= -400000000000.0) {
		tmp = t_1 + ((x * 2.0) - (y * (9.0 * (z * t))));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: t_1
    real(8) :: tmp
    t_1 = a * (27.0d0 * b)
    if ((y * 9.0d0) <= (-400000000000.0d0)) then
        tmp = t_1 + ((x * 2.0d0) - (y * (9.0d0 * (z * t))))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (z * (y * t)))) + t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a * (27.0 * b);
	double tmp;
	if ((y * 9.0) <= -400000000000.0) {
		tmp = t_1 + ((x * 2.0) - (y * (9.0 * (z * t))));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = a * (27.0 * b)
	tmp = 0
	if (y * 9.0) <= -400000000000.0:
		tmp = t_1 + ((x * 2.0) - (y * (9.0 * (z * t))))
	else:
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(a * Float64(27.0 * b))
	tmp = 0.0
	if (Float64(y * 9.0) <= -400000000000.0)
		tmp = Float64(t_1 + Float64(Float64(x * 2.0) - Float64(y * Float64(9.0 * Float64(z * t)))));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))) + t_1);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = a * (27.0 * b);
	tmp = 0.0;
	if ((y * 9.0) <= -400000000000.0)
		tmp = t_1 + ((x * 2.0) - (y * (9.0 * (z * t))));
	else
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * 9.0), $MachinePrecision], -400000000000.0], N[(t$95$1 + N[(N[(x * 2.0), $MachinePrecision] - N[(y * N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]]]

Derivation

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

Alternative 4: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot 9 \leq -50:\\ \;\;\;\;\left(27 \cdot \left(a \cdot b\right) + x \cdot 2\right) - y \cdot \left(9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right) + a \cdot \left(27 \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= (* y 9.0) -50.0)
   (- (+ (* 27.0 (* a b)) (* x 2.0)) (* y (* 9.0 (* z t))))
   (+ (- (* x 2.0) (* 9.0 (* z (* y t)))) (* a (* 27.0 b)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y * 9.0) <= -50.0) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (9.0 * (z * t)));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((y * 9.0d0) <= (-50.0d0)) then
        tmp = ((27.0d0 * (a * b)) + (x * 2.0d0)) - (y * (9.0d0 * (z * t)))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (z * (y * t)))) + (a * (27.0d0 * b))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y * 9.0) <= -50.0) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (9.0 * (z * t)));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (y * 9.0) <= -50.0:
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (9.0 * (z * t)))
	else:
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(y * 9.0) <= -50.0)
		tmp = Float64(Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0)) - Float64(y * Float64(9.0 * Float64(z * t))));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))) + Float64(a * Float64(27.0 * b)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y * 9.0) <= -50.0)
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * (9.0 * (z * t)));
	else
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(y * 9.0), $MachinePrecision], -50.0], N[(N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 5: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;y \cdot 9 \leq -50:\\ \;\;\;\;\left(27 \cdot \left(a \cdot b\right) + x \cdot 2\right) - y \cdot \left(\left(z \cdot 9\right) \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right) + a \cdot \left(27 \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= (* y 9.0) -50.0)
   (- (+ (* 27.0 (* a b)) (* x 2.0)) (* y (* (* z 9.0) t)))
   (+ (- (* x 2.0) (* 9.0 (* z (* y t)))) (* a (* 27.0 b)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y * 9.0) <= -50.0) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * ((z * 9.0) * t));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((y * 9.0d0) <= (-50.0d0)) then
        tmp = ((27.0d0 * (a * b)) + (x * 2.0d0)) - (y * ((z * 9.0d0) * t))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (z * (y * t)))) + (a * (27.0d0 * b))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((y * 9.0) <= -50.0) {
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * ((z * 9.0) * t));
	} else {
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (y * 9.0) <= -50.0:
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * ((z * 9.0) * t))
	else:
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(y * 9.0) <= -50.0)
		tmp = Float64(Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0)) - Float64(y * Float64(Float64(z * 9.0) * t)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))) + Float64(a * Float64(27.0 * b)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((y * 9.0) <= -50.0)
		tmp = ((27.0 * (a * b)) + (x * 2.0)) - (y * ((z * 9.0) * t));
	else
		tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(y * 9.0), $MachinePrecision], -50.0], N[(N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] - N[(y * N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 6: 48.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := -9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{if}\;z \leq -5.3 \cdot 10^{-82}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -3.6 \cdot 10^{-234}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;z \leq 7.2 \cdot 10^{-72} \lor \neg \left(z \leq 4.3 \cdot 10^{-43}\right) \land z \leq 48000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* -9.0 (* t (* z y)))))
   (if (<= z -5.3e-82)
     t_1
     (if (<= z -3.6e-234)
       (* a (* 27.0 b))
       (if (or (<= z 7.2e-72) (and (not (<= z 4.3e-43)) (<= z 48000000.0)))
         (* x 2.0)
         t_1)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * (t * (z * y));
	double tmp;
	if (z <= -5.3e-82) {
		tmp = t_1;
	} else if (z <= -3.6e-234) {
		tmp = a * (27.0 * b);
	} else if ((z <= 7.2e-72) || (!(z <= 4.3e-43) && (z <= 48000000.0))) {
		tmp = x * 2.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: t_1
    real(8) :: tmp
    t_1 = (-9.0d0) * (t * (z * y))
    if (z <= (-5.3d-82)) then
        tmp = t_1
    else if (z <= (-3.6d-234)) then
        tmp = a * (27.0d0 * b)
    else if ((z <= 7.2d-72) .or. (.not. (z <= 4.3d-43)) .and. (z <= 48000000.0d0)) then
        tmp = x * 2.0d0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = -9.0 * (t * (z * y));
	double tmp;
	if (z <= -5.3e-82) {
		tmp = t_1;
	} else if (z <= -3.6e-234) {
		tmp = a * (27.0 * b);
	} else if ((z <= 7.2e-72) || (!(z <= 4.3e-43) && (z <= 48000000.0))) {
		tmp = x * 2.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = -9.0 * (t * (z * y))
	tmp = 0
	if z <= -5.3e-82:
		tmp = t_1
	elif z <= -3.6e-234:
		tmp = a * (27.0 * b)
	elif (z <= 7.2e-72) or (not (z <= 4.3e-43) and (z <= 48000000.0)):
		tmp = x * 2.0
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(-9.0 * Float64(t * Float64(z * y)))
	tmp = 0.0
	if (z <= -5.3e-82)
		tmp = t_1;
	elseif (z <= -3.6e-234)
		tmp = Float64(a * Float64(27.0 * b));
	elseif ((z <= 7.2e-72) || (!(z <= 4.3e-43) && (z <= 48000000.0)))
		tmp = Float64(x * 2.0);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = -9.0 * (t * (z * y));
	tmp = 0.0;
	if (z <= -5.3e-82)
		tmp = t_1;
	elseif (z <= -3.6e-234)
		tmp = a * (27.0 * b);
	elseif ((z <= 7.2e-72) || (~((z <= 4.3e-43)) && (z <= 48000000.0)))
		tmp = x * 2.0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.3e-82], t$95$1, If[LessEqual[z, -3.6e-234], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, 7.2e-72], And[N[Not[LessEqual[z, 4.3e-43]], $MachinePrecision], LessEqual[z, 48000000.0]]], N[(x * 2.0), $MachinePrecision], t$95$1]]]]

Derivation

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

Alternative 7: 50.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} t_1 := y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{if}\;z \leq -1.65 \cdot 10^{-81}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq -2.1 \cdot 10^{-234}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-72}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 1.12 \cdot 10^{-42}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 5400000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* y (* -9.0 (* z t)))))
   (if (<= z -1.65e-81)
     t_1
     (if (<= z -2.1e-234)
       (* a (* 27.0 b))
       (if (<= z 7e-72)
         (* x 2.0)
         (if (<= z 1.12e-42)
           t_1
           (if (<= z 5400000000.0) (* x 2.0) (* -9.0 (* t (* z y))))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y * (-9.0 * (z * t));
	double tmp;
	if (z <= -1.65e-81) {
		tmp = t_1;
	} else if (z <= -2.1e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 7e-72) {
		tmp = x * 2.0;
	} else if (z <= 1.12e-42) {
		tmp = t_1;
	} else if (z <= 5400000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (t * (z * y));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: t_1
    real(8) :: tmp
    t_1 = y * ((-9.0d0) * (z * t))
    if (z <= (-1.65d-81)) then
        tmp = t_1
    else if (z <= (-2.1d-234)) then
        tmp = a * (27.0d0 * b)
    else if (z <= 7d-72) then
        tmp = x * 2.0d0
    else if (z <= 1.12d-42) then
        tmp = t_1
    else if (z <= 5400000000.0d0) then
        tmp = x * 2.0d0
    else
        tmp = (-9.0d0) * (t * (z * y))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = y * (-9.0 * (z * t));
	double tmp;
	if (z <= -1.65e-81) {
		tmp = t_1;
	} else if (z <= -2.1e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 7e-72) {
		tmp = x * 2.0;
	} else if (z <= 1.12e-42) {
		tmp = t_1;
	} else if (z <= 5400000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (t * (z * y));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	t_1 = y * (-9.0 * (z * t))
	tmp = 0
	if z <= -1.65e-81:
		tmp = t_1
	elif z <= -2.1e-234:
		tmp = a * (27.0 * b)
	elif z <= 7e-72:
		tmp = x * 2.0
	elif z <= 1.12e-42:
		tmp = t_1
	elif z <= 5400000000.0:
		tmp = x * 2.0
	else:
		tmp = -9.0 * (t * (z * y))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	t_1 = Float64(y * Float64(-9.0 * Float64(z * t)))
	tmp = 0.0
	if (z <= -1.65e-81)
		tmp = t_1;
	elseif (z <= -2.1e-234)
		tmp = Float64(a * Float64(27.0 * b));
	elseif (z <= 7e-72)
		tmp = Float64(x * 2.0);
	elseif (z <= 1.12e-42)
		tmp = t_1;
	elseif (z <= 5400000000.0)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	t_1 = y * (-9.0 * (z * t));
	tmp = 0.0;
	if (z <= -1.65e-81)
		tmp = t_1;
	elseif (z <= -2.1e-234)
		tmp = a * (27.0 * b);
	elseif (z <= 7e-72)
		tmp = x * 2.0;
	elseif (z <= 1.12e-42)
		tmp = t_1;
	elseif (z <= 5400000000.0)
		tmp = x * 2.0;
	else
		tmp = -9.0 * (t * (z * y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.65e-81], t$95$1, If[LessEqual[z, -2.1e-234], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7e-72], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 1.12e-42], t$95$1, If[LessEqual[z, 5400000000.0], N[(x * 2.0), $MachinePrecision], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

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

Alternative 8: 50.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.95 \cdot 10^{-81}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -1.7 \cdot 10^{-234}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;z \leq 8.2 \cdot 10^{-72}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6.8 \cdot 10^{-44}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 200000000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.95e-81)
   (* y (* t (* z -9.0)))
   (if (<= z -1.7e-234)
     (* a (* 27.0 b))
     (if (<= z 8.2e-72)
       (* x 2.0)
       (if (<= z 6.8e-44)
         (* y (* -9.0 (* z t)))
         (if (<= z 200000000000.0) (* x 2.0) (* -9.0 (* t (* z y)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.95e-81) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -1.7e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 8.2e-72) {
		tmp = x * 2.0;
	} else if (z <= 6.8e-44) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= 200000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (t * (z * y));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (z <= (-1.95d-81)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= (-1.7d-234)) then
        tmp = a * (27.0d0 * b)
    else if (z <= 8.2d-72) then
        tmp = x * 2.0d0
    else if (z <= 6.8d-44) then
        tmp = y * ((-9.0d0) * (z * t))
    else if (z <= 200000000000.0d0) then
        tmp = x * 2.0d0
    else
        tmp = (-9.0d0) * (t * (z * y))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.95e-81) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -1.7e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 8.2e-72) {
		tmp = x * 2.0;
	} else if (z <= 6.8e-44) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= 200000000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (t * (z * y));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -1.95e-81:
		tmp = y * (t * (z * -9.0))
	elif z <= -1.7e-234:
		tmp = a * (27.0 * b)
	elif z <= 8.2e-72:
		tmp = x * 2.0
	elif z <= 6.8e-44:
		tmp = y * (-9.0 * (z * t))
	elif z <= 200000000000.0:
		tmp = x * 2.0
	else:
		tmp = -9.0 * (t * (z * y))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1.95e-81)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= -1.7e-234)
		tmp = Float64(a * Float64(27.0 * b));
	elseif (z <= 8.2e-72)
		tmp = Float64(x * 2.0);
	elseif (z <= 6.8e-44)
		tmp = Float64(y * Float64(-9.0 * Float64(z * t)));
	elseif (z <= 200000000000.0)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -1.95e-81)
		tmp = y * (t * (z * -9.0));
	elseif (z <= -1.7e-234)
		tmp = a * (27.0 * b);
	elseif (z <= 8.2e-72)
		tmp = x * 2.0;
	elseif (z <= 6.8e-44)
		tmp = y * (-9.0 * (z * t));
	elseif (z <= 200000000000.0)
		tmp = x * 2.0;
	else
		tmp = -9.0 * (t * (z * y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1.95e-81], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.7e-234], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.2e-72], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.8e-44], N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 200000000000.0], N[(x * 2.0), $MachinePrecision], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 9: 50.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -8.2 \cdot 10^{-82}:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq -3 \cdot 10^{-234}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;z \leq 7.4 \cdot 10^{-72}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 1.85 \cdot 10^{-42}:\\ \;\;\;\;y \cdot \left(-9 \cdot \left(z \cdot t\right)\right)\\ \mathbf{elif}\;z \leq 56000000:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -8.2e-82)
   (* y (* t (* z -9.0)))
   (if (<= z -3e-234)
     (* a (* 27.0 b))
     (if (<= z 7.4e-72)
       (* x 2.0)
       (if (<= z 1.85e-42)
         (* y (* -9.0 (* z t)))
         (if (<= z 56000000.0) (* x 2.0) (* -9.0 (* z (* y t)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.2e-82) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -3e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 7.4e-72) {
		tmp = x * 2.0;
	} else if (z <= 1.85e-42) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= 56000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (z * (y * t));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (z <= (-8.2d-82)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= (-3d-234)) then
        tmp = a * (27.0d0 * b)
    else if (z <= 7.4d-72) then
        tmp = x * 2.0d0
    else if (z <= 1.85d-42) then
        tmp = y * ((-9.0d0) * (z * t))
    else if (z <= 56000000.0d0) then
        tmp = x * 2.0d0
    else
        tmp = (-9.0d0) * (z * (y * t))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8.2e-82) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= -3e-234) {
		tmp = a * (27.0 * b);
	} else if (z <= 7.4e-72) {
		tmp = x * 2.0;
	} else if (z <= 1.85e-42) {
		tmp = y * (-9.0 * (z * t));
	} else if (z <= 56000000.0) {
		tmp = x * 2.0;
	} else {
		tmp = -9.0 * (z * (y * t));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -8.2e-82:
		tmp = y * (t * (z * -9.0))
	elif z <= -3e-234:
		tmp = a * (27.0 * b)
	elif z <= 7.4e-72:
		tmp = x * 2.0
	elif z <= 1.85e-42:
		tmp = y * (-9.0 * (z * t))
	elif z <= 56000000.0:
		tmp = x * 2.0
	else:
		tmp = -9.0 * (z * (y * t))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -8.2e-82)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= -3e-234)
		tmp = Float64(a * Float64(27.0 * b));
	elseif (z <= 7.4e-72)
		tmp = Float64(x * 2.0);
	elseif (z <= 1.85e-42)
		tmp = Float64(y * Float64(-9.0 * Float64(z * t)));
	elseif (z <= 56000000.0)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -8.2e-82)
		tmp = y * (t * (z * -9.0));
	elseif (z <= -3e-234)
		tmp = a * (27.0 * b);
	elseif (z <= 7.4e-72)
		tmp = x * 2.0;
	elseif (z <= 1.85e-42)
		tmp = y * (-9.0 * (z * t));
	elseif (z <= 56000000.0)
		tmp = x * 2.0;
	else
		tmp = -9.0 * (z * (y * t));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -8.2e-82], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3e-234], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.4e-72], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 1.85e-42], N[(y * N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 56000000.0], N[(x * 2.0), $MachinePrecision], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 10: 93.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right) + a \cdot \left(27 \cdot b\right) \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (+ (- (* x 2.0) (* 9.0 (* z (* y t)))) (* a (* 27.0 b))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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
    code = ((x * 2.0d0) - (9.0d0 * (z * (y * t)))) + (a * (27.0d0 * b))
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b))

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))) + Float64(a * Float64(27.0 * b)))
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = ((x * 2.0) - (9.0 * (z * (y * t)))) + (a * (27.0 * b));
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

Alternative 11: 76.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -2:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 4.35 \cdot 10^{-175}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -2.0)
   (* y (* t (* z -9.0)))
   (if (<= z 4.35e-175)
     (+ (* 27.0 (* a b)) (* x 2.0))
     (- (* x 2.0) (* 9.0 (* t (* z y)))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -2.0) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 4.35e-175) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (z <= (-2.0d0)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= 4.35d-175) then
        tmp = (27.0d0 * (a * b)) + (x * 2.0d0)
    else
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -2.0) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 4.35e-175) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -2.0:
		tmp = y * (t * (z * -9.0))
	elif z <= 4.35e-175:
		tmp = (27.0 * (a * b)) + (x * 2.0)
	else:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -2.0)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= 4.35e-175)
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	else
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -2.0)
		tmp = y * (t * (z * -9.0));
	elseif (z <= 4.35e-175)
		tmp = (27.0 * (a * b)) + (x * 2.0);
	else
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -2.0], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.35e-175], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 12: 76.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -46:\\ \;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{+47}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right) + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -46.0)
   (* y (* t (* z -9.0)))
   (if (<= z 6.2e+47) (+ (* 27.0 (* a b)) (* x 2.0)) (* -9.0 (* z (* y t))))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -46.0) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 6.2e+47) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = -9.0 * (z * (y * t));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (z <= (-46.0d0)) then
        tmp = y * (t * (z * (-9.0d0)))
    else if (z <= 6.2d+47) then
        tmp = (27.0d0 * (a * b)) + (x * 2.0d0)
    else
        tmp = (-9.0d0) * (z * (y * t))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -46.0) {
		tmp = y * (t * (z * -9.0));
	} else if (z <= 6.2e+47) {
		tmp = (27.0 * (a * b)) + (x * 2.0);
	} else {
		tmp = -9.0 * (z * (y * t));
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if z <= -46.0:
		tmp = y * (t * (z * -9.0))
	elif z <= 6.2e+47:
		tmp = (27.0 * (a * b)) + (x * 2.0)
	else:
		tmp = -9.0 * (z * (y * t))
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -46.0)
		tmp = Float64(y * Float64(t * Float64(z * -9.0)));
	elseif (z <= 6.2e+47)
		tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(x * 2.0));
	else
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (z <= -46.0)
		tmp = y * (t * (z * -9.0));
	elseif (z <= 6.2e+47)
		tmp = (27.0 * (a * b)) + (x * 2.0);
	else
		tmp = -9.0 * (z * (y * t));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -46.0], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.2e+47], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 13: 47.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -6 \cdot 10^{+111} \lor \neg \left(a \leq 116\right):\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (or (<= a -6e+111) (not (<= a 116.0))) (* 27.0 (* a b)) (* x 2.0)))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a <= -6e+111) || !(a <= 116.0)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if ((a <= (-6d+111)) .or. (.not. (a <= 116.0d0))) then
        tmp = 27.0d0 * (a * b)
    else
        tmp = x * 2.0d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((a <= -6e+111) || !(a <= 116.0)) {
		tmp = 27.0 * (a * b);
	} else {
		tmp = x * 2.0;
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if (a <= -6e+111) or not (a <= 116.0):
		tmp = 27.0 * (a * b)
	else:
		tmp = x * 2.0
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if ((a <= -6e+111) || !(a <= 116.0))
		tmp = Float64(27.0 * Float64(a * b));
	else
		tmp = Float64(x * 2.0);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if ((a <= -6e+111) || ~((a <= 116.0)))
		tmp = 27.0 * (a * b);
	else
		tmp = x * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[a, -6e+111], N[Not[LessEqual[a, 116.0]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]

Derivation

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

Alternative 14: 48.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -5.2 \cdot 10^{+111}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{-29}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -5.2e+111)
   (* 27.0 (* a b))
   (if (<= a 7.2e-29) (* x 2.0) (* a (* 27.0 b)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -5.2e+111) {
		tmp = 27.0 * (a * b);
	} else if (a <= 7.2e-29) {
		tmp = x * 2.0;
	} else {
		tmp = a * (27.0 * b);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (a <= (-5.2d+111)) then
        tmp = 27.0d0 * (a * b)
    else if (a <= 7.2d-29) then
        tmp = x * 2.0d0
    else
        tmp = a * (27.0d0 * b)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -5.2e+111) {
		tmp = 27.0 * (a * b);
	} else if (a <= 7.2e-29) {
		tmp = x * 2.0;
	} else {
		tmp = a * (27.0 * b);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -5.2e+111:
		tmp = 27.0 * (a * b)
	elif a <= 7.2e-29:
		tmp = x * 2.0
	else:
		tmp = a * (27.0 * b)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -5.2e+111)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (a <= 7.2e-29)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(a * Float64(27.0 * b));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (a <= -5.2e+111)
		tmp = 27.0 * (a * b);
	elseif (a <= 7.2e-29)
		tmp = x * 2.0;
	else
		tmp = a * (27.0 * b);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -5.2e+111], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 7.2e-29], N[(x * 2.0), $MachinePrecision], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 15: 47.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -5.2 \cdot 10^{+111}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;a \leq 1.4 \cdot 10^{-5}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(27 \cdot a\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
 :precision binary64
 (if (<= a -5.2e+111)
   (* 27.0 (* a b))
   (if (<= a 1.4e-5) (* x 2.0) (* b (* 27.0 a)))))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -5.2e+111) {
		tmp = 27.0 * (a * b);
	} else if (a <= 1.4e-5) {
		tmp = x * 2.0;
	} else {
		tmp = b * (27.0 * a);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (a <= (-5.2d+111)) then
        tmp = 27.0d0 * (a * b)
    else if (a <= 1.4d-5) then
        tmp = x * 2.0d0
    else
        tmp = b * (27.0d0 * a)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= -5.2e+111) {
		tmp = 27.0 * (a * b);
	} else if (a <= 1.4e-5) {
		tmp = x * 2.0;
	} else {
		tmp = b * (27.0 * a);
	}
	return tmp;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	tmp = 0
	if a <= -5.2e+111:
		tmp = 27.0 * (a * b)
	elif a <= 1.4e-5:
		tmp = x * 2.0
	else:
		tmp = b * (27.0 * a)
	return tmp

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= -5.2e+111)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (a <= 1.4e-5)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(b * Float64(27.0 * a));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (a <= -5.2e+111)
		tmp = 27.0 * (a * b);
	elseif (a <= 1.4e-5)
		tmp = x * 2.0;
	else
		tmp = b * (27.0 * a);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, -5.2e+111], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.4e-5], N[(x * 2.0), $MachinePrecision], N[(b * N[(27.0 * a), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 16: 32.1% accurate, 5.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\ [x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\ \\ x \cdot 2 \end{array} \]

FPCore

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b) :precision binary64 (* x 2.0))

C

assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Fortran

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
    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
    code = x * 2.0d0
end function

Java

assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
	return x * 2.0;
}

Python

[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
[x, y, z, t, a, b] = sort([x, y, z, t, a, b])
def code(x, y, z, t, a, b):
	return x * 2.0

Julia

x, y, z, t, a, b = sort([x, y, z, t, a, b])
x, y, z, t, a, b = sort([x, y, z, t, a, b])
function code(x, y, z, t, a, b)
	return Float64(x * 2.0)
end

MATLAB

x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
	tmp = x * 2.0;
end

Wolfram

NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]

Derivation

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

Developer target: 94.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\ \;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (< y 7.590524218811189e-161)
   (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b)))
   (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    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) :: tmp
    if (y < 7.590524218811189d-161) then
        tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
    else
        tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (y < 7.590524218811189e-161) {
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	} else {
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	tmp = 0
	if y < 7.590524218811189e-161:
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b))
	else:
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b)
	return tmp

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (y < 7.590524218811189e-161)
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	tmp = 0.0;
	if (y < 7.590524218811189e-161)
		tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
	else
		tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2023350 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, A"
  :precision binary64

  :herbie-target
  (if (< y 7.590524218811189e-161) (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b))) (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b)))

  (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))