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

Percentage Accurate: 79.5% → 88.8%

Time: 21.2s

Alternatives: 15

Speedup: 0.2×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function

Java

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

Python

def code(x, y, z, t, a, b, c):
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
end

Wolfram

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

Initial Program: 79.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function

Java

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

Python

def code(x, y, z, t, a, b, c):
	return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
end

Wolfram

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

Alternative 1: 88.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;c \leq -0.5 \lor \neg \left(c \leq 5 \cdot 10^{+20}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{a}{c} \cdot t, -4, \mathsf{fma}\left(9, \frac{x}{c} \cdot \frac{y}{z}, \frac{b}{c \cdot z}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{c \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= c -0.5) (not (<= c 5e+20)))
   (fma (* (/ a c) t) -4.0 (fma 9.0 (* (/ x c) (/ y z)) (/ b (* c z))))
   (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* c z))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((c <= -0.5) || !(c <= 5e+20)) {
		tmp = fma(((a / c) * t), -4.0, fma(9.0, ((x / c) * (y / z)), (b / (c * z))));
	} else {
		tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (c * z);
	}
	return tmp;
}

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((c <= -0.5) || !(c <= 5e+20))
		tmp = fma(Float64(Float64(a / c) * t), -4.0, fma(9.0, Float64(Float64(x / c) * Float64(y / z)), Float64(b / Float64(c * z))));
	else
		tmp = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(c * z));
	end
	return tmp
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[c, -0.5], N[Not[LessEqual[c, 5e+20]], $MachinePrecision]], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0 + N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 2: 87.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} t_1 := \frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c \cdot z}\\ t_2 := \frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{c \cdot z}\\ \mathbf{if}\;t_1 \leq -1 \cdot 10^{-115}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t_1 \leq 0:\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\ \mathbf{elif}\;t_1 \leq \infty:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{c}}{z} + a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* c z)))
        (t_2 (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* c z))))
   (if (<= t_1 -1e-115)
     t_2
     (if (<= t_1 0.0)
       (/ (+ (* -4.0 (* a t)) (/ b z)) c)
       (if (<= t_1 INFINITY) t_2 (+ (/ (/ b c) z) (* a (* -4.0 (/ t c)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (c * z);
	double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (c * z);
	double tmp;
	if (t_1 <= -1e-115) {
		tmp = t_2;
	} else if (t_1 <= 0.0) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_2;
	} else {
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	}
	return tmp;
}

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (c * z);
	double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (c * z);
	double tmp;
	if (t_1 <= -1e-115) {
		tmp = t_2;
	} else if (t_1 <= 0.0) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else {
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (c * z)
	t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (c * z)
	tmp = 0
	if t_1 <= -1e-115:
		tmp = t_2
	elif t_1 <= 0.0:
		tmp = ((-4.0 * (a * t)) + (b / z)) / c
	elif t_1 <= math.inf:
		tmp = t_2
	else:
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c * z))
	t_2 = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(c * z))
	tmp = 0.0
	if (t_1 <= -1e-115)
		tmp = t_2;
	elseif (t_1 <= 0.0)
		tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c);
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = Float64(Float64(Float64(b / c) / z) + Float64(a * Float64(-4.0 * Float64(t / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (c * z);
	t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (c * z);
	tmp = 0.0;
	if (t_1 <= -1e-115)
		tmp = t_2;
	elseif (t_1 <= 0.0)
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	elseif (t_1 <= Inf)
		tmp = t_2;
	else
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-115], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision] + N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 3: 50.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} t_1 := \frac{\frac{b}{c}}{z}\\ t_2 := -4 \cdot \frac{a \cdot t}{c}\\ \mathbf{if}\;b \leq -4.4 \cdot 10^{+68}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \leq -2 \cdot 10^{-61}:\\ \;\;\;\;9 \cdot \left(\frac{y}{c} \cdot \frac{x}{z}\right)\\ \mathbf{elif}\;b \leq 2.55 \cdot 10^{-244}:\\ \;\;\;\;t \cdot \frac{-a}{\frac{c}{4}}\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{-212}:\\ \;\;\;\;\frac{y}{z} \cdot \frac{9 \cdot x}{c}\\ \mathbf{elif}\;b \leq 6.8 \cdot 10^{-184}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \leq 1.76 \cdot 10^{-91}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;b \leq 5.4 \cdot 10^{-26}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (/ b c) z)) (t_2 (* -4.0 (/ (* a t) c))))
   (if (<= b -4.4e+68)
     t_1
     (if (<= b -2e-61)
       (* 9.0 (* (/ y c) (/ x z)))
       (if (<= b 2.55e-244)
         (* t (/ (- a) (/ c 4.0)))
         (if (<= b 1.05e-212)
           (* (/ y z) (/ (* 9.0 x) c))
           (if (<= b 6.8e-184)
             t_2
             (if (<= b 1.76e-91)
               (* 9.0 (* x (/ y (* c z))))
               (if (<= b 5.4e-26) t_2 t_1)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b / c) / z;
	double t_2 = -4.0 * ((a * t) / c);
	double tmp;
	if (b <= -4.4e+68) {
		tmp = t_1;
	} else if (b <= -2e-61) {
		tmp = 9.0 * ((y / c) * (x / z));
	} else if (b <= 2.55e-244) {
		tmp = t * (-a / (c / 4.0));
	} else if (b <= 1.05e-212) {
		tmp = (y / z) * ((9.0 * x) / c);
	} else if (b <= 6.8e-184) {
		tmp = t_2;
	} else if (b <= 1.76e-91) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (b <= 5.4e-26) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (b / c) / z
    t_2 = (-4.0d0) * ((a * t) / c)
    if (b <= (-4.4d+68)) then
        tmp = t_1
    else if (b <= (-2d-61)) then
        tmp = 9.0d0 * ((y / c) * (x / z))
    else if (b <= 2.55d-244) then
        tmp = t * (-a / (c / 4.0d0))
    else if (b <= 1.05d-212) then
        tmp = (y / z) * ((9.0d0 * x) / c)
    else if (b <= 6.8d-184) then
        tmp = t_2
    else if (b <= 1.76d-91) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (b <= 5.4d-26) then
        tmp = t_2
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b / c) / z;
	double t_2 = -4.0 * ((a * t) / c);
	double tmp;
	if (b <= -4.4e+68) {
		tmp = t_1;
	} else if (b <= -2e-61) {
		tmp = 9.0 * ((y / c) * (x / z));
	} else if (b <= 2.55e-244) {
		tmp = t * (-a / (c / 4.0));
	} else if (b <= 1.05e-212) {
		tmp = (y / z) * ((9.0 * x) / c);
	} else if (b <= 6.8e-184) {
		tmp = t_2;
	} else if (b <= 1.76e-91) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (b <= 5.4e-26) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = (b / c) / z
	t_2 = -4.0 * ((a * t) / c)
	tmp = 0
	if b <= -4.4e+68:
		tmp = t_1
	elif b <= -2e-61:
		tmp = 9.0 * ((y / c) * (x / z))
	elif b <= 2.55e-244:
		tmp = t * (-a / (c / 4.0))
	elif b <= 1.05e-212:
		tmp = (y / z) * ((9.0 * x) / c)
	elif b <= 6.8e-184:
		tmp = t_2
	elif b <= 1.76e-91:
		tmp = 9.0 * (x * (y / (c * z)))
	elif b <= 5.4e-26:
		tmp = t_2
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(b / c) / z)
	t_2 = Float64(-4.0 * Float64(Float64(a * t) / c))
	tmp = 0.0
	if (b <= -4.4e+68)
		tmp = t_1;
	elseif (b <= -2e-61)
		tmp = Float64(9.0 * Float64(Float64(y / c) * Float64(x / z)));
	elseif (b <= 2.55e-244)
		tmp = Float64(t * Float64(Float64(-a) / Float64(c / 4.0)));
	elseif (b <= 1.05e-212)
		tmp = Float64(Float64(y / z) * Float64(Float64(9.0 * x) / c));
	elseif (b <= 6.8e-184)
		tmp = t_2;
	elseif (b <= 1.76e-91)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (b <= 5.4e-26)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = (b / c) / z;
	t_2 = -4.0 * ((a * t) / c);
	tmp = 0.0;
	if (b <= -4.4e+68)
		tmp = t_1;
	elseif (b <= -2e-61)
		tmp = 9.0 * ((y / c) * (x / z));
	elseif (b <= 2.55e-244)
		tmp = t * (-a / (c / 4.0));
	elseif (b <= 1.05e-212)
		tmp = (y / z) * ((9.0 * x) / c);
	elseif (b <= 6.8e-184)
		tmp = t_2;
	elseif (b <= 1.76e-91)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (b <= 5.4e-26)
		tmp = t_2;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.4e+68], t$95$1, If[LessEqual[b, -2e-61], N[(9.0 * N[(N[(y / c), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.55e-244], N[(t * N[((-a) / N[(c / 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.05e-212], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6.8e-184], t$95$2, If[LessEqual[b, 1.76e-91], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.4e-26], t$95$2, t$95$1]]]]]]]]]

Derivation

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

Alternative 4: 50.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} t_1 := \frac{\frac{b}{c}}{z}\\ t_2 := -4 \cdot \frac{a \cdot t}{c}\\ \mathbf{if}\;b \leq -9.8 \cdot 10^{+67}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b \leq -2.25 \cdot 10^{-61}:\\ \;\;\;\;9 \cdot \left(\frac{y}{c} \cdot \frac{x}{z}\right)\\ \mathbf{elif}\;b \leq 6.6 \cdot 10^{-244}:\\ \;\;\;\;t \cdot \frac{-a}{\frac{c}{4}}\\ \mathbf{elif}\;b \leq 5 \cdot 10^{-214}:\\ \;\;\;\;\frac{9}{\frac{c}{x} \cdot \frac{z}{y}}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-183}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{-91}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{-24}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (/ b c) z)) (t_2 (* -4.0 (/ (* a t) c))))
   (if (<= b -9.8e+67)
     t_1
     (if (<= b -2.25e-61)
       (* 9.0 (* (/ y c) (/ x z)))
       (if (<= b 6.6e-244)
         (* t (/ (- a) (/ c 4.0)))
         (if (<= b 5e-214)
           (/ 9.0 (* (/ c x) (/ z y)))
           (if (<= b 2.6e-183)
             t_2
             (if (<= b 1.55e-91)
               (* 9.0 (* x (/ y (* c z))))
               (if (<= b 1.55e-24) t_2 t_1)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b / c) / z;
	double t_2 = -4.0 * ((a * t) / c);
	double tmp;
	if (b <= -9.8e+67) {
		tmp = t_1;
	} else if (b <= -2.25e-61) {
		tmp = 9.0 * ((y / c) * (x / z));
	} else if (b <= 6.6e-244) {
		tmp = t * (-a / (c / 4.0));
	} else if (b <= 5e-214) {
		tmp = 9.0 / ((c / x) * (z / y));
	} else if (b <= 2.6e-183) {
		tmp = t_2;
	} else if (b <= 1.55e-91) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (b <= 1.55e-24) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (b / c) / z
    t_2 = (-4.0d0) * ((a * t) / c)
    if (b <= (-9.8d+67)) then
        tmp = t_1
    else if (b <= (-2.25d-61)) then
        tmp = 9.0d0 * ((y / c) * (x / z))
    else if (b <= 6.6d-244) then
        tmp = t * (-a / (c / 4.0d0))
    else if (b <= 5d-214) then
        tmp = 9.0d0 / ((c / x) * (z / y))
    else if (b <= 2.6d-183) then
        tmp = t_2
    else if (b <= 1.55d-91) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (b <= 1.55d-24) then
        tmp = t_2
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (b / c) / z;
	double t_2 = -4.0 * ((a * t) / c);
	double tmp;
	if (b <= -9.8e+67) {
		tmp = t_1;
	} else if (b <= -2.25e-61) {
		tmp = 9.0 * ((y / c) * (x / z));
	} else if (b <= 6.6e-244) {
		tmp = t * (-a / (c / 4.0));
	} else if (b <= 5e-214) {
		tmp = 9.0 / ((c / x) * (z / y));
	} else if (b <= 2.6e-183) {
		tmp = t_2;
	} else if (b <= 1.55e-91) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (b <= 1.55e-24) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = (b / c) / z
	t_2 = -4.0 * ((a * t) / c)
	tmp = 0
	if b <= -9.8e+67:
		tmp = t_1
	elif b <= -2.25e-61:
		tmp = 9.0 * ((y / c) * (x / z))
	elif b <= 6.6e-244:
		tmp = t * (-a / (c / 4.0))
	elif b <= 5e-214:
		tmp = 9.0 / ((c / x) * (z / y))
	elif b <= 2.6e-183:
		tmp = t_2
	elif b <= 1.55e-91:
		tmp = 9.0 * (x * (y / (c * z)))
	elif b <= 1.55e-24:
		tmp = t_2
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(b / c) / z)
	t_2 = Float64(-4.0 * Float64(Float64(a * t) / c))
	tmp = 0.0
	if (b <= -9.8e+67)
		tmp = t_1;
	elseif (b <= -2.25e-61)
		tmp = Float64(9.0 * Float64(Float64(y / c) * Float64(x / z)));
	elseif (b <= 6.6e-244)
		tmp = Float64(t * Float64(Float64(-a) / Float64(c / 4.0)));
	elseif (b <= 5e-214)
		tmp = Float64(9.0 / Float64(Float64(c / x) * Float64(z / y)));
	elseif (b <= 2.6e-183)
		tmp = t_2;
	elseif (b <= 1.55e-91)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (b <= 1.55e-24)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = (b / c) / z;
	t_2 = -4.0 * ((a * t) / c);
	tmp = 0.0;
	if (b <= -9.8e+67)
		tmp = t_1;
	elseif (b <= -2.25e-61)
		tmp = 9.0 * ((y / c) * (x / z));
	elseif (b <= 6.6e-244)
		tmp = t * (-a / (c / 4.0));
	elseif (b <= 5e-214)
		tmp = 9.0 / ((c / x) * (z / y));
	elseif (b <= 2.6e-183)
		tmp = t_2;
	elseif (b <= 1.55e-91)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (b <= 1.55e-24)
		tmp = t_2;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -9.8e+67], t$95$1, If[LessEqual[b, -2.25e-61], N[(9.0 * N[(N[(y / c), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6.6e-244], N[(t * N[((-a) / N[(c / 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5e-214], N[(9.0 / N[(N[(c / x), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-183], t$95$2, If[LessEqual[b, 1.55e-91], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.55e-24], t$95$2, t$95$1]]]]]]]]]

Derivation

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

Alternative 5: 49.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} t_1 := 9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{if}\;y \leq -1.1 \cdot 10^{-6}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;y \leq -2.45 \cdot 10^{-232}:\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{-285}:\\ \;\;\;\;\frac{1}{z \cdot \frac{c}{b}}\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{-31}:\\ \;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{+110}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (* 9.0 (* x (/ y (* c z))))))
   (if (<= y -1.1e-6)
     t_1
     (if (<= y -2.45e-232)
       (* a (* -4.0 (/ t c)))
       (if (<= y 3.5e-285)
         (/ 1.0 (* z (/ c b)))
         (if (<= y 2.4e-31)
           (* (* (/ a c) t) -4.0)
           (if (<= y 1.2e+110) (/ b (* c z)) t_1)))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 9.0 * (x * (y / (c * z)));
	double tmp;
	if (y <= -1.1e-6) {
		tmp = t_1;
	} else if (y <= -2.45e-232) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 3.5e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 2.4e-31) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 1.2e+110) {
		tmp = b / (c * z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: tmp
    t_1 = 9.0d0 * (x * (y / (c * z)))
    if (y <= (-1.1d-6)) then
        tmp = t_1
    else if (y <= (-2.45d-232)) then
        tmp = a * ((-4.0d0) * (t / c))
    else if (y <= 3.5d-285) then
        tmp = 1.0d0 / (z * (c / b))
    else if (y <= 2.4d-31) then
        tmp = ((a / c) * t) * (-4.0d0)
    else if (y <= 1.2d+110) then
        tmp = b / (c * z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = 9.0 * (x * (y / (c * z)));
	double tmp;
	if (y <= -1.1e-6) {
		tmp = t_1;
	} else if (y <= -2.45e-232) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 3.5e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 2.4e-31) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 1.2e+110) {
		tmp = b / (c * z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	t_1 = 9.0 * (x * (y / (c * z)))
	tmp = 0
	if y <= -1.1e-6:
		tmp = t_1
	elif y <= -2.45e-232:
		tmp = a * (-4.0 * (t / c))
	elif y <= 3.5e-285:
		tmp = 1.0 / (z * (c / b))
	elif y <= 2.4e-31:
		tmp = ((a / c) * t) * -4.0
	elif y <= 1.2e+110:
		tmp = b / (c * z)
	else:
		tmp = t_1
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))))
	tmp = 0.0
	if (y <= -1.1e-6)
		tmp = t_1;
	elseif (y <= -2.45e-232)
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	elseif (y <= 3.5e-285)
		tmp = Float64(1.0 / Float64(z * Float64(c / b)));
	elseif (y <= 2.4e-31)
		tmp = Float64(Float64(Float64(a / c) * t) * -4.0);
	elseif (y <= 1.2e+110)
		tmp = Float64(b / Float64(c * z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = 9.0 * (x * (y / (c * z)));
	tmp = 0.0;
	if (y <= -1.1e-6)
		tmp = t_1;
	elseif (y <= -2.45e-232)
		tmp = a * (-4.0 * (t / c));
	elseif (y <= 3.5e-285)
		tmp = 1.0 / (z * (c / b));
	elseif (y <= 2.4e-31)
		tmp = ((a / c) * t) * -4.0;
	elseif (y <= 1.2e+110)
		tmp = b / (c * z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.1e-6], t$95$1, If[LessEqual[y, -2.45e-232], N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.5e-285], N[(1.0 / N[(z * N[(c / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.4e-31], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[y, 1.2e+110], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]

Derivation

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

Alternative 6: 50.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -7.5 \cdot 10^{-7}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;y \leq -9 \cdot 10^{-245}:\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{-285}:\\ \;\;\;\;\frac{1}{z \cdot \frac{c}{b}}\\ \mathbf{elif}\;y \leq 10^{-31}:\\ \;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+113}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \mathbf{else}:\\ \;\;\;\;9 \cdot \left(\frac{y}{c} \cdot \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= y -7.5e-7)
   (* 9.0 (* x (/ y (* c z))))
   (if (<= y -9e-245)
     (* a (* -4.0 (/ t c)))
     (if (<= y 3.8e-285)
       (/ 1.0 (* z (/ c b)))
       (if (<= y 1e-31)
         (* (* (/ a c) t) -4.0)
         (if (<= y 5.8e+113) (/ b (* c z)) (* 9.0 (* (/ y c) (/ x z)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -7.5e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -9e-245) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 3.8e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 1e-31) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 5.8e+113) {
		tmp = b / (c * z);
	} else {
		tmp = 9.0 * ((y / c) * (x / z));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (y <= (-7.5d-7)) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (y <= (-9d-245)) then
        tmp = a * ((-4.0d0) * (t / c))
    else if (y <= 3.8d-285) then
        tmp = 1.0d0 / (z * (c / b))
    else if (y <= 1d-31) then
        tmp = ((a / c) * t) * (-4.0d0)
    else if (y <= 5.8d+113) then
        tmp = b / (c * z)
    else
        tmp = 9.0d0 * ((y / c) * (x / z))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -7.5e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -9e-245) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 3.8e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 1e-31) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 5.8e+113) {
		tmp = b / (c * z);
	} else {
		tmp = 9.0 * ((y / c) * (x / z));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if y <= -7.5e-7:
		tmp = 9.0 * (x * (y / (c * z)))
	elif y <= -9e-245:
		tmp = a * (-4.0 * (t / c))
	elif y <= 3.8e-285:
		tmp = 1.0 / (z * (c / b))
	elif y <= 1e-31:
		tmp = ((a / c) * t) * -4.0
	elif y <= 5.8e+113:
		tmp = b / (c * z)
	else:
		tmp = 9.0 * ((y / c) * (x / z))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (y <= -7.5e-7)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (y <= -9e-245)
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	elseif (y <= 3.8e-285)
		tmp = Float64(1.0 / Float64(z * Float64(c / b)));
	elseif (y <= 1e-31)
		tmp = Float64(Float64(Float64(a / c) * t) * -4.0);
	elseif (y <= 5.8e+113)
		tmp = Float64(b / Float64(c * z));
	else
		tmp = Float64(9.0 * Float64(Float64(y / c) * Float64(x / z)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (y <= -7.5e-7)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (y <= -9e-245)
		tmp = a * (-4.0 * (t / c));
	elseif (y <= 3.8e-285)
		tmp = 1.0 / (z * (c / b));
	elseif (y <= 1e-31)
		tmp = ((a / c) * t) * -4.0;
	elseif (y <= 5.8e+113)
		tmp = b / (c * z);
	else
		tmp = 9.0 * ((y / c) * (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, -7.5e-7], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -9e-245], N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.8e-285], N[(1.0 / N[(z * N[(c / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1e-31], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[y, 5.8e+113], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(N[(y / c), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 7: 50.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -9 \cdot 10^{-7}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;y \leq -6.1 \cdot 10^{-240}:\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{-285}:\\ \;\;\;\;\frac{1}{z \cdot \frac{c}{b}}\\ \mathbf{elif}\;y \leq 1.12 \cdot 10^{-32}:\\ \;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{+110}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{9 \cdot x}{\frac{z}{\frac{y}{c}}}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= y -9e-7)
   (* 9.0 (* x (/ y (* c z))))
   (if (<= y -6.1e-240)
     (* a (* -4.0 (/ t c)))
     (if (<= y 2.2e-285)
       (/ 1.0 (* z (/ c b)))
       (if (<= y 1.12e-32)
         (* (* (/ a c) t) -4.0)
         (if (<= y 1.25e+110) (/ b (* c z)) (/ (* 9.0 x) (/ z (/ y c)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -9e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -6.1e-240) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 2.2e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 1.12e-32) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 1.25e+110) {
		tmp = b / (c * z);
	} else {
		tmp = (9.0 * x) / (z / (y / c));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (y <= (-9d-7)) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (y <= (-6.1d-240)) then
        tmp = a * ((-4.0d0) * (t / c))
    else if (y <= 2.2d-285) then
        tmp = 1.0d0 / (z * (c / b))
    else if (y <= 1.12d-32) then
        tmp = ((a / c) * t) * (-4.0d0)
    else if (y <= 1.25d+110) then
        tmp = b / (c * z)
    else
        tmp = (9.0d0 * x) / (z / (y / c))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -9e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -6.1e-240) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 2.2e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 1.12e-32) {
		tmp = ((a / c) * t) * -4.0;
	} else if (y <= 1.25e+110) {
		tmp = b / (c * z);
	} else {
		tmp = (9.0 * x) / (z / (y / c));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if y <= -9e-7:
		tmp = 9.0 * (x * (y / (c * z)))
	elif y <= -6.1e-240:
		tmp = a * (-4.0 * (t / c))
	elif y <= 2.2e-285:
		tmp = 1.0 / (z * (c / b))
	elif y <= 1.12e-32:
		tmp = ((a / c) * t) * -4.0
	elif y <= 1.25e+110:
		tmp = b / (c * z)
	else:
		tmp = (9.0 * x) / (z / (y / c))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (y <= -9e-7)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (y <= -6.1e-240)
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	elseif (y <= 2.2e-285)
		tmp = Float64(1.0 / Float64(z * Float64(c / b)));
	elseif (y <= 1.12e-32)
		tmp = Float64(Float64(Float64(a / c) * t) * -4.0);
	elseif (y <= 1.25e+110)
		tmp = Float64(b / Float64(c * z));
	else
		tmp = Float64(Float64(9.0 * x) / Float64(z / Float64(y / c)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (y <= -9e-7)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (y <= -6.1e-240)
		tmp = a * (-4.0 * (t / c));
	elseif (y <= 2.2e-285)
		tmp = 1.0 / (z * (c / b));
	elseif (y <= 1.12e-32)
		tmp = ((a / c) * t) * -4.0;
	elseif (y <= 1.25e+110)
		tmp = b / (c * z);
	else
		tmp = (9.0 * x) / (z / (y / c));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, -9e-7], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -6.1e-240], N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.2e-285], N[(1.0 / N[(z * N[(c / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.12e-32], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[y, 1.25e+110], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(9.0 * x), $MachinePrecision] / N[(z / N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 8: 50.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5.2 \cdot 10^{-7}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;y \leq -1 \cdot 10^{-231}:\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{elif}\;y \leq 1.65 \cdot 10^{-285}:\\ \;\;\;\;\frac{1}{z \cdot \frac{c}{b}}\\ \mathbf{elif}\;y \leq 3.2 \cdot 10^{-31}:\\ \;\;\;\;\frac{\frac{a \cdot -4}{c}}{\frac{1}{t}}\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+110}:\\ \;\;\;\;\frac{b}{c \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{9 \cdot x}{\frac{z}{\frac{y}{c}}}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= y -5.2e-7)
   (* 9.0 (* x (/ y (* c z))))
   (if (<= y -1e-231)
     (* a (* -4.0 (/ t c)))
     (if (<= y 1.65e-285)
       (/ 1.0 (* z (/ c b)))
       (if (<= y 3.2e-31)
         (/ (/ (* a -4.0) c) (/ 1.0 t))
         (if (<= y 1.55e+110) (/ b (* c z)) (/ (* 9.0 x) (/ z (/ y c)))))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -5.2e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -1e-231) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 1.65e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 3.2e-31) {
		tmp = ((a * -4.0) / c) / (1.0 / t);
	} else if (y <= 1.55e+110) {
		tmp = b / (c * z);
	} else {
		tmp = (9.0 * x) / (z / (y / c));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (y <= (-5.2d-7)) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (y <= (-1d-231)) then
        tmp = a * ((-4.0d0) * (t / c))
    else if (y <= 1.65d-285) then
        tmp = 1.0d0 / (z * (c / b))
    else if (y <= 3.2d-31) then
        tmp = ((a * (-4.0d0)) / c) / (1.0d0 / t)
    else if (y <= 1.55d+110) then
        tmp = b / (c * z)
    else
        tmp = (9.0d0 * x) / (z / (y / c))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -5.2e-7) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= -1e-231) {
		tmp = a * (-4.0 * (t / c));
	} else if (y <= 1.65e-285) {
		tmp = 1.0 / (z * (c / b));
	} else if (y <= 3.2e-31) {
		tmp = ((a * -4.0) / c) / (1.0 / t);
	} else if (y <= 1.55e+110) {
		tmp = b / (c * z);
	} else {
		tmp = (9.0 * x) / (z / (y / c));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if y <= -5.2e-7:
		tmp = 9.0 * (x * (y / (c * z)))
	elif y <= -1e-231:
		tmp = a * (-4.0 * (t / c))
	elif y <= 1.65e-285:
		tmp = 1.0 / (z * (c / b))
	elif y <= 3.2e-31:
		tmp = ((a * -4.0) / c) / (1.0 / t)
	elif y <= 1.55e+110:
		tmp = b / (c * z)
	else:
		tmp = (9.0 * x) / (z / (y / c))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (y <= -5.2e-7)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (y <= -1e-231)
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	elseif (y <= 1.65e-285)
		tmp = Float64(1.0 / Float64(z * Float64(c / b)));
	elseif (y <= 3.2e-31)
		tmp = Float64(Float64(Float64(a * -4.0) / c) / Float64(1.0 / t));
	elseif (y <= 1.55e+110)
		tmp = Float64(b / Float64(c * z));
	else
		tmp = Float64(Float64(9.0 * x) / Float64(z / Float64(y / c)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (y <= -5.2e-7)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (y <= -1e-231)
		tmp = a * (-4.0 * (t / c));
	elseif (y <= 1.65e-285)
		tmp = 1.0 / (z * (c / b));
	elseif (y <= 3.2e-31)
		tmp = ((a * -4.0) / c) / (1.0 / t);
	elseif (y <= 1.55e+110)
		tmp = b / (c * z);
	else
		tmp = (9.0 * x) / (z / (y / c));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, -5.2e-7], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1e-231], N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.65e-285], N[(1.0 / N[(z * N[(c / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.2e-31], N[(N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision] / N[(1.0 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.55e+110], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(9.0 * x), $MachinePrecision] / N[(z / N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

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

Alternative 9: 71.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;a \leq -3.55 \cdot 10^{-71}:\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\ \mathbf{elif}\;a \leq 1.5 \cdot 10^{-10}:\\ \;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{c \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{c}}{z} + a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= a -3.55e-71)
   (/ (+ (* -4.0 (* a t)) (/ b z)) c)
   (if (<= a 1.5e-10)
     (/ (+ b (* x (* 9.0 y))) (* c z))
     (+ (/ (/ b c) z) (* a (* -4.0 (/ t c)))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (a <= -3.55e-71) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else if (a <= 1.5e-10) {
		tmp = (b + (x * (9.0 * y))) / (c * z);
	} else {
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (a <= (-3.55d-71)) then
        tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
    else if (a <= 1.5d-10) then
        tmp = (b + (x * (9.0d0 * y))) / (c * z)
    else
        tmp = ((b / c) / z) + (a * ((-4.0d0) * (t / c)))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (a <= -3.55e-71) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else if (a <= 1.5e-10) {
		tmp = (b + (x * (9.0 * y))) / (c * z);
	} else {
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if a <= -3.55e-71:
		tmp = ((-4.0 * (a * t)) + (b / z)) / c
	elif a <= 1.5e-10:
		tmp = (b + (x * (9.0 * y))) / (c * z)
	else:
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (a <= -3.55e-71)
		tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c);
	elseif (a <= 1.5e-10)
		tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(c * z));
	else
		tmp = Float64(Float64(Float64(b / c) / z) + Float64(a * Float64(-4.0 * Float64(t / c))));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (a <= -3.55e-71)
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	elseif (a <= 1.5e-10)
		tmp = (b + (x * (9.0 * y))) / (c * z);
	else
		tmp = ((b / c) / z) + (a * (-4.0 * (t / c)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -3.55e-71], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 1.5e-10], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision] + N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 10: 74.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-85} \lor \neg \left(z \leq 1.85 \cdot 10^{+62}\right):\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{c \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= z -9.2e-85) (not (<= z 1.85e+62)))
   (/ (+ (* -4.0 (* a t)) (/ b z)) c)
   (/ (+ b (* x (* 9.0 y))) (* c z))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -9.2e-85) || !(z <= 1.85e+62)) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else {
		tmp = (b + (x * (9.0 * y))) / (c * z);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if ((z <= (-9.2d-85)) .or. (.not. (z <= 1.85d+62))) then
        tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
    else
        tmp = (b + (x * (9.0d0 * y))) / (c * z)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((z <= -9.2e-85) || !(z <= 1.85e+62)) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else {
		tmp = (b + (x * (9.0 * y))) / (c * z);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if (z <= -9.2e-85) or not (z <= 1.85e+62):
		tmp = ((-4.0 * (a * t)) + (b / z)) / c
	else:
		tmp = (b + (x * (9.0 * y))) / (c * z)
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((z <= -9.2e-85) || !(z <= 1.85e+62))
		tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c);
	else
		tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(c * z));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((z <= -9.2e-85) || ~((z <= 1.85e+62)))
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	else
		tmp = (b + (x * (9.0 * y))) / (c * z);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -9.2e-85], N[Not[LessEqual[z, 1.85e+62]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 11: 68.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{-8}:\\ \;\;\;\;9 \cdot \left(x \cdot \frac{y}{c \cdot z}\right)\\ \mathbf{elif}\;y \leq 1.85 \cdot 10^{+273}:\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \frac{b}{z}}{c}\\ \mathbf{else}:\\ \;\;\;\;9 \cdot \left(\frac{y}{c} \cdot \frac{x}{z}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= y -2.65e-8)
   (* 9.0 (* x (/ y (* c z))))
   (if (<= y 1.85e+273)
     (/ (+ (* -4.0 (* a t)) (/ b z)) c)
     (* 9.0 (* (/ y c) (/ x z))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -2.65e-8) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= 1.85e+273) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else {
		tmp = 9.0 * ((y / c) * (x / z));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (y <= (-2.65d-8)) then
        tmp = 9.0d0 * (x * (y / (c * z)))
    else if (y <= 1.85d+273) then
        tmp = (((-4.0d0) * (a * t)) + (b / z)) / c
    else
        tmp = 9.0d0 * ((y / c) * (x / z))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (y <= -2.65e-8) {
		tmp = 9.0 * (x * (y / (c * z)));
	} else if (y <= 1.85e+273) {
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	} else {
		tmp = 9.0 * ((y / c) * (x / z));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if y <= -2.65e-8:
		tmp = 9.0 * (x * (y / (c * z)))
	elif y <= 1.85e+273:
		tmp = ((-4.0 * (a * t)) + (b / z)) / c
	else:
		tmp = 9.0 * ((y / c) * (x / z))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (y <= -2.65e-8)
		tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c * z))));
	elseif (y <= 1.85e+273)
		tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(b / z)) / c);
	else
		tmp = Float64(9.0 * Float64(Float64(y / c) * Float64(x / z)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (y <= -2.65e-8)
		tmp = 9.0 * (x * (y / (c * z)));
	elseif (y <= 1.85e+273)
		tmp = ((-4.0 * (a * t)) + (b / z)) / c;
	else
		tmp = 9.0 * ((y / c) * (x / z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[y, -2.65e-8], N[(9.0 * N[(x * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.85e+273], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(9.0 * N[(N[(y / c), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 12: 50.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{+80} \lor \neg \left(b \leq 2 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{\frac{b}{c}}{z}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= b -3.6e+80) (not (<= b 2e-24)))
   (/ (/ b c) z)
   (* -4.0 (/ (* a t) c))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((b <= -3.6e+80) || !(b <= 2e-24)) {
		tmp = (b / c) / z;
	} else {
		tmp = -4.0 * ((a * t) / c);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if ((b <= (-3.6d+80)) .or. (.not. (b <= 2d-24))) then
        tmp = (b / c) / z
    else
        tmp = (-4.0d0) * ((a * t) / c)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((b <= -3.6e+80) || !(b <= 2e-24)) {
		tmp = (b / c) / z;
	} else {
		tmp = -4.0 * ((a * t) / c);
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if (b <= -3.6e+80) or not (b <= 2e-24):
		tmp = (b / c) / z
	else:
		tmp = -4.0 * ((a * t) / c)
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((b <= -3.6e+80) || !(b <= 2e-24))
		tmp = Float64(Float64(b / c) / z);
	else
		tmp = Float64(-4.0 * Float64(Float64(a * t) / c));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((b <= -3.6e+80) || ~((b <= 2e-24)))
		tmp = (b / c) / z;
	else
		tmp = -4.0 * ((a * t) / c);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[b, -3.6e+80], N[Not[LessEqual[b, 2e-24]], $MachinePrecision]], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]

Derivation

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

Alternative 13: 49.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -1.15 \cdot 10^{+52} \lor \neg \left(t \leq 6 \cdot 10^{-68}\right):\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{z}}{c}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (or (<= t -1.15e+52) (not (<= t 6e-68)))
   (* a (* -4.0 (/ t c)))
   (/ (/ b z) c)))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((t <= -1.15e+52) || !(t <= 6e-68)) {
		tmp = a * (-4.0 * (t / c));
	} else {
		tmp = (b / z) / c;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if ((t <= (-1.15d+52)) .or. (.not. (t <= 6d-68))) then
        tmp = a * ((-4.0d0) * (t / c))
    else
        tmp = (b / z) / c
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((t <= -1.15e+52) || !(t <= 6e-68)) {
		tmp = a * (-4.0 * (t / c));
	} else {
		tmp = (b / z) / c;
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if (t <= -1.15e+52) or not (t <= 6e-68):
		tmp = a * (-4.0 * (t / c))
	else:
		tmp = (b / z) / c
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if ((t <= -1.15e+52) || !(t <= 6e-68))
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	else
		tmp = Float64(Float64(b / z) / c);
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((t <= -1.15e+52) || ~((t <= 6e-68)))
		tmp = a * (-4.0 * (t / c));
	else
		tmp = (b / z) / c;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

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

Alternative 14: 49.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} [x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\ \\ \begin{array}{l} \mathbf{if}\;t \leq -9.2 \cdot 10^{+51}:\\ \;\;\;\;a \cdot \left(-4 \cdot \frac{t}{c}\right)\\ \mathbf{elif}\;t \leq 4.5 \cdot 10^{-60}:\\ \;\;\;\;\frac{\frac{b}{z}}{c}\\ \mathbf{else}:\\ \;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
 :precision binary64
 (if (<= t -9.2e+51)
   (* a (* -4.0 (/ t c)))
   (if (<= t 4.5e-60) (/ (/ b z) c) (* -4.0 (/ a (/ c t))))))

C

assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (t <= -9.2e+51) {
		tmp = a * (-4.0 * (t / c));
	} else if (t <= 4.5e-60) {
		tmp = (b / z) / c;
	} else {
		tmp = -4.0 * (a / (c / t));
	}
	return tmp;
}

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (t <= (-9.2d+51)) then
        tmp = a * ((-4.0d0) * (t / c))
    else if (t <= 4.5d-60) then
        tmp = (b / z) / c
    else
        tmp = (-4.0d0) * (a / (c / t))
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if (t <= -9.2e+51) {
		tmp = a * (-4.0 * (t / c));
	} else if (t <= 4.5e-60) {
		tmp = (b / z) / c;
	} else {
		tmp = -4.0 * (a / (c / t));
	}
	return tmp;
}

Python

[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c])
def code(x, y, z, t, a, b, c):
	tmp = 0
	if t <= -9.2e+51:
		tmp = a * (-4.0 * (t / c))
	elif t <= 4.5e-60:
		tmp = (b / z) / c
	else:
		tmp = -4.0 * (a / (c / t))
	return tmp

Julia

x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c])
function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (t <= -9.2e+51)
		tmp = Float64(a * Float64(-4.0 * Float64(t / c)));
	elseif (t <= 4.5e-60)
		tmp = Float64(Float64(b / z) / c);
	else
		tmp = Float64(-4.0 * Float64(a / Float64(c / t)));
	end
	return tmp
end

MATLAB

x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if (t <= -9.2e+51)
		tmp = a * (-4.0 * (t / c));
	elseif (t <= 4.5e-60)
		tmp = (b / z) / c;
	else
		tmp = -4.0 * (a / (c / t));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -9.2e+51], N[(a * N[(-4.0 * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4.5e-60], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

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

Alternative 15: 35.4% accurate, 3.8× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = b / (c * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

Developer target: 80.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{b}{c \cdot z}\\ t_2 := 4 \cdot \frac{a \cdot t}{c}\\ t_3 := \left(x \cdot 9\right) \cdot y\\ t_4 := \left(t_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\ t_5 := \frac{t_4}{z \cdot c}\\ t_6 := \frac{\left(t_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\ \mathbf{if}\;t_5 < -1.100156740804105 \cdot 10^{-171}:\\ \;\;\;\;t_6\\ \mathbf{elif}\;t_5 < 0:\\ \;\;\;\;\frac{\frac{t_4}{z}}{c}\\ \mathbf{elif}\;t_5 < 1.1708877911747488 \cdot 10^{-53}:\\ \;\;\;\;t_6\\ \mathbf{elif}\;t_5 < 2.876823679546137 \cdot 10^{+130}:\\ \;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t_1\right) - t_2\\ \mathbf{elif}\;t_5 < 1.3838515042456319 \cdot 10^{+158}:\\ \;\;\;\;t_6\\ \mathbf{else}:\\ \;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t_1\right) - t_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ b (* c z)))
        (t_2 (* 4.0 (/ (* a t) c)))
        (t_3 (* (* x 9.0) y))
        (t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
        (t_5 (/ t_4 (* z c)))
        (t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
   (if (< t_5 -1.100156740804105e-171)
     t_6
     (if (< t_5 0.0)
       (/ (/ t_4 z) c)
       (if (< t_5 1.1708877911747488e-53)
         t_6
         (if (< t_5 2.876823679546137e+130)
           (- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
           (if (< t_5 1.3838515042456319e+158)
             t_6
             (- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = b / (c * z);
	double t_2 = 4.0 * ((a * t) / c);
	double t_3 = (x * 9.0) * y;
	double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	double t_5 = t_4 / (z * c);
	double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	double tmp;
	if (t_5 < -1.100156740804105e-171) {
		tmp = t_6;
	} else if (t_5 < 0.0) {
		tmp = (t_4 / z) / c;
	} else if (t_5 < 1.1708877911747488e-53) {
		tmp = t_6;
	} else if (t_5 < 2.876823679546137e+130) {
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	} else if (t_5 < 1.3838515042456319e+158) {
		tmp = t_6;
	} else {
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b, c)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: t_5
    real(8) :: t_6
    real(8) :: tmp
    t_1 = b / (c * z)
    t_2 = 4.0d0 * ((a * t) / c)
    t_3 = (x * 9.0d0) * y
    t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
    t_5 = t_4 / (z * c)
    t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
    if (t_5 < (-1.100156740804105d-171)) then
        tmp = t_6
    else if (t_5 < 0.0d0) then
        tmp = (t_4 / z) / c
    else if (t_5 < 1.1708877911747488d-53) then
        tmp = t_6
    else if (t_5 < 2.876823679546137d+130) then
        tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
    else if (t_5 < 1.3838515042456319d+158) then
        tmp = t_6
    else
        tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = b / (c * z);
	double t_2 = 4.0 * ((a * t) / c);
	double t_3 = (x * 9.0) * y;
	double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	double t_5 = t_4 / (z * c);
	double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	double tmp;
	if (t_5 < -1.100156740804105e-171) {
		tmp = t_6;
	} else if (t_5 < 0.0) {
		tmp = (t_4 / z) / c;
	} else if (t_5 < 1.1708877911747488e-53) {
		tmp = t_6;
	} else if (t_5 < 2.876823679546137e+130) {
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	} else if (t_5 < 1.3838515042456319e+158) {
		tmp = t_6;
	} else {
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	t_1 = b / (c * z)
	t_2 = 4.0 * ((a * t) / c)
	t_3 = (x * 9.0) * y
	t_4 = (t_3 - (((z * 4.0) * t) * a)) + b
	t_5 = t_4 / (z * c)
	t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c)
	tmp = 0
	if t_5 < -1.100156740804105e-171:
		tmp = t_6
	elif t_5 < 0.0:
		tmp = (t_4 / z) / c
	elif t_5 < 1.1708877911747488e-53:
		tmp = t_6
	elif t_5 < 2.876823679546137e+130:
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2
	elif t_5 < 1.3838515042456319e+158:
		tmp = t_6
	else:
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(b / Float64(c * z))
	t_2 = Float64(4.0 * Float64(Float64(a * t) / c))
	t_3 = Float64(Float64(x * 9.0) * y)
	t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b)
	t_5 = Float64(t_4 / Float64(z * c))
	t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c))
	tmp = 0.0
	if (t_5 < -1.100156740804105e-171)
		tmp = t_6;
	elseif (t_5 < 0.0)
		tmp = Float64(Float64(t_4 / z) / c);
	elseif (t_5 < 1.1708877911747488e-53)
		tmp = t_6;
	elseif (t_5 < 2.876823679546137e+130)
		tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2);
	elseif (t_5 < 1.3838515042456319e+158)
		tmp = t_6;
	else
		tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	t_1 = b / (c * z);
	t_2 = 4.0 * ((a * t) / c);
	t_3 = (x * 9.0) * y;
	t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
	t_5 = t_4 / (z * c);
	t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
	tmp = 0.0;
	if (t_5 < -1.100156740804105e-171)
		tmp = t_6;
	elseif (t_5 < 0.0)
		tmp = (t_4 / z) / c;
	elseif (t_5 < 1.1708877911747488e-53)
		tmp = t_6;
	elseif (t_5 < 2.876823679546137e+130)
		tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
	elseif (t_5 < 1.3838515042456319e+158)
		tmp = t_6;
	else
		tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]

Reproduce

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

  :herbie-target
  (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) -1.100156740804105e-171) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 0.0) (/ (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.1708877911747488e-53) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 2.876823679546137e+130) (- (+ (* (* 9.0 (/ y c)) (/ x z)) (/ b (* c z))) (* 4.0 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.3838515042456319e+158) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (- (+ (* 9.0 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4.0 (/ (* a t) c))))))))

  (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))