
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 9 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (<= t_1 (- INFINITY))
(fma -4.5 (* z (/ t a)) (* (/ y 2.0) (/ x a)))
(if (<= t_1 5e+200)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(fma x (* (/ y a) 0.5) (/ t (/ a (* z -4.5))))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = fma(-4.5, (z * (t / a)), ((y / 2.0) * (x / a)));
} else if (t_1 <= 5e+200) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = fma(x, ((y / a) * 0.5), (t / (a / (z * -4.5))));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = fma(-4.5, Float64(z * Float64(t / a)), Float64(Float64(y / 2.0) * Float64(x / a))); elseif (t_1 <= 5e+200) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = fma(x, Float64(Float64(y / a) * 0.5), Float64(t / Float64(a / Float64(z * -4.5)))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] + N[(N[(y / 2.0), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+200], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(y / a), $MachinePrecision] * 0.5), $MachinePrecision] + N[(t / N[(a / N[(z * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-4.5, z \cdot \frac{t}{a}, \frac{y}{2} \cdot \frac{x}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+200}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(x, \frac{y}{a} \cdot 0.5, \frac{t}{\frac{a}{z \cdot -4.5}}\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -inf.0Initial program 64.6%
associate-*l*64.6%
Simplified64.6%
Taylor expanded in x around 0 61.5%
fma-def61.5%
associate-/l*79.1%
associate-/r/79.1%
associate-*r/79.1%
*-commutative79.1%
associate-*r*79.1%
Simplified79.1%
div-inv79.1%
associate-*l*79.1%
*-commutative79.1%
associate-*l*79.1%
metadata-eval79.1%
div-inv79.1%
times-frac79.1%
*-un-lft-identity79.1%
*-commutative79.1%
times-frac93.6%
Applied egg-rr93.6%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 5.00000000000000019e200Initial program 99.5%
associate-*l*99.6%
Simplified99.6%
if 5.00000000000000019e200 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 76.1%
associate-*l*76.0%
Simplified76.0%
add-sqr-sqrt35.5%
sqrt-unprod45.9%
swap-sqr45.9%
metadata-eval45.9%
metadata-eval45.9%
swap-sqr45.9%
*-commutative45.9%
*-commutative45.9%
sqrt-unprod15.2%
add-sqr-sqrt28.1%
add-cube-cbrt28.1%
pow328.1%
Applied egg-rr76.0%
Taylor expanded in x around 0 76.0%
fma-def76.0%
pow-base-176.0%
*-commutative76.0%
*-lft-identity76.0%
fma-def76.0%
associate-*r*76.1%
metadata-eval76.1%
distribute-lft-neg-in76.1%
*-commutative76.1%
fma-def78.6%
distribute-lft-neg-in78.6%
metadata-eval78.6%
*-commutative78.6%
Simplified78.6%
Taylor expanded in t around 0 68.6%
Simplified87.3%
Final simplification96.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (* z 9.0) t)))
(if (<= t_1 (- INFINITY))
(* -4.5 (* t (/ z a)))
(if (<= t_1 2e+167)
(/ (fma x y (* z (* t -9.0))) (* a 2.0))
(* (/ z a) (/ (* t -9.0) 2.0))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -4.5 * (t * (z / a));
} else if (t_1 <= 2e+167) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = (z / a) * ((t * -9.0) / 2.0);
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(z * 9.0) * t) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t_1 <= 2e+167) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(Float64(z / a) * Float64(Float64(t * -9.0) / 2.0)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+167], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(N[(t * -9.0), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+167}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \frac{t \cdot -9}{2}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -inf.0Initial program 62.8%
associate-*l*62.8%
Simplified62.8%
add-sqr-sqrt28.4%
sqrt-unprod34.0%
swap-sqr34.0%
metadata-eval34.0%
metadata-eval34.0%
swap-sqr34.0%
*-commutative34.0%
*-commutative34.0%
sqrt-unprod5.6%
add-sqr-sqrt5.6%
add-cube-cbrt5.6%
pow35.6%
Applied egg-rr62.8%
Taylor expanded in x around 0 68.4%
pow-base-168.4%
associate-*r*68.4%
metadata-eval68.4%
*-commutative68.4%
associate-*l/94.4%
Simplified94.4%
if -inf.0 < (*.f64 (*.f64 z 9) t) < 2.0000000000000001e167Initial program 95.5%
div-sub95.0%
*-commutative95.0%
div-sub95.5%
*-commutative95.5%
cancel-sign-sub-inv95.5%
fma-def95.5%
distribute-lft-neg-in95.5%
associate-*l*95.5%
distribute-rgt-neg-in95.5%
*-commutative95.5%
distribute-rgt-neg-in95.5%
metadata-eval95.5%
Simplified95.5%
if 2.0000000000000001e167 < (*.f64 (*.f64 z 9) t) Initial program 82.2%
associate-*l*82.2%
Simplified82.2%
Taylor expanded in x around 0 82.2%
associate-*r*82.2%
*-commutative82.2%
times-frac99.9%
Applied egg-rr99.9%
Final simplification96.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (- (* x y) (* (* z 9.0) t)) (- INFINITY)) (fma -4.5 (* z (/ t a)) (* (/ y 2.0) (/ x a))) (/ (fma x y (* z (* t -9.0))) (* a 2.0))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((x * y) - ((z * 9.0) * t)) <= -((double) INFINITY)) {
tmp = fma(-4.5, (z * (t / a)), ((y / 2.0) * (x / a)));
} else {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) <= Float64(-Inf)) tmp = fma(-4.5, Float64(z * Float64(t / a)), Float64(Float64(y / 2.0) * Float64(x / a))); else tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision] + N[(N[(y / 2.0), $MachinePrecision] * N[(x / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y - \left(z \cdot 9\right) \cdot t \leq -\infty:\\
\;\;\;\;\mathsf{fma}\left(-4.5, z \cdot \frac{t}{a}, \frac{y}{2} \cdot \frac{x}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -inf.0Initial program 64.6%
associate-*l*64.6%
Simplified64.6%
Taylor expanded in x around 0 61.5%
fma-def61.5%
associate-/l*79.1%
associate-/r/79.1%
associate-*r/79.1%
*-commutative79.1%
associate-*r*79.1%
Simplified79.1%
div-inv79.1%
associate-*l*79.1%
*-commutative79.1%
associate-*l*79.1%
metadata-eval79.1%
div-inv79.1%
times-frac79.1%
*-un-lft-identity79.1%
*-commutative79.1%
times-frac93.6%
Applied egg-rr93.6%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 95.3%
div-sub93.1%
*-commutative93.1%
div-sub95.3%
*-commutative95.3%
cancel-sign-sub-inv95.3%
fma-def95.8%
distribute-lft-neg-in95.8%
associate-*l*95.8%
distribute-rgt-neg-in95.8%
*-commutative95.8%
distribute-rgt-neg-in95.8%
metadata-eval95.8%
Simplified95.8%
Final simplification95.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (* z 9.0) t)))
(if (<= t_1 (- INFINITY))
(* -4.5 (* t (/ z a)))
(if (<= t_1 2e+167)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(* (/ z a) (/ (* t -9.0) 2.0))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = -4.5 * (t * (z / a));
} else if (t_1 <= 2e+167) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = (z / a) * ((t * -9.0) / 2.0);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -Double.POSITIVE_INFINITY) {
tmp = -4.5 * (t * (z / a));
} else if (t_1 <= 2e+167) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = (z / a) * ((t * -9.0) / 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = (z * 9.0) * t tmp = 0 if t_1 <= -math.inf: tmp = -4.5 * (t * (z / a)) elif t_1 <= 2e+167: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = (z / a) * ((t * -9.0) / 2.0) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(z * 9.0) * t) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(-4.5 * Float64(t * Float64(z / a))); elseif (t_1 <= 2e+167) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(z / a) * Float64(Float64(t * -9.0) / 2.0)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (z * 9.0) * t;
tmp = 0.0;
if (t_1 <= -Inf)
tmp = -4.5 * (t * (z / a));
elseif (t_1 <= 2e+167)
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
else
tmp = (z / a) * ((t * -9.0) / 2.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+167], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(N[(t * -9.0), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+167}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{a} \cdot \frac{t \cdot -9}{2}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -inf.0Initial program 62.8%
associate-*l*62.8%
Simplified62.8%
add-sqr-sqrt28.4%
sqrt-unprod34.0%
swap-sqr34.0%
metadata-eval34.0%
metadata-eval34.0%
swap-sqr34.0%
*-commutative34.0%
*-commutative34.0%
sqrt-unprod5.6%
add-sqr-sqrt5.6%
add-cube-cbrt5.6%
pow35.6%
Applied egg-rr62.8%
Taylor expanded in x around 0 68.4%
pow-base-168.4%
associate-*r*68.4%
metadata-eval68.4%
*-commutative68.4%
associate-*l/94.4%
Simplified94.4%
if -inf.0 < (*.f64 (*.f64 z 9) t) < 2.0000000000000001e167Initial program 95.5%
associate-*l*95.5%
Simplified95.5%
if 2.0000000000000001e167 < (*.f64 (*.f64 z 9) t) Initial program 82.2%
associate-*l*82.2%
Simplified82.2%
Taylor expanded in x around 0 82.2%
associate-*r*82.2%
*-commutative82.2%
times-frac99.9%
Applied egg-rr99.9%
Final simplification96.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* x y) (- INFINITY)) (* y (* (/ x a) 0.5)) (* (+ (* x y) (* t (* z -9.0))) (/ 0.5 a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -((double) INFINITY)) {
tmp = y * ((x / a) * 0.5);
} else {
tmp = ((x * y) + (t * (z * -9.0))) * (0.5 / a);
}
return tmp;
}
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x * y) <= -Double.POSITIVE_INFINITY) {
tmp = y * ((x / a) * 0.5);
} else {
tmp = ((x * y) + (t * (z * -9.0))) * (0.5 / a);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (x * y) <= -math.inf: tmp = y * ((x / a) * 0.5) else: tmp = ((x * y) + (t * (z * -9.0))) * (0.5 / a) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(x * y) <= Float64(-Inf)) tmp = Float64(y * Float64(Float64(x / a) * 0.5)); else tmp = Float64(Float64(Float64(x * y) + Float64(t * Float64(z * -9.0))) * Float64(0.5 / a)); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x * y) <= -Inf)
tmp = y * ((x / a) * 0.5);
else
tmp = ((x * y) + (t * (z * -9.0))) * (0.5 / a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(x * y), $MachinePrecision], (-Infinity)], N[(y * N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] + N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq -\infty:\\
\;\;\;\;y \cdot \left(\frac{x}{a} \cdot 0.5\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot y + t \cdot \left(z \cdot -9\right)\right) \cdot \frac{0.5}{a}\\
\end{array}
\end{array}
if (*.f64 x y) < -inf.0Initial program 52.2%
associate-*l*52.2%
Simplified52.2%
add-sqr-sqrt25.3%
sqrt-unprod52.2%
swap-sqr52.2%
metadata-eval52.2%
metadata-eval52.2%
swap-sqr52.2%
*-commutative52.2%
*-commutative52.2%
sqrt-unprod33.2%
add-sqr-sqrt52.2%
add-cube-cbrt52.2%
pow352.2%
Applied egg-rr52.2%
Taylor expanded in x around inf 58.5%
associate-*r/58.5%
*-commutative58.5%
associate-*r*58.5%
*-rgt-identity58.5%
associate-*r/58.5%
*-commutative58.5%
associate-*r*93.6%
associate-*l*93.6%
associate-*r/93.6%
*-rgt-identity93.6%
Simplified93.6%
if -inf.0 < (*.f64 x y) Initial program 94.1%
associate-*l*94.2%
Simplified94.2%
add-sqr-sqrt50.3%
sqrt-unprod58.6%
swap-sqr58.6%
metadata-eval58.6%
metadata-eval58.6%
swap-sqr58.6%
*-commutative58.6%
*-commutative58.6%
sqrt-unprod19.9%
add-sqr-sqrt44.8%
add-cube-cbrt44.8%
pow344.8%
Applied egg-rr93.7%
Taylor expanded in x around 0 94.2%
fma-def94.2%
pow-base-194.2%
*-commutative94.2%
*-lft-identity94.2%
fma-def94.2%
associate-*r*94.1%
metadata-eval94.1%
distribute-lft-neg-in94.1%
*-commutative94.1%
fma-def94.1%
distribute-lft-neg-in94.1%
metadata-eval94.1%
*-commutative94.1%
Simplified94.1%
div-inv94.1%
*-commutative94.1%
associate-/r*94.1%
metadata-eval94.1%
Applied egg-rr94.1%
fma-udef94.1%
+-commutative94.1%
Applied egg-rr94.1%
Final simplification94.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -1.2e-193) (* -4.5 (* z (/ t a))) (if (<= t 2.4e+54) (* 0.5 (/ 1.0 (/ a (* x y)))) (* -4.5 (/ z (/ a t))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 2.4e+54) {
tmp = 0.5 * (1.0 / (a / (x * y)));
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.2d-193)) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 2.4d+54) then
tmp = 0.5d0 * (1.0d0 / (a / (x * y)))
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 2.4e+54) {
tmp = 0.5 * (1.0 / (a / (x * y)));
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -1.2e-193: tmp = -4.5 * (z * (t / a)) elif t <= 2.4e+54: tmp = 0.5 * (1.0 / (a / (x * y))) else: tmp = -4.5 * (z / (a / t)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.2e-193) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 2.4e+54) tmp = Float64(0.5 * Float64(1.0 / Float64(a / Float64(x * y)))); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.2e-193)
tmp = -4.5 * (z * (t / a));
elseif (t <= 2.4e+54)
tmp = 0.5 * (1.0 / (a / (x * y)));
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.2e-193], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.4e+54], N[(0.5 * N[(1.0 / N[(a / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.2 \cdot 10^{-193}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 2.4 \cdot 10^{+54}:\\
\;\;\;\;0.5 \cdot \frac{1}{\frac{a}{x \cdot y}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -1.2e-193Initial program 87.4%
associate-*l*87.4%
Simplified87.4%
Taylor expanded in x around 0 61.5%
associate-/l*62.1%
associate-/r/61.8%
Simplified61.8%
if -1.2e-193 < t < 2.39999999999999998e54Initial program 96.8%
associate-*l*96.8%
Simplified96.8%
Taylor expanded in x around inf 71.3%
associate-*r/64.6%
Simplified64.6%
associate-*r/71.3%
clear-num71.3%
Applied egg-rr71.3%
if 2.39999999999999998e54 < t Initial program 89.5%
associate-*l*89.6%
Simplified89.6%
Taylor expanded in x around 0 76.2%
associate-/l*75.8%
associate-/r/79.8%
Simplified79.8%
*-commutative79.8%
clear-num79.6%
un-div-inv82.0%
Applied egg-rr82.0%
Final simplification69.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -1.2e-193) (* -4.5 (* z (/ t a))) (if (<= t 1.3e+27) (* 0.5 (* x (/ y a))) (* -4.5 (/ z (/ a t))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 1.3e+27) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.2d-193)) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 1.3d+27) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 1.3e+27) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -1.2e-193: tmp = -4.5 * (z * (t / a)) elif t <= 1.3e+27: tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * (z / (a / t)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.2e-193) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 1.3e+27) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.2e-193)
tmp = -4.5 * (z * (t / a));
elseif (t <= 1.3e+27)
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.2e-193], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.3e+27], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.2 \cdot 10^{-193}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 1.3 \cdot 10^{+27}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -1.2e-193Initial program 87.4%
associate-*l*87.4%
Simplified87.4%
Taylor expanded in x around 0 61.5%
associate-/l*62.1%
associate-/r/61.8%
Simplified61.8%
if -1.2e-193 < t < 1.30000000000000004e27Initial program 96.6%
associate-*l*96.7%
Simplified96.7%
Taylor expanded in x around inf 73.1%
associate-*r/66.2%
Simplified66.2%
if 1.30000000000000004e27 < t Initial program 90.2%
associate-*l*90.3%
Simplified90.3%
Taylor expanded in x around 0 76.1%
associate-/l*75.7%
associate-/r/79.4%
Simplified79.4%
*-commutative79.4%
clear-num79.3%
un-div-inv81.6%
Applied egg-rr81.6%
Final simplification68.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= t -1.2e-193) (* -4.5 (* z (/ t a))) (if (<= t 6.5e+54) (/ (* x (* y 0.5)) a) (* -4.5 (/ z (/ a t))))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 6.5e+54) {
tmp = (x * (y * 0.5)) / a;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.2d-193)) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 6.5d+54) then
tmp = (x * (y * 0.5d0)) / a
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-193) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 6.5e+54) {
tmp = (x * (y * 0.5)) / a;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -1.2e-193: tmp = -4.5 * (z * (t / a)) elif t <= 6.5e+54: tmp = (x * (y * 0.5)) / a else: tmp = -4.5 * (z / (a / t)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.2e-193) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 6.5e+54) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.2e-193)
tmp = -4.5 * (z * (t / a));
elseif (t <= 6.5e+54)
tmp = (x * (y * 0.5)) / a;
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.2e-193], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 6.5e+54], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.2 \cdot 10^{-193}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 6.5 \cdot 10^{+54}:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -1.2e-193Initial program 87.4%
associate-*l*87.4%
Simplified87.4%
Taylor expanded in x around 0 61.5%
associate-/l*62.1%
associate-/r/61.8%
Simplified61.8%
if -1.2e-193 < t < 6.5e54Initial program 96.8%
associate-*l*96.8%
Simplified96.8%
Taylor expanded in x around inf 71.3%
associate-*r/71.3%
*-commutative71.3%
associate-*r*71.3%
Simplified71.3%
if 6.5e54 < t Initial program 89.5%
associate-*l*89.6%
Simplified89.6%
Taylor expanded in x around 0 76.2%
associate-/l*75.8%
associate-/r/79.8%
Simplified79.8%
*-commutative79.8%
clear-num79.6%
un-div-inv82.0%
Applied egg-rr82.0%
Final simplification69.9%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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
code = (-4.5d0) * (z * (t / a))
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 91.5%
associate-*l*91.6%
Simplified91.6%
Taylor expanded in x around 0 55.1%
associate-/l*54.1%
associate-/r/55.3%
Simplified55.3%
Final simplification55.3%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
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) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2024026
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:herbie-target
(if (< a -2.090464557976709e+86) (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z)))) (if (< a 2.144030707833976e+99) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)) (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))