
(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 and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (or (<= t_1 (- INFINITY)) (not (<= t_1 1e+303)))
(fma (/ z (* a 2.0)) (* t -9.0) (* y (* x (/ 0.5 a))))
(* (/ 0.5 a) (+ (* x y) (* -9.0 (* z t)))))))assert(x < y);
assert(z < t);
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)) || !(t_1 <= 1e+303)) {
tmp = fma((z / (a * 2.0)), (t * -9.0), (y * (x * (0.5 / a))));
} else {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
}
return tmp;
}
x, y = sort([x, y]) z, t = sort([z, t]) 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)) || !(t_1 <= 1e+303)) tmp = fma(Float64(z / Float64(a * 2.0)), Float64(t * -9.0), Float64(y * Float64(x * Float64(0.5 / a)))); else tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(-9.0 * Float64(z * t)))); end return tmp end
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 1e+303]], $MachinePrecision]], N[(N[(z / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * N[(t * -9.0), $MachinePrecision] + N[(y * N[(x * N[(0.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 10^{+303}\right):\\
\;\;\;\;\mathsf{fma}\left(\frac{z}{a \cdot 2}, t \cdot -9, y \cdot \left(x \cdot \frac{0.5}{a}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + -9 \cdot \left(z \cdot t\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -inf.0 or 1e303 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 74.2%
sub-neg74.2%
+-commutative74.2%
neg-sub074.2%
associate-+l-74.2%
sub0-neg74.2%
neg-mul-174.2%
associate-/l*74.2%
associate-/r/74.2%
*-commutative74.2%
sub-neg74.2%
+-commutative74.2%
neg-sub074.2%
associate-+l-74.2%
sub0-neg74.2%
distribute-lft-neg-out74.2%
distribute-rgt-neg-in74.2%
Simplified75.7%
Taylor expanded in x around 0 74.2%
+-commutative74.2%
associate-*r*74.2%
*-commutative74.2%
*-commutative74.2%
*-commutative74.2%
*-commutative74.2%
distribute-lft-in71.2%
associate-*r*81.3%
fma-def81.3%
clear-num81.3%
associate-*l/81.3%
*-un-lft-identity81.3%
div-inv81.3%
metadata-eval81.3%
*-commutative81.3%
*-commutative81.3%
*-commutative81.3%
associate-*l*92.2%
Applied egg-rr92.2%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 1e303Initial program 99.2%
sub-neg99.2%
+-commutative99.2%
neg-sub099.2%
associate-+l-99.2%
sub0-neg99.2%
neg-mul-199.2%
associate-/l*98.9%
associate-/r/99.1%
*-commutative99.1%
sub-neg99.1%
+-commutative99.1%
neg-sub099.1%
associate-+l-99.1%
sub0-neg99.1%
distribute-lft-neg-out99.1%
distribute-rgt-neg-in99.1%
Simplified99.0%
Taylor expanded in x around 0 99.5%
Final simplification97.6%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= (* (* z 9.0) t) INFINITY) (* (/ 0.5 a) (+ (* x y) (* -9.0 (* z t)))) (/ -4.5 (/ (/ a z) t))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (((z * 9.0) * t) <= ((double) INFINITY)) {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (((z * 9.0) * t) <= Double.POSITIVE_INFINITY) {
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
} else {
tmp = -4.5 / ((a / z) / t);
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if ((z * 9.0) * t) <= math.inf: tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t))) else: tmp = -4.5 / ((a / z) / t) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(Float64(z * 9.0) * t) <= Inf) tmp = Float64(Float64(0.5 / a) * Float64(Float64(x * y) + Float64(-9.0 * Float64(z * t)))); else tmp = Float64(-4.5 / Float64(Float64(a / z) / t)); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (((z * 9.0) * t) <= Inf)
tmp = (0.5 / a) * ((x * y) + (-9.0 * (z * t)));
else
tmp = -4.5 / ((a / z) / t);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision], Infinity], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] + N[(-9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 / N[(N[(a / z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(z \cdot 9\right) \cdot t \leq \infty:\\
\;\;\;\;\frac{0.5}{a} \cdot \left(x \cdot y + -9 \cdot \left(z \cdot t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-4.5}{\frac{\frac{a}{z}}{t}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < +inf.0Initial program 92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
neg-mul-192.7%
associate-/l*92.5%
associate-/r/92.7%
*-commutative92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
distribute-lft-neg-out92.7%
distribute-rgt-neg-in92.7%
Simplified93.0%
Taylor expanded in x around 0 93.0%
if +inf.0 < (*.f64 (*.f64 z 9) t) Initial program 92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
neg-mul-192.7%
associate-/l*92.5%
associate-/r/92.7%
*-commutative92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
distribute-lft-neg-out92.7%
distribute-rgt-neg-in92.7%
Simplified93.0%
Taylor expanded in x around 0 57.4%
associate-/l*56.5%
associate-/r/54.0%
Simplified54.0%
associate-*l/57.4%
associate-/l*56.5%
Applied egg-rr56.5%
clear-num56.5%
un-div-inv56.5%
Applied egg-rr56.5%
Final simplification93.0%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -5e+170) (/ (* y 0.5) (/ a x)) (if (<= x 3.8e-136) (/ (/ -4.5 a) (/ (/ 1.0 t) z)) (* 0.5 (* x (/ y a))))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5e+170) {
tmp = (y * 0.5) / (a / x);
} else if (x <= 3.8e-136) {
tmp = (-4.5 / a) / ((1.0 / t) / z);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (x <= (-5d+170)) then
tmp = (y * 0.5d0) / (a / x)
else if (x <= 3.8d-136) then
tmp = ((-4.5d0) / a) / ((1.0d0 / t) / z)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5e+170) {
tmp = (y * 0.5) / (a / x);
} else if (x <= 3.8e-136) {
tmp = (-4.5 / a) / ((1.0 / t) / z);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if x <= -5e+170: tmp = (y * 0.5) / (a / x) elif x <= 3.8e-136: tmp = (-4.5 / a) / ((1.0 / t) / z) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (x <= -5e+170) tmp = Float64(Float64(y * 0.5) / Float64(a / x)); elseif (x <= 3.8e-136) tmp = Float64(Float64(-4.5 / a) / Float64(Float64(1.0 / t) / z)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (x <= -5e+170)
tmp = (y * 0.5) / (a / x);
elseif (x <= 3.8e-136)
tmp = (-4.5 / a) / ((1.0 / t) / z);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, -5e+170], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.8e-136], N[(N[(-4.5 / a), $MachinePrecision] / N[(N[(1.0 / t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5 \cdot 10^{+170}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\mathbf{elif}\;x \leq 3.8 \cdot 10^{-136}:\\
\;\;\;\;\frac{\frac{-4.5}{a}}{\frac{\frac{1}{t}}{z}}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if x < -4.99999999999999977e170Initial program 89.9%
sub-neg89.9%
+-commutative89.9%
neg-sub089.9%
associate-+l-89.9%
sub0-neg89.9%
neg-mul-189.9%
associate-/l*89.9%
associate-/r/89.7%
*-commutative89.7%
sub-neg89.7%
+-commutative89.7%
neg-sub089.7%
associate-+l-89.7%
sub0-neg89.7%
distribute-lft-neg-out89.7%
distribute-rgt-neg-in89.7%
Simplified89.7%
Taylor expanded in x around inf 76.7%
*-commutative76.7%
associate-/l*76.7%
associate-*l/76.7%
Applied egg-rr76.7%
if -4.99999999999999977e170 < x < 3.8000000000000003e-136Initial program 96.9%
sub-neg96.9%
+-commutative96.9%
neg-sub096.9%
associate-+l-96.9%
sub0-neg96.9%
neg-mul-196.9%
associate-/l*96.7%
associate-/r/96.7%
*-commutative96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
distribute-lft-neg-out96.7%
distribute-rgt-neg-in96.7%
Simplified96.7%
Taylor expanded in x around 0 72.2%
clear-num72.1%
un-div-inv72.1%
div-inv72.1%
associate-/r*72.1%
associate-/r*72.1%
Applied egg-rr72.1%
if 3.8000000000000003e-136 < x Initial program 87.7%
sub-neg87.7%
+-commutative87.7%
neg-sub087.7%
associate-+l-87.7%
sub0-neg87.7%
neg-mul-187.7%
associate-/l*87.4%
associate-/r/87.8%
*-commutative87.8%
sub-neg87.8%
+-commutative87.8%
neg-sub087.8%
associate-+l-87.8%
sub0-neg87.8%
distribute-lft-neg-out87.8%
distribute-rgt-neg-in87.8%
Simplified88.7%
Taylor expanded in x around inf 51.7%
associate-/l*56.3%
associate-/r/54.7%
Applied egg-rr54.7%
Final simplification66.2%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (or (<= x -1.18e+171) (not (<= x 1.2e-136))) (* 0.5 (* x (/ y a))) (* -4.5 (/ (* z t) a))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x <= -1.18e+171) || !(x <= 1.2e-136)) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 ((x <= (-1.18d+171)) .or. (.not. (x <= 1.2d-136))) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * ((z * t) / a)
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if ((x <= -1.18e+171) || !(x <= 1.2e-136)) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * ((z * t) / a);
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if (x <= -1.18e+171) or not (x <= 1.2e-136): tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * ((z * t) / a) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if ((x <= -1.18e+171) || !(x <= 1.2e-136)) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if ((x <= -1.18e+171) || ~((x <= 1.2e-136)))
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * ((z * t) / a);
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[Or[LessEqual[x, -1.18e+171], N[Not[LessEqual[x, 1.2e-136]], $MachinePrecision]], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.18 \cdot 10^{+171} \lor \neg \left(x \leq 1.2 \cdot 10^{-136}\right):\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\end{array}
\end{array}
if x < -1.1799999999999999e171 or 1.1999999999999999e-136 < x Initial program 88.3%
sub-neg88.3%
+-commutative88.3%
neg-sub088.3%
associate-+l-88.3%
sub0-neg88.3%
neg-mul-188.3%
associate-/l*88.0%
associate-/r/88.2%
*-commutative88.2%
sub-neg88.2%
+-commutative88.2%
neg-sub088.2%
associate-+l-88.2%
sub0-neg88.2%
distribute-lft-neg-out88.2%
distribute-rgt-neg-in88.2%
Simplified88.9%
Taylor expanded in x around inf 57.6%
associate-/l*61.1%
associate-/r/59.0%
Applied egg-rr59.0%
if -1.1799999999999999e171 < x < 1.1999999999999999e-136Initial program 96.9%
sub-neg96.9%
+-commutative96.9%
neg-sub096.9%
associate-+l-96.9%
sub0-neg96.9%
neg-mul-196.9%
associate-/l*96.7%
associate-/r/96.7%
*-commutative96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
distribute-lft-neg-out96.7%
distribute-rgt-neg-in96.7%
Simplified96.7%
Taylor expanded in x around 0 72.2%
Final simplification65.8%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -5.8e+170) (* 0.5 (/ (* x y) a)) (if (<= x 3.6e-138) (* -4.5 (/ (* z t) a)) (* 0.5 (* x (/ y a))))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5.8e+170) {
tmp = 0.5 * ((x * y) / a);
} else if (x <= 3.6e-138) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (x <= (-5.8d+170)) then
tmp = 0.5d0 * ((x * y) / a)
else if (x <= 3.6d-138) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5.8e+170) {
tmp = 0.5 * ((x * y) / a);
} else if (x <= 3.6e-138) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if x <= -5.8e+170: tmp = 0.5 * ((x * y) / a) elif x <= 3.6e-138: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (x <= -5.8e+170) tmp = Float64(0.5 * Float64(Float64(x * y) / a)); elseif (x <= 3.6e-138) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (x <= -5.8e+170)
tmp = 0.5 * ((x * y) / a);
elseif (x <= 3.6e-138)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, -5.8e+170], N[(0.5 * N[(N[(x * y), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.6e-138], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5.8 \cdot 10^{+170}:\\
\;\;\;\;0.5 \cdot \frac{x \cdot y}{a}\\
\mathbf{elif}\;x \leq 3.6 \cdot 10^{-138}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if x < -5.8000000000000001e170Initial program 89.9%
sub-neg89.9%
+-commutative89.9%
neg-sub089.9%
associate-+l-89.9%
sub0-neg89.9%
neg-mul-189.9%
associate-/l*89.9%
associate-/r/89.7%
*-commutative89.7%
sub-neg89.7%
+-commutative89.7%
neg-sub089.7%
associate-+l-89.7%
sub0-neg89.7%
distribute-lft-neg-out89.7%
distribute-rgt-neg-in89.7%
Simplified89.7%
Taylor expanded in x around inf 76.7%
if -5.8000000000000001e170 < x < 3.60000000000000018e-138Initial program 96.9%
sub-neg96.9%
+-commutative96.9%
neg-sub096.9%
associate-+l-96.9%
sub0-neg96.9%
neg-mul-196.9%
associate-/l*96.7%
associate-/r/96.7%
*-commutative96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
distribute-lft-neg-out96.7%
distribute-rgt-neg-in96.7%
Simplified96.7%
Taylor expanded in x around 0 72.2%
if 3.60000000000000018e-138 < x Initial program 87.7%
sub-neg87.7%
+-commutative87.7%
neg-sub087.7%
associate-+l-87.7%
sub0-neg87.7%
neg-mul-187.7%
associate-/l*87.4%
associate-/r/87.8%
*-commutative87.8%
sub-neg87.8%
+-commutative87.8%
neg-sub087.8%
associate-+l-87.8%
sub0-neg87.8%
distribute-lft-neg-out87.8%
distribute-rgt-neg-in87.8%
Simplified88.7%
Taylor expanded in x around inf 51.7%
associate-/l*56.3%
associate-/r/54.7%
Applied egg-rr54.7%
Final simplification66.2%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (if (<= x -5e+170) (/ (* y 0.5) (/ a x)) (if (<= x 3.2e-136) (* -4.5 (/ (* z t) a)) (* 0.5 (* x (/ y a))))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5e+170) {
tmp = (y * 0.5) / (a / x);
} else if (x <= 3.2e-136) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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 (x <= (-5d+170)) then
tmp = (y * 0.5d0) / (a / x)
else if (x <= 3.2d-136) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 0.5d0 * (x * (y / a))
end if
code = tmp
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (x <= -5e+170) {
tmp = (y * 0.5) / (a / x);
} else if (x <= 3.2e-136) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if x <= -5e+170: tmp = (y * 0.5) / (a / x) elif x <= 3.2e-136: tmp = -4.5 * ((z * t) / a) else: tmp = 0.5 * (x * (y / a)) return tmp
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (x <= -5e+170) tmp = Float64(Float64(y * 0.5) / Float64(a / x)); elseif (x <= 3.2e-136) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); end return tmp end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (x <= -5e+170)
tmp = (y * 0.5) / (a / x);
elseif (x <= 3.2e-136)
tmp = -4.5 * ((z * t) / a);
else
tmp = 0.5 * (x * (y / a));
end
tmp_2 = tmp;
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[x, -5e+170], N[(N[(y * 0.5), $MachinePrecision] / N[(a / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.2e-136], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq -5 \cdot 10^{+170}:\\
\;\;\;\;\frac{y \cdot 0.5}{\frac{a}{x}}\\
\mathbf{elif}\;x \leq 3.2 \cdot 10^{-136}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if x < -4.99999999999999977e170Initial program 89.9%
sub-neg89.9%
+-commutative89.9%
neg-sub089.9%
associate-+l-89.9%
sub0-neg89.9%
neg-mul-189.9%
associate-/l*89.9%
associate-/r/89.7%
*-commutative89.7%
sub-neg89.7%
+-commutative89.7%
neg-sub089.7%
associate-+l-89.7%
sub0-neg89.7%
distribute-lft-neg-out89.7%
distribute-rgt-neg-in89.7%
Simplified89.7%
Taylor expanded in x around inf 76.7%
*-commutative76.7%
associate-/l*76.7%
associate-*l/76.7%
Applied egg-rr76.7%
if -4.99999999999999977e170 < x < 3.19999999999999993e-136Initial program 96.9%
sub-neg96.9%
+-commutative96.9%
neg-sub096.9%
associate-+l-96.9%
sub0-neg96.9%
neg-mul-196.9%
associate-/l*96.7%
associate-/r/96.7%
*-commutative96.7%
sub-neg96.7%
+-commutative96.7%
neg-sub096.7%
associate-+l-96.7%
sub0-neg96.7%
distribute-lft-neg-out96.7%
distribute-rgt-neg-in96.7%
Simplified96.7%
Taylor expanded in x around 0 72.2%
if 3.19999999999999993e-136 < x Initial program 87.7%
sub-neg87.7%
+-commutative87.7%
neg-sub087.7%
associate-+l-87.7%
sub0-neg87.7%
neg-mul-187.7%
associate-/l*87.4%
associate-/r/87.8%
*-commutative87.8%
sub-neg87.8%
+-commutative87.8%
neg-sub087.8%
associate-+l-87.8%
sub0-neg87.8%
distribute-lft-neg-out87.8%
distribute-rgt-neg-in87.8%
Simplified88.7%
Taylor expanded in x around inf 51.7%
associate-/l*56.3%
associate-/r/54.7%
Applied egg-rr54.7%
Final simplification66.2%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* t (/ z a))))
assert(x < y);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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) * (t * (z / a))
end function
assert x < y;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t * (z / a));
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / a))) end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t * (z / a));
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
neg-mul-192.7%
associate-/l*92.5%
associate-/r/92.7%
*-commutative92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
distribute-lft-neg-out92.7%
distribute-rgt-neg-in92.7%
Simplified93.0%
Taylor expanded in x around 0 93.0%
+-commutative93.0%
associate-*r*92.6%
*-commutative92.6%
*-commutative92.6%
*-commutative92.6%
*-commutative92.6%
distribute-lft-in91.8%
associate-*r*89.6%
fma-def89.6%
clear-num89.6%
associate-*l/89.6%
*-un-lft-identity89.6%
div-inv89.6%
metadata-eval89.6%
*-commutative89.6%
*-commutative89.6%
*-commutative89.6%
associate-*l*88.9%
Applied egg-rr88.9%
Taylor expanded in z around inf 57.4%
associate-*r/56.5%
Simplified56.5%
Final simplification56.5%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t 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);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t 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] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
neg-mul-192.7%
associate-/l*92.5%
associate-/r/92.7%
*-commutative92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
distribute-lft-neg-out92.7%
distribute-rgt-neg-in92.7%
Simplified93.0%
Taylor expanded in x around 0 57.4%
associate-/l*56.5%
associate-/r/54.0%
Simplified54.0%
Final simplification54.0%
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t 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);
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * ((z * t) / a);
}
NOTE: x and y should be sorted in increasing order before calling this function.
NOTE: z and t 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;
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * ((z * t) / a);
}
[x, y] = sort([x, y]) [z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * ((z * t) / a)
x, y = sort([x, y]) z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(Float64(z * t) / a)) end
x, y = num2cell(sort([x, y])){:}
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * ((z * t) / a);
end
NOTE: x and y should be sorted in increasing order before calling this function. NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \frac{z \cdot t}{a}
\end{array}
Initial program 92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
neg-mul-192.7%
associate-/l*92.5%
associate-/r/92.7%
*-commutative92.7%
sub-neg92.7%
+-commutative92.7%
neg-sub092.7%
associate-+l-92.7%
sub0-neg92.7%
distribute-lft-neg-out92.7%
distribute-rgt-neg-in92.7%
Simplified93.0%
Taylor expanded in x around 0 57.4%
Final simplification57.4%
(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 2023207
(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)))