
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 3.1e-18)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) z) c_m)
(fma
(/ a c_m)
(/ t -0.25)
(fma x (* 9.0 (/ y (* c_m z))) (/ b (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 3.1e-18) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / z) / c_m;
} else {
tmp = fma((a / c_m), (t / -0.25), fma(x, (9.0 * (y / (c_m * z))), (b / (c_m * z))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 3.1e-18) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / z) / c_m); else tmp = fma(Float64(a / c_m), Float64(t / -0.25), fma(x, Float64(9.0 * Float64(y / Float64(c_m * z))), Float64(b / Float64(c_m * z)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 3.1e-18], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(a / c$95$m), $MachinePrecision] * N[(t / -0.25), $MachinePrecision] + N[(x * N[(9.0 * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 3.1 \cdot 10^{-18}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a}{c\_m}, \frac{t}{-0.25}, \mathsf{fma}\left(x, 9 \cdot \frac{y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)\\
\end{array}
\end{array}
if c < 3.10000000000000007e-18Initial program 81.7%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr84.9%
if 3.10000000000000007e-18 < c Initial program 71.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified91.1%
associate-*r*N/A
*-commutativeN/A
clear-numN/A
un-div-invN/A
*-commutativeN/A
div-invN/A
times-fracN/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
metadata-evalN/A
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6494.3
Applied egg-rr94.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z))))
(*
c_s
(if (<= t_1 -4e+38)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))
(if (<= t_1 5e-309)
(/ (fma 9.0 (/ (* x y) c_m) (/ (fma a (* -4.0 (* t z)) b) c_m)) z)
(if (<= t_1 INFINITY)
(/ 1.0 (/ (* c_m z) (fma x (* 9.0 y) (fma a (* t (* z -4.0)) b))))
(fma a (/ (* t -4.0) c_m) (* x (/ (/ (* 9.0 y) z) c_m)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double tmp;
if (t_1 <= -4e+38) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
} else if (t_1 <= 5e-309) {
tmp = fma(9.0, ((x * y) / c_m), (fma(a, (-4.0 * (t * z)), b) / c_m)) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = 1.0 / ((c_m * z) / fma(x, (9.0 * y), fma(a, (t * (z * -4.0)), b)));
} else {
tmp = fma(a, ((t * -4.0) / c_m), (x * (((9.0 * y) / z) / c_m)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -4e+38) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); elseif (t_1 <= 5e-309) tmp = Float64(fma(9.0, Float64(Float64(x * y) / c_m), Float64(fma(a, Float64(-4.0 * Float64(t * z)), b) / c_m)) / z); elseif (t_1 <= Inf) tmp = Float64(1.0 / Float64(Float64(c_m * z) / fma(x, Float64(9.0 * y), fma(a, Float64(t * Float64(z * -4.0)), b)))); else tmp = fma(a, Float64(Float64(t * -4.0) / c_m), Float64(x * Float64(Float64(Float64(9.0 * y) / z) / c_m))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -4e+38], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-309], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(N[(a * N[(-4.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(1.0 / N[(N[(c$95$m * z), $MachinePrecision] / N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(t * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(x * N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+38}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-309}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, \frac{x \cdot y}{c\_m}, \frac{\mathsf{fma}\left(a, -4 \cdot \left(t \cdot z\right), b\right)}{c\_m}\right)}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{1}{\frac{c\_m \cdot z}{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, t \cdot \left(z \cdot -4\right), b\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, \frac{t \cdot -4}{c\_m}, x \cdot \frac{\frac{9 \cdot y}{z}}{c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -3.99999999999999991e38Initial program 90.5%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6491.5
Applied egg-rr91.5%
if -3.99999999999999991e38 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 4.9999999999999995e-309Initial program 73.7%
Taylor expanded in z around 0
/-lowering-/.f64N/A
Simplified98.4%
if 4.9999999999999995e-309 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.4%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.4
Applied egg-rr91.4%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6490.5
Applied egg-rr90.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in b around 0
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.6
Simplified76.6%
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
*-commutativeN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f6488.1
Applied egg-rr88.1%
Final simplification92.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z))))
(*
c_s
(if (<= t_1 -2e+47)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))
(if (<= t_1 5e-309)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) c_m) z)
(if (<= t_1 INFINITY)
(/ 1.0 (/ (* c_m z) (fma x (* 9.0 y) (fma a (* t (* z -4.0)) b))))
(fma a (/ (* t -4.0) c_m) (* x (/ (/ (* 9.0 y) z) c_m)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double tmp;
if (t_1 <= -2e+47) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
} else if (t_1 <= 5e-309) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / c_m) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = 1.0 / ((c_m * z) / fma(x, (9.0 * y), fma(a, (t * (z * -4.0)), b)));
} else {
tmp = fma(a, ((t * -4.0) / c_m), (x * (((9.0 * y) / z) / c_m)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e+47) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); elseif (t_1 <= 5e-309) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / c_m) / z); elseif (t_1 <= Inf) tmp = Float64(1.0 / Float64(Float64(c_m * z) / fma(x, Float64(9.0 * y), fma(a, Float64(t * Float64(z * -4.0)), b)))); else tmp = fma(a, Float64(Float64(t * -4.0) / c_m), Float64(x * Float64(Float64(Float64(9.0 * y) / z) / c_m))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+47], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-309], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(1.0 / N[(N[(c$95$m * z), $MachinePrecision] / N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(t * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision] + N[(x * N[(N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+47}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-309}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{1}{\frac{c\_m \cdot z}{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, t \cdot \left(z \cdot -4\right), b\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, \frac{t \cdot -4}{c\_m}, x \cdot \frac{\frac{9 \cdot y}{z}}{c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -2.0000000000000001e47Initial program 90.2%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6492.6
Applied egg-rr92.6%
if -2.0000000000000001e47 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 4.9999999999999995e-309Initial program 74.7%
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr98.2%
if 4.9999999999999995e-309 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.4%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.4
Applied egg-rr91.4%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6490.5
Applied egg-rr90.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in b around 0
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6476.6
Simplified76.6%
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
*-commutativeN/A
*-commutativeN/A
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f6488.1
Applied egg-rr88.1%
Final simplification92.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z))))
(*
c_s
(if (<= t_1 -2e+47)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))
(if (<= t_1 5e-309)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) c_m) z)
(if (<= t_1 INFINITY)
(/ 1.0 (/ (* c_m z) (fma x (* 9.0 y) (fma a (* t (* z -4.0)) b))))
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double tmp;
if (t_1 <= -2e+47) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
} else if (t_1 <= 5e-309) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / c_m) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = 1.0 / ((c_m * z) / fma(x, (9.0 * y), fma(a, (t * (z * -4.0)), b)));
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e+47) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); elseif (t_1 <= 5e-309) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / c_m) / z); elseif (t_1 <= Inf) tmp = Float64(1.0 / Float64(Float64(c_m * z) / fma(x, Float64(9.0 * y), fma(a, Float64(t * Float64(z * -4.0)), b)))); else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+47], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-309], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(1.0 / N[(N[(c$95$m * z), $MachinePrecision] / N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(t * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+47}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-309}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{1}{\frac{c\_m \cdot z}{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, t \cdot \left(z \cdot -4\right), b\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -2.0000000000000001e47Initial program 90.2%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6492.6
Applied egg-rr92.6%
if -2.0000000000000001e47 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 4.9999999999999995e-309Initial program 74.7%
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr98.2%
if 4.9999999999999995e-309 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.4%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.4
Applied egg-rr91.4%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6490.5
Applied egg-rr90.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.5
Simplified80.5%
Final simplification91.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z))))
(*
c_s
(if (<= t_1 -2e+47)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))
(if (<= t_1 0.0)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) c_m) z)
(if (<= t_1 INFINITY)
t_1
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double tmp;
if (t_1 <= -2e+47) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
} else if (t_1 <= 0.0) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / c_m) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e+47) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / c_m) / z); elseif (t_1 <= Inf) tmp = t_1; else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+47], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$1, N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+47}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -2.0000000000000001e47Initial program 90.2%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6492.6
Applied egg-rr92.6%
if -2.0000000000000001e47 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 74.7%
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr98.2%
if 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.4%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.5
Simplified80.5%
Final simplification91.6%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z))))
(*
c_s
(if (<= t_1 -2e-313)
(/ (fma (* x y) 9.0 (fma (* t a) (* z -4.0) b)) (* c_m z))
(if (<= t_1 0.0)
(* t (/ (fma -4.0 a (/ b (* t z))) c_m))
(if (<= t_1 INFINITY)
t_1
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double tmp;
if (t_1 <= -2e-313) {
tmp = fma((x * y), 9.0, fma((t * a), (z * -4.0), b)) / (c_m * z);
} else if (t_1 <= 0.0) {
tmp = t * (fma(-4.0, a, (b / (t * z))) / c_m);
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e-313) tmp = Float64(fma(Float64(x * y), 9.0, fma(Float64(t * a), Float64(z * -4.0), b)) / Float64(c_m * z)); elseif (t_1 <= 0.0) tmp = Float64(t * Float64(fma(-4.0, a, Float64(b / Float64(t * z))) / c_m)); elseif (t_1 <= Inf) tmp = t_1; else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-313], N[(N[(N[(x * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(t * N[(N[(-4.0 * a + N[(b / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$1, N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-313}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot y, 9, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m \cdot z}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;t \cdot \frac{\mathsf{fma}\left(-4, a, \frac{b}{t \cdot z}\right)}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -1.99999999998e-313Initial program 92.5%
associate-+l-N/A
sub-negN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.7
Applied egg-rr91.7%
if -1.99999999998e-313 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 48.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6448.7
Simplified48.7%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6495.9
Simplified95.9%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.9
Simplified99.9%
if 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.4%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.5
Simplified80.5%
Final simplification90.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z)))
(t_2 (/ (fma (* x y) 9.0 (fma (* t a) (* z -4.0) b)) (* c_m z))))
(*
c_s
(if (<= t_1 -2e-313)
t_2
(if (<= t_1 0.0)
(* t (/ (fma -4.0 a (/ b (* t z))) c_m))
(if (<= t_1 INFINITY)
t_2
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double t_2 = fma((x * y), 9.0, fma((t * a), (z * -4.0), b)) / (c_m * z);
double tmp;
if (t_1 <= -2e-313) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = t * (fma(-4.0, a, (b / (t * z))) / c_m);
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) t_2 = Float64(fma(Float64(x * y), 9.0, fma(Float64(t * a), Float64(z * -4.0), b)) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e-313) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(t * Float64(fma(-4.0, a, Float64(b / Float64(t * z))) / c_m)); elseif (t_1 <= Inf) tmp = t_2; else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * y), $MachinePrecision] * 9.0 + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-313], t$95$2, If[LessEqual[t$95$1, 0.0], N[(t * N[(N[(-4.0 * a + N[(b / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
t_2 := \frac{\mathsf{fma}\left(x \cdot y, 9, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-313}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;t \cdot \frac{\mathsf{fma}\left(-4, a, \frac{b}{t \cdot z}\right)}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -1.99999999998e-313 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.5%
associate-+l-N/A
sub-negN/A
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.6
Applied egg-rr91.6%
if -1.99999999998e-313 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 48.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6448.7
Simplified48.7%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6495.9
Simplified95.9%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.9
Simplified99.9%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.5
Simplified80.5%
Final simplification91.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z)))
(t_2 (/ (fma (* x 9.0) y (fma (* t a) (* z -4.0) b)) (* c_m z))))
(*
c_s
(if (<= t_1 -2e-313)
t_2
(if (<= t_1 0.0)
(* t (/ (fma -4.0 a (/ b (* t z))) c_m))
(if (<= t_1 INFINITY)
t_2
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (c_m * z);
double t_2 = fma((x * 9.0), y, fma((t * a), (z * -4.0), b)) / (c_m * z);
double tmp;
if (t_1 <= -2e-313) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = t * (fma(-4.0, a, (b / (t * z))) / c_m);
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(c_m * z)) t_2 = Float64(fma(Float64(x * 9.0), y, fma(Float64(t * a), Float64(z * -4.0), b)) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -2e-313) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(t * Float64(fma(-4.0, a, Float64(b / Float64(t * z))) / c_m)); elseif (t_1 <= Inf) tmp = t_2; else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-313], t$95$2, If[LessEqual[t$95$1, 0.0], N[(t * N[(N[(-4.0 * a + N[(b / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{c\_m \cdot z}\\
t_2 := \frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-313}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;t \cdot \frac{\mathsf{fma}\left(-4, a, \frac{b}{t \cdot z}\right)}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -1.99999999998e-313 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.5%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.1
Applied egg-rr91.1%
if -1.99999999998e-313 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 48.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6448.7
Simplified48.7%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6495.9
Simplified95.9%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6499.9
Simplified99.9%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified76.4%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.5
Simplified80.5%
Final simplification90.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1
(/
(fma a (* t 4.0) (fma x (/ (* y -9.0) z) (- 0.0 (/ b z))))
(- 0.0 c_m))))
(*
c_s
(if (<= z -3e-11)
t_1
(if (<= z 0.0001)
(/ (* (fma x (* 9.0 y) (fma a (* t (* z -4.0)) b)) (/ 1.0 c_m)) z)
t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(a, (t * 4.0), fma(x, ((y * -9.0) / z), (0.0 - (b / z)))) / (0.0 - c_m);
double tmp;
if (z <= -3e-11) {
tmp = t_1;
} else if (z <= 0.0001) {
tmp = (fma(x, (9.0 * y), fma(a, (t * (z * -4.0)), b)) * (1.0 / c_m)) / z;
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(a, Float64(t * 4.0), fma(x, Float64(Float64(y * -9.0) / z), Float64(0.0 - Float64(b / z)))) / Float64(0.0 - c_m)) tmp = 0.0 if (z <= -3e-11) tmp = t_1; elseif (z <= 0.0001) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(t * Float64(z * -4.0)), b)) * Float64(1.0 / c_m)) / z); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(a * N[(t * 4.0), $MachinePrecision] + N[(x * N[(N[(y * -9.0), $MachinePrecision] / z), $MachinePrecision] + N[(0.0 - N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(0.0 - c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -3e-11], t$95$1, If[LessEqual[z, 0.0001], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(t * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] * N[(1.0 / c$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(a, t \cdot 4, \mathsf{fma}\left(x, \frac{y \cdot -9}{z}, 0 - \frac{b}{z}\right)\right)}{0 - c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{-11}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 0.0001:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, t \cdot \left(z \cdot -4\right), b\right)\right) \cdot \frac{1}{c\_m}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -3e-11 or 1.00000000000000005e-4 < z Initial program 64.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified83.2%
Taylor expanded in c around -inf
associate-*r/N/A
/-lowering-/.f64N/A
Simplified88.2%
if -3e-11 < z < 1.00000000000000005e-4Initial program 95.7%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval92.5
Applied egg-rr92.5%
associate-/r*N/A
associate-*r*N/A
div-invN/A
associate-*l/N/A
/-lowering-/.f64N/A
Applied egg-rr96.9%
Final simplification92.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 2.55e-17)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) z) c_m)
(fma
(* a (/ -4.0 c_m))
t
(fma x (* 9.0 (/ y (* c_m z))) (/ b (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 2.55e-17) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / z) / c_m;
} else {
tmp = fma((a * (-4.0 / c_m)), t, fma(x, (9.0 * (y / (c_m * z))), (b / (c_m * z))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 2.55e-17) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / z) / c_m); else tmp = fma(Float64(a * Float64(-4.0 / c_m)), t, fma(x, Float64(9.0 * Float64(y / Float64(c_m * z))), Float64(b / Float64(c_m * z)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 2.55e-17], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(a * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 2.55 \cdot 10^{-17}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot \frac{-4}{c\_m}, t, \mathsf{fma}\left(x, 9 \cdot \frac{y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)\\
\end{array}
\end{array}
if c < 2.5500000000000001e-17Initial program 81.7%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr84.9%
if 2.5500000000000001e-17 < c Initial program 71.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified91.1%
*-commutativeN/A
associate-*r*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f6494.2
Applied egg-rr94.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= c_m 7.2e-9)
(/ (/ (fma x (* 9.0 y) (fma (* t a) (* z -4.0) b)) z) c_m)
(fma
a
(* t (/ -4.0 c_m))
(fma x (/ (* 9.0 y) (* c_m z)) (/ b (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (c_m <= 7.2e-9) {
tmp = (fma(x, (9.0 * y), fma((t * a), (z * -4.0), b)) / z) / c_m;
} else {
tmp = fma(a, (t * (-4.0 / c_m)), fma(x, ((9.0 * y) / (c_m * z)), (b / (c_m * z))));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (c_m <= 7.2e-9) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(Float64(t * a), Float64(z * -4.0), b)) / z) / c_m); else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), fma(x, Float64(Float64(9.0 * y) / Float64(c_m * z)), Float64(b / Float64(c_m * z)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 7.2e-9], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(N[(t * a), $MachinePrecision] * N[(z * -4.0), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(9.0 * y), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 7.2 \cdot 10^{-9}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(t \cdot a, z \cdot -4, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \mathsf{fma}\left(x, \frac{9 \cdot y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\right)\\
\end{array}
\end{array}
if c < 7.2e-9Initial program 81.8%
associate-/r*N/A
/-lowering-/.f64N/A
Applied egg-rr84.9%
if 7.2e-9 < c Initial program 70.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified91.0%
Final simplification86.8%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* t (/ (* a -4.0) c_m))))
(*
c_s
(if (<= a -3e+21)
t_1
(if (<= a 1.35e-205)
(* x (/ (* 9.0 y) (fma z c_m 0.0)))
(if (<= a 3.7e-132)
(/ (/ b z) c_m)
(if (<= a 1.48e-5) (* 9.0 (* x (/ y (* c_m z)))) t_1)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * ((a * -4.0) / c_m);
double tmp;
if (a <= -3e+21) {
tmp = t_1;
} else if (a <= 1.35e-205) {
tmp = x * ((9.0 * y) / fma(z, c_m, 0.0));
} else if (a <= 3.7e-132) {
tmp = (b / z) / c_m;
} else if (a <= 1.48e-5) {
tmp = 9.0 * (x * (y / (c_m * z)));
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(Float64(a * -4.0) / c_m)) tmp = 0.0 if (a <= -3e+21) tmp = t_1; elseif (a <= 1.35e-205) tmp = Float64(x * Float64(Float64(9.0 * y) / fma(z, c_m, 0.0))); elseif (a <= 3.7e-132) tmp = Float64(Float64(b / z) / c_m); elseif (a <= 1.48e-5) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(c_m * z)))); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[a, -3e+21], t$95$1, If[LessEqual[a, 1.35e-205], N[(x * N[(N[(9.0 * y), $MachinePrecision] / N[(z * c$95$m + 0.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 3.7e-132], N[(N[(b / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[a, 1.48e-5], N[(9.0 * N[(x * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{a \cdot -4}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -3 \cdot 10^{+21}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 1.35 \cdot 10^{-205}:\\
\;\;\;\;x \cdot \frac{9 \cdot y}{\mathsf{fma}\left(z, c\_m, 0\right)}\\
\mathbf{elif}\;a \leq 3.7 \cdot 10^{-132}:\\
\;\;\;\;\frac{\frac{b}{z}}{c\_m}\\
\mathbf{elif}\;a \leq 1.48 \cdot 10^{-5}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{c\_m \cdot z}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if a < -3e21 or 1.4800000000000001e-5 < a Initial program 72.7%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval70.6
Applied egg-rr70.6%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6472.9
Applied egg-rr72.9%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6467.0
Simplified67.0%
if -3e21 < a < 1.35e-205Initial program 82.5%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6452.1
Simplified52.1%
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
*-commutativeN/A
/-lowering-/.f64N/A
distribute-rgt-neg-inN/A
metadata-evalN/A
*-lowering-*.f64N/A
+-lft-identityN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6454.2
Applied egg-rr54.2%
if 1.35e-205 < a < 3.7000000000000002e-132Initial program 88.6%
Taylor expanded in b around inf
Simplified60.5%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7
Applied egg-rr60.7%
if 3.7000000000000002e-132 < a < 1.4800000000000001e-5Initial program 87.3%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6457.5
Simplified57.5%
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lft-identityN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6453.8
Applied egg-rr53.8%
+-rgt-identityN/A
*-lowering-*.f6453.8
Applied egg-rr53.8%
Final simplification60.9%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* 9.0 (* x (/ y (* c_m z))))) (t_2 (* t (/ (* a -4.0) c_m))))
(*
c_s
(if (<= a -130000000.0)
t_2
(if (<= a 1.15e-205)
t_1
(if (<= a 4.8e-133) (/ (/ b z) c_m) (if (<= a 4.5e-10) t_1 t_2)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = 9.0 * (x * (y / (c_m * z)));
double t_2 = t * ((a * -4.0) / c_m);
double tmp;
if (a <= -130000000.0) {
tmp = t_2;
} else if (a <= 1.15e-205) {
tmp = t_1;
} else if (a <= 4.8e-133) {
tmp = (b / z) / c_m;
} else if (a <= 4.5e-10) {
tmp = t_1;
} else {
tmp = t_2;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * (x * (y / (c_m * z)))
t_2 = t * ((a * (-4.0d0)) / c_m)
if (a <= (-130000000.0d0)) then
tmp = t_2
else if (a <= 1.15d-205) then
tmp = t_1
else if (a <= 4.8d-133) then
tmp = (b / z) / c_m
else if (a <= 4.5d-10) then
tmp = t_1
else
tmp = t_2
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = 9.0 * (x * (y / (c_m * z)));
double t_2 = t * ((a * -4.0) / c_m);
double tmp;
if (a <= -130000000.0) {
tmp = t_2;
} else if (a <= 1.15e-205) {
tmp = t_1;
} else if (a <= 4.8e-133) {
tmp = (b / z) / c_m;
} else if (a <= 4.5e-10) {
tmp = t_1;
} else {
tmp = t_2;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = 9.0 * (x * (y / (c_m * z))) t_2 = t * ((a * -4.0) / c_m) tmp = 0 if a <= -130000000.0: tmp = t_2 elif a <= 1.15e-205: tmp = t_1 elif a <= 4.8e-133: tmp = (b / z) / c_m elif a <= 4.5e-10: tmp = t_1 else: tmp = t_2 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(9.0 * Float64(x * Float64(y / Float64(c_m * z)))) t_2 = Float64(t * Float64(Float64(a * -4.0) / c_m)) tmp = 0.0 if (a <= -130000000.0) tmp = t_2; elseif (a <= 1.15e-205) tmp = t_1; elseif (a <= 4.8e-133) tmp = Float64(Float64(b / z) / c_m); elseif (a <= 4.5e-10) tmp = t_1; else tmp = t_2; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = 9.0 * (x * (y / (c_m * z)));
t_2 = t * ((a * -4.0) / c_m);
tmp = 0.0;
if (a <= -130000000.0)
tmp = t_2;
elseif (a <= 1.15e-205)
tmp = t_1;
elseif (a <= 4.8e-133)
tmp = (b / z) / c_m;
elseif (a <= 4.5e-10)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(9.0 * N[(x * N[(y / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[a, -130000000.0], t$95$2, If[LessEqual[a, 1.15e-205], t$95$1, If[LessEqual[a, 4.8e-133], N[(N[(b / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[a, 4.5e-10], t$95$1, t$95$2]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(x \cdot \frac{y}{c\_m \cdot z}\right)\\
t_2 := t \cdot \frac{a \cdot -4}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -130000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;a \leq 1.15 \cdot 10^{-205}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 4.8 \cdot 10^{-133}:\\
\;\;\;\;\frac{\frac{b}{z}}{c\_m}\\
\mathbf{elif}\;a \leq 4.5 \cdot 10^{-10}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
\end{array}
if a < -1.3e8 or 4.5e-10 < a Initial program 73.1%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval71.1
Applied egg-rr71.1%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6473.3
Applied egg-rr73.3%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6466.0
Simplified66.0%
if -1.3e8 < a < 1.15e-205 or 4.8e-133 < a < 4.5e-10Initial program 83.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6453.2
Simplified53.2%
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-lft-identityN/A
+-commutativeN/A
*-commutativeN/A
accelerator-lowering-fma.f6454.2
Applied egg-rr54.2%
+-rgt-identityN/A
*-lowering-*.f6454.2
Applied egg-rr54.2%
if 1.15e-205 < a < 4.8e-133Initial program 88.6%
Taylor expanded in b around inf
Simplified60.5%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6460.7
Applied egg-rr60.7%
Final simplification60.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= a -5e+14)
(* t (/ (fma -4.0 a (/ b (* t z))) c_m))
(if (<= a 6.8e-7)
(/ (fma 9.0 (* x y) b) (* c_m z))
(fma a (* t (/ -4.0 c_m)) (/ b (* c_m z)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (a <= -5e+14) {
tmp = t * (fma(-4.0, a, (b / (t * z))) / c_m);
} else if (a <= 6.8e-7) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = fma(a, (t * (-4.0 / c_m)), (b / (c_m * z)));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (a <= -5e+14) tmp = Float64(t * Float64(fma(-4.0, a, Float64(b / Float64(t * z))) / c_m)); elseif (a <= 6.8e-7) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = fma(a, Float64(t * Float64(-4.0 / c_m)), Float64(b / Float64(c_m * z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[a, -5e+14], N[(t * N[(N[(-4.0 * a + N[(b / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 6.8e-7], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(a * N[(t * N[(-4.0 / c$95$m), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -5 \cdot 10^{+14}:\\
\;\;\;\;t \cdot \frac{\mathsf{fma}\left(-4, a, \frac{b}{t \cdot z}\right)}{c\_m}\\
\mathbf{elif}\;a \leq 6.8 \cdot 10^{-7}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a, t \cdot \frac{-4}{c\_m}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
if a < -5e14Initial program 70.5%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6454.1
Simplified54.1%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6474.0
Simplified74.0%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6472.4
Simplified72.4%
if -5e14 < a < 6.79999999999999948e-7Initial program 83.9%
Taylor expanded in z around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6477.6
Simplified77.6%
if 6.79999999999999948e-7 < a Initial program 74.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified85.3%
Taylor expanded in x around 0
/-lowering-/.f64N/A
*-lowering-*.f6480.1
Simplified80.1%
Final simplification77.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* t (/ (fma -4.0 a (/ b (* t z))) c_m))))
(*
c_s
(if (<= a -61000000000.0)
t_1
(if (<= a 1.85e-5) (/ (fma 9.0 (* x y) b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * (fma(-4.0, a, (b / (t * z))) / c_m);
double tmp;
if (a <= -61000000000.0) {
tmp = t_1;
} else if (a <= 1.85e-5) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(fma(-4.0, a, Float64(b / Float64(t * z))) / c_m)) tmp = 0.0 if (a <= -61000000000.0) tmp = t_1; elseif (a <= 1.85e-5) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(N[(-4.0 * a + N[(b / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[a, -61000000000.0], t$95$1, If[LessEqual[a, 1.85e-5], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{\mathsf{fma}\left(-4, a, \frac{b}{t \cdot z}\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -61000000000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 1.85 \cdot 10^{-5}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if a < -6.1e10 or 1.84999999999999991e-5 < a Initial program 73.1%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6459.3
Simplified59.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.9
Simplified75.9%
Taylor expanded in c around 0
/-lowering-/.f64N/A
accelerator-lowering-fma.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6478.4
Simplified78.4%
if -6.1e10 < a < 1.84999999999999991e-5Initial program 83.9%
Taylor expanded in z around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6477.6
Simplified77.6%
Final simplification78.0%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (fma -4.0 (* t a) (/ b z)) c_m)))
(*
c_s
(if (<= z -6.2e+16)
t_1
(if (<= z 4500000.0) (/ (fma 9.0 (* x y) b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(-4.0, (t * a), (b / z)) / c_m;
double tmp;
if (z <= -6.2e+16) {
tmp = t_1;
} else if (z <= 4500000.0) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c_m) tmp = 0.0 if (z <= -6.2e+16) tmp = t_1; elseif (z <= 4500000.0) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -6.2e+16], t$95$1, If[LessEqual[z, 4500000.0], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -6.2 \cdot 10^{+16}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4500000:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -6.2e16 or 4.5e6 < z Initial program 61.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
accelerator-lowering-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Simplified83.5%
Taylor expanded in c around -inf
associate-*r/N/A
/-lowering-/.f64N/A
Simplified87.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
/-lowering-/.f6471.3
Simplified71.3%
if -6.2e16 < z < 4.5e6Initial program 96.0%
Taylor expanded in z around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6483.9
Simplified83.9%
Final simplification77.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* t (/ (* a -4.0) c_m))))
(*
c_s
(if (<= z -9.5e+53)
t_1
(if (<= z 8e+20) (/ (fma 9.0 (* x y) b) (* c_m z)) t_1)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * ((a * -4.0) / c_m);
double tmp;
if (z <= -9.5e+53) {
tmp = t_1;
} else if (z <= 8e+20) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(Float64(a * -4.0) / c_m)) tmp = 0.0 if (z <= -9.5e+53) tmp = t_1; elseif (z <= 8e+20) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -9.5e+53], t$95$1, If[LessEqual[z, 8e+20], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{a \cdot -4}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -9.5 \cdot 10^{+53}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8 \cdot 10^{+20}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -9.5000000000000006e53 or 8e20 < z Initial program 60.4%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval64.7
Applied egg-rr64.7%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6460.9
Applied egg-rr60.9%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6468.3
Simplified68.3%
if -9.5000000000000006e53 < z < 8e20Initial program 94.3%
Taylor expanded in z around 0
+-commutativeN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f6482.2
Simplified82.2%
Final simplification75.7%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (let* ((t_1 (* t (/ (* a -4.0) c_m)))) (* c_s (if (<= z -1.5e-99) t_1 (if (<= z 8.3e-119) (/ b (* c_m z)) t_1)))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * ((a * -4.0) / c_m);
double tmp;
if (z <= -1.5e-99) {
tmp = t_1;
} else if (z <= 8.3e-119) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) / c_m)
if (z <= (-1.5d-99)) then
tmp = t_1
else if (z <= 8.3d-119) then
tmp = b / (c_m * z)
else
tmp = t_1
end if
code = c_s * tmp
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = t * ((a * -4.0) / c_m);
double tmp;
if (z <= -1.5e-99) {
tmp = t_1;
} else if (z <= 8.3e-119) {
tmp = b / (c_m * z);
} else {
tmp = t_1;
}
return c_s * tmp;
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): t_1 = t * ((a * -4.0) / c_m) tmp = 0 if z <= -1.5e-99: tmp = t_1 elif z <= 8.3e-119: tmp = b / (c_m * z) else: tmp = t_1 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) t_1 = Float64(t * Float64(Float64(a * -4.0) / c_m)) tmp = 0.0 if (z <= -1.5e-99) tmp = t_1; elseif (z <= 8.3e-119) tmp = Float64(b / Float64(c_m * z)); else tmp = t_1; end return Float64(c_s * tmp) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp_2 = code(c_s, x, y, z, t, a, b, c_m)
t_1 = t * ((a * -4.0) / c_m);
tmp = 0.0;
if (z <= -1.5e-99)
tmp = t_1;
elseif (z <= 8.3e-119)
tmp = b / (c_m * z);
else
tmp = t_1;
end
tmp_2 = c_s * tmp;
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.5e-99], t$95$1, If[LessEqual[z, 8.3e-119], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{a \cdot -4}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.5 \cdot 10^{-99}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.3 \cdot 10^{-119}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.50000000000000003e-99 or 8.29999999999999946e-119 < z Initial program 71.1%
associate-+l-N/A
sub-negN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval73.5
Applied egg-rr73.5%
clear-numN/A
/-lowering-/.f64N/A
associate-*r*N/A
/-lowering-/.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
accelerator-lowering-fma.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.5
Applied egg-rr71.5%
Taylor expanded in z around inf
associate-*r/N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r/N/A
associate-*r/N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f6460.2
Simplified60.2%
if -1.50000000000000003e-99 < z < 8.29999999999999946e-119Initial program 96.0%
Taylor expanded in b around inf
Simplified61.6%
Final simplification60.6%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. (FPCore (c_s x y z t a b c_m) :precision binary64 (* c_s (/ b (* c_m z))))
c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = abs(c)
c\_s = copysign(1.0d0, c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
real(8) function code(c_s, x, y, z, t, a, b, c_m)
real(8), intent (in) :: c_s
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), intent (in) :: b
real(8), intent (in) :: c_m
code = c_s * (b / (c_m * z))
end function
c\_m = Math.abs(c);
c\_s = Math.copySign(1.0, c);
assert x < y && y < z && z < t && t < a && a < b && b < c_m;
public static double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
return c_s * (b / (c_m * z));
}
c\_m = math.fabs(c) c\_s = math.copysign(1.0, c) [x, y, z, t, a, b, c_m] = sort([x, y, z, t, a, b, c_m]) def code(c_s, x, y, z, t, a, b, c_m): return c_s * (b / (c_m * z))
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) return Float64(c_s * Float64(b / Float64(c_m * z))) end
c\_m = abs(c);
c\_s = sign(c) * abs(1.0);
x, y, z, t, a, b, c_m = num2cell(sort([x, y, z, t, a, b, c_m])){:}
function tmp = code(c_s, x, y, z, t, a, b, c_m)
tmp = c_s * (b / (c_m * z));
end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{c\_m \cdot z}
\end{array}
Initial program 78.5%
Taylor expanded in b around inf
Simplified34.9%
Final simplification34.9%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
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), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024194
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))