
(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 13 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.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -6e+64)
(fma (* a (/ t c)) -4.0 (fma 9.0 (* (/ x c) (/ y z)) (/ b (* z c))))
(if (<= z 2.8e+99)
(/ (fma x (* 9.0 y) (+ b (* (* a -4.0) (* z t)))) (* z c))
(/ (- (/ b z) (* a (* t 4.0))) 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 <= -6e+64) {
tmp = fma((a * (t / c)), -4.0, fma(9.0, ((x / c) * (y / z)), (b / (z * c))));
} else if (z <= 2.8e+99) {
tmp = fma(x, (9.0 * y), (b + ((a * -4.0) * (z * t)))) / (z * c);
} else {
tmp = ((b / z) - (a * (t * 4.0))) / c;
}
return tmp;
}
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 <= -6e+64) tmp = fma(Float64(a * Float64(t / c)), -4.0, fma(9.0, Float64(Float64(x / c) * Float64(y / z)), Float64(b / Float64(z * c)))); elseif (z <= 2.8e+99) tmp = Float64(fma(x, Float64(9.0 * y), Float64(b + Float64(Float64(a * -4.0) * Float64(z * t)))) / Float64(z * c)); else tmp = Float64(Float64(Float64(b / z) - Float64(a * Float64(t * 4.0))) / c); end return tmp end
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[z, -6e+64], N[(N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision] * -4.0 + N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.8e+99], N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(b + N[(N[(a * -4.0), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / z), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\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 -6 \cdot 10^{+64}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \frac{t}{c}, -4, \mathsf{fma}\left(9, \frac{x}{c} \cdot \frac{y}{z}, \frac{b}{z \cdot c}\right)\right)\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+99}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b + \left(a \cdot -4\right) \cdot \left(z \cdot t\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} - a \cdot \left(t \cdot 4\right)}{c}\\
\end{array}
\end{array}
if z < -6.0000000000000004e64Initial program 59.8%
associate-+l-59.8%
*-commutative59.8%
associate-*r*64.8%
*-commutative64.8%
associate-+l-64.8%
associate-*l*64.8%
associate-*l*65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in x around 0 79.9%
cancel-sign-sub-inv79.9%
metadata-eval79.9%
+-commutative79.9%
*-commutative79.9%
fma-define79.9%
associate-/l*78.6%
fma-define78.6%
times-frac89.8%
*-commutative89.8%
Simplified89.8%
if -6.0000000000000004e64 < z < 2.8e99Initial program 96.3%
associate-+l-96.3%
*-commutative96.3%
associate-*r*95.2%
*-commutative95.2%
associate-+l-95.2%
associate-*l*95.2%
associate-*l*92.7%
*-commutative92.7%
Simplified92.7%
Taylor expanded in c around 0 96.3%
Simplified96.3%
fma-undefine96.3%
Applied egg-rr96.3%
if 2.8e99 < z Initial program 58.0%
associate-+l-58.0%
*-commutative58.0%
associate-*r*67.1%
*-commutative67.1%
associate-+l-67.1%
associate-*l*67.2%
associate-*l*69.3%
*-commutative69.3%
Simplified69.3%
Taylor expanded in c around 0 58.1%
Simplified58.1%
Taylor expanded in x around 0 48.6%
associate-*r*59.8%
*-commutative59.8%
associate-/l/65.8%
metadata-eval65.8%
cancel-sign-sub-inv65.8%
div-sub65.8%
associate-*r*65.8%
associate-*l/80.9%
associate-/l*80.9%
*-inverses80.9%
metadata-eval80.9%
*-commutative80.9%
associate-*l*80.9%
Simplified80.9%
Final simplification92.2%
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 -2.4e+181) (not (<= z 1.25e+109))) (/ (- (/ b z) (* a (* t 4.0))) c) (/ (+ b (fma x (* 9.0 y) (* t (* a (* z -4.0))))) (* 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 <= -2.4e+181) || !(z <= 1.25e+109)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + fma(x, (9.0 * y), (t * (a * (z * -4.0))))) / (z * c);
}
return tmp;
}
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 <= -2.4e+181) || !(z <= 1.25e+109)) tmp = Float64(Float64(Float64(b / z) - Float64(a * Float64(t * 4.0))) / c); else tmp = Float64(Float64(b + fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.4e+181], N[Not[LessEqual[z, 1.25e+109]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.4 \cdot 10^{+181} \lor \neg \left(z \leq 1.25 \cdot 10^{+109}\right):\\
\;\;\;\;\frac{\frac{b}{z} - a \cdot \left(t \cdot 4\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.40000000000000002e181 or 1.25e109 < z Initial program 55.6%
associate-+l-55.6%
*-commutative55.6%
associate-*r*61.2%
*-commutative61.2%
associate-+l-61.2%
associate-*l*61.2%
associate-*l*62.9%
*-commutative62.9%
Simplified62.9%
Taylor expanded in c around 0 55.7%
Simplified55.7%
Taylor expanded in x around 0 49.8%
associate-*r*57.1%
*-commutative57.1%
associate-/l/62.0%
metadata-eval62.0%
cancel-sign-sub-inv62.0%
div-sub61.9%
associate-*r*61.9%
associate-*l/80.8%
associate-/l*80.8%
*-inverses80.8%
metadata-eval80.8%
*-commutative80.8%
associate-*l*80.8%
Simplified80.8%
if -2.40000000000000002e181 < z < 1.25e109Initial program 92.3%
Simplified92.9%
Final simplification89.8%
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 (/ (* a t) c))) (t_2 (* 9.0 (* x (/ y (* z c))))))
(if (<= x -8e+83)
(* 9.0 (* (/ x c) (/ y z)))
(if (<= x -1.3e+54)
t_1
(if (<= x -4.4e+14)
t_2
(if (<= x -4.8e-98)
(/ (/ b z) c)
(if (<= x -2.8e-141)
t_1
(if (<= x 2.05e-27) (/ b (* z c)) t_2))))))))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 * ((a * t) / c);
double t_2 = 9.0 * (x * (y / (z * c)));
double tmp;
if (x <= -8e+83) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= -1.3e+54) {
tmp = t_1;
} else if (x <= -4.4e+14) {
tmp = t_2;
} else if (x <= -4.8e-98) {
tmp = (b / z) / c;
} else if (x <= -2.8e-141) {
tmp = t_1;
} else if (x <= 2.05e-27) {
tmp = b / (z * c);
} 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.
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) * ((a * t) / c)
t_2 = 9.0d0 * (x * (y / (z * c)))
if (x <= (-8d+83)) then
tmp = 9.0d0 * ((x / c) * (y / z))
else if (x <= (-1.3d+54)) then
tmp = t_1
else if (x <= (-4.4d+14)) then
tmp = t_2
else if (x <= (-4.8d-98)) then
tmp = (b / z) / c
else if (x <= (-2.8d-141)) then
tmp = t_1
else if (x <= 2.05d-27) then
tmp = b / (z * c)
else
tmp = t_2
end if
code = tmp
end function
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 * ((a * t) / c);
double t_2 = 9.0 * (x * (y / (z * c)));
double tmp;
if (x <= -8e+83) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (x <= -1.3e+54) {
tmp = t_1;
} else if (x <= -4.4e+14) {
tmp = t_2;
} else if (x <= -4.8e-98) {
tmp = (b / z) / c;
} else if (x <= -2.8e-141) {
tmp = t_1;
} else if (x <= 2.05e-27) {
tmp = b / (z * c);
} else {
tmp = t_2;
}
return tmp;
}
[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 * ((a * t) / c) t_2 = 9.0 * (x * (y / (z * c))) tmp = 0 if x <= -8e+83: tmp = 9.0 * ((x / c) * (y / z)) elif x <= -1.3e+54: tmp = t_1 elif x <= -4.4e+14: tmp = t_2 elif x <= -4.8e-98: tmp = (b / z) / c elif x <= -2.8e-141: tmp = t_1 elif x <= 2.05e-27: tmp = b / (z * c) else: tmp = t_2 return tmp
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(a * t) / c)) t_2 = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))) tmp = 0.0 if (x <= -8e+83) tmp = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))); elseif (x <= -1.3e+54) tmp = t_1; elseif (x <= -4.4e+14) tmp = t_2; elseif (x <= -4.8e-98) tmp = Float64(Float64(b / z) / c); elseif (x <= -2.8e-141) tmp = t_1; elseif (x <= 2.05e-27) tmp = Float64(b / Float64(z * c)); else tmp = t_2; end return tmp end
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 * ((a * t) / c);
t_2 = 9.0 * (x * (y / (z * c)));
tmp = 0.0;
if (x <= -8e+83)
tmp = 9.0 * ((x / c) * (y / z));
elseif (x <= -1.3e+54)
tmp = t_1;
elseif (x <= -4.4e+14)
tmp = t_2;
elseif (x <= -4.8e-98)
tmp = (b / z) / c;
elseif (x <= -2.8e-141)
tmp = t_1;
elseif (x <= 2.05e-27)
tmp = b / (z * c);
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8e+83], N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.3e+54], t$95$1, If[LessEqual[x, -4.4e+14], t$95$2, If[LessEqual[x, -4.8e-98], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[x, -2.8e-141], t$95$1, If[LessEqual[x, 2.05e-27], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
t_2 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{if}\;x \leq -8 \cdot 10^{+83}:\\
\;\;\;\;9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{elif}\;x \leq -1.3 \cdot 10^{+54}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -4.4 \cdot 10^{+14}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq -4.8 \cdot 10^{-98}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;x \leq -2.8 \cdot 10^{-141}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 2.05 \cdot 10^{-27}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -8.00000000000000025e83Initial program 84.7%
associate-+l-84.7%
*-commutative84.7%
associate-*r*84.6%
*-commutative84.6%
associate-+l-84.6%
associate-*l*84.6%
associate-*l*84.7%
*-commutative84.7%
Simplified84.7%
Taylor expanded in x around inf 63.1%
times-frac68.7%
Simplified68.7%
if -8.00000000000000025e83 < x < -1.30000000000000003e54 or -4.8000000000000001e-98 < x < -2.80000000000000012e-141Initial program 79.0%
associate-+l-79.0%
*-commutative79.0%
associate-*r*79.0%
*-commutative79.0%
associate-+l-79.0%
associate-*l*79.0%
associate-*l*79.0%
*-commutative79.0%
Simplified79.0%
Taylor expanded in z around inf 66.4%
if -1.30000000000000003e54 < x < -4.4e14 or 2.0499999999999999e-27 < x Initial program 81.5%
associate-+l-81.4%
*-commutative81.4%
associate-*r*85.5%
*-commutative85.5%
associate-+l-85.5%
associate-*l*85.5%
associate-*l*80.3%
*-commutative80.3%
Simplified80.3%
Taylor expanded in x around inf 48.6%
times-frac48.7%
Simplified48.7%
Taylor expanded in x around 0 48.6%
*-commutative48.6%
associate-/l*52.4%
Simplified52.4%
if -4.4e14 < x < -4.8000000000000001e-98Initial program 87.7%
associate-+l-87.7%
*-commutative87.7%
associate-*r*88.0%
*-commutative88.0%
associate-+l-88.0%
associate-*l*88.0%
associate-*l*90.9%
*-commutative90.9%
Simplified90.9%
Taylor expanded in c around 0 87.7%
Simplified87.7%
fma-undefine87.7%
Applied egg-rr87.7%
Taylor expanded in b around inf 57.5%
associate-/l/57.4%
Simplified57.4%
if -2.80000000000000012e-141 < x < 2.0499999999999999e-27Initial program 81.7%
associate-+l-81.7%
*-commutative81.7%
associate-*r*83.8%
*-commutative83.8%
associate-+l-83.8%
associate-*l*83.9%
associate-*l*84.3%
*-commutative84.3%
Simplified84.3%
Taylor expanded in b around inf 51.5%
*-commutative51.5%
Simplified51.5%
Final simplification56.8%
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 y) (/ x (* z c)))) (t_2 (* -4.0 (/ (* a t) c))))
(if (<= z -3.7e+143)
t_2
(if (<= z -3.5e+107)
t_1
(if (<= z -435.0)
(/ (/ b z) c)
(if (<= z -4.8e-298)
t_1
(if (<= z 8.3e-227)
(* b (/ 1.0 (* z c)))
(if (<= z 2200000.0) (* 9.0 (/ y (* c (/ z x)))) t_2))))))))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 * y) * (x / (z * c));
double t_2 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -3.7e+143) {
tmp = t_2;
} else if (z <= -3.5e+107) {
tmp = t_1;
} else if (z <= -435.0) {
tmp = (b / z) / c;
} else if (z <= -4.8e-298) {
tmp = t_1;
} else if (z <= 8.3e-227) {
tmp = b * (1.0 / (z * c));
} else if (z <= 2200000.0) {
tmp = 9.0 * (y / (c * (z / x)));
} 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.
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 = (9.0d0 * y) * (x / (z * c))
t_2 = (-4.0d0) * ((a * t) / c)
if (z <= (-3.7d+143)) then
tmp = t_2
else if (z <= (-3.5d+107)) then
tmp = t_1
else if (z <= (-435.0d0)) then
tmp = (b / z) / c
else if (z <= (-4.8d-298)) then
tmp = t_1
else if (z <= 8.3d-227) then
tmp = b * (1.0d0 / (z * c))
else if (z <= 2200000.0d0) then
tmp = 9.0d0 * (y / (c * (z / x)))
else
tmp = t_2
end if
code = tmp
end function
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 * y) * (x / (z * c));
double t_2 = -4.0 * ((a * t) / c);
double tmp;
if (z <= -3.7e+143) {
tmp = t_2;
} else if (z <= -3.5e+107) {
tmp = t_1;
} else if (z <= -435.0) {
tmp = (b / z) / c;
} else if (z <= -4.8e-298) {
tmp = t_1;
} else if (z <= 8.3e-227) {
tmp = b * (1.0 / (z * c));
} else if (z <= 2200000.0) {
tmp = 9.0 * (y / (c * (z / x)));
} else {
tmp = t_2;
}
return tmp;
}
[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 * y) * (x / (z * c)) t_2 = -4.0 * ((a * t) / c) tmp = 0 if z <= -3.7e+143: tmp = t_2 elif z <= -3.5e+107: tmp = t_1 elif z <= -435.0: tmp = (b / z) / c elif z <= -4.8e-298: tmp = t_1 elif z <= 8.3e-227: tmp = b * (1.0 / (z * c)) elif z <= 2200000.0: tmp = 9.0 * (y / (c * (z / x))) else: tmp = t_2 return tmp
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(9.0 * y) * Float64(x / Float64(z * c))) t_2 = Float64(-4.0 * Float64(Float64(a * t) / c)) tmp = 0.0 if (z <= -3.7e+143) tmp = t_2; elseif (z <= -3.5e+107) tmp = t_1; elseif (z <= -435.0) tmp = Float64(Float64(b / z) / c); elseif (z <= -4.8e-298) tmp = t_1; elseif (z <= 8.3e-227) tmp = Float64(b * Float64(1.0 / Float64(z * c))); elseif (z <= 2200000.0) tmp = Float64(9.0 * Float64(y / Float64(c * Float64(z / x)))); else tmp = t_2; end return tmp end
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 * y) * (x / (z * c));
t_2 = -4.0 * ((a * t) / c);
tmp = 0.0;
if (z <= -3.7e+143)
tmp = t_2;
elseif (z <= -3.5e+107)
tmp = t_1;
elseif (z <= -435.0)
tmp = (b / z) / c;
elseif (z <= -4.8e-298)
tmp = t_1;
elseif (z <= 8.3e-227)
tmp = b * (1.0 / (z * c));
elseif (z <= 2200000.0)
tmp = 9.0 * (y / (c * (z / x)));
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * y), $MachinePrecision] * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.7e+143], t$95$2, If[LessEqual[z, -3.5e+107], t$95$1, If[LessEqual[z, -435.0], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -4.8e-298], t$95$1, If[LessEqual[z, 8.3e-227], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2200000.0], N[(9.0 * N[(y / N[(c * N[(z / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot y\right) \cdot \frac{x}{z \cdot c}\\
t_2 := -4 \cdot \frac{a \cdot t}{c}\\
\mathbf{if}\;z \leq -3.7 \cdot 10^{+143}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq -3.5 \cdot 10^{+107}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq -435:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq -4.8 \cdot 10^{-298}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.3 \cdot 10^{-227}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{elif}\;z \leq 2200000:\\
\;\;\;\;9 \cdot \frac{y}{c \cdot \frac{z}{x}}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if z < -3.7000000000000002e143 or 2.2e6 < z Initial program 63.3%
associate-+l-63.3%
*-commutative63.3%
associate-*r*67.3%
*-commutative67.3%
associate-+l-67.3%
associate-*l*67.4%
associate-*l*70.6%
*-commutative70.6%
Simplified70.6%
Taylor expanded in z around inf 60.7%
if -3.7000000000000002e143 < z < -3.4999999999999997e107 or -435 < z < -4.79999999999999975e-298Initial program 95.5%
associate-+l-95.5%
*-commutative95.5%
associate-*r*95.5%
*-commutative95.5%
associate-+l-95.5%
associate-*l*95.5%
associate-*l*93.2%
*-commutative93.2%
Simplified93.2%
Taylor expanded in c around 0 95.5%
Simplified95.5%
Taylor expanded in x around inf 62.1%
*-commutative62.1%
*-commutative62.1%
associate-/l*66.2%
associate-*r*66.2%
Simplified66.2%
if -3.4999999999999997e107 < z < -435Initial program 83.1%
associate-+l-83.1%
*-commutative83.1%
associate-*r*87.7%
*-commutative87.7%
associate-+l-87.7%
associate-*l*87.7%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in c around 0 83.1%
Simplified83.1%
fma-undefine83.1%
Applied egg-rr83.1%
Taylor expanded in b around inf 70.8%
associate-/l/71.0%
Simplified71.0%
if -4.79999999999999975e-298 < z < 8.2999999999999996e-227Initial program 99.9%
associate-+l-99.9%
*-commutative99.9%
associate-*r*99.9%
*-commutative99.9%
associate-+l-99.9%
associate-*l*99.9%
associate-*l*89.8%
*-commutative89.8%
Simplified89.8%
Taylor expanded in b around inf 69.0%
*-commutative69.0%
Simplified69.0%
div-inv72.2%
Applied egg-rr72.2%
if 8.2999999999999996e-227 < z < 2.2e6Initial program 93.4%
associate-+l-93.4%
*-commutative93.4%
associate-*r*93.5%
*-commutative93.5%
associate-+l-93.5%
associate-*l*93.5%
associate-*l*89.2%
*-commutative89.2%
Simplified89.2%
Taylor expanded in x around inf 52.8%
times-frac50.7%
Simplified50.7%
clear-num50.7%
frac-times52.8%
*-un-lft-identity52.8%
Applied egg-rr52.8%
*-commutative52.8%
associate-*r/52.8%
*-commutative52.8%
associate-/l*52.8%
Simplified52.8%
Final simplification62.9%
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 (/ (* a t) c))))
(if (<= z -4.3e+144)
t_1
(if (<= z -1.26e+103)
(* (/ y z) (/ (* 9.0 x) c))
(if (<= z -190.0)
(/ (/ b z) c)
(if (<= z -1.55e-298)
(* (* 9.0 y) (/ x (* z c)))
(if (<= z 2.2e-222)
(* b (/ 1.0 (* z c)))
(if (<= z 650000000.0) (* 9.0 (/ y (* c (/ z x)))) t_1))))))))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 * ((a * t) / c);
double tmp;
if (z <= -4.3e+144) {
tmp = t_1;
} else if (z <= -1.26e+103) {
tmp = (y / z) * ((9.0 * x) / c);
} else if (z <= -190.0) {
tmp = (b / z) / c;
} else if (z <= -1.55e-298) {
tmp = (9.0 * y) * (x / (z * c));
} else if (z <= 2.2e-222) {
tmp = b * (1.0 / (z * c));
} else if (z <= 650000000.0) {
tmp = 9.0 * (y / (c * (z / x)));
} 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.
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) * ((a * t) / c)
if (z <= (-4.3d+144)) then
tmp = t_1
else if (z <= (-1.26d+103)) then
tmp = (y / z) * ((9.0d0 * x) / c)
else if (z <= (-190.0d0)) then
tmp = (b / z) / c
else if (z <= (-1.55d-298)) then
tmp = (9.0d0 * y) * (x / (z * c))
else if (z <= 2.2d-222) then
tmp = b * (1.0d0 / (z * c))
else if (z <= 650000000.0d0) then
tmp = 9.0d0 * (y / (c * (z / x)))
else
tmp = t_1
end if
code = tmp
end function
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 * ((a * t) / c);
double tmp;
if (z <= -4.3e+144) {
tmp = t_1;
} else if (z <= -1.26e+103) {
tmp = (y / z) * ((9.0 * x) / c);
} else if (z <= -190.0) {
tmp = (b / z) / c;
} else if (z <= -1.55e-298) {
tmp = (9.0 * y) * (x / (z * c));
} else if (z <= 2.2e-222) {
tmp = b * (1.0 / (z * c));
} else if (z <= 650000000.0) {
tmp = 9.0 * (y / (c * (z / x)));
} else {
tmp = t_1;
}
return tmp;
}
[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 * ((a * t) / c) tmp = 0 if z <= -4.3e+144: tmp = t_1 elif z <= -1.26e+103: tmp = (y / z) * ((9.0 * x) / c) elif z <= -190.0: tmp = (b / z) / c elif z <= -1.55e-298: tmp = (9.0 * y) * (x / (z * c)) elif z <= 2.2e-222: tmp = b * (1.0 / (z * c)) elif z <= 650000000.0: tmp = 9.0 * (y / (c * (z / x))) else: tmp = t_1 return tmp
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(a * t) / c)) tmp = 0.0 if (z <= -4.3e+144) tmp = t_1; elseif (z <= -1.26e+103) tmp = Float64(Float64(y / z) * Float64(Float64(9.0 * x) / c)); elseif (z <= -190.0) tmp = Float64(Float64(b / z) / c); elseif (z <= -1.55e-298) tmp = Float64(Float64(9.0 * y) * Float64(x / Float64(z * c))); elseif (z <= 2.2e-222) tmp = Float64(b * Float64(1.0 / Float64(z * c))); elseif (z <= 650000000.0) tmp = Float64(9.0 * Float64(y / Float64(c * Float64(z / x)))); else tmp = t_1; end return tmp end
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 * ((a * t) / c);
tmp = 0.0;
if (z <= -4.3e+144)
tmp = t_1;
elseif (z <= -1.26e+103)
tmp = (y / z) * ((9.0 * x) / c);
elseif (z <= -190.0)
tmp = (b / z) / c;
elseif (z <= -1.55e-298)
tmp = (9.0 * y) * (x / (z * c));
elseif (z <= 2.2e-222)
tmp = b * (1.0 / (z * c));
elseif (z <= 650000000.0)
tmp = 9.0 * (y / (c * (z / x)));
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.3e+144], t$95$1, If[LessEqual[z, -1.26e+103], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 * x), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -190.0], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -1.55e-298], N[(N[(9.0 * y), $MachinePrecision] * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.2e-222], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 650000000.0], N[(9.0 * N[(y / N[(c * N[(z / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
\mathbf{if}\;z \leq -4.3 \cdot 10^{+144}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq -1.26 \cdot 10^{+103}:\\
\;\;\;\;\frac{y}{z} \cdot \frac{9 \cdot x}{c}\\
\mathbf{elif}\;z \leq -190:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;z \leq -1.55 \cdot 10^{-298}:\\
\;\;\;\;\left(9 \cdot y\right) \cdot \frac{x}{z \cdot c}\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{-222}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{elif}\;z \leq 650000000:\\
\;\;\;\;9 \cdot \frac{y}{c \cdot \frac{z}{x}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.29999999999999984e144 or 6.5e8 < z Initial program 63.3%
associate-+l-63.3%
*-commutative63.3%
associate-*r*67.3%
*-commutative67.3%
associate-+l-67.3%
associate-*l*67.4%
associate-*l*70.6%
*-commutative70.6%
Simplified70.6%
Taylor expanded in z around inf 60.7%
if -4.29999999999999984e144 < z < -1.26000000000000006e103Initial program 81.2%
associate-+l-81.2%
*-commutative81.2%
associate-*r*81.2%
*-commutative81.2%
associate-+l-81.2%
associate-*l*81.2%
associate-*l*71.2%
*-commutative71.2%
Simplified71.2%
Taylor expanded in x around inf 71.3%
associate-*r/71.1%
associate-*r*71.1%
*-commutative71.1%
Simplified71.1%
*-commutative71.1%
times-frac87.2%
*-commutative87.2%
Applied egg-rr87.2%
if -1.26000000000000006e103 < z < -190Initial program 83.1%
associate-+l-83.1%
*-commutative83.1%
associate-*r*87.7%
*-commutative87.7%
associate-+l-87.7%
associate-*l*87.7%
associate-*l*91.7%
*-commutative91.7%
Simplified91.7%
Taylor expanded in c around 0 83.1%
Simplified83.1%
fma-undefine83.1%
Applied egg-rr83.1%
Taylor expanded in b around inf 70.8%
associate-/l/71.0%
Simplified71.0%
if -190 < z < -1.5500000000000001e-298Initial program 96.7%
associate-+l-96.7%
*-commutative96.7%
associate-*r*96.7%
*-commutative96.7%
associate-+l-96.7%
associate-*l*96.7%
associate-*l*95.0%
*-commutative95.0%
Simplified95.0%
Taylor expanded in c around 0 96.6%
Simplified96.7%
Taylor expanded in x around inf 61.3%
*-commutative61.3%
*-commutative61.3%
associate-/l*65.9%
associate-*r*65.8%
Simplified65.8%
if -1.5500000000000001e-298 < z < 2.2e-222Initial program 99.9%
associate-+l-99.9%
*-commutative99.9%
associate-*r*99.9%
*-commutative99.9%
associate-+l-99.9%
associate-*l*99.9%
associate-*l*89.8%
*-commutative89.8%
Simplified89.8%
Taylor expanded in b around inf 69.0%
*-commutative69.0%
Simplified69.0%
div-inv72.2%
Applied egg-rr72.2%
if 2.2e-222 < z < 6.5e8Initial program 93.4%
associate-+l-93.4%
*-commutative93.4%
associate-*r*93.5%
*-commutative93.5%
associate-+l-93.5%
associate-*l*93.5%
associate-*l*89.2%
*-commutative89.2%
Simplified89.2%
Taylor expanded in x around inf 52.8%
times-frac50.7%
Simplified50.7%
clear-num50.7%
frac-times52.8%
*-un-lft-identity52.8%
Applied egg-rr52.8%
*-commutative52.8%
associate-*r/52.8%
*-commutative52.8%
associate-/l*52.8%
Simplified52.8%
Final simplification63.3%
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 -1.4e+145)
(and (not (<= z 2e+14)) (or (<= z 1.02e+84) (not (<= z 2.1e+111)))))
(* -4.0 (/ (* a t) c))
(/ (+ b (* x (* 9.0 y))) (* 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 <= -1.4e+145) || (!(z <= 2e+14) && ((z <= 1.02e+84) || !(z <= 2.1e+111)))) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
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 <= (-1.4d+145)) .or. (.not. (z <= 2d+14)) .and. (z <= 1.02d+84) .or. (.not. (z <= 2.1d+111))) then
tmp = (-4.0d0) * ((a * t) / c)
else
tmp = (b + (x * (9.0d0 * y))) / (z * c)
end if
code = tmp
end function
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 <= -1.4e+145) || (!(z <= 2e+14) && ((z <= 1.02e+84) || !(z <= 2.1e+111)))) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
[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 <= -1.4e+145) or (not (z <= 2e+14) and ((z <= 1.02e+84) or not (z <= 2.1e+111))): tmp = -4.0 * ((a * t) / c) else: tmp = (b + (x * (9.0 * y))) / (z * c) return tmp
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 <= -1.4e+145) || (!(z <= 2e+14) && ((z <= 1.02e+84) || !(z <= 2.1e+111)))) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); else tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)); end return tmp end
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 <= -1.4e+145) || (~((z <= 2e+14)) && ((z <= 1.02e+84) || ~((z <= 2.1e+111)))))
tmp = -4.0 * ((a * t) / c);
else
tmp = (b + (x * (9.0 * 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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.4e+145], And[N[Not[LessEqual[z, 2e+14]], $MachinePrecision], Or[LessEqual[z, 1.02e+84], N[Not[LessEqual[z, 2.1e+111]], $MachinePrecision]]]], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.4 \cdot 10^{+145} \lor \neg \left(z \leq 2 \cdot 10^{+14}\right) \land \left(z \leq 1.02 \cdot 10^{+84} \lor \neg \left(z \leq 2.1 \cdot 10^{+111}\right)\right):\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.3999999999999999e145 or 2e14 < z < 1.0199999999999999e84 or 2.09999999999999995e111 < z Initial program 62.4%
associate-+l-62.4%
*-commutative62.4%
associate-*r*64.6%
*-commutative64.6%
associate-+l-64.6%
associate-*l*64.6%
associate-*l*68.2%
*-commutative68.2%
Simplified68.2%
Taylor expanded in z around inf 66.4%
if -1.3999999999999999e145 < z < 2e14 or 1.0199999999999999e84 < z < 2.09999999999999995e111Initial program 92.6%
associate-+l-92.6%
*-commutative92.6%
associate-*r*94.4%
*-commutative94.4%
associate-+l-94.4%
associate-*l*94.4%
associate-*l*91.2%
*-commutative91.2%
Simplified91.2%
Taylor expanded in x around inf 85.0%
associate-*r*85.0%
*-commutative85.0%
associate-*r*85.0%
Simplified85.0%
Final simplification79.0%
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 -1.4e+183) (not (<= z 1.55e+143))) (/ (- (/ b z) (* a (* t 4.0))) c) (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* 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 <= -1.4e+183) || !(z <= 1.55e+143)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
}
return tmp;
}
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 <= (-1.4d+183)) .or. (.not. (z <= 1.55d+143))) then
tmp = ((b / z) - (a * (t * 4.0d0))) / c
else
tmp = (b + ((x * (9.0d0 * y)) - ((z * 4.0d0) * (a * t)))) / (z * c)
end if
code = tmp
end function
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 <= -1.4e+183) || !(z <= 1.55e+143)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
}
return tmp;
}
[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 <= -1.4e+183) or not (z <= 1.55e+143): tmp = ((b / z) - (a * (t * 4.0))) / c else: tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c) return tmp
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 <= -1.4e+183) || !(z <= 1.55e+143)) tmp = Float64(Float64(Float64(b / z) - Float64(a * Float64(t * 4.0))) / c); else tmp = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)); end return tmp end
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 <= -1.4e+183) || ~((z <= 1.55e+143)))
tmp = ((b / z) - (a * (t * 4.0))) / c;
else
tmp = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.4e+183], N[Not[LessEqual[z, 1.55e+143]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $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[(z * c), $MachinePrecision]), $MachinePrecision]]
\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 -1.4 \cdot 10^{+183} \lor \neg \left(z \leq 1.55 \cdot 10^{+143}\right):\\
\;\;\;\;\frac{\frac{b}{z} - a \cdot \left(t \cdot 4\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.40000000000000009e183 or 1.54999999999999995e143 < z Initial program 52.9%
associate-+l-52.9%
*-commutative52.9%
associate-*r*56.5%
*-commutative56.5%
associate-+l-56.5%
associate-*l*56.5%
associate-*l*56.6%
*-commutative56.6%
Simplified56.6%
Taylor expanded in c around 0 52.9%
Simplified52.9%
Taylor expanded in x around 0 47.4%
associate-*r*51.2%
*-commutative51.2%
associate-/l/57.3%
metadata-eval57.3%
cancel-sign-sub-inv57.3%
div-sub57.3%
associate-*r*57.3%
associate-*l/81.3%
associate-/l*81.3%
*-inverses81.3%
metadata-eval81.3%
*-commutative81.3%
associate-*l*81.3%
Simplified81.3%
if -1.40000000000000009e183 < z < 1.54999999999999995e143Initial program 90.5%
associate-+l-90.5%
*-commutative90.5%
associate-*r*91.9%
*-commutative91.9%
associate-+l-91.9%
associate-*l*91.9%
associate-*l*90.7%
*-commutative90.7%
Simplified90.7%
Final simplification88.8%
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 -4.2e+142) (not (<= z 7.5e+99))) (/ (- (/ b z) (* a (* t 4.0))) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* 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 <= -4.2e+142) || !(z <= 7.5e+99)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
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 <= (-4.2d+142)) .or. (.not. (z <= 7.5d+99))) then
tmp = ((b / z) - (a * (t * 4.0d0))) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
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 <= -4.2e+142) || !(z <= 7.5e+99)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[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 <= -4.2e+142) or not (z <= 7.5e+99): tmp = ((b / z) - (a * (t * 4.0))) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
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 <= -4.2e+142) || !(z <= 7.5e+99)) tmp = Float64(Float64(Float64(b / z) - Float64(a * Float64(t * 4.0))) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
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 <= -4.2e+142) || ~((z <= 7.5e+99)))
tmp = ((b / z) - (a * (t * 4.0))) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -4.2e+142], N[Not[LessEqual[z, 7.5e+99]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], 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[(z * c), $MachinePrecision]), $MachinePrecision]]
\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 -4.2 \cdot 10^{+142} \lor \neg \left(z \leq 7.5 \cdot 10^{+99}\right):\\
\;\;\;\;\frac{\frac{b}{z} - a \cdot \left(t \cdot 4\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -4.2e142 or 7.49999999999999963e99 < z Initial program 55.2%
associate-+l-55.2%
*-commutative55.2%
associate-*r*61.4%
*-commutative61.4%
associate-+l-61.4%
associate-*l*61.4%
associate-*l*64.1%
*-commutative64.1%
Simplified64.1%
Taylor expanded in c around 0 55.3%
Simplified55.3%
Taylor expanded in x around 0 48.9%
associate-*r*57.7%
*-commutative57.7%
associate-/l/62.0%
metadata-eval62.0%
cancel-sign-sub-inv62.0%
div-sub62.0%
associate-*r*62.0%
associate-*l/78.4%
associate-/l*78.4%
*-inverses78.4%
metadata-eval78.4%
*-commutative78.4%
associate-*l*78.4%
Simplified78.4%
if -4.2e142 < z < 7.49999999999999963e99Initial program 94.5%
Final simplification89.7%
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 (/ (* a t) c))) (t_2 (/ b (* z c))))
(if (<= b -7.2e+68)
t_2
(if (<= b 3e-56)
t_1
(if (<= b 3.2e+52) t_2 (if (<= b 5.2e+152) t_1 (/ (/ b 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 t_1 = -4.0 * ((a * t) / c);
double t_2 = b / (z * c);
double tmp;
if (b <= -7.2e+68) {
tmp = t_2;
} else if (b <= 3e-56) {
tmp = t_1;
} else if (b <= 3.2e+52) {
tmp = t_2;
} else if (b <= 5.2e+152) {
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.
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) * ((a * t) / c)
t_2 = b / (z * c)
if (b <= (-7.2d+68)) then
tmp = t_2
else if (b <= 3d-56) then
tmp = t_1
else if (b <= 3.2d+52) then
tmp = t_2
else if (b <= 5.2d+152) 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;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * ((a * t) / c);
double t_2 = b / (z * c);
double tmp;
if (b <= -7.2e+68) {
tmp = t_2;
} else if (b <= 3e-56) {
tmp = t_1;
} else if (b <= 3.2e+52) {
tmp = t_2;
} else if (b <= 5.2e+152) {
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]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * ((a * t) / c) t_2 = b / (z * c) tmp = 0 if b <= -7.2e+68: tmp = t_2 elif b <= 3e-56: tmp = t_1 elif b <= 3.2e+52: tmp = t_2 elif b <= 5.2e+152: 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]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(Float64(a * t) / c)) t_2 = Float64(b / Float64(z * c)) tmp = 0.0 if (b <= -7.2e+68) tmp = t_2; elseif (b <= 3e-56) tmp = t_1; elseif (b <= 3.2e+52) tmp = t_2; elseif (b <= 5.2e+152) tmp = t_1; else tmp = Float64(Float64(b / z) / c); end return tmp end
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 * ((a * t) / c);
t_2 = b / (z * c);
tmp = 0.0;
if (b <= -7.2e+68)
tmp = t_2;
elseif (b <= 3e-56)
tmp = t_1;
elseif (b <= 3.2e+52)
tmp = t_2;
elseif (b <= 5.2e+152)
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -7.2e+68], t$95$2, If[LessEqual[b, 3e-56], t$95$1, If[LessEqual[b, 3.2e+52], t$95$2, If[LessEqual[b, 5.2e+152], t$95$1, N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
t_2 := \frac{b}{z \cdot c}\\
\mathbf{if}\;b \leq -7.2 \cdot 10^{+68}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq 3 \cdot 10^{-56}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 3.2 \cdot 10^{+52}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \leq 5.2 \cdot 10^{+152}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\end{array}
\end{array}
if b < -7.1999999999999998e68 or 2.99999999999999989e-56 < b < 3.2e52Initial program 80.6%
associate-+l-80.6%
*-commutative80.6%
associate-*r*83.2%
*-commutative83.2%
associate-+l-83.2%
associate-*l*83.2%
associate-*l*83.1%
*-commutative83.1%
Simplified83.1%
Taylor expanded in b around inf 65.3%
*-commutative65.3%
Simplified65.3%
if -7.1999999999999998e68 < b < 2.99999999999999989e-56 or 3.2e52 < b < 5.2000000000000001e152Initial program 80.4%
associate-+l-80.4%
*-commutative80.4%
associate-*r*82.4%
*-commutative82.4%
associate-+l-82.4%
associate-*l*82.4%
associate-*l*82.1%
*-commutative82.1%
Simplified82.1%
Taylor expanded in z around inf 47.1%
if 5.2000000000000001e152 < b Initial program 97.2%
associate-+l-97.2%
*-commutative97.2%
associate-*r*97.2%
*-commutative97.2%
associate-+l-97.2%
associate-*l*97.2%
associate-*l*91.6%
*-commutative91.6%
Simplified91.6%
Taylor expanded in c around 0 97.2%
Simplified97.2%
fma-undefine97.2%
Applied egg-rr97.2%
Taylor expanded in b around inf 73.6%
associate-/l/78.8%
Simplified78.8%
Final simplification56.9%
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 (/ (* a t) c))))
(if (<= a -9.5e-144)
t_1
(if (<= a 5.2e-190)
(* 9.0 (* x (/ y (* z c))))
(if (<= a 1.06e+120) (/ 1.0 (* c (/ z b))) t_1)))))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 * ((a * t) / c);
double tmp;
if (a <= -9.5e-144) {
tmp = t_1;
} else if (a <= 5.2e-190) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (a <= 1.06e+120) {
tmp = 1.0 / (c * (z / b));
} 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.
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) * ((a * t) / c)
if (a <= (-9.5d-144)) then
tmp = t_1
else if (a <= 5.2d-190) then
tmp = 9.0d0 * (x * (y / (z * c)))
else if (a <= 1.06d+120) then
tmp = 1.0d0 / (c * (z / b))
else
tmp = t_1
end if
code = tmp
end function
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 * ((a * t) / c);
double tmp;
if (a <= -9.5e-144) {
tmp = t_1;
} else if (a <= 5.2e-190) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (a <= 1.06e+120) {
tmp = 1.0 / (c * (z / b));
} else {
tmp = t_1;
}
return tmp;
}
[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 * ((a * t) / c) tmp = 0 if a <= -9.5e-144: tmp = t_1 elif a <= 5.2e-190: tmp = 9.0 * (x * (y / (z * c))) elif a <= 1.06e+120: tmp = 1.0 / (c * (z / b)) else: tmp = t_1 return tmp
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(a * t) / c)) tmp = 0.0 if (a <= -9.5e-144) tmp = t_1; elseif (a <= 5.2e-190) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); elseif (a <= 1.06e+120) tmp = Float64(1.0 / Float64(c * Float64(z / b))); else tmp = t_1; end return tmp end
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 * ((a * t) / c);
tmp = 0.0;
if (a <= -9.5e-144)
tmp = t_1;
elseif (a <= 5.2e-190)
tmp = 9.0 * (x * (y / (z * c)));
elseif (a <= 1.06e+120)
tmp = 1.0 / (c * (z / b));
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -9.5e-144], t$95$1, If[LessEqual[a, 5.2e-190], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.06e+120], N[(1.0 / N[(c * N[(z / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a \cdot t}{c}\\
\mathbf{if}\;a \leq -9.5 \cdot 10^{-144}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 5.2 \cdot 10^{-190}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{elif}\;a \leq 1.06 \cdot 10^{+120}:\\
\;\;\;\;\frac{1}{c \cdot \frac{z}{b}}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -9.49999999999999953e-144 or 1.05999999999999994e120 < a Initial program 81.1%
associate-+l-81.1%
*-commutative81.1%
associate-*r*80.4%
*-commutative80.4%
associate-+l-80.4%
associate-*l*80.5%
associate-*l*79.1%
*-commutative79.1%
Simplified79.1%
Taylor expanded in z around inf 41.7%
if -9.49999999999999953e-144 < a < 5.1999999999999996e-190Initial program 83.3%
associate-+l-83.3%
*-commutative83.3%
associate-*r*90.0%
*-commutative90.0%
associate-+l-90.0%
associate-*l*90.0%
associate-*l*89.2%
*-commutative89.2%
Simplified89.2%
Taylor expanded in x around inf 59.3%
times-frac55.7%
Simplified55.7%
Taylor expanded in x around 0 59.3%
*-commutative59.3%
associate-/l*62.6%
Simplified62.6%
if 5.1999999999999996e-190 < a < 1.05999999999999994e120Initial program 87.0%
associate-+l-87.0%
*-commutative87.0%
associate-*r*90.6%
*-commutative90.6%
associate-+l-90.6%
associate-*l*90.6%
associate-*l*90.6%
*-commutative90.6%
Simplified90.6%
Applied egg-rr67.4%
clear-num67.4%
frac-times68.3%
metadata-eval68.3%
+-commutative68.3%
*-commutative68.3%
Applied egg-rr68.3%
Taylor expanded in b around inf 54.1%
Final simplification49.0%
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 -3.4e+141) (not (<= z 120000000.0))) (/ (- (/ b z) (* a (* t 4.0))) c) (/ (+ b (* x (* 9.0 y))) (* 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 <= -3.4e+141) || !(z <= 120000000.0)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
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 <= (-3.4d+141)) .or. (.not. (z <= 120000000.0d0))) then
tmp = ((b / z) - (a * (t * 4.0d0))) / c
else
tmp = (b + (x * (9.0d0 * y))) / (z * c)
end if
code = tmp
end function
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 <= -3.4e+141) || !(z <= 120000000.0)) {
tmp = ((b / z) - (a * (t * 4.0))) / c;
} else {
tmp = (b + (x * (9.0 * y))) / (z * c);
}
return tmp;
}
[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 <= -3.4e+141) or not (z <= 120000000.0): tmp = ((b / z) - (a * (t * 4.0))) / c else: tmp = (b + (x * (9.0 * y))) / (z * c) return tmp
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 <= -3.4e+141) || !(z <= 120000000.0)) tmp = Float64(Float64(Float64(b / z) - Float64(a * Float64(t * 4.0))) / c); else tmp = Float64(Float64(b + Float64(x * Float64(9.0 * y))) / Float64(z * c)); end return tmp end
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 <= -3.4e+141) || ~((z <= 120000000.0)))
tmp = ((b / z) - (a * (t * 4.0))) / c;
else
tmp = (b + (x * (9.0 * 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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -3.4e+141], N[Not[LessEqual[z, 120000000.0]], $MachinePrecision]], N[(N[(N[(b / z), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(x * N[(9.0 * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.4 \cdot 10^{+141} \lor \neg \left(z \leq 120000000\right):\\
\;\;\;\;\frac{\frac{b}{z} - a \cdot \left(t \cdot 4\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + x \cdot \left(9 \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -3.3999999999999998e141 or 1.2e8 < z Initial program 63.3%
associate-+l-63.3%
*-commutative63.3%
associate-*r*67.3%
*-commutative67.3%
associate-+l-67.3%
associate-*l*67.4%
associate-*l*70.6%
*-commutative70.6%
Simplified70.6%
Taylor expanded in c around 0 63.4%
Simplified63.4%
Taylor expanded in x around 0 55.1%
associate-*r*62.3%
*-commutative62.3%
associate-/l/65.7%
metadata-eval65.7%
cancel-sign-sub-inv65.7%
div-sub65.7%
associate-*r*65.7%
associate-*l/79.2%
associate-/l*79.2%
*-inverses79.2%
metadata-eval79.2%
*-commutative79.2%
associate-*l*79.2%
Simplified79.2%
if -3.3999999999999998e141 < z < 1.2e8Initial program 94.0%
associate-+l-94.0%
*-commutative94.0%
associate-*r*94.6%
*-commutative94.6%
associate-+l-94.6%
associate-*l*94.6%
associate-*l*91.3%
*-commutative91.3%
Simplified91.3%
Taylor expanded in x around inf 85.4%
associate-*r*85.5%
*-commutative85.5%
associate-*r*85.5%
Simplified85.5%
Final simplification83.2%
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.85e+95) (not (<= t 1.85e-93))) (* (* a (/ t c)) -4.0) (/ b (* 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 ((t <= -1.85e+95) || !(t <= 1.85e-93)) {
tmp = (a * (t / c)) * -4.0;
} 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.
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.85d+95)) .or. (.not. (t <= 1.85d-93))) then
tmp = (a * (t / c)) * (-4.0d0)
else
tmp = b / (z * c)
end if
code = tmp
end function
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.85e+95) || !(t <= 1.85e-93)) {
tmp = (a * (t / c)) * -4.0;
} else {
tmp = b / (z * c);
}
return tmp;
}
[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.85e+95) or not (t <= 1.85e-93): tmp = (a * (t / c)) * -4.0 else: tmp = b / (z * c) return tmp
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.85e+95) || !(t <= 1.85e-93)) tmp = Float64(Float64(a * Float64(t / c)) * -4.0); 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -1.85e+95) || ~((t <= 1.85e-93)))
tmp = (a * (t / c)) * -4.0;
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. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -1.85e+95], N[Not[LessEqual[t, 1.85e-93]], $MachinePrecision]], N[(N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision] * -4.0), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.85 \cdot 10^{+95} \lor \neg \left(t \leq 1.85 \cdot 10^{-93}\right):\\
\;\;\;\;\left(a \cdot \frac{t}{c}\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if t < -1.8500000000000001e95 or 1.85000000000000001e-93 < t Initial program 75.5%
associate-+l-75.5%
*-commutative75.5%
associate-*r*82.0%
*-commutative82.0%
associate-+l-82.0%
associate-*l*82.0%
associate-*l*77.9%
*-commutative77.9%
Simplified77.9%
Taylor expanded in z around inf 50.6%
*-commutative50.6%
associate-/l*54.5%
Simplified54.5%
if -1.8500000000000001e95 < t < 1.85000000000000001e-93Initial program 89.3%
associate-+l-89.3%
*-commutative89.3%
associate-*r*87.1%
*-commutative87.1%
associate-+l-87.1%
associate-*l*87.1%
associate-*l*88.9%
*-commutative88.9%
Simplified88.9%
Taylor expanded in b around inf 50.0%
*-commutative50.0%
Simplified50.0%
Final simplification52.1%
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);
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.
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;
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]) 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]) 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])){:}
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. 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])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 82.8%
associate-+l-82.8%
*-commutative82.8%
associate-*r*84.7%
*-commutative84.7%
associate-+l-84.7%
associate-*l*84.7%
associate-*l*83.8%
*-commutative83.8%
Simplified83.8%
Taylor expanded in b around inf 40.4%
*-commutative40.4%
Simplified40.4%
Final simplification40.4%
(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 2024040
(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)))