
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z 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);
}
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
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);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
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
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
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]
\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}
Sampling outcomes in binary64 precision:
Herbie found 12 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z 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);
}
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
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);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
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
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
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]
\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}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (* y (* x 9.0))))
(if (<= t_1 -5e+266)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= t_1 2e+167)
(/ (+ (* t (* -4.0 a)) (/ (- b (* x (* y -9.0))) z)) c)
(*
y
(-
(/ (fma (* a (/ t c)) -4.0 (/ b (* z c))) y)
(* x (/ -9.0 (* z c)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = y * (x * 9.0);
double tmp;
if (t_1 <= -5e+266) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (t_1 <= 2e+167) {
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
} else {
tmp = y * ((fma((a * (t / c)), -4.0, (b / (z * c))) / y) - (x * (-9.0 / (z * c))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -5e+266) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (t_1 <= 2e+167) tmp = Float64(Float64(Float64(t * Float64(-4.0 * a)) + Float64(Float64(b - Float64(x * Float64(y * -9.0))) / z)) / c); else tmp = Float64(y * Float64(Float64(fma(Float64(a * Float64(t / c)), -4.0, Float64(b / Float64(z * c))) / y) - Float64(x * Float64(-9.0 / Float64(z * c))))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+266], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+167], N[(N[(N[(t * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] + N[(N[(b - N[(x * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(y * N[(N[(N[(N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision] * -4.0 + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] - N[(x * N[(-9.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+266}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+167}:\\
\;\;\;\;\frac{t \cdot \left(-4 \cdot a\right) + \frac{b - x \cdot \left(y \cdot -9\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(\frac{\mathsf{fma}\left(a \cdot \frac{t}{c}, -4, \frac{b}{z \cdot c}\right)}{y} - x \cdot \frac{-9}{z \cdot c}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e266Initial program 44.2%
Simplified43.8%
*-un-lft-identity43.8%
*-commutative43.8%
times-frac44.5%
+-commutative44.5%
Applied egg-rr44.5%
associate-*l/44.5%
*-un-lft-identity44.5%
Applied egg-rr44.5%
Taylor expanded in x around inf 48.0%
*-commutative48.0%
times-frac88.8%
Simplified88.8%
if -4.9999999999999999e266 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2.0000000000000001e167Initial program 78.0%
Simplified84.3%
*-un-lft-identity84.3%
*-commutative84.3%
times-frac87.6%
+-commutative87.6%
Applied egg-rr87.6%
associate-*l/87.7%
*-un-lft-identity87.7%
Applied egg-rr87.7%
Taylor expanded in b around 0 91.8%
Taylor expanded in z around -inf 92.4%
mul-1-neg92.4%
unsub-neg92.4%
associate-*r*92.4%
*-commutative92.4%
mul-1-neg92.4%
unsub-neg92.4%
*-commutative92.4%
associate-*r*92.4%
Simplified92.4%
if 2.0000000000000001e167 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.0%
associate-+l-67.0%
*-commutative67.0%
associate-*r*63.0%
*-commutative63.0%
associate-+l-63.0%
associate-*l*63.0%
associate-*l*63.4%
*-commutative63.4%
Simplified63.4%
Taylor expanded in y around -inf 74.2%
mul-1-neg74.2%
*-commutative74.2%
distribute-rgt-neg-in74.2%
Simplified77.3%
Final simplification90.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (* -4.0 (/ (* t a) c))) (t_2 (/ (/ b c) z)))
(if (<= b -8.5e+132)
t_2
(if (<= b -6.5e+78)
t_1
(if (<= b -3.5e+37)
t_2
(if (<= b 6e-259)
t_1
(if (<= b 2.25e-205)
(* y (* (/ x z) (/ 9.0 c)))
(if (<= b 1.1e-105)
t_1
(if (<= b 2.1e+80)
(* 9.0 (* x (/ y (* z c))))
(/ b (* z c)))))))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = -4.0 * ((t * a) / c);
double t_2 = (b / c) / z;
double tmp;
if (b <= -8.5e+132) {
tmp = t_2;
} else if (b <= -6.5e+78) {
tmp = t_1;
} else if (b <= -3.5e+37) {
tmp = t_2;
} else if (b <= 6e-259) {
tmp = t_1;
} else if (b <= 2.25e-205) {
tmp = y * ((x / z) * (9.0 / c));
} else if (b <= 1.1e-105) {
tmp = t_1;
} else if (b <= 2.1e+80) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = (-4.0d0) * ((t * a) / c)
t_2 = (b / c) / z
if (b <= (-8.5d+132)) then
tmp = t_2
else if (b <= (-6.5d+78)) then
tmp = t_1
else if (b <= (-3.5d+37)) then
tmp = t_2
else if (b <= 6d-259) then
tmp = t_1
else if (b <= 2.25d-205) then
tmp = y * ((x / z) * (9.0d0 / c))
else if (b <= 1.1d-105) then
tmp = t_1
else if (b <= 2.1d+80) then
tmp = 9.0d0 * (x * (y / (z * c)))
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = -4.0 * ((t * a) / c);
double t_2 = (b / c) / z;
double tmp;
if (b <= -8.5e+132) {
tmp = t_2;
} else if (b <= -6.5e+78) {
tmp = t_1;
} else if (b <= -3.5e+37) {
tmp = t_2;
} else if (b <= 6e-259) {
tmp = t_1;
} else if (b <= 2.25e-205) {
tmp = y * ((x / z) * (9.0 / c));
} else if (b <= 1.1e-105) {
tmp = t_1;
} else if (b <= 2.1e+80) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 = -4.0 * ((t * a) / c) t_2 = (b / c) / z tmp = 0 if b <= -8.5e+132: tmp = t_2 elif b <= -6.5e+78: tmp = t_1 elif b <= -3.5e+37: tmp = t_2 elif b <= 6e-259: tmp = t_1 elif b <= 2.25e-205: tmp = y * ((x / z) * (9.0 / c)) elif b <= 1.1e-105: tmp = t_1 elif b <= 2.1e+80: tmp = 9.0 * (x * (y / (z * c))) else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(-4.0 * Float64(Float64(t * a) / c)) t_2 = Float64(Float64(b / c) / z) tmp = 0.0 if (b <= -8.5e+132) tmp = t_2; elseif (b <= -6.5e+78) tmp = t_1; elseif (b <= -3.5e+37) tmp = t_2; elseif (b <= 6e-259) tmp = t_1; elseif (b <= 2.25e-205) tmp = Float64(y * Float64(Float64(x / z) * Float64(9.0 / c))); elseif (b <= 1.1e-105) tmp = t_1; elseif (b <= 2.1e+80) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = -4.0 * ((t * a) / c);
t_2 = (b / c) / z;
tmp = 0.0;
if (b <= -8.5e+132)
tmp = t_2;
elseif (b <= -6.5e+78)
tmp = t_1;
elseif (b <= -3.5e+37)
tmp = t_2;
elseif (b <= 6e-259)
tmp = t_1;
elseif (b <= 2.25e-205)
tmp = y * ((x / z) * (9.0 / c));
elseif (b <= 1.1e-105)
tmp = t_1;
elseif (b <= 2.1e+80)
tmp = 9.0 * (x * (y / (z * c)));
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(-4.0 * N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[b, -8.5e+132], t$95$2, If[LessEqual[b, -6.5e+78], t$95$1, If[LessEqual[b, -3.5e+37], t$95$2, If[LessEqual[b, 6e-259], t$95$1, If[LessEqual[b, 2.25e-205], N[(y * N[(N[(x / z), $MachinePrecision] * N[(9.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.1e-105], t$95$1, If[LessEqual[b, 2.1e+80], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{t \cdot a}{c}\\
t_2 := \frac{\frac{b}{c}}{z}\\
\mathbf{if}\;b \leq -8.5 \cdot 10^{+132}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq -6.5 \cdot 10^{+78}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq -3.5 \cdot 10^{+37}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq 6 \cdot 10^{-259}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 2.25 \cdot 10^{-205}:\\
\;\;\;\;y \cdot \left(\frac{x}{z} \cdot \frac{9}{c}\right)\\
\mathbf{elif}\;b \leq 1.1 \cdot 10^{-105}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 2.1 \cdot 10^{+80}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if b < -8.49999999999999969e132 or -6.50000000000000036e78 < b < -3.5e37Initial program 76.5%
Simplified85.0%
*-un-lft-identity85.0%
*-commutative85.0%
times-frac81.1%
+-commutative81.1%
Applied egg-rr81.1%
associate-*l/81.2%
*-un-lft-identity81.2%
Applied egg-rr81.2%
Taylor expanded in b around inf 78.6%
associate-/r*78.8%
Simplified78.8%
if -8.49999999999999969e132 < b < -6.50000000000000036e78 or -3.5e37 < b < 6.0000000000000004e-259 or 2.24999999999999978e-205 < b < 1.10000000000000002e-105Initial program 72.3%
associate-+l-72.3%
*-commutative72.3%
associate-*r*71.2%
*-commutative71.2%
associate-+l-71.2%
associate-*l*71.2%
associate-*l*74.7%
*-commutative74.7%
Simplified74.7%
Taylor expanded in z around inf 58.5%
*-commutative58.5%
Simplified58.5%
if 6.0000000000000004e-259 < b < 2.24999999999999978e-205Initial program 78.1%
Simplified78.5%
*-un-lft-identity78.5%
*-commutative78.5%
times-frac83.8%
+-commutative83.8%
Applied egg-rr83.8%
associate-*l/84.0%
*-un-lft-identity84.0%
Applied egg-rr84.0%
Taylor expanded in x around inf 73.2%
associate-*r/73.4%
associate-*r*73.4%
associate-*l/73.3%
associate-*r/73.4%
*-commutative73.4%
associate-*r/73.3%
*-commutative73.3%
*-commutative73.3%
times-frac68.3%
Simplified68.3%
if 1.10000000000000002e-105 < b < 2.10000000000000001e80Initial program 70.5%
associate-+l-70.5%
*-commutative70.5%
associate-*r*75.8%
*-commutative75.8%
associate-+l-75.8%
associate-*l*75.7%
associate-*l*78.4%
*-commutative78.4%
Simplified78.4%
Taylor expanded in x around inf 43.1%
associate-/l*53.5%
*-commutative53.5%
Simplified53.5%
if 2.10000000000000001e80 < b Initial program 73.5%
associate-+l-73.5%
*-commutative73.5%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.6%
associate-*l*77.8%
*-commutative77.8%
Simplified77.8%
Taylor expanded in b around inf 59.8%
*-commutative59.8%
Simplified59.8%
Final simplification62.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (* y (* x 9.0))))
(if (<= t_1 -5e+266)
(* 9.0 (* (/ x z) (/ y c)))
(if (<= t_1 1e+184)
(/ (+ (* t (* -4.0 a)) (/ (- b (* x (* y -9.0))) z)) c)
(/
(* x (+ (* -4.0 (* t (/ a x))) (+ (* 9.0 (/ y z)) (/ b (* x z)))))
c)))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = y * (x * 9.0);
double tmp;
if (t_1 <= -5e+266) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (t_1 <= 1e+184) {
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
} else {
tmp = (x * ((-4.0 * (t * (a / x))) + ((9.0 * (y / z)) + (b / (x * z))))) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = y * (x * 9.0d0)
if (t_1 <= (-5d+266)) then
tmp = 9.0d0 * ((x / z) * (y / c))
else if (t_1 <= 1d+184) then
tmp = ((t * ((-4.0d0) * a)) + ((b - (x * (y * (-9.0d0)))) / z)) / c
else
tmp = (x * (((-4.0d0) * (t * (a / x))) + ((9.0d0 * (y / z)) + (b / (x * z))))) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = y * (x * 9.0);
double tmp;
if (t_1 <= -5e+266) {
tmp = 9.0 * ((x / z) * (y / c));
} else if (t_1 <= 1e+184) {
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
} else {
tmp = (x * ((-4.0 * (t * (a / x))) + ((9.0 * (y / z)) + (b / (x * z))))) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 = y * (x * 9.0) tmp = 0 if t_1 <= -5e+266: tmp = 9.0 * ((x / z) * (y / c)) elif t_1 <= 1e+184: tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c else: tmp = (x * ((-4.0 * (t * (a / x))) + ((9.0 * (y / z)) + (b / (x * z))))) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -5e+266) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); elseif (t_1 <= 1e+184) tmp = Float64(Float64(Float64(t * Float64(-4.0 * a)) + Float64(Float64(b - Float64(x * Float64(y * -9.0))) / z)) / c); else tmp = Float64(Float64(x * Float64(Float64(-4.0 * Float64(t * Float64(a / x))) + Float64(Float64(9.0 * Float64(y / z)) + Float64(b / Float64(x * z))))) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = y * (x * 9.0);
tmp = 0.0;
if (t_1 <= -5e+266)
tmp = 9.0 * ((x / z) * (y / c));
elseif (t_1 <= 1e+184)
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
else
tmp = (x * ((-4.0 * (t * (a / x))) + ((9.0 * (y / z)) + (b / (x * z))))) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+266], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+184], N[(N[(N[(t * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] + N[(N[(b - N[(x * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(x * N[(N[(-4.0 * N[(t * N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+266}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+184}:\\
\;\;\;\;\frac{t \cdot \left(-4 \cdot a\right) + \frac{b - x \cdot \left(y \cdot -9\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot \left(-4 \cdot \left(t \cdot \frac{a}{x}\right) + \left(9 \cdot \frac{y}{z} + \frac{b}{x \cdot z}\right)\right)}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e266Initial program 44.2%
Simplified43.8%
*-un-lft-identity43.8%
*-commutative43.8%
times-frac44.5%
+-commutative44.5%
Applied egg-rr44.5%
associate-*l/44.5%
*-un-lft-identity44.5%
Applied egg-rr44.5%
Taylor expanded in x around inf 48.0%
*-commutative48.0%
times-frac88.8%
Simplified88.8%
if -4.9999999999999999e266 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000002e184Initial program 77.7%
Simplified83.8%
*-un-lft-identity83.8%
*-commutative83.8%
times-frac87.5%
+-commutative87.5%
Applied egg-rr87.5%
associate-*l/87.6%
*-un-lft-identity87.6%
Applied egg-rr87.6%
Taylor expanded in b around 0 91.1%
Taylor expanded in z around -inf 92.1%
mul-1-neg92.1%
unsub-neg92.1%
associate-*r*92.1%
*-commutative92.1%
mul-1-neg92.1%
unsub-neg92.1%
*-commutative92.1%
associate-*r*92.1%
Simplified92.1%
if 1.00000000000000002e184 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 66.9%
Simplified66.9%
*-un-lft-identity66.9%
*-commutative66.9%
times-frac69.7%
+-commutative69.7%
Applied egg-rr69.7%
associate-*l/69.7%
*-un-lft-identity69.7%
Applied egg-rr69.7%
Taylor expanded in x around inf 78.0%
associate-/l*82.5%
Applied egg-rr82.5%
associate-*r/78.0%
*-commutative78.0%
associate-/l*73.4%
Simplified73.4%
Final simplification90.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (/ (+ (* -4.0 (* t a)) (/ b z)) c))
(t_2 (* 9.0 (* (/ x z) (/ y c)))))
(if (<= y -9.6e+93)
t_2
(if (<= y 1.7e+44)
t_1
(if (<= y 6.8e+74)
(* y (* (/ x z) (/ 9.0 c)))
(if (<= y 2.25e+192) t_1 t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = ((-4.0 * (t * a)) + (b / z)) / c;
double t_2 = 9.0 * ((x / z) * (y / c));
double tmp;
if (y <= -9.6e+93) {
tmp = t_2;
} else if (y <= 1.7e+44) {
tmp = t_1;
} else if (y <= 6.8e+74) {
tmp = y * ((x / z) * (9.0 / c));
} else if (y <= 2.25e+192) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = (((-4.0d0) * (t * a)) + (b / z)) / c
t_2 = 9.0d0 * ((x / z) * (y / c))
if (y <= (-9.6d+93)) then
tmp = t_2
else if (y <= 1.7d+44) then
tmp = t_1
else if (y <= 6.8d+74) then
tmp = y * ((x / z) * (9.0d0 / c))
else if (y <= 2.25d+192) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = ((-4.0 * (t * a)) + (b / z)) / c;
double t_2 = 9.0 * ((x / z) * (y / c));
double tmp;
if (y <= -9.6e+93) {
tmp = t_2;
} else if (y <= 1.7e+44) {
tmp = t_1;
} else if (y <= 6.8e+74) {
tmp = y * ((x / z) * (9.0 / c));
} else if (y <= 2.25e+192) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 = ((-4.0 * (t * a)) + (b / z)) / c t_2 = 9.0 * ((x / z) * (y / c)) tmp = 0 if y <= -9.6e+93: tmp = t_2 elif y <= 1.7e+44: tmp = t_1 elif y <= 6.8e+74: tmp = y * ((x / z) * (9.0 / c)) elif y <= 2.25e+192: tmp = t_1 else: tmp = t_2 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(Float64(-4.0 * Float64(t * a)) + Float64(b / z)) / c) t_2 = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))) tmp = 0.0 if (y <= -9.6e+93) tmp = t_2; elseif (y <= 1.7e+44) tmp = t_1; elseif (y <= 6.8e+74) tmp = Float64(y * Float64(Float64(x / z) * Float64(9.0 / c))); elseif (y <= 2.25e+192) tmp = t_1; else tmp = t_2; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = ((-4.0 * (t * a)) + (b / z)) / c;
t_2 = 9.0 * ((x / z) * (y / c));
tmp = 0.0;
if (y <= -9.6e+93)
tmp = t_2;
elseif (y <= 1.7e+44)
tmp = t_1;
elseif (y <= 6.8e+74)
tmp = y * ((x / z) * (9.0 / c));
elseif (y <= 2.25e+192)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, Block[{t$95$2 = N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9.6e+93], t$95$2, If[LessEqual[y, 1.7e+44], t$95$1, If[LessEqual[y, 6.8e+74], N[(y * N[(N[(x / z), $MachinePrecision] * N[(9.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.25e+192], t$95$1, t$95$2]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{-4 \cdot \left(t \cdot a\right) + \frac{b}{z}}{c}\\
t_2 := 9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{if}\;y \leq -9.6 \cdot 10^{+93}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;y \leq 1.7 \cdot 10^{+44}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 6.8 \cdot 10^{+74}:\\
\;\;\;\;y \cdot \left(\frac{x}{z} \cdot \frac{9}{c}\right)\\
\mathbf{elif}\;y \leq 2.25 \cdot 10^{+192}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if y < -9.60000000000000042e93 or 2.25e192 < y Initial program 62.9%
Simplified67.4%
*-un-lft-identity67.4%
*-commutative67.4%
times-frac70.6%
+-commutative70.6%
Applied egg-rr70.6%
associate-*l/70.6%
*-un-lft-identity70.6%
Applied egg-rr70.6%
Taylor expanded in x around inf 48.5%
*-commutative48.5%
times-frac63.0%
Simplified63.0%
if -9.60000000000000042e93 < y < 1.7e44 or 6.7999999999999998e74 < y < 2.25e192Initial program 79.0%
Simplified84.4%
*-un-lft-identity84.4%
*-commutative84.4%
times-frac87.3%
+-commutative87.3%
Applied egg-rr87.3%
associate-*l/87.4%
*-un-lft-identity87.4%
Applied egg-rr87.4%
Taylor expanded in b around 0 89.5%
Taylor expanded in x around 0 76.9%
if 1.7e44 < y < 6.7999999999999998e74Initial program 63.8%
Simplified63.8%
*-un-lft-identity63.8%
*-commutative63.8%
times-frac76.9%
+-commutative76.9%
Applied egg-rr76.9%
associate-*l/76.7%
*-un-lft-identity76.7%
Applied egg-rr76.7%
Taylor expanded in x around inf 51.0%
associate-*r/51.0%
associate-*r*51.0%
associate-*l/51.2%
associate-*r/51.2%
*-commutative51.2%
associate-*r/51.2%
*-commutative51.2%
*-commutative51.2%
times-frac62.7%
Simplified62.7%
Final simplification72.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 z) (/ y c)))))
(if (<= y -1.8e-91)
t_1
(if (<= y 1.6e-125)
(* -4.0 (* a (/ t c)))
(if (<= y 3.4e-38)
(/ (/ b c) z)
(if (<= y 1.35e+44) (* -4.0 (/ (* t a) c)) t_1))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 / z) * (y / c));
double tmp;
if (y <= -1.8e-91) {
tmp = t_1;
} else if (y <= 1.6e-125) {
tmp = -4.0 * (a * (t / c));
} else if (y <= 3.4e-38) {
tmp = (b / c) / z;
} else if (y <= 1.35e+44) {
tmp = -4.0 * ((t * a) / c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 / z) * (y / c))
if (y <= (-1.8d-91)) then
tmp = t_1
else if (y <= 1.6d-125) then
tmp = (-4.0d0) * (a * (t / c))
else if (y <= 3.4d-38) then
tmp = (b / c) / z
else if (y <= 1.35d+44) then
tmp = (-4.0d0) * ((t * a) / c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 / z) * (y / c));
double tmp;
if (y <= -1.8e-91) {
tmp = t_1;
} else if (y <= 1.6e-125) {
tmp = -4.0 * (a * (t / c));
} else if (y <= 3.4e-38) {
tmp = (b / c) / z;
} else if (y <= 1.35e+44) {
tmp = -4.0 * ((t * a) / c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 / z) * (y / c)) tmp = 0 if y <= -1.8e-91: tmp = t_1 elif y <= 1.6e-125: tmp = -4.0 * (a * (t / c)) elif y <= 3.4e-38: tmp = (b / c) / z elif y <= 1.35e+44: tmp = -4.0 * ((t * a) / c) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(Float64(x / z) * Float64(y / c))) tmp = 0.0 if (y <= -1.8e-91) tmp = t_1; elseif (y <= 1.6e-125) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); elseif (y <= 3.4e-38) tmp = Float64(Float64(b / c) / z); elseif (y <= 1.35e+44) tmp = Float64(-4.0 * Float64(Float64(t * a) / c)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 / z) * (y / c));
tmp = 0.0;
if (y <= -1.8e-91)
tmp = t_1;
elseif (y <= 1.6e-125)
tmp = -4.0 * (a * (t / c));
elseif (y <= 3.4e-38)
tmp = (b / c) / z;
elseif (y <= 1.35e+44)
tmp = -4.0 * ((t * a) / c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.8e-91], t$95$1, If[LessEqual[y, 1.6e-125], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.4e-38], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[y, 1.35e+44], N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{if}\;y \leq -1.8 \cdot 10^{-91}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 1.6 \cdot 10^{-125}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{elif}\;y \leq 3.4 \cdot 10^{-38}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;y \leq 1.35 \cdot 10^{+44}:\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if y < -1.8e-91 or 1.35e44 < y Initial program 68.4%
Simplified73.4%
*-un-lft-identity73.4%
*-commutative73.4%
times-frac76.5%
+-commutative76.5%
Applied egg-rr76.5%
associate-*l/76.5%
*-un-lft-identity76.5%
Applied egg-rr76.5%
Taylor expanded in x around inf 44.3%
*-commutative44.3%
times-frac53.4%
Simplified53.4%
if -1.8e-91 < y < 1.5999999999999999e-125Initial program 81.0%
Simplified86.5%
*-un-lft-identity86.5%
*-commutative86.5%
times-frac88.1%
+-commutative88.1%
Applied egg-rr88.1%
Taylor expanded in z around inf 52.7%
associate-/l*51.4%
Simplified51.4%
if 1.5999999999999999e-125 < y < 3.4000000000000002e-38Initial program 76.0%
Simplified76.0%
*-un-lft-identity76.0%
*-commutative76.0%
times-frac85.6%
+-commutative85.6%
Applied egg-rr85.6%
associate-*l/85.7%
*-un-lft-identity85.7%
Applied egg-rr85.7%
Taylor expanded in b around inf 47.1%
associate-/r*42.5%
Simplified42.5%
if 3.4000000000000002e-38 < y < 1.35e44Initial program 84.9%
associate-+l-84.9%
*-commutative84.9%
associate-*r*85.1%
*-commutative85.1%
associate-+l-85.1%
associate-*l*85.1%
associate-*l*92.6%
*-commutative92.6%
Simplified92.6%
Taylor expanded in z around inf 48.1%
*-commutative48.1%
Simplified48.1%
Final simplification51.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (* -4.0 (/ (* t a) c))) (t_2 (/ (/ b c) z)))
(if (<= b -1e+133)
t_2
(if (<= b -8.4e+77)
t_1
(if (<= b -6.5e+36) t_2 (if (<= b 5.6e+55) t_1 (/ b (* z c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = -4.0 * ((t * a) / c);
double t_2 = (b / c) / z;
double tmp;
if (b <= -1e+133) {
tmp = t_2;
} else if (b <= -8.4e+77) {
tmp = t_1;
} else if (b <= -6.5e+36) {
tmp = t_2;
} else if (b <= 5.6e+55) {
tmp = t_1;
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = (-4.0d0) * ((t * a) / c)
t_2 = (b / c) / z
if (b <= (-1d+133)) then
tmp = t_2
else if (b <= (-8.4d+77)) then
tmp = t_1
else if (b <= (-6.5d+36)) then
tmp = t_2
else if (b <= 5.6d+55) then
tmp = t_1
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = -4.0 * ((t * a) / c);
double t_2 = (b / c) / z;
double tmp;
if (b <= -1e+133) {
tmp = t_2;
} else if (b <= -8.4e+77) {
tmp = t_1;
} else if (b <= -6.5e+36) {
tmp = t_2;
} else if (b <= 5.6e+55) {
tmp = t_1;
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 = -4.0 * ((t * a) / c) t_2 = (b / c) / z tmp = 0 if b <= -1e+133: tmp = t_2 elif b <= -8.4e+77: tmp = t_1 elif b <= -6.5e+36: tmp = t_2 elif b <= 5.6e+55: tmp = t_1 else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(-4.0 * Float64(Float64(t * a) / c)) t_2 = Float64(Float64(b / c) / z) tmp = 0.0 if (b <= -1e+133) tmp = t_2; elseif (b <= -8.4e+77) tmp = t_1; elseif (b <= -6.5e+36) tmp = t_2; elseif (b <= 5.6e+55) tmp = t_1; else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = -4.0 * ((t * a) / c);
t_2 = (b / c) / z;
tmp = 0.0;
if (b <= -1e+133)
tmp = t_2;
elseif (b <= -8.4e+77)
tmp = t_1;
elseif (b <= -6.5e+36)
tmp = t_2;
elseif (b <= 5.6e+55)
tmp = t_1;
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(-4.0 * N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[b, -1e+133], t$95$2, If[LessEqual[b, -8.4e+77], t$95$1, If[LessEqual[b, -6.5e+36], t$95$2, If[LessEqual[b, 5.6e+55], t$95$1, N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{t \cdot a}{c}\\
t_2 := \frac{\frac{b}{c}}{z}\\
\mathbf{if}\;b \leq -1 \cdot 10^{+133}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq -8.4 \cdot 10^{+77}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq -6.5 \cdot 10^{+36}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq 5.6 \cdot 10^{+55}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if b < -1e133 or -8.3999999999999995e77 < b < -6.4999999999999998e36Initial program 76.5%
Simplified85.0%
*-un-lft-identity85.0%
*-commutative85.0%
times-frac81.1%
+-commutative81.1%
Applied egg-rr81.1%
associate-*l/81.2%
*-un-lft-identity81.2%
Applied egg-rr81.2%
Taylor expanded in b around inf 78.6%
associate-/r*78.8%
Simplified78.8%
if -1e133 < b < -8.3999999999999995e77 or -6.4999999999999998e36 < b < 5.6000000000000002e55Initial program 71.7%
associate-+l-71.7%
*-commutative71.7%
associate-*r*72.2%
*-commutative72.2%
associate-+l-72.2%
associate-*l*72.2%
associate-*l*75.2%
*-commutative75.2%
Simplified75.2%
Taylor expanded in z around inf 51.3%
*-commutative51.3%
Simplified51.3%
if 5.6000000000000002e55 < b Initial program 76.1%
associate-+l-76.1%
*-commutative76.1%
associate-*r*78.1%
*-commutative78.1%
associate-+l-78.1%
associate-*l*78.1%
associate-*l*80.1%
*-commutative80.1%
Simplified80.1%
Taylor expanded in b around inf 59.9%
*-commutative59.9%
Simplified59.9%
Final simplification57.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 (* x 9.0)) -5e+266) (* 9.0 (* (/ x z) (/ y c))) (/ (+ (* t (* -4.0 a)) (/ (- b (* x (* y -9.0))) z)) c)))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 * (x * 9.0)) <= -5e+266) {
tmp = 9.0 * ((x / z) * (y / c));
} else {
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 * (x * 9.0d0)) <= (-5d+266)) then
tmp = 9.0d0 * ((x / z) * (y / c))
else
tmp = ((t * ((-4.0d0) * a)) + ((b - (x * (y * (-9.0d0)))) / z)) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 * (x * 9.0)) <= -5e+266) {
tmp = 9.0 * ((x / z) * (y / c));
} else {
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 * (x * 9.0)) <= -5e+266: tmp = 9.0 * ((x / z) * (y / c)) else: tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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 (Float64(y * Float64(x * 9.0)) <= -5e+266) tmp = Float64(9.0 * Float64(Float64(x / z) * Float64(y / c))); else tmp = Float64(Float64(Float64(t * Float64(-4.0 * a)) + Float64(Float64(b - Float64(x * Float64(y * -9.0))) / z)) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 * (x * 9.0)) <= -5e+266)
tmp = 9.0 * ((x / z) * (y / c));
else
tmp = ((t * (-4.0 * a)) + ((b - (x * (y * -9.0))) / z)) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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[N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision], -5e+266], N[(9.0 * N[(N[(x / z), $MachinePrecision] * N[(y / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] + N[(N[(b - N[(x * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot \left(x \cdot 9\right) \leq -5 \cdot 10^{+266}:\\
\;\;\;\;9 \cdot \left(\frac{x}{z} \cdot \frac{y}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot \left(-4 \cdot a\right) + \frac{b - x \cdot \left(y \cdot -9\right)}{z}}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999999e266Initial program 44.2%
Simplified43.8%
*-un-lft-identity43.8%
*-commutative43.8%
times-frac44.5%
+-commutative44.5%
Applied egg-rr44.5%
associate-*l/44.5%
*-un-lft-identity44.5%
Applied egg-rr44.5%
Taylor expanded in x around inf 48.0%
*-commutative48.0%
times-frac88.8%
Simplified88.8%
if -4.9999999999999999e266 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.7%
Simplified82.2%
*-un-lft-identity82.2%
*-commutative82.2%
times-frac85.8%
+-commutative85.8%
Applied egg-rr85.8%
associate-*l/85.9%
*-un-lft-identity85.9%
Applied egg-rr85.9%
Taylor expanded in b around 0 88.2%
Taylor expanded in z around -inf 89.5%
mul-1-neg89.5%
unsub-neg89.5%
associate-*r*89.5%
*-commutative89.5%
mul-1-neg89.5%
unsub-neg89.5%
*-commutative89.5%
associate-*r*89.5%
Simplified89.5%
Final simplification89.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (* -4.0 (* t a))))
(if (<= b -0.55)
(/ (+ t_1 (/ b z)) c)
(if (<= b 5.2e+105)
(/ (+ t_1 (* (/ y z) (* x 9.0))) c)
(/ (+ b (* 9.0 (* x y))) (* z c))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = -4.0 * (t * a);
double tmp;
if (b <= -0.55) {
tmp = (t_1 + (b / z)) / c;
} else if (b <= 5.2e+105) {
tmp = (t_1 + ((y / z) * (x * 9.0))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = (-4.0d0) * (t * a)
if (b <= (-0.55d0)) then
tmp = (t_1 + (b / z)) / c
else if (b <= 5.2d+105) then
tmp = (t_1 + ((y / z) * (x * 9.0d0))) / c
else
tmp = (b + (9.0d0 * (x * y))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = -4.0 * (t * a);
double tmp;
if (b <= -0.55) {
tmp = (t_1 + (b / z)) / c;
} else if (b <= 5.2e+105) {
tmp = (t_1 + ((y / z) * (x * 9.0))) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 = -4.0 * (t * a) tmp = 0 if b <= -0.55: tmp = (t_1 + (b / z)) / c elif b <= 5.2e+105: tmp = (t_1 + ((y / z) * (x * 9.0))) / c else: tmp = (b + (9.0 * (x * y))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(-4.0 * Float64(t * a)) tmp = 0.0 if (b <= -0.55) tmp = Float64(Float64(t_1 + Float64(b / z)) / c); elseif (b <= 5.2e+105) tmp = Float64(Float64(t_1 + Float64(Float64(y / z) * Float64(x * 9.0))) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = -4.0 * (t * a);
tmp = 0.0;
if (b <= -0.55)
tmp = (t_1 + (b / z)) / c;
elseif (b <= 5.2e+105)
tmp = (t_1 + ((y / z) * (x * 9.0))) / c;
else
tmp = (b + (9.0 * (x * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -0.55], N[(N[(t$95$1 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[b, 5.2e+105], N[(N[(t$95$1 + N[(N[(y / z), $MachinePrecision] * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a\right)\\
\mathbf{if}\;b \leq -0.55:\\
\;\;\;\;\frac{t\_1 + \frac{b}{z}}{c}\\
\mathbf{elif}\;b \leq 5.2 \cdot 10^{+105}:\\
\;\;\;\;\frac{t\_1 + \frac{y}{z} \cdot \left(x \cdot 9\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if b < -0.55000000000000004Initial program 72.6%
Simplified80.1%
*-un-lft-identity80.1%
*-commutative80.1%
times-frac83.3%
+-commutative83.3%
Applied egg-rr83.3%
associate-*l/83.4%
*-un-lft-identity83.4%
Applied egg-rr83.4%
Taylor expanded in b around 0 81.7%
Taylor expanded in x around 0 79.3%
if -0.55000000000000004 < b < 5.2000000000000004e105Initial program 71.8%
Simplified75.5%
*-un-lft-identity75.5%
*-commutative75.5%
times-frac81.4%
+-commutative81.4%
Applied egg-rr81.4%
associate-*l/81.4%
*-un-lft-identity81.4%
Applied egg-rr81.4%
Taylor expanded in b around 0 85.6%
Taylor expanded in x around inf 79.4%
associate-*r/82.4%
associate-*r*82.4%
Simplified82.4%
if 5.2000000000000004e105 < b Initial program 81.6%
associate-+l-81.6%
*-commutative81.6%
associate-*r*84.1%
*-commutative84.1%
associate-+l-84.1%
associate-*l*84.1%
associate-*l*86.7%
*-commutative86.7%
Simplified86.7%
Taylor expanded in x around inf 75.1%
Final simplification80.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 -8e-38) (not (<= z 8e+114))) (/ (+ (* -4.0 (* t a)) (/ b z)) c) (/ (+ b (* 9.0 (* x y))) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -8e-38) || !(z <= 8e+114)) {
tmp = ((-4.0 * (t * a)) + (b / z)) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-8d-38)) .or. (.not. (z <= 8d+114))) then
tmp = (((-4.0d0) * (t * a)) + (b / z)) / c
else
tmp = (b + (9.0d0 * (x * y))) / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -8e-38) || !(z <= 8e+114)) {
tmp = ((-4.0 * (t * a)) + (b / z)) / c;
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 <= -8e-38) or not (z <= 8e+114): tmp = ((-4.0 * (t * a)) + (b / z)) / c else: tmp = (b + (9.0 * (x * y))) / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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 <= -8e-38) || !(z <= 8e+114)) tmp = Float64(Float64(Float64(-4.0 * Float64(t * a)) + Float64(b / z)) / c); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -8e-38) || ~((z <= 8e+114)))
tmp = ((-4.0 * (t * a)) + (b / z)) / c;
else
tmp = (b + (9.0 * (x * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -8e-38], N[Not[LessEqual[z, 8e+114]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{-38} \lor \neg \left(z \leq 8 \cdot 10^{+114}\right):\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right) + \frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -7.9999999999999997e-38 or 8e114 < z Initial program 54.4%
Simplified65.7%
*-un-lft-identity65.7%
*-commutative65.7%
times-frac76.8%
+-commutative76.8%
Applied egg-rr76.8%
associate-*l/76.9%
*-un-lft-identity76.9%
Applied egg-rr76.9%
Taylor expanded in b around 0 83.9%
Taylor expanded in x around 0 77.5%
if -7.9999999999999997e-38 < z < 8e114Initial program 90.1%
associate-+l-90.1%
*-commutative90.1%
associate-*r*91.5%
*-commutative91.5%
associate-+l-91.5%
associate-*l*91.5%
associate-*l*89.4%
*-commutative89.4%
Simplified89.4%
Taylor expanded in x around inf 76.6%
Final simplification77.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 -7.2e-37) (not (<= z 1.3e+123))) (* -4.0 (/ (* t a) c)) (* 9.0 (* x (/ y (* z c))))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -7.2e-37) || !(z <= 1.3e+123)) {
tmp = -4.0 * ((t * a) / c);
} else {
tmp = 9.0 * (x * (y / (z * c)));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-7.2d-37)) .or. (.not. (z <= 1.3d+123))) then
tmp = (-4.0d0) * ((t * a) / c)
else
tmp = 9.0d0 * (x * (y / (z * c)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -7.2e-37) || !(z <= 1.3e+123)) {
tmp = -4.0 * ((t * a) / c);
} else {
tmp = 9.0 * (x * (y / (z * c)));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 <= -7.2e-37) or not (z <= 1.3e+123): tmp = -4.0 * ((t * a) / c) else: tmp = 9.0 * (x * (y / (z * c))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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 <= -7.2e-37) || !(z <= 1.3e+123)) tmp = Float64(-4.0 * Float64(Float64(t * a) / c)); else tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -7.2e-37) || ~((z <= 1.3e+123)))
tmp = -4.0 * ((t * a) / c);
else
tmp = 9.0 * (x * (y / (z * c)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -7.2e-37], N[Not[LessEqual[z, 1.3e+123]], $MachinePrecision]], N[(-4.0 * N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -7.2 \cdot 10^{-37} \lor \neg \left(z \leq 1.3 \cdot 10^{+123}\right):\\
\;\;\;\;-4 \cdot \frac{t \cdot a}{c}\\
\mathbf{else}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\end{array}
\end{array}
if z < -7.20000000000000014e-37 or 1.29999999999999993e123 < z Initial program 54.9%
associate-+l-54.9%
*-commutative54.9%
associate-*r*57.3%
*-commutative57.3%
associate-+l-57.3%
associate-*l*57.3%
associate-*l*64.6%
*-commutative64.6%
Simplified64.6%
Taylor expanded in z around inf 60.3%
*-commutative60.3%
Simplified60.3%
if -7.20000000000000014e-37 < z < 1.29999999999999993e123Initial program 89.5%
associate-+l-89.5%
*-commutative89.5%
associate-*r*90.8%
*-commutative90.8%
associate-+l-90.8%
associate-*l*90.8%
associate-*l*88.7%
*-commutative88.7%
Simplified88.7%
Taylor expanded in x around inf 48.3%
associate-/l*52.4%
*-commutative52.4%
Simplified52.4%
Final simplification56.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 (<= b -2.85e+35) (/ (/ b c) z) (if (<= b 4.4e+38) (* -4.0 (* a (/ t c))) (/ b (* z c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -2.85e+35) {
tmp = (b / c) / z;
} else if (b <= 4.4e+38) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-2.85d+35)) then
tmp = (b / c) / z
else if (b <= 4.4d+38) then
tmp = (-4.0d0) * (a * (t / c))
else
tmp = b / (z * c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -2.85e+35) {
tmp = (b / c) / z;
} else if (b <= 4.4e+38) {
tmp = -4.0 * (a * (t / c));
} else {
tmp = b / (z * c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 <= -2.85e+35: tmp = (b / c) / z elif b <= 4.4e+38: tmp = -4.0 * (a * (t / c)) else: tmp = b / (z * c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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 <= -2.85e+35) tmp = Float64(Float64(b / c) / z); elseif (b <= 4.4e+38) tmp = Float64(-4.0 * Float64(a * Float64(t / c))); else tmp = Float64(b / Float64(z * c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -2.85e+35)
tmp = (b / c) / z;
elseif (b <= 4.4e+38)
tmp = -4.0 * (a * (t / c));
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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[b, -2.85e+35], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[b, 4.4e+38], N[(-4.0 * N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -2.85 \cdot 10^{+35}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;b \leq 4.4 \cdot 10^{+38}:\\
\;\;\;\;-4 \cdot \left(a \cdot \frac{t}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if b < -2.84999999999999997e35Initial program 71.8%
Simplified78.5%
*-un-lft-identity78.5%
*-commutative78.5%
times-frac81.9%
+-commutative81.9%
Applied egg-rr81.9%
associate-*l/82.0%
*-un-lft-identity82.0%
Applied egg-rr82.0%
Taylor expanded in b around inf 67.0%
associate-/r*67.1%
Simplified67.1%
if -2.84999999999999997e35 < b < 4.40000000000000013e38Initial program 73.2%
Simplified77.2%
*-un-lft-identity77.2%
*-commutative77.2%
times-frac82.8%
+-commutative82.8%
Applied egg-rr82.8%
Taylor expanded in z around inf 51.1%
associate-/l*51.1%
Simplified51.1%
if 4.40000000000000013e38 < b Initial program 75.7%
associate-+l-75.7%
*-commutative75.7%
associate-*r*79.3%
*-commutative79.3%
associate-+l-79.3%
associate-*l*79.3%
associate-*l*81.2%
*-commutative81.2%
Simplified81.2%
Taylor expanded in b around inf 56.7%
*-commutative56.7%
Simplified56.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 73.4%
associate-+l-73.4%
*-commutative73.4%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*77.5%
*-commutative77.5%
Simplified77.5%
Taylor expanded in b around inf 35.8%
*-commutative35.8%
Simplified35.8%
(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))))))))
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;
}
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
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;
}
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
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
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
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]]]]]]]]]]]]
\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}
herbie shell --seed 2024094
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(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)))