
(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 12 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.
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 -2e+272)
(fma (- z) (* (/ t a) 4.5) (/ y (/ (* a 2.0) x)))
(if (<= t_1 4e+239)
(/ (fma z (* t -9.0) (* x y)) (* a 2.0))
(fma (/ x (* a 2.0)) y (* (/ z a) (* t -4.5)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e+272) {
tmp = fma(-z, ((t / a) * 4.5), (y / ((a * 2.0) / x)));
} else if (t_1 <= 4e+239) {
tmp = fma(z, (t * -9.0), (x * y)) / (a * 2.0);
} else {
tmp = fma((x / (a * 2.0)), y, ((z / a) * (t * -4.5)));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e+272) tmp = fma(Float64(-z), Float64(Float64(t / a) * 4.5), Float64(y / Float64(Float64(a * 2.0) / x))); elseif (t_1 <= 4e+239) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) / Float64(a * 2.0)); else tmp = fma(Float64(x / Float64(a * 2.0)), y, Float64(Float64(z / a) * Float64(t * -4.5))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e+272], N[((-z) * N[(N[(t / a), $MachinePrecision] * 4.5), $MachinePrecision] + N[(y / N[(N[(a * 2.0), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+239], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * y + N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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 -2 \cdot 10^{+272}:\\
\;\;\;\;\mathsf{fma}\left(-z, \frac{t}{a} \cdot 4.5, \frac{y}{\frac{a \cdot 2}{x}}\right)\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+239}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{a \cdot 2}, y, \frac{z}{a} \cdot \left(t \cdot -4.5\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -2.0000000000000001e272Initial program 69.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
metadata-evalN/A
Applied rewrites95.9%
lift-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-*r/N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f6495.9
Applied rewrites95.9%
if -2.0000000000000001e272 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 3.99999999999999996e239Initial program 98.7%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.6
Applied rewrites98.6%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
un-div-invN/A
lower-/.f6498.8
Applied rewrites98.8%
if 3.99999999999999996e239 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 56.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites67.0%
lift-*.f64N/A
*-commutativeN/A
neg-mul-1N/A
times-fracN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6490.3
Applied rewrites90.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (- z) (* (/ t a) 4.5) (* x (/ y (* a 2.0))))
(if (<= t_1 4e+239)
(/ (fma z (* t -9.0) (* x y)) (* a 2.0))
(fma (/ x (* a 2.0)) y (* (/ z a) (* t -4.5)))))))assert(x < y && y < z && z < t && t < a);
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(-z, ((t / a) * 4.5), (x * (y / (a * 2.0))));
} else if (t_1 <= 4e+239) {
tmp = fma(z, (t * -9.0), (x * y)) / (a * 2.0);
} else {
tmp = fma((x / (a * 2.0)), y, ((z / a) * (t * -4.5)));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) 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(Float64(-z), Float64(Float64(t / a) * 4.5), Float64(x * Float64(y / Float64(a * 2.0)))); elseif (t_1 <= 4e+239) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) / Float64(a * 2.0)); else tmp = fma(Float64(x / Float64(a * 2.0)), y, Float64(Float64(z / a) * Float64(t * -4.5))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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[((-z) * N[(N[(t / a), $MachinePrecision] * 4.5), $MachinePrecision] + N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+239], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * y + N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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(-z, \frac{t}{a} \cdot 4.5, x \cdot \frac{y}{a \cdot 2}\right)\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+239}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{a \cdot 2}, y, \frac{z}{a} \cdot \left(t \cdot -4.5\right)\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0Initial program 62.2%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
metadata-evalN/A
Applied rewrites94.9%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 3.99999999999999996e239Initial program 98.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.6
Applied rewrites98.6%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
un-div-invN/A
lower-/.f6498.8
Applied rewrites98.8%
if 3.99999999999999996e239 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 56.3%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites67.0%
lift-*.f64N/A
*-commutativeN/A
neg-mul-1N/A
times-fracN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6490.3
Applied rewrites90.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 (fma (/ x (* a 2.0)) y (* (/ z a) (* t -4.5))))
(t_2 (- (* x y) (* (* z 9.0) t))))
(if (<= t_2 (- INFINITY))
t_1
(if (<= t_2 4e+239) (/ (fma z (* t -9.0) (* x y)) (* a 2.0)) t_1))))assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = fma((x / (a * 2.0)), y, ((z / a) * (t * -4.5)));
double t_2 = (x * y) - ((z * 9.0) * t);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = t_1;
} else if (t_2 <= 4e+239) {
tmp = fma(z, (t * -9.0), (x * y)) / (a * 2.0);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = fma(Float64(x / Float64(a * 2.0)), y, Float64(Float64(z / a) * Float64(t * -4.5))) t_2 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = t_1; elseif (t_2 <= 4e+239) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) / Float64(a * 2.0)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 / N[(a * 2.0), $MachinePrecision]), $MachinePrecision] * y + N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 4e+239], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{x}{a \cdot 2}, y, \frac{z}{a} \cdot \left(t \cdot -4.5\right)\right)\\
t_2 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+239}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -inf.0 or 3.99999999999999996e239 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 57.9%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
distribute-neg-frac2N/A
lower-/.f64N/A
Applied rewrites66.9%
lift-*.f64N/A
*-commutativeN/A
neg-mul-1N/A
times-fracN/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r/N/A
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6491.5
Applied rewrites91.5%
if -inf.0 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 3.99999999999999996e239Initial program 98.8%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.6
Applied rewrites98.6%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
un-div-invN/A
lower-/.f6498.8
Applied rewrites98.8%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e+302)
(* (/ z a) (* t -4.5))
(if (<= t_1 5e+247)
(/ (fma z (* t -9.0) (* x y)) (* a 2.0))
(* t (/ z (* a -0.2222222222222222)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e+302) {
tmp = (z / a) * (t * -4.5);
} else if (t_1 <= 5e+247) {
tmp = fma(z, (t * -9.0), (x * y)) / (a * 2.0);
} else {
tmp = t * (z / (a * -0.2222222222222222));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e+302) tmp = Float64(Float64(z / a) * Float64(t * -4.5)); elseif (t_1 <= 5e+247) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) / Float64(a * 2.0)); else tmp = Float64(t * Float64(z / Float64(a * -0.2222222222222222))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e+302], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+247], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(t * N[(z / N[(a * -0.2222222222222222), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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 -2 \cdot 10^{+302}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+247}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{z}{a \cdot -0.2222222222222222}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000002e302Initial program 45.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6496.0
Applied rewrites96.0%
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.0
Applied rewrites96.0%
if -2.0000000000000002e302 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 5.00000000000000023e247Initial program 94.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval94.3
Applied rewrites94.3%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
un-div-invN/A
lower-/.f6494.5
Applied rewrites94.5%
if 5.00000000000000023e247 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 59.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6487.2
Applied rewrites87.2%
metadata-evalN/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
neg-mul-1N/A
lift-neg.f64N/A
associate-/l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
lower-/.f6487.3
Applied rewrites87.3%
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-/.f64N/A
div-invN/A
clear-numN/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-eval87.3
Applied rewrites87.3%
Final simplification94.1%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e+302)
(* (/ z a) (* t -4.5))
(if (<= t_1 5e+247)
(* (fma z (* t -9.0) (* x y)) (/ 0.5 a))
(* t (/ z (* a -0.2222222222222222)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e+302) {
tmp = (z / a) * (t * -4.5);
} else if (t_1 <= 5e+247) {
tmp = fma(z, (t * -9.0), (x * y)) * (0.5 / a);
} else {
tmp = t * (z / (a * -0.2222222222222222));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e+302) tmp = Float64(Float64(z / a) * Float64(t * -4.5)); elseif (t_1 <= 5e+247) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) * Float64(0.5 / a)); else tmp = Float64(t * Float64(z / Float64(a * -0.2222222222222222))); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e+302], N[(N[(z / a), $MachinePrecision] * N[(t * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+247], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(t * N[(z / N[(a * -0.2222222222222222), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[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 -2 \cdot 10^{+302}:\\
\;\;\;\;\frac{z}{a} \cdot \left(t \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+247}:\\
\;\;\;\;\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{z}{a \cdot -0.2222222222222222}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000002e302Initial program 45.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6496.0
Applied rewrites96.0%
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6496.0
Applied rewrites96.0%
if -2.0000000000000002e302 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 5.00000000000000023e247Initial program 94.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval94.3
Applied rewrites94.3%
if 5.00000000000000023e247 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 59.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6487.2
Applied rewrites87.2%
metadata-evalN/A
associate-*r/N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
*-commutativeN/A
neg-mul-1N/A
lift-neg.f64N/A
associate-/l*N/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
lower-/.f6487.3
Applied rewrites87.3%
lift-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lift-/.f64N/A
div-invN/A
lift-/.f64N/A
associate-*r*N/A
lift-*.f64N/A
lower-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-/.f64N/A
div-invN/A
clear-numN/A
associate-*l/N/A
*-lft-identityN/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-eval87.3
Applied rewrites87.3%
Final simplification94.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e-62)
(* t (* (/ z a) -4.5))
(if (<= t_1 1e+51) (/ (* x 0.5) (/ a y)) (* -4.5 (* z (/ t a)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = (x * 0.5) / (a / y);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-2d-62)) then
tmp = t * ((z / a) * (-4.5d0))
else if (t_1 <= 1d+51) then
tmp = (x * 0.5d0) / (a / y)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = (x * 0.5) / (a / y);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 <= -2e-62: tmp = t * ((z / a) * -4.5) elif t_1 <= 1e+51: tmp = (x * 0.5) / (a / y) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e-62) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (t_1 <= 1e+51) tmp = Float64(Float64(x * 0.5) / Float64(a / y)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 <= -2e-62)
tmp = t * ((z / a) * -4.5);
elseif (t_1 <= 1e+51)
tmp = (x * 0.5) / (a / y);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e-62], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+51], N[(N[(x * 0.5), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision], 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])\\\\
[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 -2 \cdot 10^{-62}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+51}:\\
\;\;\;\;\frac{x \cdot 0.5}{\frac{a}{y}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000001e-62Initial program 78.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
lift-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.1
Applied rewrites78.1%
if -2.0000000000000001e-62 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1e51Initial program 93.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval93.4
Applied rewrites93.4%
Taylor expanded in z around 0
lower-*.f6475.8
Applied rewrites75.8%
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
clear-numN/A
div-invN/A
metadata-evalN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.1
Applied rewrites75.1%
associate-/r*N/A
div-invN/A
metadata-evalN/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.2
Applied rewrites75.2%
if 1e51 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.1
Applied rewrites86.1%
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6487.6
Applied rewrites87.6%
Final simplification78.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e-62)
(* t (* (/ z a) -4.5))
(if (<= t_1 1e+51) (/ x (/ a (* y 0.5))) (* -4.5 (* z (/ t a)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = x / (a / (y * 0.5));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-2d-62)) then
tmp = t * ((z / a) * (-4.5d0))
else if (t_1 <= 1d+51) then
tmp = x / (a / (y * 0.5d0))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = x / (a / (y * 0.5));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 <= -2e-62: tmp = t * ((z / a) * -4.5) elif t_1 <= 1e+51: tmp = x / (a / (y * 0.5)) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e-62) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (t_1 <= 1e+51) tmp = Float64(x / Float64(a / Float64(y * 0.5))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 <= -2e-62)
tmp = t * ((z / a) * -4.5);
elseif (t_1 <= 1e+51)
tmp = x / (a / (y * 0.5));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e-62], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+51], N[(x / N[(a / N[(y * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\\\
[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 -2 \cdot 10^{-62}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+51}:\\
\;\;\;\;\frac{x}{\frac{a}{y \cdot 0.5}}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000001e-62Initial program 78.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
lift-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.1
Applied rewrites78.1%
if -2.0000000000000001e-62 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1e51Initial program 93.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval93.4
Applied rewrites93.4%
Taylor expanded in z around 0
lower-*.f6475.8
Applied rewrites75.8%
lift-*.f64N/A
associate-*r/N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-/l*N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lower-/.f6475.2
Applied rewrites75.2%
if 1e51 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.1
Applied rewrites86.1%
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6487.6
Applied rewrites87.6%
Final simplification78.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. 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 2.0) 2e-67) (/ (fma z (* t -9.0) (* x y)) (* a 2.0)) (fma (- t) (/ (* z 4.5) a) (* x (/ y (* a 2.0))))))
assert(x < y && y < z && z < t && t < 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 * 2.0) <= 2e-67) {
tmp = fma(z, (t * -9.0), (x * y)) / (a * 2.0);
} else {
tmp = fma(-t, ((z * 4.5) / a), (x * (y / (a * 2.0))));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(a * 2.0) <= 2e-67) tmp = Float64(fma(z, Float64(t * -9.0), Float64(x * y)) / Float64(a * 2.0)); else tmp = fma(Float64(-t), Float64(Float64(z * 4.5) / a), Float64(x * Float64(y / 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. 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[(a * 2.0), $MachinePrecision], 2e-67], N[(N[(z * N[(t * -9.0), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-t) * N[(N[(z * 4.5), $MachinePrecision] / a), $MachinePrecision] + N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \cdot 2 \leq 2 \cdot 10^{-67}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot -9, x \cdot y\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-t, \frac{z \cdot 4.5}{a}, x \cdot \frac{y}{a \cdot 2}\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 1.99999999999999989e-67Initial program 90.1%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval90.0
Applied rewrites90.0%
lift-*.f64N/A
lift-*.f64N/A
lift-fma.f64N/A
metadata-evalN/A
associate-/r*N/A
*-commutativeN/A
lift-*.f64N/A
un-div-invN/A
lower-/.f6490.1
Applied rewrites90.1%
if 1.99999999999999989e-67 < (*.f64 a #s(literal 2 binary64)) Initial program 81.0%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
div-subN/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
Applied rewrites93.3%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e-62)
(* t (* (/ z a) -4.5))
(if (<= t_1 1e+51) (* x (/ y (* a 2.0))) (* -4.5 (* z (/ t a)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = x * (y / (a * 2.0));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-2d-62)) then
tmp = t * ((z / a) * (-4.5d0))
else if (t_1 <= 1d+51) then
tmp = x * (y / (a * 2.0d0))
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = x * (y / (a * 2.0));
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 <= -2e-62: tmp = t * ((z / a) * -4.5) elif t_1 <= 1e+51: tmp = x * (y / (a * 2.0)) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e-62) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (t_1 <= 1e+51) tmp = Float64(x * Float64(y / Float64(a * 2.0))); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 <= -2e-62)
tmp = t * ((z / a) * -4.5);
elseif (t_1 <= 1e+51)
tmp = x * (y / (a * 2.0));
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e-62], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+51], N[(x * N[(y / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 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])\\\\
[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 -2 \cdot 10^{-62}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+51}:\\
\;\;\;\;x \cdot \frac{y}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000001e-62Initial program 78.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
lift-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.1
Applied rewrites78.1%
if -2.0000000000000001e-62 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1e51Initial program 93.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval93.4
Applied rewrites93.4%
Taylor expanded in z around 0
lower-*.f6475.8
Applied rewrites75.8%
lift-/.f64N/A
associate-*l*N/A
lift-/.f64N/A
clear-numN/A
div-invN/A
metadata-evalN/A
lift-*.f64N/A
div-invN/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.1
Applied rewrites75.1%
if 1e51 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.1
Applied rewrites86.1%
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6487.6
Applied rewrites87.6%
Final simplification78.2%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 -2e-62)
(* t (* (/ z a) -4.5))
(if (<= t_1 1e+51) (* (* x y) (/ 0.5 a)) (* -4.5 (* z (/ t a)))))))assert(x < y && y < z && z < t && t < a);
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-2d-62)) then
tmp = t * ((z / a) * (-4.5d0))
else if (t_1 <= 1d+51) then
tmp = (x * y) * (0.5d0 / a)
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
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 <= -2e-62) {
tmp = t * ((z / a) * -4.5);
} else if (t_1 <= 1e+51) {
tmp = (x * y) * (0.5 / a);
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [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 <= -2e-62: tmp = t * ((z / a) * -4.5) elif t_1 <= 1e+51: tmp = (x * y) * (0.5 / a) else: tmp = -4.5 * (z * (t / a)) return tmp
x, y, z, t, a = sort([x, y, z, t, a]) 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 <= -2e-62) tmp = Float64(t * Float64(Float64(z / a) * -4.5)); elseif (t_1 <= 1e+51) tmp = Float64(Float64(x * y) * Float64(0.5 / a)); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
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 <= -2e-62)
tmp = t * ((z / a) * -4.5);
elseif (t_1 <= 1e+51)
tmp = (x * y) * (0.5 / a);
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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, -2e-62], N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+51], N[(N[(x * y), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], 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])\\\\
[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 -2 \cdot 10^{-62}:\\
\;\;\;\;t \cdot \left(\frac{z}{a} \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+51}:\\
\;\;\;\;\left(x \cdot y\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.0000000000000001e-62Initial program 78.7%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
lift-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.1
Applied rewrites78.1%
if -2.0000000000000001e-62 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 1e51Initial program 93.5%
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
lift--.f64N/A
lift-*.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval93.4
Applied rewrites93.4%
Taylor expanded in z around 0
lower-*.f6475.8
Applied rewrites75.8%
if 1e51 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.2%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6486.1
Applied rewrites86.1%
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lift-/.f64N/A
lower-*.f6487.6
Applied rewrites87.6%
Final simplification78.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. 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 (* t (* (/ z a) -4.5)))
assert(x < y && y < z && z < t && t < a);
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return t * ((z / a) * -4.5);
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
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 = t * ((z / a) * (-4.5d0))
end function
assert x < y && y < z && z < t && t < a;
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
return t * ((z / a) * -4.5);
}
[x, y, z, t, a] = sort([x, y, z, t, a]) [x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return t * ((z / a) * -4.5)
x, y, z, t, a = sort([x, y, z, t, a]) x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(t * Float64(Float64(z / a) * -4.5)) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = t * ((z / a) * -4.5);
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(t * N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\\\
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
t \cdot \left(\frac{z}{a} \cdot -4.5\right)
\end{array}
Initial program 87.3%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6453.0
Applied rewrites53.0%
lift-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6453.0
Applied rewrites53.0%
Final simplification53.0%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. 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);
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.
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;
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]) [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]) 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])){:}
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. 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])\\\\
[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 87.3%
Taylor expanded in x around 0
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6453.0
Applied rewrites53.0%
(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 2024216
(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)))