
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* y x) (* t (* 9.0 z)))))
(if (<= t_1 -5e+292)
(fma (/ y a) (* 0.5 x) (/ (* -4.5 t) (/ a z)))
(if (<= t_1 5e+274)
(* (/ 0.5 a) (fma (* t z) -9.0 (* y x)))
(fma (* 0.5 z) (/ (* (- t) 9.0) a) (* (* (/ 0.5 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 t_1 = (y * x) - (t * (9.0 * z));
double tmp;
if (t_1 <= -5e+292) {
tmp = fma((y / a), (0.5 * x), ((-4.5 * t) / (a / z)));
} else if (t_1 <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = fma((0.5 * z), ((-t * 9.0) / a), (((0.5 / a) * x) * y));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y * x) - Float64(t * Float64(9.0 * z))) tmp = 0.0 if (t_1 <= -5e+292) tmp = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(-4.5 * t) / Float64(a / z))); elseif (t_1 <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); else tmp = fma(Float64(0.5 * z), Float64(Float64(Float64(-t) * 9.0) / a), Float64(Float64(Float64(0.5 / a) * x) * y)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] - N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+292], N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(-4.5 * t), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * z), $MachinePrecision] * N[(N[((-t) * 9.0), $MachinePrecision] / a), $MachinePrecision] + N[(N[(N[(0.5 / a), $MachinePrecision] * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot x - t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+292}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \frac{-4.5 \cdot t}{\frac{a}{z}}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(0.5 \cdot z, \frac{\left(-t\right) \cdot 9}{a}, \left(\frac{0.5}{a} \cdot x\right) \cdot y\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.9999999999999996e292Initial program 72.1%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites97.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-/.f6497.1
Applied rewrites97.1%
if -4.9999999999999996e292 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999998e274Initial program 98.0%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.5
Applied rewrites98.5%
if 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lower-neg.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites93.1%
Final simplification97.3%
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 (- (* y x) (* t (* 9.0 z)))))
(if (<= t_1 -5e+292)
(fma (/ y a) (* 0.5 x) (/ (* -4.5 t) (/ a z)))
(if (<= t_1 5e+274)
(* (/ 0.5 a) (fma (* t z) -9.0 (* y x)))
(fma (/ z a) (* -4.5 t) (* (* (/ x a) 0.5) y))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y * x) - (t * (9.0 * z));
double tmp;
if (t_1 <= -5e+292) {
tmp = fma((y / a), (0.5 * x), ((-4.5 * t) / (a / z)));
} else if (t_1 <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = fma((z / a), (-4.5 * t), (((x / a) * 0.5) * y));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y * x) - Float64(t * Float64(9.0 * z))) tmp = 0.0 if (t_1 <= -5e+292) tmp = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(-4.5 * t) / Float64(a / z))); elseif (t_1 <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); else tmp = fma(Float64(z / a), Float64(-4.5 * t), Float64(Float64(Float64(x / a) * 0.5) * y)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] - N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+292], N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(-4.5 * t), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(-4.5 * t), $MachinePrecision] + N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot x - t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+292}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \frac{-4.5 \cdot t}{\frac{a}{z}}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{z}{a}, -4.5 \cdot t, \left(\frac{x}{a} \cdot 0.5\right) \cdot y\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.9999999999999996e292Initial program 72.1%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites97.1%
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-/.f6497.1
Applied rewrites97.1%
if -4.9999999999999996e292 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999998e274Initial program 98.0%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.5
Applied rewrites98.5%
if 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.0%
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6493.1
Applied rewrites93.1%
Final simplification97.3%
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 (- (* y x) (* t (* 9.0 z)))))
(if (<= t_1 -5e+248)
(fma (/ y a) (* 0.5 x) (* (* 4.5 (/ z a)) (- t)))
(if (<= t_1 5e+274)
(* (/ 0.5 a) (fma (* t z) -9.0 (* y x)))
(fma (/ z a) (* -4.5 t) (* (* (/ x a) 0.5) y))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y * x) - (t * (9.0 * z));
double tmp;
if (t_1 <= -5e+248) {
tmp = fma((y / a), (0.5 * x), ((4.5 * (z / a)) * -t));
} else if (t_1 <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = fma((z / a), (-4.5 * t), (((x / a) * 0.5) * y));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y * x) - Float64(t * Float64(9.0 * z))) tmp = 0.0 if (t_1 <= -5e+248) tmp = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(4.5 * Float64(z / a)) * Float64(-t))); elseif (t_1 <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); else tmp = fma(Float64(z / a), Float64(-4.5 * t), Float64(Float64(Float64(x / a) * 0.5) * y)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] - N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+248], N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(4.5 * N[(z / a), $MachinePrecision]), $MachinePrecision] * (-t)), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(-4.5 * t), $MachinePrecision] + N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot x - t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+248}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \left(4.5 \cdot \frac{z}{a}\right) \cdot \left(-t\right)\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{z}{a}, -4.5 \cdot t, \left(\frac{x}{a} \cdot 0.5\right) \cdot y\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.9999999999999996e248Initial program 74.8%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites97.4%
if -4.9999999999999996e248 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999998e274Initial program 97.9%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.4
Applied rewrites98.4%
if 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.0%
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6493.1
Applied rewrites93.1%
Final simplification97.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
(let* ((t_1 (- (* y x) (* t (* 9.0 z)))))
(if (<= t_1 -5e+248)
(fma (/ y a) (* 0.5 x) (* (* (/ z a) t) -4.5))
(if (<= t_1 5e+274)
(* (/ 0.5 a) (fma (* t z) -9.0 (* y x)))
(fma (/ z a) (* -4.5 t) (* (* (/ x a) 0.5) y))))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = (y * x) - (t * (9.0 * z));
double tmp;
if (t_1 <= -5e+248) {
tmp = fma((y / a), (0.5 * x), (((z / a) * t) * -4.5));
} else if (t_1 <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = fma((z / a), (-4.5 * t), (((x / a) * 0.5) * y));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(Float64(y * x) - Float64(t * Float64(9.0 * z))) tmp = 0.0 if (t_1 <= -5e+248) tmp = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(Float64(z / a) * t) * -4.5)); elseif (t_1 <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); else tmp = fma(Float64(z / a), Float64(-4.5 * t), Float64(Float64(Float64(x / a) * 0.5) * y)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] - N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+248], N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(N[(z / a), $MachinePrecision] * t), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z / a), $MachinePrecision] * N[(-4.5 * t), $MachinePrecision] + N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot x - t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+248}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \left(\frac{z}{a} \cdot t\right) \cdot -4.5\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{z}{a}, -4.5 \cdot t, \left(\frac{x}{a} \cdot 0.5\right) \cdot y\right)\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.9999999999999996e248Initial program 74.8%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites97.4%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval97.3
Applied rewrites97.3%
if -4.9999999999999996e248 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999998e274Initial program 97.9%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.4
Applied rewrites98.4%
if 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 67.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites93.0%
lift-fma.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-/.f64N/A
associate-*l/N/A
associate-*r/N/A
lift-*.f64N/A
associate-*l/N/A
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6493.1
Applied rewrites93.1%
Final simplification97.3%
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 (/ y a) (* 0.5 x) (* (* (/ z a) t) -4.5)))
(t_2 (- (* y x) (* t (* 9.0 z)))))
(if (<= t_2 -5e+248)
t_1
(if (<= t_2 5e+274) (* (/ 0.5 a) (fma (* t z) -9.0 (* y x))) t_1))))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((y / a), (0.5 * x), (((z / a) * t) * -4.5));
double t_2 = (y * x) - (t * (9.0 * z));
double tmp;
if (t_2 <= -5e+248) {
tmp = t_1;
} else if (t_2 <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(Float64(z / a) * t) * -4.5)) t_2 = Float64(Float64(y * x) - Float64(t * Float64(9.0 * z))) tmp = 0.0 if (t_2 <= -5e+248) tmp = t_1; elseif (t_2 <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); 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.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(N[(z / a), $MachinePrecision] * t), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * x), $MachinePrecision] - N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+248], t$95$1, If[LessEqual[t$95$2, 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \left(\frac{z}{a} \cdot t\right) \cdot -4.5\right)\\
t_2 := y \cdot x - t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+248}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < -4.9999999999999996e248 or 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) Initial program 71.1%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites95.1%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval95.1
Applied rewrites95.1%
if -4.9999999999999996e248 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z #s(literal 9 binary64)) t)) < 4.9999999999999998e274Initial program 97.9%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval98.4
Applied rewrites98.4%
Final simplification97.3%
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 (<= (* y x) -1e+215)
(* (* 0.5 x) (/ y a))
(if (<= (* y x) 5e+274)
(* (/ 0.5 a) (fma (* t z) -9.0 (* y x)))
(* (* (/ x a) 0.5) 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 ((y * x) <= -1e+215) {
tmp = (0.5 * x) * (y / a);
} else if ((y * x) <= 5e+274) {
tmp = (0.5 / a) * fma((t * z), -9.0, (y * x));
} else {
tmp = ((x / a) * 0.5) * 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(y * x) <= -1e+215) tmp = Float64(Float64(0.5 * x) * Float64(y / a)); elseif (Float64(y * x) <= 5e+274) tmp = Float64(Float64(0.5 / a) * fma(Float64(t * z), -9.0, Float64(y * x))); else tmp = Float64(Float64(Float64(x / a) * 0.5) * y); 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[(y * x), $MachinePrecision], -1e+215], N[(N[(0.5 * x), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * x), $MachinePrecision], 5e+274], N[(N[(0.5 / a), $MachinePrecision] * N[(N[(t * z), $MachinePrecision] * -9.0 + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot x \leq -1 \cdot 10^{+215}:\\
\;\;\;\;\left(0.5 \cdot x\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;y \cdot x \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\frac{0.5}{a} \cdot \mathsf{fma}\left(t \cdot z, -9, y \cdot x\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{x}{a} \cdot 0.5\right) \cdot y\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999907e214Initial program 72.5%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6495.9
Applied rewrites95.9%
Applied rewrites92.1%
if -9.99999999999999907e214 < (*.f64 x y) < 4.9999999999999998e274Initial program 94.7%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
metadata-eval95.1
Applied rewrites95.1%
if 4.9999999999999998e274 < (*.f64 x y) Initial program 59.6%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6496.3
Applied rewrites96.3%
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 (<= (* y x) -1e+215)
(* (* 0.5 x) (/ y a))
(if (<= (* y x) 5e+274)
(* (fma (* -9.0 z) t (* y x)) (/ 0.5 a))
(* (* (/ x a) 0.5) 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 ((y * x) <= -1e+215) {
tmp = (0.5 * x) * (y / a);
} else if ((y * x) <= 5e+274) {
tmp = fma((-9.0 * z), t, (y * x)) * (0.5 / a);
} else {
tmp = ((x / a) * 0.5) * 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(y * x) <= -1e+215) tmp = Float64(Float64(0.5 * x) * Float64(y / a)); elseif (Float64(y * x) <= 5e+274) tmp = Float64(fma(Float64(-9.0 * z), t, Float64(y * x)) * Float64(0.5 / a)); else tmp = Float64(Float64(Float64(x / a) * 0.5) * y); 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[(y * x), $MachinePrecision], -1e+215], N[(N[(0.5 * x), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y * x), $MachinePrecision], 5e+274], N[(N[(N[(-9.0 * z), $MachinePrecision] * t + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;y \cdot x \leq -1 \cdot 10^{+215}:\\
\;\;\;\;\left(0.5 \cdot x\right) \cdot \frac{y}{a}\\
\mathbf{elif}\;y \cdot x \leq 5 \cdot 10^{+274}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot z, t, y \cdot x\right) \cdot \frac{0.5}{a}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{x}{a} \cdot 0.5\right) \cdot y\\
\end{array}
\end{array}
if (*.f64 x y) < -9.99999999999999907e214Initial program 72.5%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6495.9
Applied rewrites95.9%
Applied rewrites92.1%
if -9.99999999999999907e214 < (*.f64 x y) < 4.9999999999999998e274Initial program 94.7%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6442.8
Applied rewrites42.8%
Taylor expanded in a around 0
*-commutativeN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*l/N/A
associate-/l*N/A
Applied rewrites95.0%
if 4.9999999999999998e274 < (*.f64 x y) Initial program 59.6%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6496.3
Applied rewrites96.3%
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 (<= (* 2.0 a) 1e+80) (/ (fma (* -9.0 t) z (* y x)) (* 2.0 a)) (fma (/ y a) (* 0.5 x) (* (* (/ t a) z) -4.5))))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double tmp;
if ((2.0 * a) <= 1e+80) {
tmp = fma((-9.0 * t), z, (y * x)) / (2.0 * a);
} else {
tmp = fma((y / a), (0.5 * x), (((t / a) * z) * -4.5));
}
return tmp;
}
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) tmp = 0.0 if (Float64(2.0 * a) <= 1e+80) tmp = Float64(fma(Float64(-9.0 * t), z, Float64(y * x)) / Float64(2.0 * a)); else tmp = fma(Float64(y / a), Float64(0.5 * x), Float64(Float64(Float64(t / a) * z) * -4.5)); end return tmp end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[N[(2.0 * a), $MachinePrecision], 1e+80], N[(N[(N[(-9.0 * t), $MachinePrecision] * z + N[(y * x), $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(y / a), $MachinePrecision] * N[(0.5 * x), $MachinePrecision] + N[(N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision] * -4.5), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;2 \cdot a \leq 10^{+80}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-9 \cdot t, z, y \cdot x\right)}{2 \cdot a}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{a}, 0.5 \cdot x, \left(\frac{t}{a} \cdot z\right) \cdot -4.5\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 2 binary64)) < 1e80Initial program 91.6%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-eval92.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6492.6
Applied rewrites92.6%
if 1e80 < (*.f64 a #s(literal 2 binary64)) Initial program 77.1%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites92.3%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval92.2
Applied rewrites92.2%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6488.0
Applied rewrites88.0%
Final simplification91.8%
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 (* t (* 9.0 z))))
(if (<= t_1 -2e-32)
(* (* (/ t a) z) -4.5)
(if (<= t_1 2000000000000.0)
(* (* 0.5 x) (/ y a))
(* (* (/ z a) -4.5) t)))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = (0.5 * x) * (y / a);
} else {
tmp = ((z / a) * -4.5) * t;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = t * (9.0d0 * z)
if (t_1 <= (-2d-32)) then
tmp = ((t / a) * z) * (-4.5d0)
else if (t_1 <= 2000000000000.0d0) then
tmp = (0.5d0 * x) * (y / a)
else
tmp = ((z / a) * (-4.5d0)) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = (0.5 * x) * (y / a);
} else {
tmp = ((z / a) * -4.5) * t;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (9.0 * z) tmp = 0 if t_1 <= -2e-32: tmp = ((t / a) * z) * -4.5 elif t_1 <= 2000000000000.0: tmp = (0.5 * x) * (y / a) else: tmp = ((z / a) * -4.5) * t return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(9.0 * z)) tmp = 0.0 if (t_1 <= -2e-32) tmp = Float64(Float64(Float64(t / a) * z) * -4.5); elseif (t_1 <= 2000000000000.0) tmp = Float64(Float64(0.5 * x) * Float64(y / a)); else tmp = Float64(Float64(Float64(z / a) * -4.5) * t); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (9.0 * z);
tmp = 0.0;
if (t_1 <= -2e-32)
tmp = ((t / a) * z) * -4.5;
elseif (t_1 <= 2000000000000.0)
tmp = (0.5 * x) * (y / a);
else
tmp = ((z / a) * -4.5) * t;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-32], N[(N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2000000000000.0], N[(N[(0.5 * x), $MachinePrecision] * N[(y / a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\left(\frac{t}{a} \cdot z\right) \cdot -4.5\\
\mathbf{elif}\;t\_1 \leq 2000000000000:\\
\;\;\;\;\left(0.5 \cdot x\right) \cdot \frac{y}{a}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z}{a} \cdot -4.5\right) \cdot t\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.00000000000000011e-32Initial program 88.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.5
Applied rewrites75.5%
Applied rewrites73.9%
if -2.00000000000000011e-32 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e12Initial program 92.2%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6481.0
Applied rewrites81.0%
Applied rewrites81.5%
if 2e12 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6473.8
Applied rewrites73.8%
Final simplification77.6%
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* t (* 9.0 z))))
(if (<= t_1 -2e-32)
(* (* (/ t a) z) -4.5)
(if (<= t_1 2000000000000.0)
(* (* (/ x a) 0.5) y)
(* (* (/ z a) -4.5) t)))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((x / a) * 0.5) * y;
} else {
tmp = ((z / a) * -4.5) * t;
}
return tmp;
}
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8) :: t_1
real(8) :: tmp
t_1 = t * (9.0d0 * z)
if (t_1 <= (-2d-32)) then
tmp = ((t / a) * z) * (-4.5d0)
else if (t_1 <= 2000000000000.0d0) then
tmp = ((x / a) * 0.5d0) * y
else
tmp = ((z / a) * (-4.5d0)) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((x / a) * 0.5) * y;
} else {
tmp = ((z / a) * -4.5) * t;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (9.0 * z) tmp = 0 if t_1 <= -2e-32: tmp = ((t / a) * z) * -4.5 elif t_1 <= 2000000000000.0: tmp = ((x / a) * 0.5) * y else: tmp = ((z / a) * -4.5) * t return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(9.0 * z)) tmp = 0.0 if (t_1 <= -2e-32) tmp = Float64(Float64(Float64(t / a) * z) * -4.5); elseif (t_1 <= 2000000000000.0) tmp = Float64(Float64(Float64(x / a) * 0.5) * y); else tmp = Float64(Float64(Float64(z / a) * -4.5) * t); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (9.0 * z);
tmp = 0.0;
if (t_1 <= -2e-32)
tmp = ((t / a) * z) * -4.5;
elseif (t_1 <= 2000000000000.0)
tmp = ((x / a) * 0.5) * y;
else
tmp = ((z / a) * -4.5) * t;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-32], N[(N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2000000000000.0], N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(z / a), $MachinePrecision] * -4.5), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\left(\frac{t}{a} \cdot z\right) \cdot -4.5\\
\mathbf{elif}\;t\_1 \leq 2000000000000:\\
\;\;\;\;\left(\frac{x}{a} \cdot 0.5\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{z}{a} \cdot -4.5\right) \cdot t\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.00000000000000011e-32Initial program 88.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.5
Applied rewrites75.5%
Applied rewrites73.9%
if -2.00000000000000011e-32 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e12Initial program 92.2%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6481.0
Applied rewrites81.0%
if 2e12 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6473.8
Applied rewrites73.8%
Final simplification77.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
(let* ((t_1 (* t (* 9.0 z))))
(if (<= t_1 -2e-32)
(* (* (/ t a) z) -4.5)
(if (<= t_1 2000000000000.0)
(* (* (/ x a) 0.5) y)
(* (* (/ t a) -4.5) z)))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((x / a) * 0.5) * y;
} else {
tmp = ((t / a) * -4.5) * z;
}
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) :: t_1
real(8) :: tmp
t_1 = t * (9.0d0 * z)
if (t_1 <= (-2d-32)) then
tmp = ((t / a) * z) * (-4.5d0)
else if (t_1 <= 2000000000000.0d0) then
tmp = ((x / a) * 0.5d0) * y
else
tmp = ((t / a) * (-4.5d0)) * z
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 t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((x / a) * 0.5) * y;
} else {
tmp = ((t / a) * -4.5) * z;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (9.0 * z) tmp = 0 if t_1 <= -2e-32: tmp = ((t / a) * z) * -4.5 elif t_1 <= 2000000000000.0: tmp = ((x / a) * 0.5) * y else: tmp = ((t / a) * -4.5) * z return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(9.0 * z)) tmp = 0.0 if (t_1 <= -2e-32) tmp = Float64(Float64(Float64(t / a) * z) * -4.5); elseif (t_1 <= 2000000000000.0) tmp = Float64(Float64(Float64(x / a) * 0.5) * y); else tmp = Float64(Float64(Float64(t / a) * -4.5) * z); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (9.0 * z);
tmp = 0.0;
if (t_1 <= -2e-32)
tmp = ((t / a) * z) * -4.5;
elseif (t_1 <= 2000000000000.0)
tmp = ((x / a) * 0.5) * y;
else
tmp = ((t / a) * -4.5) * z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-32], N[(N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2000000000000.0], N[(N[(N[(x / a), $MachinePrecision] * 0.5), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(t / a), $MachinePrecision] * -4.5), $MachinePrecision] * z), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\left(\frac{t}{a} \cdot z\right) \cdot -4.5\\
\mathbf{elif}\;t\_1 \leq 2000000000000:\\
\;\;\;\;\left(\frac{x}{a} \cdot 0.5\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{t}{a} \cdot -4.5\right) \cdot z\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.00000000000000011e-32Initial program 88.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.5
Applied rewrites75.5%
Applied rewrites73.9%
if -2.00000000000000011e-32 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e12Initial program 92.2%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6481.0
Applied rewrites81.0%
if 2e12 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites90.3%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval90.2
Applied rewrites90.2%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6488.9
Applied rewrites88.9%
Taylor expanded in x around 0
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6473.8
Applied rewrites73.8%
Final simplification77.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
(let* ((t_1 (* t (* 9.0 z))))
(if (<= t_1 -2e-32)
(* (* (/ t a) z) -4.5)
(if (<= t_1 2000000000000.0)
(* (* (/ 0.5 a) x) y)
(* (* (/ t a) -4.5) z)))))assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
double t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((0.5 / a) * x) * y;
} else {
tmp = ((t / a) * -4.5) * z;
}
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) :: t_1
real(8) :: tmp
t_1 = t * (9.0d0 * z)
if (t_1 <= (-2d-32)) then
tmp = ((t / a) * z) * (-4.5d0)
else if (t_1 <= 2000000000000.0d0) then
tmp = ((0.5d0 / a) * x) * y
else
tmp = ((t / a) * (-4.5d0)) * z
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 t_1 = t * (9.0 * z);
double tmp;
if (t_1 <= -2e-32) {
tmp = ((t / a) * z) * -4.5;
} else if (t_1 <= 2000000000000.0) {
tmp = ((0.5 / a) * x) * y;
} else {
tmp = ((t / a) * -4.5) * z;
}
return tmp;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): t_1 = t * (9.0 * z) tmp = 0 if t_1 <= -2e-32: tmp = ((t / a) * z) * -4.5 elif t_1 <= 2000000000000.0: tmp = ((0.5 / a) * x) * y else: tmp = ((t / a) * -4.5) * z return tmp
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) t_1 = Float64(t * Float64(9.0 * z)) tmp = 0.0 if (t_1 <= -2e-32) tmp = Float64(Float64(Float64(t / a) * z) * -4.5); elseif (t_1 <= 2000000000000.0) tmp = Float64(Float64(Float64(0.5 / a) * x) * y); else tmp = Float64(Float64(Float64(t / a) * -4.5) * z); end return tmp end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = t * (9.0 * z);
tmp = 0.0;
if (t_1 <= -2e-32)
tmp = ((t / a) * z) * -4.5;
elseif (t_1 <= 2000000000000.0)
tmp = ((0.5 / a) * x) * y;
else
tmp = ((t / a) * -4.5) * z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(9.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-32], N[(N[(N[(t / a), $MachinePrecision] * z), $MachinePrecision] * -4.5), $MachinePrecision], If[LessEqual[t$95$1, 2000000000000.0], N[(N[(N[(0.5 / a), $MachinePrecision] * x), $MachinePrecision] * y), $MachinePrecision], N[(N[(N[(t / a), $MachinePrecision] * -4.5), $MachinePrecision] * z), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(9 \cdot z\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-32}:\\
\;\;\;\;\left(\frac{t}{a} \cdot z\right) \cdot -4.5\\
\mathbf{elif}\;t\_1 \leq 2000000000000:\\
\;\;\;\;\left(\frac{0.5}{a} \cdot x\right) \cdot y\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{t}{a} \cdot -4.5\right) \cdot z\\
\end{array}
\end{array}
if (*.f64 (*.f64 z #s(literal 9 binary64)) t) < -2.00000000000000011e-32Initial program 88.7%
Taylor expanded in x around 0
associate-/l*N/A
*-commutativeN/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6475.5
Applied rewrites75.5%
Applied rewrites73.9%
if -2.00000000000000011e-32 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) < 2e12Initial program 92.2%
Taylor expanded in x around inf
associate-*l/N/A
associate-*l*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6481.0
Applied rewrites81.0%
Applied rewrites81.0%
if 2e12 < (*.f64 (*.f64 z #s(literal 9 binary64)) t) Initial program 83.7%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites90.3%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval90.2
Applied rewrites90.2%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6488.9
Applied rewrites88.9%
Taylor expanded in x around 0
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6473.8
Applied rewrites73.8%
Final simplification77.3%
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 a) -4.5) z))
assert(x < y && y < z && z < t && t < a);
double code(double x, double y, double z, double t, double a) {
return ((t / a) * -4.5) * z;
}
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 / a) * (-4.5d0)) * z
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 ((t / a) * -4.5) * z;
}
[x, y, z, t, a] = sort([x, y, z, t, a]) def code(x, y, z, t, a): return ((t / a) * -4.5) * z
x, y, z, t, a = sort([x, y, z, t, a]) function code(x, y, z, t, a) return Float64(Float64(Float64(t / a) * -4.5) * z) end
x, y, z, t, a = num2cell(sort([x, y, z, t, a])){:}
function tmp = code(x, y, z, t, a)
tmp = ((t / a) * -4.5) * z;
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[(N[(N[(t / a), $MachinePrecision] * -4.5), $MachinePrecision] * z), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a] = \mathsf{sort}([x, y, z, t, a])\\
\\
\left(\frac{t}{a} \cdot -4.5\right) \cdot z
\end{array}
Initial program 89.0%
lift-/.f64N/A
lift--.f64N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
div-invN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
*-commutativeN/A
associate-/l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
Applied rewrites89.6%
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
lower-*.f64N/A
metadata-eval89.6
Applied rewrites89.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
associate-/r/N/A
associate-*r*N/A
div-invN/A
lower-*.f64N/A
lower-/.f6488.9
Applied rewrites88.9%
Taylor expanded in x around 0
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6447.8
Applied rewrites47.8%
(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 2024332
(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)))