
(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. 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.2e-51) (not (<= z 1.6e-59))) (fma (* a (/ t c)) -4.0 (/ (fma y (* x (/ 9.0 z)) (/ b z)) c)) (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.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 ((z <= -2.2e-51) || !(z <= 1.6e-59)) {
tmp = fma((a * (t / c)), -4.0, (fma(y, (x * (9.0 / z)), (b / z)) / c));
} else {
tmp = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.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 ((z <= -2.2e-51) || !(z <= 1.6e-59)) tmp = fma(Float64(a * Float64(t / c)), -4.0, Float64(fma(y, Float64(x * Float64(9.0 / z)), Float64(b / z)) / c)); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * 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. 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.2e-51], N[Not[LessEqual[z, 1.6e-59]], $MachinePrecision]], N[(N[(a * N[(t / c), $MachinePrecision]), $MachinePrecision] * -4.0 + N[(N[(y * N[(x * N[(9.0 / z), $MachinePrecision]), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(N[(y * N[(x * 9.0), $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])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.2 \cdot 10^{-51} \lor \neg \left(z \leq 1.6 \cdot 10^{-59}\right):\\
\;\;\;\;\mathsf{fma}\left(a \cdot \frac{t}{c}, -4, \frac{\mathsf{fma}\left(y, x \cdot \frac{9}{z}, \frac{b}{z}\right)}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.2e-51 or 1.6e-59 < z Initial program 63.8%
associate-+l-63.8%
*-commutative63.8%
associate-*r*61.8%
*-commutative61.8%
associate-+l-61.8%
associate-*l*61.9%
associate-*l*67.7%
*-commutative67.7%
Simplified67.7%
Taylor expanded in x around 0 80.3%
cancel-sign-sub-inv80.3%
metadata-eval80.3%
+-commutative80.3%
*-commutative80.3%
fma-define80.3%
associate-/l*80.0%
fma-define80.0%
times-frac86.2%
*-commutative86.2%
Simplified86.2%
Taylor expanded in c around 0 85.2%
associate-*r/85.1%
*-commutative85.1%
associate-*r*85.1%
*-commutative85.1%
associate-/l*90.7%
associate-*r*90.7%
fma-define90.7%
associate-*r/90.7%
*-commutative90.7%
associate-/l*90.8%
Simplified90.8%
if -2.2e-51 < z < 1.6e-59Initial program 94.2%
Final simplification92.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 (* (* z 4.0) (* a t)))
(t_2 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_3 (/ (+ b (- (* x (* y 9.0)) t_1)) (* z c))))
(if (<= t_2 -5e-324)
t_3
(if (<= t_2 0.0)
(/ (/ (+ b (fma x (* y 9.0) t_1)) c) z)
(if (<= t_2 INFINITY) t_3 (* (/ t c) (* a -4.0)))))))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 = (z * 4.0) * (a * t);
double t_2 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_3 = (b + ((x * (y * 9.0)) - t_1)) / (z * c);
double tmp;
if (t_2 <= -5e-324) {
tmp = t_3;
} else if (t_2 <= 0.0) {
tmp = ((b + fma(x, (y * 9.0), t_1)) / c) / z;
} else if (t_2 <= ((double) INFINITY)) {
tmp = t_3;
} else {
tmp = (t / c) * (a * -4.0);
}
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(z * 4.0) * Float64(a * t)) t_2 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_3 = Float64(Float64(b + Float64(Float64(x * Float64(y * 9.0)) - t_1)) / Float64(z * c)) tmp = 0.0 if (t_2 <= -5e-324) tmp = t_3; elseif (t_2 <= 0.0) tmp = Float64(Float64(Float64(b + fma(x, Float64(y * 9.0), t_1)) / c) / z); elseif (t_2 <= Inf) tmp = t_3; else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(b + N[(N[(x * N[(y * 9.0), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-324], t$95$3, If[LessEqual[t$95$2, 0.0], N[(N[(N[(b + N[(x * N[(y * 9.0), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$3, N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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 := \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\\
t_2 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_3 := \frac{b + \left(x \cdot \left(y \cdot 9\right) - t\_1\right)}{z \cdot c}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-324}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{\frac{b + \mathsf{fma}\left(x, y \cdot 9, t\_1\right)}{c}}{z}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -4.94066e-324 or -0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < +inf.0Initial program 85.6%
associate-+l-85.6%
*-commutative85.6%
associate-*r*84.1%
*-commutative84.1%
associate-+l-84.1%
associate-*l*84.1%
associate-*l*86.9%
*-commutative86.9%
Simplified86.9%
if -4.94066e-324 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < -0.0Initial program 37.6%
associate-+l-37.6%
*-commutative37.6%
associate-*r*36.5%
*-commutative36.5%
associate-+l-36.5%
associate-*l*36.5%
associate-*l*37.6%
*-commutative37.6%
Simplified37.6%
Applied egg-rr68.3%
associate-*l/68.3%
*-un-lft-identity68.3%
+-commutative68.3%
*-commutative68.3%
associate-*r*68.3%
*-commutative68.3%
Applied egg-rr68.3%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*0.8%
*-commutative0.8%
associate-+l-0.8%
associate-*l*0.8%
associate-*l*0.8%
*-commutative0.8%
Simplified0.8%
Taylor expanded in z around inf 62.5%
associate-/l*80.2%
associate-*r*80.2%
*-commutative80.2%
Simplified80.2%
Final simplification85.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 (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)) INFINITY) (/ (+ b (- (* x (* y 9.0)) (* (* z 4.0) (* a t)))) (* z c)) (* (/ t c) (* a -4.0))))
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c)) <= ((double) INFINITY)) {
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (t / c) * (a * -4.0);
}
return tmp;
}
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c)) <= Double.POSITIVE_INFINITY) {
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
} else {
tmp = (t / c) * (a * -4.0);
}
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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c)) <= math.inf: tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c) else: tmp = (t / c) * (a * -4.0) 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(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) <= Inf) tmp = Float64(Float64(b + Float64(Float64(x * Float64(y * 9.0)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c)) <= Inf)
tmp = (b + ((x * (y * 9.0)) - ((z * 4.0) * (a * t)))) / (z * c);
else
tmp = (t / c) * (a * -4.0);
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[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(b + N[(N[(x * N[(y * 9.0), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;\frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c} \leq \infty:\\
\;\;\;\;\frac{b + \left(x \cdot \left(y \cdot 9\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) < +inf.0Initial program 81.9%
associate-+l-81.9%
*-commutative81.9%
associate-*r*80.5%
*-commutative80.5%
associate-+l-80.5%
associate-*l*80.5%
associate-*l*83.1%
*-commutative83.1%
Simplified83.1%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x 9) y) (*.f64 (*.f64 (*.f64 z 4) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*0.8%
*-commutative0.8%
associate-+l-0.8%
associate-*l*0.8%
associate-*l*0.8%
*-commutative0.8%
Simplified0.8%
Taylor expanded in z around inf 62.5%
associate-/l*80.2%
associate-*r*80.2%
*-commutative80.2%
Simplified80.2%
Final simplification82.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
(let* ((t_1 (/ (+ b (* y (* x 9.0))) (* z c))) (t_2 (* (/ t c) (* a -4.0))))
(if (<= t -1.05e+116)
t_2
(if (<= t -1.3e+102)
t_1
(if (<= t -3.8e-6)
t_2
(if (<= t 2.25e-13) t_1 (* t (/ (* a -4.0) 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 = (b + (y * (x * 9.0))) / (z * c);
double t_2 = (t / c) * (a * -4.0);
double tmp;
if (t <= -1.05e+116) {
tmp = t_2;
} else if (t <= -1.3e+102) {
tmp = t_1;
} else if (t <= -3.8e-6) {
tmp = t_2;
} else if (t <= 2.25e-13) {
tmp = t_1;
} else {
tmp = t * ((a * -4.0) / 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 = (b + (y * (x * 9.0d0))) / (z * c)
t_2 = (t / c) * (a * (-4.0d0))
if (t <= (-1.05d+116)) then
tmp = t_2
else if (t <= (-1.3d+102)) then
tmp = t_1
else if (t <= (-3.8d-6)) then
tmp = t_2
else if (t <= 2.25d-13) then
tmp = t_1
else
tmp = t * ((a * (-4.0d0)) / 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 = (b + (y * (x * 9.0))) / (z * c);
double t_2 = (t / c) * (a * -4.0);
double tmp;
if (t <= -1.05e+116) {
tmp = t_2;
} else if (t <= -1.3e+102) {
tmp = t_1;
} else if (t <= -3.8e-6) {
tmp = t_2;
} else if (t <= 2.25e-13) {
tmp = t_1;
} else {
tmp = t * ((a * -4.0) / 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 = (b + (y * (x * 9.0))) / (z * c) t_2 = (t / c) * (a * -4.0) tmp = 0 if t <= -1.05e+116: tmp = t_2 elif t <= -1.3e+102: tmp = t_1 elif t <= -3.8e-6: tmp = t_2 elif t <= 2.25e-13: tmp = t_1 else: tmp = t * ((a * -4.0) / 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(Float64(b + Float64(y * Float64(x * 9.0))) / Float64(z * c)) t_2 = Float64(Float64(t / c) * Float64(a * -4.0)) tmp = 0.0 if (t <= -1.05e+116) tmp = t_2; elseif (t <= -1.3e+102) tmp = t_1; elseif (t <= -3.8e-6) tmp = t_2; elseif (t <= 2.25e-13) tmp = t_1; else tmp = Float64(t * Float64(Float64(a * -4.0) / 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 = (b + (y * (x * 9.0))) / (z * c);
t_2 = (t / c) * (a * -4.0);
tmp = 0.0;
if (t <= -1.05e+116)
tmp = t_2;
elseif (t <= -1.3e+102)
tmp = t_1;
elseif (t <= -3.8e-6)
tmp = t_2;
elseif (t <= 2.25e-13)
tmp = t_1;
else
tmp = t * ((a * -4.0) / 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[(N[(b + N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.05e+116], t$95$2, If[LessEqual[t, -1.3e+102], t$95$1, If[LessEqual[t, -3.8e-6], t$95$2, If[LessEqual[t, 2.25e-13], t$95$1, N[(t * N[(N[(a * -4.0), $MachinePrecision] / 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 := \frac{b + y \cdot \left(x \cdot 9\right)}{z \cdot c}\\
t_2 := \frac{t}{c} \cdot \left(a \cdot -4\right)\\
\mathbf{if}\;t \leq -1.05 \cdot 10^{+116}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{+102}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq -3.8 \cdot 10^{-6}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t \leq 2.25 \cdot 10^{-13}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\end{array}
\end{array}
if t < -1.0500000000000001e116 or -1.30000000000000003e102 < t < -3.8e-6Initial program 72.5%
associate-+l-72.5%
*-commutative72.5%
associate-*r*79.9%
*-commutative79.9%
associate-+l-79.9%
associate-*l*79.9%
associate-*l*77.5%
*-commutative77.5%
Simplified77.5%
Taylor expanded in z around inf 53.7%
associate-/l*61.2%
associate-*r*61.2%
*-commutative61.2%
Simplified61.2%
if -1.0500000000000001e116 < t < -1.30000000000000003e102 or -3.8e-6 < t < 2.25e-13Initial program 78.8%
associate-+l-78.8%
*-commutative78.8%
associate-*r*72.1%
*-commutative72.1%
associate-+l-72.1%
associate-*l*72.1%
associate-*l*78.8%
*-commutative78.8%
Simplified78.8%
Taylor expanded in x around inf 69.6%
associate-*r*69.6%
Simplified69.6%
if 2.25e-13 < t Initial program 74.2%
associate-+l-74.2%
*-commutative74.2%
associate-*r*75.8%
*-commutative75.8%
associate-+l-75.8%
associate-*l*75.8%
associate-*l*74.3%
*-commutative74.3%
Simplified74.3%
Taylor expanded in z around inf 50.7%
associate-/l*55.1%
associate-*r*55.1%
*-commutative55.1%
Simplified55.1%
add-cube-cbrt54.9%
pow354.8%
*-commutative54.8%
Applied egg-rr54.8%
rem-cube-cbrt55.1%
associate-*l/50.7%
*-un-lft-identity50.7%
times-frac58.0%
Applied egg-rr58.0%
Final simplification64.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
(if (<= a -3.9e-209)
(/ (* t (* a -4.0)) c)
(if (<= a 2.05e-247)
(/ 1.0 (* c (/ z b)))
(if (<= a 1.35e-176)
(* 9.0 (* (/ x c) (/ y z)))
(if (<= a 2.2e+86) (/ (/ b z) c) (* (/ t c) (* a -4.0)))))))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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 2.05e-247) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1.35e-176) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (a <= 2.2e+86) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 (a <= (-3.9d-209)) then
tmp = (t * (a * (-4.0d0))) / c
else if (a <= 2.05d-247) then
tmp = 1.0d0 / (c * (z / b))
else if (a <= 1.35d-176) then
tmp = 9.0d0 * ((x / c) * (y / z))
else if (a <= 2.2d+86) then
tmp = (b / z) / c
else
tmp = (t / c) * (a * (-4.0d0))
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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 2.05e-247) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1.35e-176) {
tmp = 9.0 * ((x / c) * (y / z));
} else if (a <= 2.2e+86) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 a <= -3.9e-209: tmp = (t * (a * -4.0)) / c elif a <= 2.05e-247: tmp = 1.0 / (c * (z / b)) elif a <= 1.35e-176: tmp = 9.0 * ((x / c) * (y / z)) elif a <= 2.2e+86: tmp = (b / z) / c else: tmp = (t / c) * (a * -4.0) 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 (a <= -3.9e-209) tmp = Float64(Float64(t * Float64(a * -4.0)) / c); elseif (a <= 2.05e-247) tmp = Float64(1.0 / Float64(c * Float64(z / b))); elseif (a <= 1.35e-176) tmp = Float64(9.0 * Float64(Float64(x / c) * Float64(y / z))); elseif (a <= 2.2e+86) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 (a <= -3.9e-209)
tmp = (t * (a * -4.0)) / c;
elseif (a <= 2.05e-247)
tmp = 1.0 / (c * (z / b));
elseif (a <= 1.35e-176)
tmp = 9.0 * ((x / c) * (y / z));
elseif (a <= 2.2e+86)
tmp = (b / z) / c;
else
tmp = (t / c) * (a * -4.0);
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[a, -3.9e-209], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 2.05e-247], N[(1.0 / N[(c * N[(z / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.35e-176], N[(9.0 * N[(N[(x / c), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.2e+86], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;a \leq -3.9 \cdot 10^{-209}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;a \leq 2.05 \cdot 10^{-247}:\\
\;\;\;\;\frac{1}{c \cdot \frac{z}{b}}\\
\mathbf{elif}\;a \leq 1.35 \cdot 10^{-176}:\\
\;\;\;\;9 \cdot \left(\frac{x}{c} \cdot \frac{y}{z}\right)\\
\mathbf{elif}\;a \leq 2.2 \cdot 10^{+86}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if a < -3.9e-209Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in z around inf 49.6%
associate-/l*49.0%
associate-*r*49.0%
*-commutative49.0%
Simplified49.0%
associate-*r/49.6%
Applied egg-rr49.6%
if -3.9e-209 < a < 2.0499999999999999e-247Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.6%
associate-*l*75.6%
*-commutative75.6%
Simplified75.6%
Applied egg-rr75.5%
Taylor expanded in b around inf 51.8%
frac-times47.0%
*-un-lft-identity47.0%
clear-num47.0%
Applied egg-rr47.0%
clear-num47.0%
*-commutative47.0%
associate-/l/56.6%
clear-num56.6%
div-inv56.7%
clear-num56.6%
Applied egg-rr56.6%
if 2.0499999999999999e-247 < a < 1.3499999999999999e-176Initial program 79.4%
associate-+l-79.4%
*-commutative79.4%
associate-*r*86.5%
*-commutative86.5%
associate-+l-86.5%
associate-*l*86.5%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in x around inf 38.1%
times-frac36.8%
Simplified36.8%
if 1.3499999999999999e-176 < a < 2.20000000000000003e86Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
associate-*l*77.2%
associate-*l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in b around inf 39.9%
*-commutative39.9%
Simplified39.9%
Taylor expanded in b around 0 39.9%
*-commutative39.9%
associate-/r*45.0%
Simplified45.0%
if 2.20000000000000003e86 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
associate-*l*66.9%
associate-*l*73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 49.3%
associate-/l*60.1%
associate-*r*60.1%
*-commutative60.1%
Simplified60.1%
Final simplification50.8%
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 (<= a -3.9e-209)
(/ (* t (* a -4.0)) c)
(if (<= a 1.45e-248)
(/ 1.0 (* c (/ z b)))
(if (<= a 1e-176)
(* 9.0 (/ (* y x) (* z c)))
(if (<= a 1.3e+87) (/ (/ b z) c) (* (/ t c) (* a -4.0)))))))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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1.45e-248) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1e-176) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.3e+87) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 (a <= (-3.9d-209)) then
tmp = (t * (a * (-4.0d0))) / c
else if (a <= 1.45d-248) then
tmp = 1.0d0 / (c * (z / b))
else if (a <= 1d-176) then
tmp = 9.0d0 * ((y * x) / (z * c))
else if (a <= 1.3d+87) then
tmp = (b / z) / c
else
tmp = (t / c) * (a * (-4.0d0))
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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1.45e-248) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1e-176) {
tmp = 9.0 * ((y * x) / (z * c));
} else if (a <= 1.3e+87) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 a <= -3.9e-209: tmp = (t * (a * -4.0)) / c elif a <= 1.45e-248: tmp = 1.0 / (c * (z / b)) elif a <= 1e-176: tmp = 9.0 * ((y * x) / (z * c)) elif a <= 1.3e+87: tmp = (b / z) / c else: tmp = (t / c) * (a * -4.0) 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 (a <= -3.9e-209) tmp = Float64(Float64(t * Float64(a * -4.0)) / c); elseif (a <= 1.45e-248) tmp = Float64(1.0 / Float64(c * Float64(z / b))); elseif (a <= 1e-176) tmp = Float64(9.0 * Float64(Float64(y * x) / Float64(z * c))); elseif (a <= 1.3e+87) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 (a <= -3.9e-209)
tmp = (t * (a * -4.0)) / c;
elseif (a <= 1.45e-248)
tmp = 1.0 / (c * (z / b));
elseif (a <= 1e-176)
tmp = 9.0 * ((y * x) / (z * c));
elseif (a <= 1.3e+87)
tmp = (b / z) / c;
else
tmp = (t / c) * (a * -4.0);
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[a, -3.9e-209], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 1.45e-248], N[(1.0 / N[(c * N[(z / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1e-176], N[(9.0 * N[(N[(y * x), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.3e+87], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;a \leq -3.9 \cdot 10^{-209}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;a \leq 1.45 \cdot 10^{-248}:\\
\;\;\;\;\frac{1}{c \cdot \frac{z}{b}}\\
\mathbf{elif}\;a \leq 10^{-176}:\\
\;\;\;\;9 \cdot \frac{y \cdot x}{z \cdot c}\\
\mathbf{elif}\;a \leq 1.3 \cdot 10^{+87}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if a < -3.9e-209Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in z around inf 49.6%
associate-/l*49.0%
associate-*r*49.0%
*-commutative49.0%
Simplified49.0%
associate-*r/49.6%
Applied egg-rr49.6%
if -3.9e-209 < a < 1.4500000000000001e-248Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.6%
associate-*l*75.6%
*-commutative75.6%
Simplified75.6%
Applied egg-rr75.5%
Taylor expanded in b around inf 51.8%
frac-times47.0%
*-un-lft-identity47.0%
clear-num47.0%
Applied egg-rr47.0%
clear-num47.0%
*-commutative47.0%
associate-/l/56.6%
clear-num56.6%
div-inv56.7%
clear-num56.6%
Applied egg-rr56.6%
if 1.4500000000000001e-248 < a < 1e-176Initial program 79.4%
associate-+l-79.4%
*-commutative79.4%
associate-*r*86.5%
*-commutative86.5%
associate-+l-86.5%
associate-*l*86.5%
associate-*l*86.5%
*-commutative86.5%
Simplified86.5%
Taylor expanded in x around inf 38.1%
if 1e-176 < a < 1.29999999999999999e87Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
associate-*l*77.2%
associate-*l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in b around inf 39.9%
*-commutative39.9%
Simplified39.9%
Taylor expanded in b around 0 39.9%
*-commutative39.9%
associate-/r*45.0%
Simplified45.0%
if 1.29999999999999999e87 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
associate-*l*66.9%
associate-*l*73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 49.3%
associate-/l*60.1%
associate-*r*60.1%
*-commutative60.1%
Simplified60.1%
Final simplification50.8%
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 (<= a -3.9e-209)
(/ (* t (* a -4.0)) c)
(if (<= a 1.7e-247)
(/ 1.0 (* c (/ z b)))
(if (<= a 1.06e-131)
(* 9.0 (/ (* x (/ y c)) z))
(if (<= a 2.8e+83) (/ (/ b z) c) (* (/ t c) (* a -4.0)))))))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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1.7e-247) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1.06e-131) {
tmp = 9.0 * ((x * (y / c)) / z);
} else if (a <= 2.8e+83) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 (a <= (-3.9d-209)) then
tmp = (t * (a * (-4.0d0))) / c
else if (a <= 1.7d-247) then
tmp = 1.0d0 / (c * (z / b))
else if (a <= 1.06d-131) then
tmp = 9.0d0 * ((x * (y / c)) / z)
else if (a <= 2.8d+83) then
tmp = (b / z) / c
else
tmp = (t / c) * (a * (-4.0d0))
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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1.7e-247) {
tmp = 1.0 / (c * (z / b));
} else if (a <= 1.06e-131) {
tmp = 9.0 * ((x * (y / c)) / z);
} else if (a <= 2.8e+83) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 a <= -3.9e-209: tmp = (t * (a * -4.0)) / c elif a <= 1.7e-247: tmp = 1.0 / (c * (z / b)) elif a <= 1.06e-131: tmp = 9.0 * ((x * (y / c)) / z) elif a <= 2.8e+83: tmp = (b / z) / c else: tmp = (t / c) * (a * -4.0) 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 (a <= -3.9e-209) tmp = Float64(Float64(t * Float64(a * -4.0)) / c); elseif (a <= 1.7e-247) tmp = Float64(1.0 / Float64(c * Float64(z / b))); elseif (a <= 1.06e-131) tmp = Float64(9.0 * Float64(Float64(x * Float64(y / c)) / z)); elseif (a <= 2.8e+83) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 (a <= -3.9e-209)
tmp = (t * (a * -4.0)) / c;
elseif (a <= 1.7e-247)
tmp = 1.0 / (c * (z / b));
elseif (a <= 1.06e-131)
tmp = 9.0 * ((x * (y / c)) / z);
elseif (a <= 2.8e+83)
tmp = (b / z) / c;
else
tmp = (t / c) * (a * -4.0);
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[a, -3.9e-209], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 1.7e-247], N[(1.0 / N[(c * N[(z / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.06e-131], N[(9.0 * N[(N[(x * N[(y / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.8e+83], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;a \leq -3.9 \cdot 10^{-209}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;a \leq 1.7 \cdot 10^{-247}:\\
\;\;\;\;\frac{1}{c \cdot \frac{z}{b}}\\
\mathbf{elif}\;a \leq 1.06 \cdot 10^{-131}:\\
\;\;\;\;9 \cdot \frac{x \cdot \frac{y}{c}}{z}\\
\mathbf{elif}\;a \leq 2.8 \cdot 10^{+83}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if a < -3.9e-209Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in z around inf 49.6%
associate-/l*49.0%
associate-*r*49.0%
*-commutative49.0%
Simplified49.0%
associate-*r/49.6%
Applied egg-rr49.6%
if -3.9e-209 < a < 1.7000000000000001e-247Initial program 73.0%
associate-+l-73.0%
*-commutative73.0%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.6%
associate-*l*75.6%
*-commutative75.6%
Simplified75.6%
Applied egg-rr75.5%
Taylor expanded in b around inf 51.8%
frac-times47.0%
*-un-lft-identity47.0%
clear-num47.0%
Applied egg-rr47.0%
clear-num47.0%
*-commutative47.0%
associate-/l/56.6%
clear-num56.6%
div-inv56.7%
clear-num56.6%
Applied egg-rr56.6%
if 1.7000000000000001e-247 < a < 1.06000000000000006e-131Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
associate-*l*84.8%
associate-*l*86.2%
*-commutative86.2%
Simplified86.2%
Taylor expanded in x around 0 82.0%
cancel-sign-sub-inv82.0%
metadata-eval82.0%
+-commutative82.0%
*-commutative82.0%
fma-define82.0%
associate-/l*75.1%
fma-define75.1%
times-frac70.8%
*-commutative70.8%
Simplified70.8%
Taylor expanded in c around 0 71.5%
associate-*r/71.5%
*-commutative71.5%
associate-*r*71.5%
*-commutative71.5%
associate-/l*64.5%
associate-*r*64.4%
fma-define64.4%
associate-*r/64.4%
*-commutative64.4%
associate-/l*64.5%
Simplified64.5%
fma-undefine64.5%
*-commutative64.5%
associate-*r*64.5%
associate-*l/75.1%
clear-num75.2%
frac-add57.5%
*-commutative57.5%
associate-*l/57.5%
*-commutative57.5%
associate-*l/57.4%
Applied egg-rr57.4%
Taylor expanded in y around inf 28.8%
associate-/r*35.7%
associate-/l*35.6%
Simplified35.6%
if 1.06000000000000006e-131 < a < 2.8e83Initial program 73.5%
associate-+l-73.5%
*-commutative73.5%
associate-*r*75.6%
*-commutative75.6%
associate-+l-75.6%
associate-*l*75.5%
associate-*l*75.7%
*-commutative75.7%
Simplified75.7%
Taylor expanded in b around inf 36.1%
*-commutative36.1%
Simplified36.1%
Taylor expanded in b around 0 36.1%
*-commutative36.1%
associate-/r*42.7%
Simplified42.7%
if 2.8e83 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
associate-*l*66.9%
associate-*l*73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 49.3%
associate-/l*60.1%
associate-*r*60.1%
*-commutative60.1%
Simplified60.1%
Final simplification49.8%
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 -1.35e+96) (/ b (* z c)) (if (<= b 1.2e+147) (* -4.0 (/ (* a t) c)) (/ (/ b c) z))))
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 <= -1.35e+96) {
tmp = b / (z * c);
} else if (b <= 1.2e+147) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b / c) / z;
}
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 <= (-1.35d+96)) then
tmp = b / (z * c)
else if (b <= 1.2d+147) then
tmp = (-4.0d0) * ((a * t) / c)
else
tmp = (b / c) / z
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 <= -1.35e+96) {
tmp = b / (z * c);
} else if (b <= 1.2e+147) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = (b / c) / z;
}
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 <= -1.35e+96: tmp = b / (z * c) elif b <= 1.2e+147: tmp = -4.0 * ((a * t) / c) else: tmp = (b / c) / z 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 <= -1.35e+96) tmp = Float64(b / Float64(z * c)); elseif (b <= 1.2e+147) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); else tmp = Float64(Float64(b / c) / z); 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 <= -1.35e+96)
tmp = b / (z * c);
elseif (b <= 1.2e+147)
tmp = -4.0 * ((a * t) / c);
else
tmp = (b / c) / z;
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, -1.35e+96], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.2e+147], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $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 -1.35 \cdot 10^{+96}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 1.2 \cdot 10^{+147}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.35000000000000011e96Initial program 83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*81.2%
*-commutative81.2%
associate-+l-81.2%
associate-*l*81.2%
associate-*l*83.5%
*-commutative83.5%
Simplified83.5%
Taylor expanded in b around inf 66.0%
*-commutative66.0%
Simplified66.0%
if -1.35000000000000011e96 < b < 1.20000000000000001e147Initial program 73.7%
associate-+l-73.7%
*-commutative73.7%
associate-*r*71.4%
*-commutative71.4%
associate-+l-71.4%
associate-*l*71.4%
associate-*l*74.3%
*-commutative74.3%
Simplified74.3%
Taylor expanded in z around inf 46.9%
if 1.20000000000000001e147 < b Initial program 81.1%
associate-+l-81.1%
*-commutative81.1%
associate-*r*87.3%
*-commutative87.3%
associate-+l-87.3%
associate-*l*87.3%
associate-*l*87.4%
*-commutative87.4%
Simplified87.4%
Taylor expanded in b around inf 62.2%
associate-/r*71.6%
Simplified71.6%
Final simplification52.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 (<= a -3.9e-209) (* -4.0 (/ (* a t) c)) (if (<= a 3.7e+81) (/ (/ b z) c) (* (/ t c) (* a -4.0)))))
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 (a <= -3.9e-209) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3.7e+81) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 (a <= (-3.9d-209)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (a <= 3.7d+81) then
tmp = (b / z) / c
else
tmp = (t / c) * (a * (-4.0d0))
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 (a <= -3.9e-209) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3.7e+81) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 a <= -3.9e-209: tmp = -4.0 * ((a * t) / c) elif a <= 3.7e+81: tmp = (b / z) / c else: tmp = (t / c) * (a * -4.0) 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 (a <= -3.9e-209) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (a <= 3.7e+81) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 (a <= -3.9e-209)
tmp = -4.0 * ((a * t) / c);
elseif (a <= 3.7e+81)
tmp = (b / z) / c;
else
tmp = (t / c) * (a * -4.0);
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[a, -3.9e-209], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 3.7e+81], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;a \leq -3.9 \cdot 10^{-209}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;a \leq 3.7 \cdot 10^{+81}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if a < -3.9e-209Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in z around inf 49.6%
if -3.9e-209 < a < 3.7000000000000001e81Initial program 75.5%
associate-+l-75.5%
*-commutative75.5%
associate-*r*77.8%
*-commutative77.8%
associate-+l-77.8%
associate-*l*77.8%
associate-*l*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in b around inf 43.0%
*-commutative43.0%
Simplified43.0%
Taylor expanded in b around 0 43.0%
*-commutative43.0%
associate-/r*47.3%
Simplified47.3%
if 3.7000000000000001e81 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
associate-*l*66.9%
associate-*l*73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 49.3%
associate-/l*60.1%
associate-*r*60.1%
*-commutative60.1%
Simplified60.1%
Final simplification50.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 (if (<= a -3.9e-209) (/ (* t (* a -4.0)) c) (if (<= a 1e+84) (/ (/ b z) c) (* (/ t c) (* a -4.0)))))
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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1e+84) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 (a <= (-3.9d-209)) then
tmp = (t * (a * (-4.0d0))) / c
else if (a <= 1d+84) then
tmp = (b / z) / c
else
tmp = (t / c) * (a * (-4.0d0))
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 (a <= -3.9e-209) {
tmp = (t * (a * -4.0)) / c;
} else if (a <= 1e+84) {
tmp = (b / z) / c;
} else {
tmp = (t / c) * (a * -4.0);
}
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 a <= -3.9e-209: tmp = (t * (a * -4.0)) / c elif a <= 1e+84: tmp = (b / z) / c else: tmp = (t / c) * (a * -4.0) 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 (a <= -3.9e-209) tmp = Float64(Float64(t * Float64(a * -4.0)) / c); elseif (a <= 1e+84) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(t / c) * Float64(a * -4.0)); 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 (a <= -3.9e-209)
tmp = (t * (a * -4.0)) / c;
elseif (a <= 1e+84)
tmp = (b / z) / c;
else
tmp = (t / c) * (a * -4.0);
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[a, -3.9e-209], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[a, 1e+84], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(t / c), $MachinePrecision] * N[(a * -4.0), $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}\;a \leq -3.9 \cdot 10^{-209}:\\
\;\;\;\;\frac{t \cdot \left(a \cdot -4\right)}{c}\\
\mathbf{elif}\;a \leq 10^{+84}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c} \cdot \left(a \cdot -4\right)\\
\end{array}
\end{array}
if a < -3.9e-209Initial program 76.3%
associate-+l-76.3%
*-commutative76.3%
associate-*r*75.2%
*-commutative75.2%
associate-+l-75.2%
associate-*l*75.2%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in z around inf 49.6%
associate-/l*49.0%
associate-*r*49.0%
*-commutative49.0%
Simplified49.0%
associate-*r/49.6%
Applied egg-rr49.6%
if -3.9e-209 < a < 1.00000000000000006e84Initial program 75.5%
associate-+l-75.5%
*-commutative75.5%
associate-*r*77.8%
*-commutative77.8%
associate-+l-77.8%
associate-*l*77.8%
associate-*l*78.2%
*-commutative78.2%
Simplified78.2%
Taylor expanded in b around inf 43.0%
*-commutative43.0%
Simplified43.0%
Taylor expanded in b around 0 43.0%
*-commutative43.0%
associate-/r*47.3%
Simplified47.3%
if 1.00000000000000006e84 < a Initial program 77.5%
associate-+l-77.5%
*-commutative77.5%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
associate-*l*66.9%
associate-*l*73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 49.3%
associate-/l*60.1%
associate-*r*60.1%
*-commutative60.1%
Simplified60.1%
Final simplification50.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 (/ 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 76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*74.9%
*-commutative74.9%
associate-+l-74.9%
associate-*l*74.9%
associate-*l*77.4%
*-commutative77.4%
Simplified77.4%
Taylor expanded in b around inf 32.0%
*-commutative32.0%
Simplified32.0%
Final simplification32.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 (/ (/ b c) z))
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 / c) / z;
}
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 / c) / z
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 / c) / z;
}
[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 / c) / z
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(Float64(b / c) / z) 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 / c) / z;
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[(N[(b / c), $MachinePrecision] / z), $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{\frac{b}{c}}{z}
\end{array}
Initial program 76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*74.9%
*-commutative74.9%
associate-+l-74.9%
associate-*l*74.9%
associate-*l*77.4%
*-commutative77.4%
Simplified77.4%
Taylor expanded in b around inf 32.0%
associate-/r*33.5%
Simplified33.5%
Final simplification33.5%
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(Float64(b / 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[(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])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{\frac{b}{z}}{c}
\end{array}
Initial program 76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*74.9%
*-commutative74.9%
associate-+l-74.9%
associate-*l*74.9%
associate-*l*77.4%
*-commutative77.4%
Simplified77.4%
Taylor expanded in b around inf 32.0%
*-commutative32.0%
Simplified32.0%
Taylor expanded in b around 0 32.0%
*-commutative32.0%
associate-/r*33.9%
Simplified33.9%
Final simplification33.9%
(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 2024045
(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)))