
(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 20 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 1.65e-57)
(/ (+ (* z (fma 9.0 (/ (* x y) z) (* -4.0 (* t a)))) b) (* c_m z))
(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 <= 1.65e-57) {
tmp = ((z * fma(9.0, ((x * y) / z), (-4.0 * (t * a)))) + b) / (c_m * z);
} 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 <= 1.65e-57) tmp = Float64(Float64(Float64(z * fma(9.0, Float64(Float64(x * y) / z), Float64(-4.0 * Float64(t * a)))) + b) / Float64(c_m * z)); 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, 1.65e-57], N[(N[(N[(z * N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $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 1.65 \cdot 10^{-57}:\\
\;\;\;\;\frac{z \cdot \mathsf{fma}\left(9, \frac{x \cdot y}{z}, -4 \cdot \left(t \cdot a\right)\right) + b}{c\_m \cdot z}\\
\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 < 1.6499999999999999e-57Initial program 80.9%
Taylor expanded in z around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6483.1
Applied rewrites83.1%
if 1.6499999999999999e-57 < c Initial program 76.7%
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
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites92.9%
Final simplification86.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
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* c_m z)))
(t_2 (/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))))
(*
c_s
(if (<= t_1 -4e+17)
t_2
(if (<= t_1 5e-160)
(/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) z) c_m)
(if (<= t_1 INFINITY)
t_2
(fma (/ (* x 9.0) c_m) (/ y z) (- (* a (* 4.0 (/ t 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 t_2 = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
double tmp;
if (t_1 <= -4e+17) {
tmp = t_2;
} else if (t_1 <= 5e-160) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / z) / c_m;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma(((x * 9.0) / c_m), (y / z), -(a * (4.0 * (t / 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)) t_2 = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -4e+17) tmp = t_2; elseif (t_1 <= 5e-160) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / z) / c_m); elseif (t_1 <= Inf) tmp = t_2; else tmp = fma(Float64(Float64(x * 9.0) / c_m), Float64(y / z), Float64(-Float64(a * Float64(4.0 * Float64(t / 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]}, Block[{t$95$2 = 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]}, N[(c$95$s * If[LessEqual[t$95$1, -4e+17], t$95$2, If[LessEqual[t$95$1, 5e-160], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(N[(x * 9.0), $MachinePrecision] / c$95$m), $MachinePrecision] * N[(y / z), $MachinePrecision] + (-N[(a * N[(4.0 * N[(t / c$95$m), $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])\\
\\
\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(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+17}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-160}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x \cdot 9}{c\_m}, \frac{y}{z}, -a \cdot \left(4 \cdot \frac{t}{c\_m}\right)\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)) < -4e17 or 4.99999999999999994e-160 < (/.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 86.1%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites87.2%
if -4e17 < (/.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.99999999999999994e-160Initial program 70.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.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%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites8.8%
Taylor expanded in z around inf
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6499.3
Applied rewrites99.3%
Final simplification89.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 (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))))
(*
c_s
(if (<= t_1 -4e+17)
t_2
(if (<= t_1 5e-160)
(/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) z) c_m)
(if (<= t_1 INFINITY) t_2 (* (/ t c_m) (* a -4.0))))))))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((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
double tmp;
if (t_1 <= -4e+17) {
tmp = t_2;
} else if (t_1 <= 5e-160) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / z) / c_m;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = (t / c_m) * (a * -4.0);
}
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(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -4e+17) tmp = t_2; elseif (t_1 <= 5e-160) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / z) / c_m); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(Float64(t / c_m) * Float64(a * -4.0)); 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[(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]}, N[(c$95$s * If[LessEqual[t$95$1, -4e+17], t$95$2, If[LessEqual[t$95$1, 5e-160], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(t / c$95$m), $MachinePrecision] * N[(a * -4.0), $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(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+17}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-160}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c\_m} \cdot \left(a \cdot -4\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)) < -4e17 or 4.99999999999999994e-160 < (/.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 86.1%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites87.2%
if -4e17 < (/.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.99999999999999994e-160Initial program 70.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.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 b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f642.4
Applied rewrites2.4%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6444.1
Applied rewrites44.1%
Applied rewrites83.0%
Final simplification89.1%
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 (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* c_m z))))
(*
c_s
(if (<= t_1 -1e-243)
t_2
(if (<= t_1 0.0)
(/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) c_m) z)
(if (<= t_1 INFINITY) t_2 (* (/ t c_m) (* a -4.0))))))))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((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (c_m * z);
double tmp;
if (t_1 <= -1e-243) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / c_m) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = (t / c_m) * (a * -4.0);
}
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(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(c_m * z)) tmp = 0.0 if (t_1 <= -1e-243) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / c_m) / z); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(Float64(t / c_m) * Float64(a * -4.0)); 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[(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]}, N[(c$95$s * If[LessEqual[t$95$1, -1e-243], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(t / c$95$m), $MachinePrecision] * N[(a * -4.0), $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(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{c\_m \cdot z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-243}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{t}{c\_m} \cdot \left(a \cdot -4\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)) < -9.99999999999999995e-244 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 87.5%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites88.5%
if -9.99999999999999995e-244 < (/.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 36.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites99.6%
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 b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f642.4
Applied rewrites2.4%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6444.1
Applied rewrites44.1%
Applied rewrites83.0%
Final simplification89.1%
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 x (* (/ y z) -9.0) (/ (- (* z (* a (* 4.0 t))) b) z))
(- c_m))))
(*
c_s
(if (<= z -3.4e+39)
t_1
(if (<= z 1e-50)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 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(x, ((y / z) * -9.0), (((z * (a * (4.0 * t))) - b) / z)) / -c_m;
double tmp;
if (z <= -3.4e+39) {
tmp = t_1;
} else if (z <= 1e-50) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * 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(x, Float64(Float64(y / z) * -9.0), Float64(Float64(Float64(z * Float64(a * Float64(4.0 * t))) - b) / z)) / Float64(-c_m)) tmp = 0.0 if (z <= -3.4e+39) tmp = t_1; elseif (z <= 1e-50) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * 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[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision] + N[(N[(N[(z * N[(a * N[(4.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / (-c$95$m)), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -3.4e+39], t$95$1, If[LessEqual[z, 1e-50], 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], 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(x, \frac{y}{z} \cdot -9, \frac{z \cdot \left(a \cdot \left(4 \cdot t\right)\right) - b}{z}\right)}{-c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -3.4 \cdot 10^{+39}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 10^{-50}:\\
\;\;\;\;\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{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -3.3999999999999999e39 or 1.00000000000000001e-50 < z Initial program 65.3%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites64.2%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites85.5%
if -3.3999999999999999e39 < z < 1.00000000000000001e-50Initial program 94.4%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites95.4%
Final simplification90.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 (* y (* x 9.0))))
(*
c_s
(if (<= t_1 -2e+135)
(/ (fma x (/ (* 9.0 y) z) (* a (* t -4.0))) c_m)
(if (<= t_1 5e+127)
(/ (fma 4.0 (* t a) (- (/ b z))) (- c_m))
(fma 9.0 (* x (/ 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 t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -2e+135) {
tmp = fma(x, ((9.0 * y) / z), (a * (t * -4.0))) / c_m;
} else if (t_1 <= 5e+127) {
tmp = fma(4.0, (t * a), -(b / z)) / -c_m;
} else {
tmp = fma(9.0, (x * (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) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -2e+135) tmp = Float64(fma(x, Float64(Float64(9.0 * y) / z), Float64(a * Float64(t * -4.0))) / c_m); elseif (t_1 <= 5e+127) tmp = Float64(fma(4.0, Float64(t * a), Float64(-Float64(b / z))) / Float64(-c_m)); else tmp = fma(9.0, Float64(x * 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_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+135], N[(N[(x * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, 5e+127], N[(N[(4.0 * N[(t * a), $MachinePrecision] + (-N[(b / z), $MachinePrecision])), $MachinePrecision] / (-c$95$m)), $MachinePrecision], N[(9.0 * N[(x * N[(y / N[(c$95$m * z), $MachinePrecision]), $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 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+135}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \frac{9 \cdot y}{z}, a \cdot \left(t \cdot -4\right)\right)}{c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+127}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4, t \cdot a, -\frac{b}{z}\right)}{-c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(9, x \cdot \frac{y}{c\_m \cdot z}, \frac{b}{c\_m \cdot z}\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.99999999999999992e135Initial program 66.3%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites70.5%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites73.5%
Taylor expanded in b around 0
Applied rewrites82.9%
if -1.99999999999999992e135 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000004e127Initial program 81.3%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites67.3%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites81.2%
Taylor expanded in x around 0
remove-double-negN/A
unsub-negN/A
distribute-neg-inN/A
+-commutativeN/A
associate-/l/N/A
sub-negN/A
associate-*r/N/A
div-subN/A
distribute-neg-frac2N/A
lower-/.f64N/A
sub-negN/A
lower-fma.f64N/A
lower-*.f64N/A
distribute-frac-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-neg.f6478.1
Applied rewrites78.1%
if 5.0000000000000004e127 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 84.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites79.0%
Taylor expanded in z around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6474.3
Applied rewrites74.3%
Taylor expanded in t around 0
lower-fma.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6492.1
Applied rewrites92.1%
Final simplification80.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 (* y (* x 9.0))))
(*
c_s
(if (<= t_1 -2e+63)
(/ (/ (fma x (* 9.0 y) b) c_m) z)
(if (<= t_1 1e+121)
(/ (fma 4.0 (* t a) (- (/ b z))) (- c_m))
(/ (fma y (* x 9.0) 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 = y * (x * 9.0);
double tmp;
if (t_1 <= -2e+63) {
tmp = (fma(x, (9.0 * y), b) / c_m) / z;
} else if (t_1 <= 1e+121) {
tmp = fma(4.0, (t * a), -(b / z)) / -c_m;
} else {
tmp = fma(y, (x * 9.0), 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(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -2e+63) tmp = Float64(Float64(fma(x, Float64(9.0 * y), b) / c_m) / z); elseif (t_1 <= 1e+121) tmp = Float64(fma(4.0, Float64(t * a), Float64(-Float64(b / z))) / Float64(-c_m)); else tmp = Float64(fma(y, Float64(x * 9.0), 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e+63], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e+121], N[(N[(4.0 * N[(t * a), $MachinePrecision] + (-N[(b / z), $MachinePrecision])), $MachinePrecision] / (-c$95$m)), $MachinePrecision], N[(N[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+63}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{+121}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4, t \cdot a, -\frac{b}{z}\right)}{-c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.00000000000000012e63Initial program 71.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
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6429.9
Applied rewrites29.9%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6469.8
Applied rewrites69.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6473.9
Applied rewrites73.9%
if -2.00000000000000012e63 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000004e121Initial program 80.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites68.4%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites83.3%
Taylor expanded in x around 0
remove-double-negN/A
unsub-negN/A
distribute-neg-inN/A
+-commutativeN/A
associate-/l/N/A
sub-negN/A
associate-*r/N/A
div-subN/A
distribute-neg-frac2N/A
lower-/.f64N/A
sub-negN/A
lower-fma.f64N/A
lower-*.f64N/A
distribute-frac-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-neg.f6478.6
Applied rewrites78.6%
if 1.00000000000000004e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 84.8%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6438.5
Applied rewrites38.5%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6485.0
Applied rewrites85.0%
Final simplification78.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 (* y (* x 9.0))))
(*
c_s
(if (<= t_1 -2e-18)
(/ (/ (fma x (* 9.0 y) b) c_m) z)
(if (<= t_1 2e+74)
(/ (fma (* a (* z -4.0)) t b) (* c_m z))
(/ (fma y (* x 9.0) 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 = y * (x * 9.0);
double tmp;
if (t_1 <= -2e-18) {
tmp = (fma(x, (9.0 * y), b) / c_m) / z;
} else if (t_1 <= 2e+74) {
tmp = fma((a * (z * -4.0)), t, b) / (c_m * z);
} else {
tmp = fma(y, (x * 9.0), 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(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -2e-18) tmp = Float64(Float64(fma(x, Float64(9.0 * y), b) / c_m) / z); elseif (t_1 <= 2e+74) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, b) / Float64(c_m * z)); else tmp = Float64(fma(y, Float64(x * 9.0), 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-18], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 2e+74], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / 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])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-18}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+74}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.0000000000000001e-18Initial 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
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6436.4
Applied rewrites36.4%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6468.3
Applied rewrites68.3%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6472.4
Applied rewrites72.4%
if -2.0000000000000001e-18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.9999999999999999e74Initial program 83.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6474.5
Applied rewrites74.5%
Applied rewrites73.8%
if 1.9999999999999999e74 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6440.5
Applied rewrites40.5%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6478.3
Applied rewrites78.3%
Final simplification74.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 (/ (fma y (* x 9.0) b) (* c_m z))) (t_2 (* y (* x 9.0))))
(*
c_s
(if (<= t_2 -2e-18)
t_1
(if (<= t_2 2e+74) (/ (fma (* a (* z -4.0)) t 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(y, (x * 9.0), b) / (c_m * z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -2e-18) {
tmp = t_1;
} else if (t_2 <= 2e+74) {
tmp = fma((a * (z * -4.0)), t, 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(y, Float64(x * 9.0), b) / Float64(c_m * z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -2e-18) tmp = t_1; elseif (t_2 <= 2e+74) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, 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[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -2e-18], t$95$1, If[LessEqual[t$95$2, 2e+74], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + 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(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{-18}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+74}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.0000000000000001e-18 or 1.9999999999999999e74 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 75.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
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6438.0
Applied rewrites38.0%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6472.3
Applied rewrites72.3%
if -2.0000000000000001e-18 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.9999999999999999e74Initial program 83.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6474.5
Applied rewrites74.5%
Applied rewrites73.8%
Final simplification73.1%
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 x (/ (* 9.0 y) z) (* a (* t -4.0))) c_m)))
(*
c_s
(if (<= z -1.95e+86)
t_1
(if (<= z 6.8e+174)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 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(x, ((9.0 * y) / z), (a * (t * -4.0))) / c_m;
double tmp;
if (z <= -1.95e+86) {
tmp = t_1;
} else if (z <= 6.8e+174) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * 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(x, Float64(Float64(9.0 * y) / z), Float64(a * Float64(t * -4.0))) / c_m) tmp = 0.0 if (z <= -1.95e+86) tmp = t_1; elseif (z <= 6.8e+174) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * 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[(x * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.95e+86], t$95$1, If[LessEqual[z, 6.8e+174], 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], 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(x, \frac{9 \cdot y}{z}, a \cdot \left(t \cdot -4\right)\right)}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.95 \cdot 10^{+86}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6.8 \cdot 10^{+174}:\\
\;\;\;\;\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{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.9500000000000001e86 or 6.8000000000000002e174 < z Initial program 56.1%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites54.4%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites83.1%
Taylor expanded in b around 0
Applied rewrites79.7%
if -1.9500000000000001e86 < z < 6.8000000000000002e174Initial program 90.0%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites91.3%
Final simplification87.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
(*
c_s
(if (<= z -7.5e+40)
(/ (fma x (/ (* 9.0 y) z) (* a (* t -4.0))) c_m)
(if (<= z 1.65e-14)
(/ (fma y (* x 9.0) b) (* c_m z))
(/ (fma 4.0 (* t a) (- (/ b 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 tmp;
if (z <= -7.5e+40) {
tmp = fma(x, ((9.0 * y) / z), (a * (t * -4.0))) / c_m;
} else if (z <= 1.65e-14) {
tmp = fma(y, (x * 9.0), b) / (c_m * z);
} else {
tmp = fma(4.0, (t * a), -(b / 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) tmp = 0.0 if (z <= -7.5e+40) tmp = Float64(fma(x, Float64(Float64(9.0 * y) / z), Float64(a * Float64(t * -4.0))) / c_m); elseif (z <= 1.65e-14) tmp = Float64(fma(y, Float64(x * 9.0), b) / Float64(c_m * z)); else tmp = Float64(fma(4.0, Float64(t * a), Float64(-Float64(b / z))) / Float64(-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_] := N[(c$95$s * If[LessEqual[z, -7.5e+40], N[(N[(x * N[(N[(9.0 * y), $MachinePrecision] / z), $MachinePrecision] + N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 1.65e-14], N[(N[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(4.0 * N[(t * a), $MachinePrecision] + (-N[(b / z), $MachinePrecision])), $MachinePrecision] / (-c$95$m)), $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}\;z \leq -7.5 \cdot 10^{+40}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \frac{9 \cdot y}{z}, a \cdot \left(t \cdot -4\right)\right)}{c\_m}\\
\mathbf{elif}\;z \leq 1.65 \cdot 10^{-14}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4, t \cdot a, -\frac{b}{z}\right)}{-c\_m}\\
\end{array}
\end{array}
if z < -7.4999999999999996e40Initial program 59.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites64.8%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites84.6%
Taylor expanded in b around 0
Applied rewrites76.8%
if -7.4999999999999996e40 < z < 1.6499999999999999e-14Initial program 94.6%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6464.3
Applied rewrites64.3%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6484.0
Applied rewrites84.0%
if 1.6499999999999999e-14 < z Initial program 69.3%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites61.5%
Taylor expanded in c around -inf
mul-1-negN/A
distribute-neg-frac2N/A
neg-mul-1N/A
lower-/.f64N/A
Applied rewrites85.6%
Taylor expanded in x around 0
remove-double-negN/A
unsub-negN/A
distribute-neg-inN/A
+-commutativeN/A
associate-/l/N/A
sub-negN/A
associate-*r/N/A
div-subN/A
distribute-neg-frac2N/A
lower-/.f64N/A
sub-negN/A
lower-fma.f64N/A
lower-*.f64N/A
distribute-frac-negN/A
lower-/.f64N/A
lower-neg.f64N/A
lower-neg.f6473.6
Applied rewrites73.6%
Final simplification79.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
(if (<= b -4.2e+105)
(/ (/ b c_m) z)
(if (<= b 1.08e-88)
(* t (/ (* a -4.0) c_m))
(if (<= b 9.2e+50)
(/ (* x (* 9.0 y)) (* c_m z))
(/ 1.0 (* z (/ c_m b))))))))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 (b <= -4.2e+105) {
tmp = (b / c_m) / z;
} else if (b <= 1.08e-88) {
tmp = t * ((a * -4.0) / c_m);
} else if (b <= 9.2e+50) {
tmp = (x * (9.0 * y)) / (c_m * z);
} else {
tmp = 1.0 / (z * (c_m / b));
}
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) :: tmp
if (b <= (-4.2d+105)) then
tmp = (b / c_m) / z
else if (b <= 1.08d-88) then
tmp = t * ((a * (-4.0d0)) / c_m)
else if (b <= 9.2d+50) then
tmp = (x * (9.0d0 * y)) / (c_m * z)
else
tmp = 1.0d0 / (z * (c_m / b))
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 tmp;
if (b <= -4.2e+105) {
tmp = (b / c_m) / z;
} else if (b <= 1.08e-88) {
tmp = t * ((a * -4.0) / c_m);
} else if (b <= 9.2e+50) {
tmp = (x * (9.0 * y)) / (c_m * z);
} else {
tmp = 1.0 / (z * (c_m / b));
}
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): tmp = 0 if b <= -4.2e+105: tmp = (b / c_m) / z elif b <= 1.08e-88: tmp = t * ((a * -4.0) / c_m) elif b <= 9.2e+50: tmp = (x * (9.0 * y)) / (c_m * z) else: tmp = 1.0 / (z * (c_m / b)) 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 (b <= -4.2e+105) tmp = Float64(Float64(b / c_m) / z); elseif (b <= 1.08e-88) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (b <= 9.2e+50) tmp = Float64(Float64(x * Float64(9.0 * y)) / Float64(c_m * z)); else tmp = Float64(1.0 / Float64(z * Float64(c_m / b))); 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)
tmp = 0.0;
if (b <= -4.2e+105)
tmp = (b / c_m) / z;
elseif (b <= 1.08e-88)
tmp = t * ((a * -4.0) / c_m);
elseif (b <= 9.2e+50)
tmp = (x * (9.0 * y)) / (c_m * z);
else
tmp = 1.0 / (z * (c_m / b));
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_] := N[(c$95$s * If[LessEqual[b, -4.2e+105], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[b, 1.08e-88], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9.2e+50], N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(z * N[(c$95$m / b), $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}\;b \leq -4.2 \cdot 10^{+105}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\mathbf{elif}\;b \leq 1.08 \cdot 10^{-88}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;b \leq 9.2 \cdot 10^{+50}:\\
\;\;\;\;\frac{x \cdot \left(9 \cdot y\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{z \cdot \frac{c\_m}{b}}\\
\end{array}
\end{array}
if b < -4.2000000000000002e105Initial program 83.1%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6472.5
Applied rewrites72.5%
Applied rewrites75.3%
if -4.2000000000000002e105 < b < 1.07999999999999995e-88Initial program 76.9%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6418.0
Applied rewrites18.0%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6451.2
Applied rewrites51.2%
Applied rewrites53.8%
if 1.07999999999999995e-88 < b < 9.19999999999999987e50Initial program 75.2%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6475.2
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied rewrites75.2%
Taylor expanded in x around inf
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6458.7
Applied rewrites58.7%
lift-/.f64N/A
lift-/.f64N/A
clear-numN/A
lower-/.f6458.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites58.7%
if 9.19999999999999987e50 < b Initial program 85.2%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6485.2
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied rewrites85.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites86.3%
Taylor expanded in b around inf
lower-/.f6469.6
Applied rewrites69.6%
Final simplification61.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 c_m) z)))
(*
c_s
(if (<= b -4.2e+105)
t_1
(if (<= b 1.08e-88)
(* t (/ (* a -4.0) c_m))
(if (<= b 9.2e+50) (/ (* x (* 9.0 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 = (b / c_m) / z;
double tmp;
if (b <= -4.2e+105) {
tmp = t_1;
} else if (b <= 1.08e-88) {
tmp = t * ((a * -4.0) / c_m);
} else if (b <= 9.2e+50) {
tmp = (x * (9.0 * y)) / (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 = (b / c_m) / z
if (b <= (-4.2d+105)) then
tmp = t_1
else if (b <= 1.08d-88) then
tmp = t * ((a * (-4.0d0)) / c_m)
else if (b <= 9.2d+50) then
tmp = (x * (9.0d0 * y)) / (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 = (b / c_m) / z;
double tmp;
if (b <= -4.2e+105) {
tmp = t_1;
} else if (b <= 1.08e-88) {
tmp = t * ((a * -4.0) / c_m);
} else if (b <= 9.2e+50) {
tmp = (x * (9.0 * y)) / (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 = (b / c_m) / z tmp = 0 if b <= -4.2e+105: tmp = t_1 elif b <= 1.08e-88: tmp = t * ((a * -4.0) / c_m) elif b <= 9.2e+50: tmp = (x * (9.0 * 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(Float64(b / c_m) / z) tmp = 0.0 if (b <= -4.2e+105) tmp = t_1; elseif (b <= 1.08e-88) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (b <= 9.2e+50) tmp = Float64(Float64(x * Float64(9.0 * y)) / 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 = (b / c_m) / z;
tmp = 0.0;
if (b <= -4.2e+105)
tmp = t_1;
elseif (b <= 1.08e-88)
tmp = t * ((a * -4.0) / c_m);
elseif (b <= 9.2e+50)
tmp = (x * (9.0 * y)) / (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[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision]}, N[(c$95$s * If[LessEqual[b, -4.2e+105], t$95$1, If[LessEqual[b, 1.08e-88], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9.2e+50], N[(N[(x * N[(9.0 * y), $MachinePrecision]), $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{\frac{b}{c\_m}}{z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;b \leq -4.2 \cdot 10^{+105}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 1.08 \cdot 10^{-88}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;b \leq 9.2 \cdot 10^{+50}:\\
\;\;\;\;\frac{x \cdot \left(9 \cdot y\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if b < -4.2000000000000002e105 or 9.19999999999999987e50 < b Initial program 84.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6469.1
Applied rewrites69.1%
Applied rewrites71.2%
if -4.2000000000000002e105 < b < 1.07999999999999995e-88Initial program 76.9%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6418.0
Applied rewrites18.0%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6451.2
Applied rewrites51.2%
Applied rewrites53.8%
if 1.07999999999999995e-88 < b < 9.19999999999999987e50Initial program 75.2%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6475.2
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied rewrites75.2%
Taylor expanded in x around inf
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6458.7
Applied rewrites58.7%
lift-/.f64N/A
lift-/.f64N/A
clear-numN/A
lower-/.f6458.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
Applied rewrites58.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
(*
c_s
(if (<= z -8e+53)
(* t (/ (* a -4.0) c_m))
(if (<= z 7.5e+116)
(/ (fma y (* x 9.0) b) (* c_m z))
(/ 1.0 (/ (* c_m -0.25) (* t a)))))))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 (z <= -8e+53) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 7.5e+116) {
tmp = fma(y, (x * 9.0), b) / (c_m * z);
} else {
tmp = 1.0 / ((c_m * -0.25) / (t * a));
}
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 (z <= -8e+53) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (z <= 7.5e+116) tmp = Float64(fma(y, Float64(x * 9.0), b) / Float64(c_m * z)); else tmp = Float64(1.0 / Float64(Float64(c_m * -0.25) / Float64(t * a))); 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[z, -8e+53], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.5e+116], N[(N[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(c$95$m * -0.25), $MachinePrecision] / N[(t * a), $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}\;z \leq -8 \cdot 10^{+53}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{+116}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{c\_m \cdot -0.25}{t \cdot a}}\\
\end{array}
\end{array}
if z < -7.9999999999999999e53Initial program 57.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6421.0
Applied rewrites21.0%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6459.7
Applied rewrites59.7%
Applied rewrites66.9%
if -7.9999999999999999e53 < z < 7.5e116Initial program 92.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6462.7
Applied rewrites62.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6479.5
Applied rewrites79.5%
if 7.5e116 < z Initial program 65.3%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6465.2
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
Applied rewrites65.2%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6459.5
Applied rewrites59.5%
Final simplification73.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
(*
c_s
(if (<= z -8e+53)
(* t (/ (* a -4.0) c_m))
(if (<= z 7.5e+116)
(/ (fma y (* x 9.0) b) (* c_m z))
(/ (* -4.0 (* t a)) 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 tmp;
if (z <= -8e+53) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 7.5e+116) {
tmp = fma(y, (x * 9.0), b) / (c_m * z);
} else {
tmp = (-4.0 * (t * a)) / 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) tmp = 0.0 if (z <= -8e+53) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (z <= 7.5e+116) tmp = Float64(fma(y, Float64(x * 9.0), b) / Float64(c_m * z)); else tmp = Float64(Float64(-4.0 * Float64(t * a)) / 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_] := N[(c$95$s * If[LessEqual[z, -8e+53], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.5e+116], N[(N[(y * N[(x * 9.0), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;z \leq -8 \cdot 10^{+53}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{+116}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y, x \cdot 9, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c\_m}\\
\end{array}
\end{array}
if z < -7.9999999999999999e53Initial program 57.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6421.0
Applied rewrites21.0%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6459.7
Applied rewrites59.7%
Applied rewrites66.9%
if -7.9999999999999999e53 < z < 7.5e116Initial program 92.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6462.7
Applied rewrites62.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6479.5
Applied rewrites79.5%
if 7.5e116 < z Initial program 65.3%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6459.4
Applied rewrites59.4%
Final simplification73.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
(*
c_s
(if (<= z -8e+53)
(* t (/ (* a -4.0) c_m))
(if (<= z 7.5e+116)
(/ (fma 9.0 (* x y) b) (* c_m z))
(/ (* -4.0 (* t a)) 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 tmp;
if (z <= -8e+53) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 7.5e+116) {
tmp = fma(9.0, (x * y), b) / (c_m * z);
} else {
tmp = (-4.0 * (t * a)) / 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) tmp = 0.0 if (z <= -8e+53) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (z <= 7.5e+116) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(c_m * z)); else tmp = Float64(Float64(-4.0 * Float64(t * a)) / 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_] := N[(c$95$s * If[LessEqual[z, -8e+53], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.5e+116], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;z \leq -8 \cdot 10^{+53}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{+116}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c\_m}\\
\end{array}
\end{array}
if z < -7.9999999999999999e53Initial program 57.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6421.0
Applied rewrites21.0%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6459.7
Applied rewrites59.7%
Applied rewrites66.9%
if -7.9999999999999999e53 < z < 7.5e116Initial program 92.3%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6479.4
Applied rewrites79.4%
if 7.5e116 < z Initial program 65.3%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6459.4
Applied rewrites59.4%
Final simplification73.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
(*
c_s
(if (<= z -4.2e-41)
(* t (/ (* a -4.0) c_m))
(if (<= z 5.7e-12) (/ (/ b c_m) z) (/ (* -4.0 (* t a)) 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 tmp;
if (z <= -4.2e-41) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 5.7e-12) {
tmp = (b / c_m) / z;
} else {
tmp = (-4.0 * (t * a)) / c_m;
}
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) :: tmp
if (z <= (-4.2d-41)) then
tmp = t * ((a * (-4.0d0)) / c_m)
else if (z <= 5.7d-12) then
tmp = (b / c_m) / z
else
tmp = ((-4.0d0) * (t * a)) / c_m
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 tmp;
if (z <= -4.2e-41) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 5.7e-12) {
tmp = (b / c_m) / z;
} else {
tmp = (-4.0 * (t * a)) / c_m;
}
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): tmp = 0 if z <= -4.2e-41: tmp = t * ((a * -4.0) / c_m) elif z <= 5.7e-12: tmp = (b / c_m) / z else: tmp = (-4.0 * (t * a)) / 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) tmp = 0.0 if (z <= -4.2e-41) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (z <= 5.7e-12) tmp = Float64(Float64(b / c_m) / z); else tmp = Float64(Float64(-4.0 * Float64(t * a)) / c_m); 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)
tmp = 0.0;
if (z <= -4.2e-41)
tmp = t * ((a * -4.0) / c_m);
elseif (z <= 5.7e-12)
tmp = (b / c_m) / z;
else
tmp = (-4.0 * (t * a)) / c_m;
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_] := N[(c$95$s * If[LessEqual[z, -4.2e-41], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.7e-12], N[(N[(b / c$95$m), $MachinePrecision] / z), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;z \leq -4.2 \cdot 10^{-41}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 5.7 \cdot 10^{-12}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c\_m}\\
\end{array}
\end{array}
if z < -4.20000000000000025e-41Initial program 62.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6420.6
Applied rewrites20.6%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
Applied rewrites59.7%
if -4.20000000000000025e-41 < z < 5.7000000000000003e-12Initial program 97.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6456.6
Applied rewrites56.6%
Applied rewrites57.4%
if 5.7000000000000003e-12 < z Initial program 69.3%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6453.0
Applied rewrites53.0%
Final simplification57.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
(*
c_s
(if (<= z -4.2e-41)
(* t (/ (* a -4.0) c_m))
(if (<= z 5.7e-12) (/ b (* c_m z)) (/ (* -4.0 (* t a)) 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 tmp;
if (z <= -4.2e-41) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 5.7e-12) {
tmp = b / (c_m * z);
} else {
tmp = (-4.0 * (t * a)) / c_m;
}
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) :: tmp
if (z <= (-4.2d-41)) then
tmp = t * ((a * (-4.0d0)) / c_m)
else if (z <= 5.7d-12) then
tmp = b / (c_m * z)
else
tmp = ((-4.0d0) * (t * a)) / c_m
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 tmp;
if (z <= -4.2e-41) {
tmp = t * ((a * -4.0) / c_m);
} else if (z <= 5.7e-12) {
tmp = b / (c_m * z);
} else {
tmp = (-4.0 * (t * a)) / c_m;
}
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): tmp = 0 if z <= -4.2e-41: tmp = t * ((a * -4.0) / c_m) elif z <= 5.7e-12: tmp = b / (c_m * z) else: tmp = (-4.0 * (t * a)) / 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) tmp = 0.0 if (z <= -4.2e-41) tmp = Float64(t * Float64(Float64(a * -4.0) / c_m)); elseif (z <= 5.7e-12) tmp = Float64(b / Float64(c_m * z)); else tmp = Float64(Float64(-4.0 * Float64(t * a)) / c_m); 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)
tmp = 0.0;
if (z <= -4.2e-41)
tmp = t * ((a * -4.0) / c_m);
elseif (z <= 5.7e-12)
tmp = b / (c_m * z);
else
tmp = (-4.0 * (t * a)) / c_m;
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_] := N[(c$95$s * If[LessEqual[z, -4.2e-41], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.7e-12], N[(b / N[(c$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;z \leq -4.2 \cdot 10^{-41}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 5.7 \cdot 10^{-12}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c\_m}\\
\end{array}
\end{array}
if z < -4.20000000000000025e-41Initial program 62.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6420.6
Applied rewrites20.6%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6450.4
Applied rewrites50.4%
Applied rewrites59.7%
if -4.20000000000000025e-41 < z < 5.7000000000000003e-12Initial program 97.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6456.6
Applied rewrites56.6%
if 5.7000000000000003e-12 < z Initial program 69.3%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6453.0
Applied rewrites53.0%
Final simplification56.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 (* t (/ (* a -4.0) c_m)))) (* c_s (if (<= z -4.2e-41) t_1 (if (<= z 2.05e-12) (/ 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 <= -4.2e-41) {
tmp = t_1;
} else if (z <= 2.05e-12) {
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 <= (-4.2d-41)) then
tmp = t_1
else if (z <= 2.05d-12) 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 <= -4.2e-41) {
tmp = t_1;
} else if (z <= 2.05e-12) {
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 <= -4.2e-41: tmp = t_1 elif z <= 2.05e-12: 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 <= -4.2e-41) tmp = t_1; elseif (z <= 2.05e-12) 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 <= -4.2e-41)
tmp = t_1;
elseif (z <= 2.05e-12)
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, -4.2e-41], t$95$1, If[LessEqual[z, 2.05e-12], 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 -4.2 \cdot 10^{-41}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.05 \cdot 10^{-12}:\\
\;\;\;\;\frac{b}{c\_m \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -4.20000000000000025e-41 or 2.04999999999999995e-12 < z Initial program 65.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6421.3
Applied rewrites21.3%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6451.6
Applied rewrites51.6%
Applied rewrites56.6%
if -4.20000000000000025e-41 < z < 2.04999999999999995e-12Initial program 97.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6456.6
Applied rewrites56.6%
Final simplification56.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 79.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6436.8
Applied rewrites36.8%
Final simplification36.8%
(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 2024221
(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)))