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

Percentage Accurate: 95.6% → 98.9%

Time: 15.6s

Alternatives: 15

Speedup: 0.9×

• 27.5% 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.6% 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.9% 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 1000:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, \mathsf{fma}\left(x, 2, y \cdot \left(z \cdot \left(t \cdot -9\right)\right)\right)\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 1000.0)
   (fma a (* 27.0 b) (fma x 2.0 (* y (* z (* t -9.0)))))
   (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 <= 1000.0) {
		tmp = fma(a, (27.0 * b), fma(x, 2.0, (y * (z * (t * -9.0)))));
	} 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 <= 1000.0)
		tmp = fma(a, Float64(27.0 * b), fma(x, 2.0, Float64(y * Float64(z * Float64(t * -9.0)))));
	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, 1000.0], N[(a * N[(27.0 * b), $MachinePrecision] + N[(x * 2.0 + N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $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: 99.0% 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 1000:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, x \cdot 2 - y \cdot \left(t \cdot \left(z \cdot 9\right)\right)\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 1000.0)
   (fma a (* 27.0 b) (- (* x 2.0) (* y (* t (* z 9.0)))))
   (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 <= 1000.0) {
		tmp = fma(a, (27.0 * b), ((x * 2.0) - (y * (t * (z * 9.0)))));
	} 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 <= 1000.0)
		tmp = fma(a, Float64(27.0 * b), Float64(Float64(x * 2.0) - Float64(y * Float64(t * Float64(z * 9.0)))));
	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, 1000.0], N[(a * N[(27.0 * b), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(y * N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $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 3: 98.6% 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}\;y \cdot 9 \leq -2 \cdot 10^{+63}:\\ \;\;\;\;\mathsf{fma}\left(a, 27 \cdot b, x \cdot 2 - y \cdot \left(t \cdot \left(z \cdot 9\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(a \cdot 27\right) + \left(x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\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 (<= (* y 9.0) -2e+63)
   (fma a (* 27.0 b) (- (* x 2.0) (* y (* t (* z 9.0)))))
   (+ (* b (* a 27.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 ((y * 9.0) <= -2e+63) {
		tmp = fma(a, (27.0 * b), ((x * 2.0) - (y * (t * (z * 9.0)))));
	} else {
		tmp = (b * (a * 27.0)) + ((x * 2.0) - (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 (Float64(y * 9.0) <= -2e+63)
		tmp = fma(a, Float64(27.0 * b), Float64(Float64(x * 2.0) - Float64(y * Float64(t * Float64(z * 9.0)))));
	else
		tmp = Float64(Float64(b * Float64(a * 27.0)) + Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t)))));
	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[N[(y * 9.0), $MachinePrecision], -2e+63], N[(a * N[(27.0 * b), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(y * N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 4: 49.7% accurate, 0.6× 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 := y \cdot \left(z \cdot \left(t \cdot -9\right)\right)\\ \mathbf{if}\;z \leq -4 \cdot 10^{-69}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq -3.5 \cdot 10^{-205}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq -5.6 \cdot 10^{-289}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{-296}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{-265}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right)\\ \mathbf{elif}\;z \leq 3.05 \cdot 10^{-250}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 1.02 \cdot 10^{-230}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 4.8 \cdot 10^{-122}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;z \leq 6 \cdot 10^{-82}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq 4.6 \cdot 10^{-22}:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;t \cdot \left(-9 \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 (* 27.0 (* a b))) (t_2 (* y (* z (* t -9.0)))))
   (if (<= z -4e-69)
     t_2
     (if (<= z -3.5e-205)
       (* x 2.0)
       (if (<= z -5.6e-289)
         t_1
         (if (<= z 4.8e-296)
           (* x 2.0)
           (if (<= z 2.8e-265)
             (* a (* 27.0 b))
             (if (<= z 3.05e-250)
               (* x 2.0)
               (if (<= z 1.02e-230)
                 t_1
                 (if (<= z 4.8e-122)
                   (* x 2.0)
                   (if (<= z 6e-82)
                     t_2
                     (if (<= z 4.6e-22)
                       (* x 2.0)
                       (* t (* -9.0 (* 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 = 27.0 * (a * b);
	double t_2 = y * (z * (t * -9.0));
	double tmp;
	if (z <= -4e-69) {
		tmp = t_2;
	} else if (z <= -3.5e-205) {
		tmp = x * 2.0;
	} else if (z <= -5.6e-289) {
		tmp = t_1;
	} else if (z <= 4.8e-296) {
		tmp = x * 2.0;
	} else if (z <= 2.8e-265) {
		tmp = a * (27.0 * b);
	} else if (z <= 3.05e-250) {
		tmp = x * 2.0;
	} else if (z <= 1.02e-230) {
		tmp = t_1;
	} else if (z <= 4.8e-122) {
		tmp = x * 2.0;
	} else if (z <= 6e-82) {
		tmp = t_2;
	} else if (z <= 4.6e-22) {
		tmp = x * 2.0;
	} else {
		tmp = t * (-9.0 * (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) :: t_2
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = y * (z * (t * (-9.0d0)))
    if (z <= (-4d-69)) then
        tmp = t_2
    else if (z <= (-3.5d-205)) then
        tmp = x * 2.0d0
    else if (z <= (-5.6d-289)) then
        tmp = t_1
    else if (z <= 4.8d-296) then
        tmp = x * 2.0d0
    else if (z <= 2.8d-265) then
        tmp = a * (27.0d0 * b)
    else if (z <= 3.05d-250) then
        tmp = x * 2.0d0
    else if (z <= 1.02d-230) then
        tmp = t_1
    else if (z <= 4.8d-122) then
        tmp = x * 2.0d0
    else if (z <= 6d-82) then
        tmp = t_2
    else if (z <= 4.6d-22) then
        tmp = x * 2.0d0
    else
        tmp = t * ((-9.0d0) * (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 = 27.0 * (a * b);
	double t_2 = y * (z * (t * -9.0));
	double tmp;
	if (z <= -4e-69) {
		tmp = t_2;
	} else if (z <= -3.5e-205) {
		tmp = x * 2.0;
	} else if (z <= -5.6e-289) {
		tmp = t_1;
	} else if (z <= 4.8e-296) {
		tmp = x * 2.0;
	} else if (z <= 2.8e-265) {
		tmp = a * (27.0 * b);
	} else if (z <= 3.05e-250) {
		tmp = x * 2.0;
	} else if (z <= 1.02e-230) {
		tmp = t_1;
	} else if (z <= 4.8e-122) {
		tmp = x * 2.0;
	} else if (z <= 6e-82) {
		tmp = t_2;
	} else if (z <= 4.6e-22) {
		tmp = x * 2.0;
	} else {
		tmp = t * (-9.0 * (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 = 27.0 * (a * b)
	t_2 = y * (z * (t * -9.0))
	tmp = 0
	if z <= -4e-69:
		tmp = t_2
	elif z <= -3.5e-205:
		tmp = x * 2.0
	elif z <= -5.6e-289:
		tmp = t_1
	elif z <= 4.8e-296:
		tmp = x * 2.0
	elif z <= 2.8e-265:
		tmp = a * (27.0 * b)
	elif z <= 3.05e-250:
		tmp = x * 2.0
	elif z <= 1.02e-230:
		tmp = t_1
	elif z <= 4.8e-122:
		tmp = x * 2.0
	elif z <= 6e-82:
		tmp = t_2
	elif z <= 4.6e-22:
		tmp = x * 2.0
	else:
		tmp = t * (-9.0 * (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(27.0 * Float64(a * b))
	t_2 = Float64(y * Float64(z * Float64(t * -9.0)))
	tmp = 0.0
	if (z <= -4e-69)
		tmp = t_2;
	elseif (z <= -3.5e-205)
		tmp = Float64(x * 2.0);
	elseif (z <= -5.6e-289)
		tmp = t_1;
	elseif (z <= 4.8e-296)
		tmp = Float64(x * 2.0);
	elseif (z <= 2.8e-265)
		tmp = Float64(a * Float64(27.0 * b));
	elseif (z <= 3.05e-250)
		tmp = Float64(x * 2.0);
	elseif (z <= 1.02e-230)
		tmp = t_1;
	elseif (z <= 4.8e-122)
		tmp = Float64(x * 2.0);
	elseif (z <= 6e-82)
		tmp = t_2;
	elseif (z <= 4.6e-22)
		tmp = Float64(x * 2.0);
	else
		tmp = Float64(t * Float64(-9.0 * 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 = 27.0 * (a * b);
	t_2 = y * (z * (t * -9.0));
	tmp = 0.0;
	if (z <= -4e-69)
		tmp = t_2;
	elseif (z <= -3.5e-205)
		tmp = x * 2.0;
	elseif (z <= -5.6e-289)
		tmp = t_1;
	elseif (z <= 4.8e-296)
		tmp = x * 2.0;
	elseif (z <= 2.8e-265)
		tmp = a * (27.0 * b);
	elseif (z <= 3.05e-250)
		tmp = x * 2.0;
	elseif (z <= 1.02e-230)
		tmp = t_1;
	elseif (z <= 4.8e-122)
		tmp = x * 2.0;
	elseif (z <= 6e-82)
		tmp = t_2;
	elseif (z <= 4.6e-22)
		tmp = x * 2.0;
	else
		tmp = t * (-9.0 * (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[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4e-69], t$95$2, If[LessEqual[z, -3.5e-205], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, -5.6e-289], t$95$1, If[LessEqual[z, 4.8e-296], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 2.8e-265], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.05e-250], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 1.02e-230], t$95$1, If[LessEqual[z, 4.8e-122], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6e-82], t$95$2, If[LessEqual[z, 4.6e-22], N[(x * 2.0), $MachinePrecision], N[(t * N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]]

Derivation

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

Alternative 5: 46.3% accurate, 0.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} t_1 := 27 \cdot \left(a \cdot b\right)\\ t_2 := -9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{if}\;x \leq -1.55 \cdot 10^{+25}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq -3.3 \cdot 10^{-153}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq -1.02 \cdot 10^{-190}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.35 \cdot 10^{-41}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+21}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+124}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\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
 (let* ((t_1 (* 27.0 (* a b))) (t_2 (* -9.0 (* z (* y t)))))
   (if (<= x -1.55e+25)
     (* x 2.0)
     (if (<= x -3.3e-153)
       t_2
       (if (<= x -1.02e-190)
         t_1
         (if (<= x 1.35e-41)
           t_2
           (if (<= x 4.2e+21)
             t_1
             (if (<= x 4.2e+124) (* -9.0 (* t (* z y))) (* 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 t_1 = 27.0 * (a * b);
	double t_2 = -9.0 * (z * (y * t));
	double tmp;
	if (x <= -1.55e+25) {
		tmp = x * 2.0;
	} else if (x <= -3.3e-153) {
		tmp = t_2;
	} else if (x <= -1.02e-190) {
		tmp = t_1;
	} else if (x <= 1.35e-41) {
		tmp = t_2;
	} else if (x <= 4.2e+21) {
		tmp = t_1;
	} else if (x <= 4.2e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    t_2 = (-9.0d0) * (z * (y * t))
    if (x <= (-1.55d+25)) then
        tmp = x * 2.0d0
    else if (x <= (-3.3d-153)) then
        tmp = t_2
    else if (x <= (-1.02d-190)) then
        tmp = t_1
    else if (x <= 1.35d-41) then
        tmp = t_2
    else if (x <= 4.2d+21) then
        tmp = t_1
    else if (x <= 4.2d+124) then
        tmp = (-9.0d0) * (t * (z * y))
    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 t_1 = 27.0 * (a * b);
	double t_2 = -9.0 * (z * (y * t));
	double tmp;
	if (x <= -1.55e+25) {
		tmp = x * 2.0;
	} else if (x <= -3.3e-153) {
		tmp = t_2;
	} else if (x <= -1.02e-190) {
		tmp = t_1;
	} else if (x <= 1.35e-41) {
		tmp = t_2;
	} else if (x <= 4.2e+21) {
		tmp = t_1;
	} else if (x <= 4.2e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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):
	t_1 = 27.0 * (a * b)
	t_2 = -9.0 * (z * (y * t))
	tmp = 0
	if x <= -1.55e+25:
		tmp = x * 2.0
	elif x <= -3.3e-153:
		tmp = t_2
	elif x <= -1.02e-190:
		tmp = t_1
	elif x <= 1.35e-41:
		tmp = t_2
	elif x <= 4.2e+21:
		tmp = t_1
	elif x <= 4.2e+124:
		tmp = -9.0 * (t * (z * y))
	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)
	t_1 = Float64(27.0 * Float64(a * b))
	t_2 = Float64(-9.0 * Float64(z * Float64(y * t)))
	tmp = 0.0
	if (x <= -1.55e+25)
		tmp = Float64(x * 2.0);
	elseif (x <= -3.3e-153)
		tmp = t_2;
	elseif (x <= -1.02e-190)
		tmp = t_1;
	elseif (x <= 1.35e-41)
		tmp = t_2;
	elseif (x <= 4.2e+21)
		tmp = t_1;
	elseif (x <= 4.2e+124)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	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)
	t_1 = 27.0 * (a * b);
	t_2 = -9.0 * (z * (y * t));
	tmp = 0.0;
	if (x <= -1.55e+25)
		tmp = x * 2.0;
	elseif (x <= -3.3e-153)
		tmp = t_2;
	elseif (x <= -1.02e-190)
		tmp = t_1;
	elseif (x <= 1.35e-41)
		tmp = t_2;
	elseif (x <= 4.2e+21)
		tmp = t_1;
	elseif (x <= 4.2e+124)
		tmp = -9.0 * (t * (z * y));
	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_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.55e+25], N[(x * 2.0), $MachinePrecision], If[LessEqual[x, -3.3e-153], t$95$2, If[LessEqual[x, -1.02e-190], t$95$1, If[LessEqual[x, 1.35e-41], t$95$2, If[LessEqual[x, 4.2e+21], t$95$1, If[LessEqual[x, 4.2e+124], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]]]]]]]]

Derivation

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

Alternative 6: 46.3% accurate, 0.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} t_1 := 27 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;x \leq -4.5 \cdot 10^{+30}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq -8.8 \cdot 10^{-153}:\\ \;\;\;\;-9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{elif}\;x \leq -3.02 \cdot 10^{-205}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.8 \cdot 10^{-41}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\right)\right)\\ \mathbf{elif}\;x \leq 3.6 \cdot 10^{+21}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{+124}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\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
 (let* ((t_1 (* 27.0 (* a b))))
   (if (<= x -4.5e+30)
     (* x 2.0)
     (if (<= x -8.8e-153)
       (* -9.0 (* z (* y t)))
       (if (<= x -3.02e-205)
         t_1
         (if (<= x 1.8e-41)
           (* z (* t (* y -9.0)))
           (if (<= x 3.6e+21)
             t_1
             (if (<= x 1.2e+124) (* -9.0 (* t (* z y))) (* 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 t_1 = 27.0 * (a * b);
	double tmp;
	if (x <= -4.5e+30) {
		tmp = x * 2.0;
	} else if (x <= -8.8e-153) {
		tmp = -9.0 * (z * (y * t));
	} else if (x <= -3.02e-205) {
		tmp = t_1;
	} else if (x <= 1.8e-41) {
		tmp = z * (t * (y * -9.0));
	} else if (x <= 3.6e+21) {
		tmp = t_1;
	} else if (x <= 1.2e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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) :: t_1
    real(8) :: tmp
    t_1 = 27.0d0 * (a * b)
    if (x <= (-4.5d+30)) then
        tmp = x * 2.0d0
    else if (x <= (-8.8d-153)) then
        tmp = (-9.0d0) * (z * (y * t))
    else if (x <= (-3.02d-205)) then
        tmp = t_1
    else if (x <= 1.8d-41) then
        tmp = z * (t * (y * (-9.0d0)))
    else if (x <= 3.6d+21) then
        tmp = t_1
    else if (x <= 1.2d+124) then
        tmp = (-9.0d0) * (t * (z * y))
    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 t_1 = 27.0 * (a * b);
	double tmp;
	if (x <= -4.5e+30) {
		tmp = x * 2.0;
	} else if (x <= -8.8e-153) {
		tmp = -9.0 * (z * (y * t));
	} else if (x <= -3.02e-205) {
		tmp = t_1;
	} else if (x <= 1.8e-41) {
		tmp = z * (t * (y * -9.0));
	} else if (x <= 3.6e+21) {
		tmp = t_1;
	} else if (x <= 1.2e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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):
	t_1 = 27.0 * (a * b)
	tmp = 0
	if x <= -4.5e+30:
		tmp = x * 2.0
	elif x <= -8.8e-153:
		tmp = -9.0 * (z * (y * t))
	elif x <= -3.02e-205:
		tmp = t_1
	elif x <= 1.8e-41:
		tmp = z * (t * (y * -9.0))
	elif x <= 3.6e+21:
		tmp = t_1
	elif x <= 1.2e+124:
		tmp = -9.0 * (t * (z * y))
	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)
	t_1 = Float64(27.0 * Float64(a * b))
	tmp = 0.0
	if (x <= -4.5e+30)
		tmp = Float64(x * 2.0);
	elseif (x <= -8.8e-153)
		tmp = Float64(-9.0 * Float64(z * Float64(y * t)));
	elseif (x <= -3.02e-205)
		tmp = t_1;
	elseif (x <= 1.8e-41)
		tmp = Float64(z * Float64(t * Float64(y * -9.0)));
	elseif (x <= 3.6e+21)
		tmp = t_1;
	elseif (x <= 1.2e+124)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	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)
	t_1 = 27.0 * (a * b);
	tmp = 0.0;
	if (x <= -4.5e+30)
		tmp = x * 2.0;
	elseif (x <= -8.8e-153)
		tmp = -9.0 * (z * (y * t));
	elseif (x <= -3.02e-205)
		tmp = t_1;
	elseif (x <= 1.8e-41)
		tmp = z * (t * (y * -9.0));
	elseif (x <= 3.6e+21)
		tmp = t_1;
	elseif (x <= 1.2e+124)
		tmp = -9.0 * (t * (z * y));
	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_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.5e+30], N[(x * 2.0), $MachinePrecision], If[LessEqual[x, -8.8e-153], N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -3.02e-205], t$95$1, If[LessEqual[x, 1.8e-41], N[(z * N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.6e+21], t$95$1, If[LessEqual[x, 1.2e+124], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]]]]]]]

Derivation

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

Alternative 7: 76.9% accurate, 0.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}\;z \leq -3.2 \cdot 10^{+38}:\\ \;\;\;\;y \cdot \left(z \cdot \left(t \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 7.2 \cdot 10^{-115} \lor \neg \left(z \leq 1.55 \cdot 10^{-42}\right) \land z \leq 2.8 \cdot 10^{+18}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \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 -3.2e+38)
   (* y (* z (* t -9.0)))
   (if (or (<= z 7.2e-115) (and (not (<= z 1.55e-42)) (<= z 2.8e+18)))
     (+ (* x 2.0) (* 27.0 (* a b)))
     (- (* 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 <= -3.2e+38) {
		tmp = y * (z * (t * -9.0));
	} else if ((z <= 7.2e-115) || (!(z <= 1.55e-42) && (z <= 2.8e+18))) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} 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 <= (-3.2d+38)) then
        tmp = y * (z * (t * (-9.0d0)))
    else if ((z <= 7.2d-115) .or. (.not. (z <= 1.55d-42)) .and. (z <= 2.8d+18)) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    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 <= -3.2e+38) {
		tmp = y * (z * (t * -9.0));
	} else if ((z <= 7.2e-115) || (!(z <= 1.55e-42) && (z <= 2.8e+18))) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} 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 <= -3.2e+38:
		tmp = y * (z * (t * -9.0))
	elif (z <= 7.2e-115) or (not (z <= 1.55e-42) and (z <= 2.8e+18)):
		tmp = (x * 2.0) + (27.0 * (a * b))
	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 <= -3.2e+38)
		tmp = Float64(y * Float64(z * Float64(t * -9.0)));
	elseif ((z <= 7.2e-115) || (!(z <= 1.55e-42) && (z <= 2.8e+18)))
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	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 <= -3.2e+38)
		tmp = y * (z * (t * -9.0));
	elseif ((z <= 7.2e-115) || (~((z <= 1.55e-42)) && (z <= 2.8e+18)))
		tmp = (x * 2.0) + (27.0 * (a * b));
	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, -3.2e+38], N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[z, 7.2e-115], And[N[Not[LessEqual[z, 1.55e-42]], $MachinePrecision], LessEqual[z, 2.8e+18]]], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $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 8: 79.2% accurate, 0.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} t_1 := x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ t_2 := x \cdot 2 - 9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \mathbf{if}\;z \leq -3.2 \cdot 10^{-44}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-112}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{-46}:\\ \;\;\;\;x \cdot 2 - 9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;z \leq 3.2 \cdot 10^{+18}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_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
 (let* ((t_1 (+ (* x 2.0) (* 27.0 (* a b))))
        (t_2 (- (* x 2.0) (* 9.0 (* z (* y t))))))
   (if (<= z -3.2e-44)
     t_2
     (if (<= z 4.5e-112)
       t_1
       (if (<= z 1.15e-46)
         (- (* x 2.0) (* 9.0 (* t (* z y))))
         (if (<= z 3.2e+18) t_1 t_2))))))

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 = (x * 2.0) + (27.0 * (a * b));
	double t_2 = (x * 2.0) - (9.0 * (z * (y * t)));
	double tmp;
	if (z <= -3.2e-44) {
		tmp = t_2;
	} else if (z <= 4.5e-112) {
		tmp = t_1;
	} else if (z <= 1.15e-46) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else if (z <= 3.2e+18) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	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) :: tmp
    t_1 = (x * 2.0d0) + (27.0d0 * (a * b))
    t_2 = (x * 2.0d0) - (9.0d0 * (z * (y * t)))
    if (z <= (-3.2d-44)) then
        tmp = t_2
    else if (z <= 4.5d-112) then
        tmp = t_1
    else if (z <= 1.15d-46) then
        tmp = (x * 2.0d0) - (9.0d0 * (t * (z * y)))
    else if (z <= 3.2d+18) 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;
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 = (x * 2.0) + (27.0 * (a * b));
	double t_2 = (x * 2.0) - (9.0 * (z * (y * t)));
	double tmp;
	if (z <= -3.2e-44) {
		tmp = t_2;
	} else if (z <= 4.5e-112) {
		tmp = t_1;
	} else if (z <= 1.15e-46) {
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	} else if (z <= 3.2e+18) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	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 = (x * 2.0) + (27.0 * (a * b))
	t_2 = (x * 2.0) - (9.0 * (z * (y * t)))
	tmp = 0
	if z <= -3.2e-44:
		tmp = t_2
	elif z <= 4.5e-112:
		tmp = t_1
	elif z <= 1.15e-46:
		tmp = (x * 2.0) - (9.0 * (t * (z * y)))
	elif z <= 3.2e+18:
		tmp = t_1
	else:
		tmp = t_2
	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(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)))
	t_2 = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(z * Float64(y * t))))
	tmp = 0.0
	if (z <= -3.2e-44)
		tmp = t_2;
	elseif (z <= 4.5e-112)
		tmp = t_1;
	elseif (z <= 1.15e-46)
		tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(t * Float64(z * y))));
	elseif (z <= 3.2e+18)
		tmp = t_1;
	else
		tmp = t_2;
	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 = (x * 2.0) + (27.0 * (a * b));
	t_2 = (x * 2.0) - (9.0 * (z * (y * t)));
	tmp = 0.0;
	if (z <= -3.2e-44)
		tmp = t_2;
	elseif (z <= 4.5e-112)
		tmp = t_1;
	elseif (z <= 1.15e-46)
		tmp = (x * 2.0) - (9.0 * (t * (z * y)));
	elseif (z <= 3.2e+18)
		tmp = t_1;
	else
		tmp = t_2;
	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[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.2e-44], t$95$2, If[LessEqual[z, 4.5e-112], t$95$1, If[LessEqual[z, 1.15e-46], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.2e+18], t$95$1, t$95$2]]]]]]

Derivation

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

Alternative 9: 96.9% accurate, 0.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}\;z \leq 6.5 \cdot 10^{+54}:\\ \;\;\;\;\left(y \cdot \left(z \cdot \left(t \cdot -9\right)\right) + x \cdot 2\right) + a \cdot \left(27 \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 2 - 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 6.5e+54)
   (+ (+ (* y (* z (* t -9.0))) (* x 2.0)) (* a (* 27.0 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 <= 6.5e+54) {
		tmp = ((y * (z * (t * -9.0))) + (x * 2.0)) + (a * (27.0 * b));
	} else {
		tmp = (x * 2.0) - (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 <= 6.5d+54) then
        tmp = ((y * (z * (t * (-9.0d0)))) + (x * 2.0d0)) + (a * (27.0d0 * b))
    else
        tmp = (x * 2.0d0) - (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 <= 6.5e+54) {
		tmp = ((y * (z * (t * -9.0))) + (x * 2.0)) + (a * (27.0 * b));
	} else {
		tmp = (x * 2.0) - (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 <= 6.5e+54:
		tmp = ((y * (z * (t * -9.0))) + (x * 2.0)) + (a * (27.0 * b))
	else:
		tmp = (x * 2.0) - (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 <= 6.5e+54)
		tmp = Float64(Float64(Float64(y * Float64(z * Float64(t * -9.0))) + Float64(x * 2.0)) + Float64(a * Float64(27.0 * b)));
	else
		tmp = Float64(Float64(x * 2.0) - 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 <= 6.5e+54)
		tmp = ((y * (z * (t * -9.0))) + (x * 2.0)) + (a * (27.0 * b));
	else
		tmp = (x * 2.0) - (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, 6.5e+54], N[(N[(N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * 2.0), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 10: 77.8% 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}\;x \leq -2.9 \cdot 10^{-9}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;x \leq 1.8 \cdot 10^{+30}:\\ \;\;\;\;a \cdot \left(27 \cdot b\right) + -9 \cdot \left(z \cdot \left(y \cdot t\right)\right)\\ \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 (<= x -2.9e-9)
   (+ (* x 2.0) (* 27.0 (* a b)))
   (if (<= x 1.8e+30)
     (+ (* a (* 27.0 b)) (* -9.0 (* z (* y t))))
     (- (* 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 (x <= -2.9e-9) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else if (x <= 1.8e+30) {
		tmp = (a * (27.0 * b)) + (-9.0 * (z * (y * t)));
	} 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 (x <= (-2.9d-9)) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    else if (x <= 1.8d+30) then
        tmp = (a * (27.0d0 * b)) + ((-9.0d0) * (z * (y * t)))
    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 (x <= -2.9e-9) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else if (x <= 1.8e+30) {
		tmp = (a * (27.0 * b)) + (-9.0 * (z * (y * t)));
	} 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 x <= -2.9e-9:
		tmp = (x * 2.0) + (27.0 * (a * b))
	elif x <= 1.8e+30:
		tmp = (a * (27.0 * b)) + (-9.0 * (z * (y * t)))
	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 (x <= -2.9e-9)
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	elseif (x <= 1.8e+30)
		tmp = Float64(Float64(a * Float64(27.0 * b)) + Float64(-9.0 * Float64(z * Float64(y * t))));
	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 (x <= -2.9e-9)
		tmp = (x * 2.0) + (27.0 * (a * b));
	elseif (x <= 1.8e+30)
		tmp = (a * (27.0 * b)) + (-9.0 * (z * (y * t)));
	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[x, -2.9e-9], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.8e+30], N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(-9.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $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 11: 46.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} t_1 := -9 \cdot \left(t \cdot \left(z \cdot y\right)\right)\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{+34}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq 8.5 \cdot 10^{-41}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;x \leq 4.6 \cdot 10^{+21}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;x \leq 7.5 \cdot 10^{+124}:\\ \;\;\;\;t_1\\ \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
 (let* ((t_1 (* -9.0 (* t (* z y)))))
   (if (<= x -8.5e+34)
     (* x 2.0)
     (if (<= x 8.5e-41)
       t_1
       (if (<= x 4.6e+21)
         (* 27.0 (* a b))
         (if (<= x 7.5e+124) t_1 (* 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 t_1 = -9.0 * (t * (z * y));
	double tmp;
	if (x <= -8.5e+34) {
		tmp = x * 2.0;
	} else if (x <= 8.5e-41) {
		tmp = t_1;
	} else if (x <= 4.6e+21) {
		tmp = 27.0 * (a * b);
	} else if (x <= 7.5e+124) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_1 = (-9.0d0) * (t * (z * y))
    if (x <= (-8.5d+34)) then
        tmp = x * 2.0d0
    else if (x <= 8.5d-41) then
        tmp = t_1
    else if (x <= 4.6d+21) then
        tmp = 27.0d0 * (a * b)
    else if (x <= 7.5d+124) then
        tmp = t_1
    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 t_1 = -9.0 * (t * (z * y));
	double tmp;
	if (x <= -8.5e+34) {
		tmp = x * 2.0;
	} else if (x <= 8.5e-41) {
		tmp = t_1;
	} else if (x <= 4.6e+21) {
		tmp = 27.0 * (a * b);
	} else if (x <= 7.5e+124) {
		tmp = t_1;
	} 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):
	t_1 = -9.0 * (t * (z * y))
	tmp = 0
	if x <= -8.5e+34:
		tmp = x * 2.0
	elif x <= 8.5e-41:
		tmp = t_1
	elif x <= 4.6e+21:
		tmp = 27.0 * (a * b)
	elif x <= 7.5e+124:
		tmp = t_1
	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)
	t_1 = Float64(-9.0 * Float64(t * Float64(z * y)))
	tmp = 0.0
	if (x <= -8.5e+34)
		tmp = Float64(x * 2.0);
	elseif (x <= 8.5e-41)
		tmp = t_1;
	elseif (x <= 4.6e+21)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (x <= 7.5e+124)
		tmp = t_1;
	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)
	t_1 = -9.0 * (t * (z * y));
	tmp = 0.0;
	if (x <= -8.5e+34)
		tmp = x * 2.0;
	elseif (x <= 8.5e-41)
		tmp = t_1;
	elseif (x <= 4.6e+21)
		tmp = 27.0 * (a * b);
	elseif (x <= 7.5e+124)
		tmp = t_1;
	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_] := Block[{t$95$1 = N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e+34], N[(x * 2.0), $MachinePrecision], If[LessEqual[x, 8.5e-41], t$95$1, If[LessEqual[x, 4.6e+21], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 7.5e+124], t$95$1, N[(x * 2.0), $MachinePrecision]]]]]]

Derivation

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

Alternative 12: 46.7% 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}\;x \leq -2.52 \cdot 10^{+33}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{-40}:\\ \;\;\;\;t \cdot \left(-9 \cdot \left(z \cdot y\right)\right)\\ \mathbf{elif}\;x \leq 3.05 \cdot 10^{+21}:\\ \;\;\;\;27 \cdot \left(a \cdot b\right)\\ \mathbf{elif}\;x \leq 1.9 \cdot 10^{+124}:\\ \;\;\;\;-9 \cdot \left(t \cdot \left(z \cdot y\right)\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 (<= x -2.52e+33)
   (* x 2.0)
   (if (<= x 1.2e-40)
     (* t (* -9.0 (* z y)))
     (if (<= x 3.05e+21)
       (* 27.0 (* a b))
       (if (<= x 1.9e+124) (* -9.0 (* t (* z y))) (* 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 (x <= -2.52e+33) {
		tmp = x * 2.0;
	} else if (x <= 1.2e-40) {
		tmp = t * (-9.0 * (z * y));
	} else if (x <= 3.05e+21) {
		tmp = 27.0 * (a * b);
	} else if (x <= 1.9e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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 (x <= (-2.52d+33)) then
        tmp = x * 2.0d0
    else if (x <= 1.2d-40) then
        tmp = t * ((-9.0d0) * (z * y))
    else if (x <= 3.05d+21) then
        tmp = 27.0d0 * (a * b)
    else if (x <= 1.9d+124) then
        tmp = (-9.0d0) * (t * (z * y))
    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 (x <= -2.52e+33) {
		tmp = x * 2.0;
	} else if (x <= 1.2e-40) {
		tmp = t * (-9.0 * (z * y));
	} else if (x <= 3.05e+21) {
		tmp = 27.0 * (a * b);
	} else if (x <= 1.9e+124) {
		tmp = -9.0 * (t * (z * y));
	} 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 x <= -2.52e+33:
		tmp = x * 2.0
	elif x <= 1.2e-40:
		tmp = t * (-9.0 * (z * y))
	elif x <= 3.05e+21:
		tmp = 27.0 * (a * b)
	elif x <= 1.9e+124:
		tmp = -9.0 * (t * (z * y))
	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 (x <= -2.52e+33)
		tmp = Float64(x * 2.0);
	elseif (x <= 1.2e-40)
		tmp = Float64(t * Float64(-9.0 * Float64(z * y)));
	elseif (x <= 3.05e+21)
		tmp = Float64(27.0 * Float64(a * b));
	elseif (x <= 1.9e+124)
		tmp = Float64(-9.0 * Float64(t * Float64(z * y)));
	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 (x <= -2.52e+33)
		tmp = x * 2.0;
	elseif (x <= 1.2e-40)
		tmp = t * (-9.0 * (z * y));
	elseif (x <= 3.05e+21)
		tmp = 27.0 * (a * b);
	elseif (x <= 1.9e+124)
		tmp = -9.0 * (t * (z * y));
	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[LessEqual[x, -2.52e+33], N[(x * 2.0), $MachinePrecision], If[LessEqual[x, 1.2e-40], N[(t * N[(-9.0 * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.05e+21], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.9e+124], N[(-9.0 * N[(t * N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]]]]

Derivation

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

Alternative 13: 76.1% 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 -1.45 \cdot 10^{+38}:\\ \;\;\;\;y \cdot \left(z \cdot \left(t \cdot -9\right)\right)\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{+18}:\\ \;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(t \cdot \left(y \cdot -9\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.45e+38)
   (* y (* z (* t -9.0)))
   (if (<= z 3.1e+18) (+ (* x 2.0) (* 27.0 (* a b))) (* z (* t (* y -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 <= -1.45e+38) {
		tmp = y * (z * (t * -9.0));
	} else if (z <= 3.1e+18) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = z * (t * (y * -9.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 (z <= (-1.45d+38)) then
        tmp = y * (z * (t * (-9.0d0)))
    else if (z <= 3.1d+18) then
        tmp = (x * 2.0d0) + (27.0d0 * (a * b))
    else
        tmp = z * (t * (y * (-9.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 (z <= -1.45e+38) {
		tmp = y * (z * (t * -9.0));
	} else if (z <= 3.1e+18) {
		tmp = (x * 2.0) + (27.0 * (a * b));
	} else {
		tmp = z * (t * (y * -9.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 z <= -1.45e+38:
		tmp = y * (z * (t * -9.0))
	elif z <= 3.1e+18:
		tmp = (x * 2.0) + (27.0 * (a * b))
	else:
		tmp = z * (t * (y * -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 <= -1.45e+38)
		tmp = Float64(y * Float64(z * Float64(t * -9.0)));
	elseif (z <= 3.1e+18)
		tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b)));
	else
		tmp = Float64(z * Float64(t * Float64(y * -9.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 (z <= -1.45e+38)
		tmp = y * (z * (t * -9.0));
	elseif (z <= 3.1e+18)
		tmp = (x * 2.0) + (27.0 * (a * b));
	else
		tmp = z * (t * (y * -9.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[LessEqual[z, -1.45e+38], N[(y * N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.1e+18], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(t * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 14: 46.6% 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}\;b \leq -4.9 \cdot 10^{-36} \lor \neg \left(b \leq 2.55 \cdot 10^{+169}\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 (<= b -4.9e-36) (not (<= b 2.55e+169))) (* 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 ((b <= -4.9e-36) || !(b <= 2.55e+169)) {
		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 ((b <= (-4.9d-36)) .or. (.not. (b <= 2.55d+169))) 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 ((b <= -4.9e-36) || !(b <= 2.55e+169)) {
		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 (b <= -4.9e-36) or not (b <= 2.55e+169):
		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 ((b <= -4.9e-36) || !(b <= 2.55e+169))
		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 ((b <= -4.9e-36) || ~((b <= 2.55e+169)))
		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[b, -4.9e-36], N[Not[LessEqual[b, 2.55e+169]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]

Derivation

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

Alternative 15: 30.5% 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: 95.2% 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 2023348 
(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)))