
(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 (if (<= (* x y) 2e+265) (/ (fma x y (* z (* t -9.0))) (* a 2.0)) (* 0.5 (* x (/ y 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) <= 2e+265) {
tmp = fma(x, y, (z * (t * -9.0))) / (a * 2.0);
} else {
tmp = 0.5 * (x * (y / 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) <= 2e+265) tmp = Float64(fma(x, y, Float64(z * Float64(t * -9.0))) / Float64(a * 2.0)); else tmp = Float64(0.5 * Float64(x * Float64(y / a))); 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[(x * y), $MachinePrecision], 2e+265], N[(N[(x * y + N[(z * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $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 2 \cdot 10^{+265}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t \cdot -9\right)\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if (*.f64 x y) < 2.00000000000000013e265Initial program 94.8%
div-sub93.1%
*-commutative93.1%
div-sub94.8%
cancel-sign-sub-inv94.8%
*-commutative94.8%
fma-define95.7%
distribute-rgt-neg-in95.7%
associate-*r*95.3%
distribute-lft-neg-in95.3%
*-commutative95.3%
distribute-rgt-neg-in95.3%
metadata-eval95.3%
Simplified95.3%
if 2.00000000000000013e265 < (*.f64 x y) Initial program 72.0%
div-sub67.0%
*-commutative67.0%
div-sub72.0%
cancel-sign-sub-inv72.0%
*-commutative72.0%
fma-define72.0%
distribute-rgt-neg-in72.0%
associate-*r*72.0%
distribute-lft-neg-in72.0%
*-commutative72.0%
distribute-rgt-neg-in72.0%
metadata-eval72.0%
Simplified72.0%
Taylor expanded in x around inf 72.0%
associate-/l*95.4%
Simplified95.4%
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) -2e+81)
(* 0.5 (* x (/ y a)))
(if (<= (* x y) 1e-62)
(* -4.5 (/ (* z t) a))
(/ 1.0 (* 2.0 (/ (/ a x) y))))))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) <= -2e+81) {
tmp = 0.5 * (x * (y / a));
} else if ((x * y) <= 1e-62) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 1.0 / (2.0 * ((a / x) / y));
}
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 ((x * y) <= (-2d+81)) then
tmp = 0.5d0 * (x * (y / a))
else if ((x * y) <= 1d-62) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = 1.0d0 / (2.0d0 * ((a / x) / y))
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 ((x * y) <= -2e+81) {
tmp = 0.5 * (x * (y / a));
} else if ((x * y) <= 1e-62) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = 1.0 / (2.0 * ((a / x) / y));
}
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) <= -2e+81: tmp = 0.5 * (x * (y / a)) elif (x * y) <= 1e-62: tmp = -4.5 * ((z * t) / a) else: tmp = 1.0 / (2.0 * ((a / x) / y)) 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) <= -2e+81) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (Float64(x * y) <= 1e-62) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(1.0 / Float64(2.0 * Float64(Float64(a / x) / y))); 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) <= -2e+81)
tmp = 0.5 * (x * (y / a));
elseif ((x * y) <= 1e-62)
tmp = -4.5 * ((z * t) / a);
else
tmp = 1.0 / (2.0 * ((a / x) / y));
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], -2e+81], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-62], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(2.0 * N[(N[(a / x), $MachinePrecision] / y), $MachinePrecision]), $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 -2 \cdot 10^{+81}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 10^{-62}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{2 \cdot \frac{\frac{a}{x}}{y}}\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999984e81Initial program 87.7%
div-sub85.9%
*-commutative85.9%
div-sub87.7%
cancel-sign-sub-inv87.7%
*-commutative87.7%
fma-define91.3%
distribute-rgt-neg-in91.3%
associate-*r*91.3%
distribute-lft-neg-in91.3%
*-commutative91.3%
distribute-rgt-neg-in91.3%
metadata-eval91.3%
Simplified91.3%
Taylor expanded in x around inf 79.1%
associate-/l*80.9%
Simplified80.9%
if -1.99999999999999984e81 < (*.f64 x y) < 1e-62Initial program 98.1%
div-sub97.2%
*-commutative97.2%
div-sub98.1%
cancel-sign-sub-inv98.1%
*-commutative98.1%
fma-define98.1%
distribute-rgt-neg-in98.1%
associate-*r*97.3%
distribute-lft-neg-in97.3%
*-commutative97.3%
distribute-rgt-neg-in97.3%
metadata-eval97.3%
Simplified97.3%
Taylor expanded in x around 0 77.0%
if 1e-62 < (*.f64 x y) Initial program 89.2%
div-sub85.5%
*-commutative85.5%
div-sub89.2%
cancel-sign-sub-inv89.2%
*-commutative89.2%
fma-define89.2%
distribute-rgt-neg-in89.2%
associate-*r*89.2%
distribute-lft-neg-in89.2%
*-commutative89.2%
distribute-rgt-neg-in89.2%
metadata-eval89.2%
Simplified89.2%
Taylor expanded in x around inf 73.5%
clear-num73.4%
inv-pow73.4%
*-commutative73.4%
*-un-lft-identity73.4%
times-frac73.4%
metadata-eval73.4%
Applied egg-rr73.4%
unpow-173.4%
associate-/r*74.7%
Simplified74.7%
Final simplification77.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 (* z 9.0)) (- INFINITY)) (* z (* t (/ -4.5 a))) (/ (- (* 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 ((t * (z * 9.0)) <= -((double) INFINITY)) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 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 tmp;
if ((t * (z * 9.0)) <= -Double.POSITIVE_INFINITY) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = ((x * y) - (z * (t * 9.0))) / (a * 2.0);
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (t * (z * 9.0)) <= -math.inf: tmp = z * (t * (-4.5 / a)) else: tmp = ((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(t * Float64(z * 9.0)) <= Float64(-Inf)) tmp = Float64(z * Float64(t * Float64(-4.5 / a))); else tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(t * 9.0))) / Float64(a * 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)
tmp = 0.0;
if ((t * (z * 9.0)) <= -Inf)
tmp = z * (t * (-4.5 / a));
else
tmp = ((x * y) - (z * (t * 9.0))) / (a * 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_] := If[LessEqual[N[(t * N[(z * 9.0), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(z * N[(t * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - 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}\;t \cdot \left(z \cdot 9\right) \leq -\infty:\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(t \cdot 9\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -inf.0Initial program 75.1%
div-sub70.8%
*-commutative70.8%
div-sub75.1%
cancel-sign-sub-inv75.1%
*-commutative75.1%
fma-define83.8%
distribute-rgt-neg-in83.8%
associate-*r*83.8%
distribute-lft-neg-in83.8%
*-commutative83.8%
distribute-rgt-neg-in83.8%
metadata-eval83.8%
Simplified83.8%
Taylor expanded in x around 0 83.8%
associate-/l*100.0%
Simplified100.0%
associate-*r*96.1%
clear-num96.1%
un-div-inv96.1%
Applied egg-rr96.1%
associate-/r/96.1%
*-commutative96.1%
Simplified96.1%
Taylor expanded in t around 0 99.9%
*-commutative99.9%
associate-*l/96.1%
associate-*r/99.9%
Simplified99.9%
if -inf.0 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 94.8%
div-sub93.1%
*-commutative93.1%
div-sub94.8%
cancel-sign-sub-inv94.8%
*-commutative94.8%
fma-define94.8%
distribute-rgt-neg-in94.8%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
distribute-rgt-neg-in94.4%
metadata-eval94.4%
Simplified94.4%
*-commutative94.4%
associate-*r*94.8%
metadata-eval94.8%
distribute-rgt-neg-in94.8%
distribute-lft-neg-in94.8%
fmm-def94.8%
associate-*l*94.4%
Applied egg-rr94.4%
Final simplification94.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 (<= (* x y) -2e+81) (* 0.5 (* x (/ y a))) (if (<= (* x y) 1e-62) (* -4.5 (/ (* z t) a)) (* (/ x a) (* y 0.5)))))
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) <= -2e+81) {
tmp = 0.5 * (x * (y / a));
} else if ((x * y) <= 1e-62) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = (x / a) * (y * 0.5);
}
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 ((x * y) <= (-2d+81)) then
tmp = 0.5d0 * (x * (y / a))
else if ((x * y) <= 1d-62) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (x / a) * (y * 0.5d0)
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 ((x * y) <= -2e+81) {
tmp = 0.5 * (x * (y / a));
} else if ((x * y) <= 1e-62) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = (x / a) * (y * 0.5);
}
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) <= -2e+81: tmp = 0.5 * (x * (y / a)) elif (x * y) <= 1e-62: tmp = -4.5 * ((z * t) / a) else: tmp = (x / a) * (y * 0.5) 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) <= -2e+81) tmp = Float64(0.5 * Float64(x * Float64(y / a))); elseif (Float64(x * y) <= 1e-62) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(Float64(x / a) * Float64(y * 0.5)); 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) <= -2e+81)
tmp = 0.5 * (x * (y / a));
elseif ((x * y) <= 1e-62)
tmp = -4.5 * ((z * t) / a);
else
tmp = (x / a) * (y * 0.5);
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], -2e+81], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 1e-62], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(x / a), $MachinePrecision] * N[(y * 0.5), $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 -2 \cdot 10^{+81}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{elif}\;x \cdot y \leq 10^{-62}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{a} \cdot \left(y \cdot 0.5\right)\\
\end{array}
\end{array}
if (*.f64 x y) < -1.99999999999999984e81Initial program 87.7%
div-sub85.9%
*-commutative85.9%
div-sub87.7%
cancel-sign-sub-inv87.7%
*-commutative87.7%
fma-define91.3%
distribute-rgt-neg-in91.3%
associate-*r*91.3%
distribute-lft-neg-in91.3%
*-commutative91.3%
distribute-rgt-neg-in91.3%
metadata-eval91.3%
Simplified91.3%
Taylor expanded in x around inf 79.1%
associate-/l*80.9%
Simplified80.9%
if -1.99999999999999984e81 < (*.f64 x y) < 1e-62Initial program 98.1%
div-sub97.2%
*-commutative97.2%
div-sub98.1%
cancel-sign-sub-inv98.1%
*-commutative98.1%
fma-define98.1%
distribute-rgt-neg-in98.1%
associate-*r*97.3%
distribute-lft-neg-in97.3%
*-commutative97.3%
distribute-rgt-neg-in97.3%
metadata-eval97.3%
Simplified97.3%
Taylor expanded in x around 0 77.0%
if 1e-62 < (*.f64 x y) Initial program 89.2%
div-sub85.5%
*-commutative85.5%
div-sub89.2%
cancel-sign-sub-inv89.2%
*-commutative89.2%
fma-define89.2%
distribute-rgt-neg-in89.2%
associate-*r*89.2%
distribute-lft-neg-in89.2%
*-commutative89.2%
distribute-rgt-neg-in89.2%
metadata-eval89.2%
Simplified89.2%
Taylor expanded in x around inf 73.5%
times-frac74.7%
div-inv74.7%
metadata-eval74.7%
Applied egg-rr74.7%
Final simplification77.2%
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 (or (<= t -7e-150) (not (<= t 6.2e+59))) (* z (* t (/ -4.5 a))) (* 0.5 (* x (/ y 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 ((t <= -7e-150) || !(t <= 6.2e+59)) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 0.5 * (x * (y / a));
}
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 <= (-7d-150)) .or. (.not. (t <= 6.2d+59))) then
tmp = z * (t * ((-4.5d0) / a))
else
tmp = 0.5d0 * (x * (y / a))
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 <= -7e-150) || !(t <= 6.2e+59)) {
tmp = z * (t * (-4.5 / a));
} else {
tmp = 0.5 * (x * (y / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if (t <= -7e-150) or not (t <= 6.2e+59): tmp = z * (t * (-4.5 / a)) else: tmp = 0.5 * (x * (y / 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 ((t <= -7e-150) || !(t <= 6.2e+59)) tmp = Float64(z * Float64(t * Float64(-4.5 / a))); else tmp = Float64(0.5 * Float64(x * Float64(y / 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 ((t <= -7e-150) || ~((t <= 6.2e+59)))
tmp = z * (t * (-4.5 / a));
else
tmp = 0.5 * (x * (y / 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[Or[LessEqual[t, -7e-150], N[Not[LessEqual[t, 6.2e+59]], $MachinePrecision]], N[(z * N[(t * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(x * N[(y / a), $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 -7 \cdot 10^{-150} \lor \neg \left(t \leq 6.2 \cdot 10^{+59}\right):\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\end{array}
\end{array}
if t < -6.9999999999999996e-150 or 6.20000000000000029e59 < t Initial program 91.9%
div-sub88.9%
*-commutative88.9%
div-sub91.9%
cancel-sign-sub-inv91.9%
*-commutative91.9%
fma-define93.4%
distribute-rgt-neg-in93.4%
associate-*r*92.7%
distribute-lft-neg-in92.7%
*-commutative92.7%
distribute-rgt-neg-in92.7%
metadata-eval92.7%
Simplified92.7%
Taylor expanded in x around 0 60.1%
associate-/l*61.5%
Simplified61.5%
associate-*r*60.8%
clear-num60.7%
un-div-inv61.4%
Applied egg-rr61.4%
associate-/r/62.0%
*-commutative62.0%
Simplified62.0%
Taylor expanded in t around 0 62.7%
*-commutative62.7%
associate-*l/62.0%
associate-*r/62.7%
Simplified62.7%
if -6.9999999999999996e-150 < t < 6.20000000000000029e59Initial program 94.3%
div-sub93.4%
*-commutative93.4%
div-sub94.3%
cancel-sign-sub-inv94.3%
*-commutative94.3%
fma-define94.3%
distribute-rgt-neg-in94.3%
associate-*r*94.3%
distribute-lft-neg-in94.3%
*-commutative94.3%
distribute-rgt-neg-in94.3%
metadata-eval94.3%
Simplified94.3%
Taylor expanded in x around inf 77.2%
associate-/l*78.4%
Simplified78.4%
Final simplification70.2%
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 -7e-150) (* z (* -4.5 (/ t a))) (if (<= t 8.5e+59) (* 0.5 (* x (/ y a))) (* z (* t (/ -4.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 (t <= -7e-150) {
tmp = z * (-4.5 * (t / a));
} else if (t <= 8.5e+59) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = z * (t * (-4.5 / a));
}
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 <= (-7d-150)) then
tmp = z * ((-4.5d0) * (t / a))
else if (t <= 8.5d+59) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = z * (t * ((-4.5d0) / a))
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 <= -7e-150) {
tmp = z * (-4.5 * (t / a));
} else if (t <= 8.5e+59) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = z * (t * (-4.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 t <= -7e-150: tmp = z * (-4.5 * (t / a)) elif t <= 8.5e+59: tmp = 0.5 * (x * (y / a)) else: tmp = z * (t * (-4.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 (t <= -7e-150) tmp = Float64(z * Float64(-4.5 * Float64(t / a))); elseif (t <= 8.5e+59) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(z * Float64(t * Float64(-4.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 (t <= -7e-150)
tmp = z * (-4.5 * (t / a));
elseif (t <= 8.5e+59)
tmp = 0.5 * (x * (y / a));
else
tmp = z * (t * (-4.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[t, -7e-150], N[(z * N[(-4.5 * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 8.5e+59], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(t * N[(-4.5 / a), $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 -7 \cdot 10^{-150}:\\
\;\;\;\;z \cdot \left(-4.5 \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 8.5 \cdot 10^{+59}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\end{array}
\end{array}
if t < -6.9999999999999996e-150Initial program 93.3%
div-sub91.1%
*-commutative91.1%
div-sub93.3%
cancel-sign-sub-inv93.3%
*-commutative93.3%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*93.2%
distribute-lft-neg-in93.2%
*-commutative93.2%
distribute-rgt-neg-in93.2%
metadata-eval93.2%
Simplified93.2%
Taylor expanded in x around 0 58.2%
associate-/l*59.2%
Simplified59.2%
associate-*r*59.3%
clear-num59.1%
un-div-inv60.1%
Applied egg-rr60.1%
associate-/r/60.3%
*-commutative60.3%
Simplified60.3%
*-commutative60.3%
associate-*r/60.3%
*-commutative60.3%
Applied egg-rr60.3%
if -6.9999999999999996e-150 < t < 8.4999999999999999e59Initial program 94.3%
div-sub93.4%
*-commutative93.4%
div-sub94.3%
cancel-sign-sub-inv94.3%
*-commutative94.3%
fma-define94.3%
distribute-rgt-neg-in94.3%
associate-*r*94.3%
distribute-lft-neg-in94.3%
*-commutative94.3%
distribute-rgt-neg-in94.3%
metadata-eval94.3%
Simplified94.3%
Taylor expanded in x around inf 77.2%
associate-/l*78.4%
Simplified78.4%
if 8.4999999999999999e59 < t Initial program 89.2%
div-sub84.8%
*-commutative84.8%
div-sub89.2%
cancel-sign-sub-inv89.2%
*-commutative89.2%
fma-define91.5%
distribute-rgt-neg-in91.5%
associate-*r*91.6%
distribute-lft-neg-in91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
metadata-eval91.6%
Simplified91.6%
Taylor expanded in x around 0 63.9%
associate-/l*65.8%
Simplified65.8%
associate-*r*63.9%
clear-num63.8%
un-div-inv63.8%
Applied egg-rr63.8%
associate-/r/65.5%
*-commutative65.5%
Simplified65.5%
Taylor expanded in t around 0 67.4%
*-commutative67.4%
associate-*l/65.5%
associate-*r/67.4%
Simplified67.4%
Final simplification70.2%
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 -7e-150) (* -4.5 (/ (* z t) a)) (if (<= t 1.9e+60) (* 0.5 (* x (/ y a))) (* -4.5 (* t (/ z 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 (t <= -7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 1.9e+60) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (t * (z / a));
}
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 <= (-7d-150)) then
tmp = (-4.5d0) * ((z * t) / a)
else if (t <= 1.9d+60) then
tmp = 0.5d0 * (x * (y / a))
else
tmp = (-4.5d0) * (t * (z / a))
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 <= -7e-150) {
tmp = -4.5 * ((z * t) / a);
} else if (t <= 1.9e+60) {
tmp = 0.5 * (x * (y / a));
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if t <= -7e-150: tmp = -4.5 * ((z * t) / a) elif t <= 1.9e+60: tmp = 0.5 * (x * (y / a)) else: tmp = -4.5 * (t * (z / 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 (t <= -7e-150) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); elseif (t <= 1.9e+60) tmp = Float64(0.5 * Float64(x * Float64(y / a))); else tmp = Float64(-4.5 * Float64(t * Float64(z / 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 (t <= -7e-150)
tmp = -4.5 * ((z * t) / a);
elseif (t <= 1.9e+60)
tmp = 0.5 * (x * (y / a));
else
tmp = -4.5 * (t * (z / 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[t, -7e-150], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.9e+60], N[(0.5 * N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $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 -7 \cdot 10^{-150}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{elif}\;t \leq 1.9 \cdot 10^{+60}:\\
\;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if t < -6.9999999999999996e-150Initial program 93.3%
div-sub91.1%
*-commutative91.1%
div-sub93.3%
cancel-sign-sub-inv93.3%
*-commutative93.3%
fma-define94.4%
distribute-rgt-neg-in94.4%
associate-*r*93.2%
distribute-lft-neg-in93.2%
*-commutative93.2%
distribute-rgt-neg-in93.2%
metadata-eval93.2%
Simplified93.2%
Taylor expanded in x around 0 58.2%
if -6.9999999999999996e-150 < t < 1.90000000000000005e60Initial program 94.3%
div-sub93.4%
*-commutative93.4%
div-sub94.3%
cancel-sign-sub-inv94.3%
*-commutative94.3%
fma-define94.3%
distribute-rgt-neg-in94.3%
associate-*r*94.3%
distribute-lft-neg-in94.3%
*-commutative94.3%
distribute-rgt-neg-in94.3%
metadata-eval94.3%
Simplified94.3%
Taylor expanded in x around inf 77.2%
associate-/l*78.4%
Simplified78.4%
if 1.90000000000000005e60 < t Initial program 89.2%
div-sub84.8%
*-commutative84.8%
div-sub89.2%
cancel-sign-sub-inv89.2%
*-commutative89.2%
fma-define91.5%
distribute-rgt-neg-in91.5%
associate-*r*91.6%
distribute-lft-neg-in91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
metadata-eval91.6%
Simplified91.6%
Taylor expanded in x around 0 63.9%
associate-/l*65.8%
Simplified65.8%
Final simplification69.2%
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 (<= a 3e+135) (* -4.5 (/ (* z t) a)) (* -4.5 (* t (/ z 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 (a <= 3e+135) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
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 (a <= 3d+135) then
tmp = (-4.5d0) * ((z * t) / a)
else
tmp = (-4.5d0) * (t * (z / a))
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 (a <= 3e+135) {
tmp = -4.5 * ((z * t) / a);
} else {
tmp = -4.5 * (t * (z / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): tmp = 0 if a <= 3e+135: tmp = -4.5 * ((z * t) / a) else: tmp = -4.5 * (t * (z / 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 (a <= 3e+135) tmp = Float64(-4.5 * Float64(Float64(z * t) / a)); else tmp = Float64(-4.5 * Float64(t * Float64(z / 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 (a <= 3e+135)
tmp = -4.5 * ((z * t) / a);
else
tmp = -4.5 * (t * (z / 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[a, 3e+135], N[(-4.5 * N[(N[(z * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-4.5 * N[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq 3 \cdot 10^{+135}:\\
\;\;\;\;-4.5 \cdot \frac{z \cdot t}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(t \cdot \frac{z}{a}\right)\\
\end{array}
\end{array}
if a < 3e135Initial program 94.9%
div-sub92.5%
*-commutative92.5%
div-sub94.9%
cancel-sign-sub-inv94.9%
*-commutative94.9%
fma-define95.3%
distribute-rgt-neg-in95.3%
associate-*r*94.9%
distribute-lft-neg-in94.9%
*-commutative94.9%
distribute-rgt-neg-in94.9%
metadata-eval94.9%
Simplified94.9%
Taylor expanded in x around 0 47.4%
if 3e135 < a Initial program 83.3%
div-sub83.3%
*-commutative83.3%
div-sub83.3%
cancel-sign-sub-inv83.3%
*-commutative83.3%
fma-define85.8%
distribute-rgt-neg-in85.8%
associate-*r*85.7%
distribute-lft-neg-in85.7%
*-commutative85.7%
distribute-rgt-neg-in85.7%
metadata-eval85.7%
Simplified85.7%
Taylor expanded in x around 0 48.7%
associate-/l*57.9%
Simplified57.9%
Final simplification49.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 (* -4.5 (* t (/ z 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 * (t * (z / 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) * (t * (z / 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 * (t * (z / a));
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return -4.5 * (t * (z / a))
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t * Float64(z / 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 * (t * (z / 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[(t * N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
-4.5 \cdot \left(t \cdot \frac{z}{a}\right)
\end{array}
Initial program 93.0%
div-sub91.1%
*-commutative91.1%
div-sub93.0%
cancel-sign-sub-inv93.0%
*-commutative93.0%
fma-define93.8%
distribute-rgt-neg-in93.8%
associate-*r*93.5%
distribute-lft-neg-in93.5%
*-commutative93.5%
distribute-rgt-neg-in93.5%
metadata-eval93.5%
Simplified93.5%
Taylor expanded in x around 0 47.6%
associate-/l*47.9%
Simplified47.9%
(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 2024181
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:alt
(! :herbie-platform default (if (< a -209046455797670900000000000000000000000000000000000000000000000000000000000000000000000) (- (* 1/2 (/ (* y x) a)) (* 9/2 (/ t (/ a z)))) (if (< a 2144030707833976000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* x y) (* z (* 9 t))) (* a 2)) (- (* (/ y a) (* x 1/2)) (* (/ t a) (* z 9/2))))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))