
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (fma (* (/ a c_m) -4.0) t (/ b (* z c_m)))))
(*
c_s
(if (<= c_m 4e-19)
(/ (/ -1.0 c_m) (/ (- z) (fma (* y 9.0) x (fma (* -4.0 (* a t)) z b))))
(if (<= c_m 5.3e+181)
(fma (* (/ y (* z c_m)) 9.0) x t_1)
(* (fma (/ x z) (/ 9.0 c_m) (/ t_1 y)) y))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double t_1 = fma(((a / c_m) * -4.0), t, (b / (z * c_m)));
double tmp;
if (c_m <= 4e-19) {
tmp = (-1.0 / c_m) / (-z / fma((y * 9.0), x, fma((-4.0 * (a * t)), z, b)));
} else if (c_m <= 5.3e+181) {
tmp = fma(((y / (z * c_m)) * 9.0), x, t_1);
} else {
tmp = fma((x / z), (9.0 / c_m), (t_1 / y)) * y;
}
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]) 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 = fma(Float64(Float64(a / c_m) * -4.0), t, Float64(b / Float64(z * c_m))) tmp = 0.0 if (c_m <= 4e-19) tmp = Float64(Float64(-1.0 / c_m) / Float64(Float64(-z) / fma(Float64(y * 9.0), x, fma(Float64(-4.0 * Float64(a * t)), z, b)))); elseif (c_m <= 5.3e+181) tmp = fma(Float64(Float64(y / Float64(z * c_m)) * 9.0), x, t_1); else tmp = Float64(fma(Float64(x / z), Float64(9.0 / c_m), Float64(t_1 / y)) * y); 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.
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[(N[(a / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * t + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[c$95$m, 4e-19], N[(N[(-1.0 / c$95$m), $MachinePrecision] / N[((-z) / N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] * z + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c$95$m, 5.3e+181], N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x + t$95$1), $MachinePrecision], N[(N[(N[(x / z), $MachinePrecision] * N[(9.0 / c$95$m), $MachinePrecision] + N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision] * y), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{a}{c\_m} \cdot -4, t, \frac{b}{z \cdot c\_m}\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;c\_m \leq 4 \cdot 10^{-19}:\\
\;\;\;\;\frac{\frac{-1}{c\_m}}{\frac{-z}{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(-4 \cdot \left(a \cdot t\right), z, b\right)\right)}}\\
\mathbf{elif}\;c\_m \leq 5.3 \cdot 10^{+181}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{z \cdot c\_m} \cdot 9, x, t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{z}, \frac{9}{c\_m}, \frac{t\_1}{y}\right) \cdot y\\
\end{array}
\end{array}
\end{array}
if c < 3.9999999999999999e-19Initial program 80.1%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg87.5
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites91.0%
if 3.9999999999999999e-19 < c < 5.2999999999999996e181Initial program 70.9%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites94.9%
if 5.2999999999999996e181 < c Initial program 49.9%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
Applied rewrites80.5%
Final simplification90.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* -4.0 (* a t))))
(*
c_s
(if (<=
(/ (+ (- (* (* x 9.0) y) (* (* (* 4.0 z) t) a)) b) (* z c_m))
1e+290)
(/ (/ -1.0 c_m) (/ (- z) (fma (* y 9.0) x (fma t_1 z b))))
(/ (fma (* (/ x z) y) 9.0 t_1) 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);
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 = -4.0 * (a * t);
double tmp;
if ((((((x * 9.0) * y) - (((4.0 * z) * t) * a)) + b) / (z * c_m)) <= 1e+290) {
tmp = (-1.0 / c_m) / (-z / fma((y * 9.0), x, fma(t_1, z, b)));
} else {
tmp = fma(((x / z) * y), 9.0, t_1) / 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]) 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(-4.0 * Float64(a * t)) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(z * c_m)) <= 1e+290) tmp = Float64(Float64(-1.0 / c_m) / Float64(Float64(-z) / fma(Float64(y * 9.0), x, fma(t_1, z, b)))); else tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, t_1) / 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.
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[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], 1e+290], N[(N[(-1.0 / c$95$m), $MachinePrecision] / N[((-z) / N[(N[(y * 9.0), $MachinePrecision] * x + N[(t$95$1 * z + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + t$95$1), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(a \cdot t\right)\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{z \cdot c\_m} \leq 10^{+290}:\\
\;\;\;\;\frac{\frac{-1}{c\_m}}{\frac{-z}{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(t\_1, z, b\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, t\_1\right)}{c\_m}\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 1.00000000000000006e290Initial program 84.6%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites86.3%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg87.4
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites93.7%
if 1.00000000000000006e290 < (/.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 51.8%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6448.7
Applied rewrites48.7%
Taylor expanded in a around inf
Applied rewrites52.3%
Taylor expanded in a around 0
Applied rewrites76.3%
Applied rewrites81.5%
Final simplification90.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 z) -9.0 (/ (fma (* -4.0 a) t (/ b z)) (- y))) y)
(/ -1.0 c_m))))
(*
c_s
(if (<= z -90000000.0)
t_1
(if (<= z 3e-5)
(/ (+ (- (* (* x 9.0) y) (* (* (* 4.0 z) t) a)) b) (* z c_m))
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);
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 / z), -9.0, (fma((-4.0 * a), t, (b / z)) / -y)) * y) * (-1.0 / c_m);
double tmp;
if (z <= -90000000.0) {
tmp = t_1;
} else if (z <= 3e-5) {
tmp = ((((x * 9.0) * y) - (((4.0 * z) * t) * a)) + b) / (z * c_m);
} 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]) 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(fma(Float64(x / z), -9.0, Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / Float64(-y))) * y) * Float64(-1.0 / c_m)) tmp = 0.0 if (z <= -90000000.0) tmp = t_1; elseif (z <= 3e-5) tmp = Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(z * c_m)); 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.
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[(N[(N[(x / z), $MachinePrecision] * -9.0 + N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / (-y)), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] * N[(-1.0 / c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -90000000.0], t$95$1, If[LessEqual[z, 3e-5], N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c$95$m), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(\mathsf{fma}\left(\frac{x}{z}, -9, \frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{-y}\right) \cdot y\right) \cdot \frac{-1}{c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -90000000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 3 \cdot 10^{-5}:\\
\;\;\;\;\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -9e7 or 3.00000000000000008e-5 < z Initial program 57.9%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites72.3%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
mul-1-negN/A
lower-neg.f6488.3
Applied rewrites88.3%
if -9e7 < z < 3.00000000000000008e-5Initial program 96.8%
Final simplification92.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.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (/ (fma (* x y) 9.0 b) z) c_m)
(if (<= t_1 1e+54)
(/ (fma (* -4.0 a) t (/ b z)) c_m)
(/ (fma (* (/ x z) y) 9.0 (* -4.0 (* a 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);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = (fma((x * y), 9.0, b) / z) / c_m;
} else if (t_1 <= 1e+54) {
tmp = fma((-4.0 * a), t, (b / z)) / c_m;
} else {
tmp = fma(((x / z) * y), 9.0, (-4.0 * (a * 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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(Float64(fma(Float64(x * y), 9.0, b) / z) / c_m); elseif (t_1 <= 1e+54) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); else tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(-4.0 * Float64(a * 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, 1e+54], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(-4.0 * N[(a * t), $MachinePrecision]), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq 10^{+54}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, -4 \cdot \left(a \cdot t\right)\right)}{c\_m}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6466.1
Applied rewrites66.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.3
Applied rewrites75.3%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.0000000000000001e54Initial program 79.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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites76.4%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6490.8
Applied rewrites90.8%
if 1.0000000000000001e54 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.4%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
Applied rewrites67.2%
Taylor expanded in a around inf
Applied rewrites28.5%
Taylor expanded in a around 0
Applied rewrites78.4%
Applied rewrites83.0%
Final simplification85.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.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (/ (fma (* x y) 9.0 b) z) c_m)
(if (<= t_1 1e+54)
(/ (fma (* -4.0 a) t (/ b z)) c_m)
(/ (fma (* a t) -4.0 (* (/ (* x y) z) 9.0)) 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);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = (fma((x * y), 9.0, b) / z) / c_m;
} else if (t_1 <= 1e+54) {
tmp = fma((-4.0 * a), t, (b / z)) / c_m;
} else {
tmp = fma((a * t), -4.0, (((x * y) / z) * 9.0)) / 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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(Float64(fma(Float64(x * y), 9.0, b) / z) / c_m); elseif (t_1 <= 1e+54) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); else tmp = Float64(fma(Float64(a * t), -4.0, Float64(Float64(Float64(x * y) / z) * 9.0)) / 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, 1e+54], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] * 9.0), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq 10^{+54}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \frac{x \cdot y}{z} \cdot 9\right)}{c\_m}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6466.1
Applied rewrites66.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.3
Applied rewrites75.3%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.0000000000000001e54Initial program 79.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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites76.4%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6490.8
Applied rewrites90.8%
if 1.0000000000000001e54 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.4%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
Applied rewrites67.2%
Taylor expanded in a around 0
Applied rewrites78.4%
Final simplification84.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.
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 4e-19)
(/ (/ -1.0 c_m) (/ (- z) (fma (* y 9.0) x (fma (* -4.0 (* a t)) z b))))
(fma
(* (/ y (* z c_m)) 9.0)
x
(fma (* (/ a c_m) -4.0) t (/ 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);
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 <= 4e-19) {
tmp = (-1.0 / c_m) / (-z / fma((y * 9.0), x, fma((-4.0 * (a * t)), z, b)));
} else {
tmp = fma(((y / (z * c_m)) * 9.0), x, fma(((a / c_m) * -4.0), t, (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]) 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 <= 4e-19) tmp = Float64(Float64(-1.0 / c_m) / Float64(Float64(-z) / fma(Float64(y * 9.0), x, fma(Float64(-4.0 * Float64(a * t)), z, b)))); else tmp = fma(Float64(Float64(y / Float64(z * c_m)) * 9.0), x, fma(Float64(Float64(a / c_m) * -4.0), t, Float64(b / Float64(z * c_m)))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, 4e-19], N[(N[(-1.0 / c$95$m), $MachinePrecision] / N[((-z) / N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] * z + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x + N[(N[(N[(a / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision] * t + N[(b / N[(z * 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])\\\\
[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 4 \cdot 10^{-19}:\\
\;\;\;\;\frac{\frac{-1}{c\_m}}{\frac{-z}{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(-4 \cdot \left(a \cdot t\right), z, b\right)\right)}}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{y}{z \cdot c\_m} \cdot 9, x, \mathsf{fma}\left(\frac{a}{c\_m} \cdot -4, t, \frac{b}{z \cdot c\_m}\right)\right)\\
\end{array}
\end{array}
if c < 3.9999999999999999e-19Initial program 80.1%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites87.3%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg87.5
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites91.0%
if 3.9999999999999999e-19 < c Initial program 62.1%
Taylor expanded in b around 0
associate--l+N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*l/N/A
associate-*l*N/A
lower-fma.f64N/A
Applied rewrites87.1%
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.
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 -2.15e+170)
(/ (fma (* (/ x z) y) 9.0 (* -4.0 (* a t))) c_m)
(if (<= z -1e-37)
(/ (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) z) c_m)
(if (<= z 2.2e+154)
(/ (+ (- (* (* x 9.0) y) (* (* (* 4.0 z) t) a)) b) (* z c_m))
(/ (fma (* -4.0 a) t (/ 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);
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 <= -2.15e+170) {
tmp = fma(((x / z) * y), 9.0, (-4.0 * (a * t))) / c_m;
} else if (z <= -1e-37) {
tmp = (fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / z) / c_m;
} else if (z <= 2.2e+154) {
tmp = ((((x * 9.0) * y) - (((4.0 * z) * t) * a)) + b) / (z * c_m);
} else {
tmp = fma((-4.0 * a), t, (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]) 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 <= -2.15e+170) tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(-4.0 * Float64(a * t))) / c_m); elseif (z <= -1e-37) tmp = Float64(Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / z) / c_m); elseif (z <= 2.2e+154) tmp = Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(z * c_m)); else tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, -2.15e+170], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, -1e-37], N[(N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 2.2e+154], N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + 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])\\\\
[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 -2.15 \cdot 10^{+170}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, -4 \cdot \left(a \cdot t\right)\right)}{c\_m}\\
\mathbf{elif}\;z \leq -1 \cdot 10^{-37}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{+154}:\\
\;\;\;\;\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\end{array}
\end{array}
if z < -2.1499999999999999e170Initial program 22.5%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6438.2
Applied rewrites38.2%
Taylor expanded in a around inf
Applied rewrites56.6%
Taylor expanded in a around 0
Applied rewrites72.2%
Applied rewrites81.1%
if -2.1499999999999999e170 < z < -1.00000000000000007e-37Initial program 75.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites90.8%
if -1.00000000000000007e-37 < z < 2.2000000000000001e154Initial program 94.8%
if 2.2000000000000001e154 < z Initial program 42.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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites61.0%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.8
Applied rewrites86.8%
Final simplification91.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (/ (fma (* x y) 9.0 b) z) c_m)
(if (<= t_1 5e+145)
(/ (fma (* -4.0 a) t (/ b z)) c_m)
(* (/ y z) (* (/ 9.0 c_m) x)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = (fma((x * y), 9.0, b) / z) / c_m;
} else if (t_1 <= 5e+145) {
tmp = fma((-4.0 * a), t, (b / z)) / c_m;
} else {
tmp = (y / z) * ((9.0 / c_m) * x);
}
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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(Float64(fma(Float64(x * y), 9.0, b) / z) / c_m); elseif (t_1 <= 5e+145) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); else tmp = Float64(Float64(y / z) * Float64(Float64(9.0 / c_m) * x)); 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, 5e+145], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 / c$95$m), $MachinePrecision] * x), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{z} \cdot \left(\frac{9}{c\_m} \cdot x\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6466.1
Applied rewrites66.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6475.3
Applied rewrites75.3%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999967e145Initial program 78.5%
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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites75.4%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.6
Applied rewrites86.6%
if 4.99999999999999967e145 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.0%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites70.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg70.6
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites78.7%
Taylor expanded in y around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
Applied rewrites78.7%
Final simplification83.2%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (/ (fma (* x y) 9.0 b) c_m) z)
(if (<= t_1 5e+145)
(/ (fma (* -4.0 a) t (/ b z)) c_m)
(* (/ y z) (* (/ 9.0 c_m) x)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = (fma((x * y), 9.0, b) / c_m) / z;
} else if (t_1 <= 5e+145) {
tmp = fma((-4.0 * a), t, (b / z)) / c_m;
} else {
tmp = (y / z) * ((9.0 / c_m) * x);
}
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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(Float64(fma(Float64(x * y), 9.0, b) / c_m) / z); elseif (t_1 <= 5e+145) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); else tmp = Float64(Float64(y / z) * Float64(Float64(9.0 / c_m) * x)); 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+145], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 / c$95$m), $MachinePrecision] * x), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{z} \cdot \left(\frac{9}{c\_m} \cdot x\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6469.8
Applied rewrites69.8%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999967e145Initial program 78.5%
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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites75.4%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.6
Applied rewrites86.6%
if 4.99999999999999967e145 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.0%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites70.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg70.6
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites78.7%
Taylor expanded in y around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
Applied rewrites78.7%
Final simplification82.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.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (fma (* x 9.0) y b) (* z c_m))
(if (<= t_1 5e+145)
(/ (fma (* -4.0 a) t (/ b z)) c_m)
(* (/ y z) (* (/ 9.0 c_m) x)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = fma((x * 9.0), y, b) / (z * c_m);
} else if (t_1 <= 5e+145) {
tmp = fma((-4.0 * a), t, (b / z)) / c_m;
} else {
tmp = (y / z) * ((9.0 / c_m) * x);
}
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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(z * c_m)); elseif (t_1 <= 5e+145) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); else tmp = Float64(Float64(y / z) * Float64(Float64(9.0 / c_m) * x)); 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+145], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 / c$95$m), $MachinePrecision] * x), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+145}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{z} \cdot \left(\frac{9}{c\_m} \cdot x\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6466.1
Applied rewrites66.1%
Applied rewrites66.1%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999967e145Initial program 78.5%
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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites75.4%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.6
Applied rewrites86.6%
if 4.99999999999999967e145 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.0%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites70.6%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg70.6
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites78.7%
Taylor expanded in y around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
Applied rewrites78.7%
Final simplification81.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* (* x 9.0) y)))
(*
c_s
(if (<= t_1 -1e+31)
(/ (fma (* x 9.0) y b) (* z c_m))
(if (<= t_1 2e+135)
(/ (fma (* -4.0 (* a t)) z b) (* z c_m))
(* (/ y z) (* (/ 9.0 c_m) x)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 = (x * 9.0) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = fma((x * 9.0), y, b) / (z * c_m);
} else if (t_1 <= 2e+135) {
tmp = fma((-4.0 * (a * t)), z, b) / (z * c_m);
} else {
tmp = (y / z) * ((9.0 / c_m) * x);
}
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]) 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(x * 9.0) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(z * c_m)); elseif (t_1 <= 2e+135) tmp = Float64(fma(Float64(-4.0 * Float64(a * t)), z, b) / Float64(z * c_m)); else tmp = Float64(Float64(y / z) * Float64(Float64(9.0 / c_m) * x)); 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.
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 * 9.0), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+135], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] * z + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * N[(N[(9.0 / c$95$m), $MachinePrecision] * x), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+135}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot \left(a \cdot t\right), z, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{z} \cdot \left(\frac{9}{c\_m} \cdot x\right)\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6466.1
Applied rewrites66.1%
Applied rewrites66.1%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999992e135Initial program 79.2%
Taylor expanded in y around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6472.6
Applied rewrites72.6%
if 1.99999999999999992e135 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 62.7%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites68.7%
lift-*.f64N/A
lift-/.f64N/A
clear-numN/A
un-div-invN/A
lower-/.f64N/A
frac-2negN/A
lower-/.f64N/A
lower-neg.f64N/A
lift-neg.f64N/A
remove-double-neg68.7
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-+l+N/A
Applied rewrites76.0%
Taylor expanded in y around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6475.8
Applied rewrites75.8%
Applied rewrites75.9%
Final simplification71.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.
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 -9.4e-13)
(/ (fma (* (/ x z) y) 9.0 (* -4.0 (* a t))) c_m)
(if (<= z 2.2e+154)
(/ (+ (- (* (* x 9.0) y) (* (* (* 4.0 z) t) a)) b) (* z c_m))
(/ (fma (* -4.0 a) t (/ 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);
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 <= -9.4e-13) {
tmp = fma(((x / z) * y), 9.0, (-4.0 * (a * t))) / c_m;
} else if (z <= 2.2e+154) {
tmp = ((((x * 9.0) * y) - (((4.0 * z) * t) * a)) + b) / (z * c_m);
} else {
tmp = fma((-4.0 * a), t, (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]) 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 <= -9.4e-13) tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(-4.0 * Float64(a * t))) / c_m); elseif (z <= 2.2e+154) tmp = Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(z * c_m)); else tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, -9.4e-13], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 2.2e+154], N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + 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])\\\\
[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 -9.4 \cdot 10^{-13}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, -4 \cdot \left(a \cdot t\right)\right)}{c\_m}\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{+154}:\\
\;\;\;\;\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\end{array}
\end{array}
if z < -9.4000000000000003e-13Initial program 49.5%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.9
Applied rewrites58.9%
Taylor expanded in a around inf
Applied rewrites56.8%
Taylor expanded in a around 0
Applied rewrites75.9%
Applied rewrites80.0%
if -9.4000000000000003e-13 < z < 2.2000000000000001e154Initial program 94.9%
if 2.2000000000000001e154 < z Initial program 42.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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites61.0%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.8
Applied rewrites86.8%
Final simplification89.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.
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 -0.059)
(/ (fma (* (/ x z) y) 9.0 (* -4.0 (* a t))) c_m)
(if (<= z 4e+154)
(/ (fma (* x 9.0) y (fma (* (* -4.0 z) a) t b)) (* z c_m))
(/ (fma (* -4.0 a) t (/ 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);
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 <= -0.059) {
tmp = fma(((x / z) * y), 9.0, (-4.0 * (a * t))) / c_m;
} else if (z <= 4e+154) {
tmp = fma((x * 9.0), y, fma(((-4.0 * z) * a), t, b)) / (z * c_m);
} else {
tmp = fma((-4.0 * a), t, (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]) 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 <= -0.059) tmp = Float64(fma(Float64(Float64(x / z) * y), 9.0, Float64(-4.0 * Float64(a * t))) / c_m); elseif (z <= 4e+154) tmp = Float64(fma(Float64(x * 9.0), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c_m)); else tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c_m); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, -0.059], N[(N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 4e+154], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + 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])\\\\
[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 -0.059:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot y, 9, -4 \cdot \left(a \cdot t\right)\right)}{c\_m}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{+154}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c\_m}\\
\end{array}
\end{array}
if z < -0.058999999999999997Initial program 48.7%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.3
Applied rewrites58.3%
Taylor expanded in a around inf
Applied rewrites56.1%
Taylor expanded in a around 0
Applied rewrites75.5%
Applied rewrites79.7%
if -0.058999999999999997 < z < 4.00000000000000015e154Initial program 95.0%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/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
Applied rewrites92.6%
if 4.00000000000000015e154 < z Initial program 42.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
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites61.0%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
associate-*r*N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6486.8
Applied rewrites86.8%
Final simplification88.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= a -0.0045)
(* (/ (* a t) c_m) -4.0)
(if (<= a 1.7e+68)
(/ (fma (* x y) 9.0 b) (* z c_m))
(/ (* -4.0 (* a 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);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (a <= -0.0045) {
tmp = ((a * t) / c_m) * -4.0;
} else if (a <= 1.7e+68) {
tmp = fma((x * y), 9.0, b) / (z * c_m);
} else {
tmp = (-4.0 * (a * 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]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (a <= -0.0045) tmp = Float64(Float64(Float64(a * t) / c_m) * -4.0); elseif (a <= 1.7e+68) tmp = Float64(fma(Float64(x * y), 9.0, b) / Float64(z * c_m)); else tmp = Float64(Float64(-4.0 * Float64(a * 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.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[a, -0.0045], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[a, 1.7e+68], N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(a * t), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -0.0045:\\
\;\;\;\;\frac{a \cdot t}{c\_m} \cdot -4\\
\mathbf{elif}\;a \leq 1.7 \cdot 10^{+68}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c\_m}\\
\end{array}
\end{array}
if a < -0.00449999999999999966Initial program 79.2%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.4
Applied rewrites68.4%
if -0.00449999999999999966 < a < 1.70000000000000008e68Initial program 76.9%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6470.8
Applied rewrites70.8%
if 1.70000000000000008e68 < a Initial program 66.4%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
Taylor expanded in a around inf
Applied rewrites60.3%
Final simplification68.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.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(*
c_s
(if (<= a -0.0045)
(* (/ (* a t) c_m) -4.0)
(if (<= a 1.7e+68)
(/ (fma (* x 9.0) y b) (* z c_m))
(/ (* -4.0 (* a 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);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
double code(double c_s, double x, double y, double z, double t, double a, double b, double c_m) {
double tmp;
if (a <= -0.0045) {
tmp = ((a * t) / c_m) * -4.0;
} else if (a <= 1.7e+68) {
tmp = fma((x * 9.0), y, b) / (z * c_m);
} else {
tmp = (-4.0 * (a * 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]) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) function code(c_s, x, y, z, t, a, b, c_m) tmp = 0.0 if (a <= -0.0045) tmp = Float64(Float64(Float64(a * t) / c_m) * -4.0); elseif (a <= 1.7e+68) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(z * c_m)); else tmp = Float64(Float64(-4.0 * Float64(a * 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.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[a, -0.0045], N[(N[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[a, 1.7e+68], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(a * t), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;a \leq -0.0045:\\
\;\;\;\;\frac{a \cdot t}{c\_m} \cdot -4\\
\mathbf{elif}\;a \leq 1.7 \cdot 10^{+68}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c\_m}\\
\end{array}
\end{array}
if a < -0.00449999999999999966Initial program 79.2%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.4
Applied rewrites68.4%
if -0.00449999999999999966 < a < 1.70000000000000008e68Initial program 76.9%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6470.8
Applied rewrites70.8%
Applied rewrites70.8%
if 1.70000000000000008e68 < a Initial program 66.4%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
Taylor expanded in a around inf
Applied rewrites60.3%
Final simplification68.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.
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 -6.5e+102)
(/ b (* z c_m))
(if (<= b 5e+15) (/ (* -4.0 (* a t)) c_m) (/ 1.0 (* (/ c_m b) 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);
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 <= -6.5e+102) {
tmp = b / (z * c_m);
} else if (b <= 5e+15) {
tmp = (-4.0 * (a * t)) / c_m;
} else {
tmp = 1.0 / ((c_m / b) * z);
}
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.
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 <= (-6.5d+102)) then
tmp = b / (z * c_m)
else if (b <= 5d+15) then
tmp = ((-4.0d0) * (a * t)) / c_m
else
tmp = 1.0d0 / ((c_m / b) * z)
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;
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 <= -6.5e+102) {
tmp = b / (z * c_m);
} else if (b <= 5e+15) {
tmp = (-4.0 * (a * t)) / c_m;
} else {
tmp = 1.0 / ((c_m / b) * z);
}
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]) [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 <= -6.5e+102: tmp = b / (z * c_m) elif b <= 5e+15: tmp = (-4.0 * (a * t)) / c_m else: tmp = 1.0 / ((c_m / b) * 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]) 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 <= -6.5e+102) tmp = Float64(b / Float64(z * c_m)); elseif (b <= 5e+15) tmp = Float64(Float64(-4.0 * Float64(a * t)) / c_m); else tmp = Float64(1.0 / Float64(Float64(c_m / b) * z)); 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])){:}
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 <= -6.5e+102)
tmp = b / (z * c_m);
elseif (b <= 5e+15)
tmp = (-4.0 * (a * t)) / c_m;
else
tmp = 1.0 / ((c_m / b) * z);
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.
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, -6.5e+102], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5e+15], N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(1.0 / N[(N[(c$95$m / b), $MachinePrecision] * 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])\\\\
[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 -6.5 \cdot 10^{+102}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{elif}\;b \leq 5 \cdot 10^{+15}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{c\_m}{b} \cdot z}\\
\end{array}
\end{array}
if b < -6.5000000000000004e102Initial program 76.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6457.1
Applied rewrites57.1%
if -6.5000000000000004e102 < b < 5e15Initial program 74.3%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6470.6
Applied rewrites70.6%
Taylor expanded in a around inf
Applied rewrites55.7%
if 5e15 < b Initial program 77.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6454.6
Applied rewrites54.6%
Applied rewrites62.1%
Applied rewrites62.2%
Final simplification57.4%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 -6.5e+102)
(/ b (* z c_m))
(if (<= b 5e+15) (/ (* -4.0 (* a t)) c_m) (/ (/ b c_m) z)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 <= -6.5e+102) {
tmp = b / (z * c_m);
} else if (b <= 5e+15) {
tmp = (-4.0 * (a * t)) / c_m;
} else {
tmp = (b / c_m) / z;
}
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.
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 <= (-6.5d+102)) then
tmp = b / (z * c_m)
else if (b <= 5d+15) then
tmp = ((-4.0d0) * (a * t)) / c_m
else
tmp = (b / c_m) / z
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;
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 <= -6.5e+102) {
tmp = b / (z * c_m);
} else if (b <= 5e+15) {
tmp = (-4.0 * (a * t)) / c_m;
} else {
tmp = (b / c_m) / z;
}
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]) [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 <= -6.5e+102: tmp = b / (z * c_m) elif b <= 5e+15: tmp = (-4.0 * (a * t)) / c_m else: tmp = (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]) 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 <= -6.5e+102) tmp = Float64(b / Float64(z * c_m)); elseif (b <= 5e+15) tmp = Float64(Float64(-4.0 * Float64(a * t)) / c_m); else tmp = Float64(Float64(b / c_m) / z); 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])){:}
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 <= -6.5e+102)
tmp = b / (z * c_m);
elseif (b <= 5e+15)
tmp = (-4.0 * (a * t)) / c_m;
else
tmp = (b / c_m) / z;
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.
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, -6.5e+102], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5e+15], N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(b / c$95$m), $MachinePrecision] / z), $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])\\\\
[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 -6.5 \cdot 10^{+102}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{elif}\;b \leq 5 \cdot 10^{+15}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c\_m}}{z}\\
\end{array}
\end{array}
if b < -6.5000000000000004e102Initial program 76.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6457.1
Applied rewrites57.1%
if -6.5000000000000004e102 < b < 5e15Initial program 74.3%
Taylor expanded in b around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6470.6
Applied rewrites70.6%
Taylor expanded in a around inf
Applied rewrites55.7%
if 5e15 < b Initial program 77.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6454.6
Applied rewrites54.6%
Applied rewrites62.1%
Final simplification57.4%
c\_m = (fabs.f64 c) c\_s = (copysign.f64 #s(literal 1 binary64) c) NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function. 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 (* (/ (* a t) c_m) -4.0))) (* c_s (if (<= t -7.4e-16) t_1 (if (<= t 2.7e-96) (/ b (* z c_m)) 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);
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 = ((a * t) / c_m) * -4.0;
double tmp;
if (t <= -7.4e-16) {
tmp = t_1;
} else if (t <= 2.7e-96) {
tmp = b / (z * c_m);
} 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.
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 = ((a * t) / c_m) * (-4.0d0)
if (t <= (-7.4d-16)) then
tmp = t_1
else if (t <= 2.7d-96) then
tmp = b / (z * c_m)
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;
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 = ((a * t) / c_m) * -4.0;
double tmp;
if (t <= -7.4e-16) {
tmp = t_1;
} else if (t <= 2.7e-96) {
tmp = b / (z * c_m);
} 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]) [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 = ((a * t) / c_m) * -4.0 tmp = 0 if t <= -7.4e-16: tmp = t_1 elif t <= 2.7e-96: tmp = b / (z * c_m) 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]) 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(Float64(a * t) / c_m) * -4.0) tmp = 0.0 if (t <= -7.4e-16) tmp = t_1; elseif (t <= 2.7e-96) tmp = Float64(b / Float64(z * c_m)); 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])){:}
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 = ((a * t) / c_m) * -4.0;
tmp = 0.0;
if (t <= -7.4e-16)
tmp = t_1;
elseif (t <= 2.7e-96)
tmp = b / (z * c_m);
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.
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[(N[(a * t), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t, -7.4e-16], t$95$1, If[LessEqual[t, 2.7e-96], N[(b / N[(z * c$95$m), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{a \cdot t}{c\_m} \cdot -4\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t \leq -7.4 \cdot 10^{-16}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 2.7 \cdot 10^{-96}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if t < -7.3999999999999999e-16 or 2.7e-96 < t Initial program 71.1%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6456.0
Applied rewrites56.0%
if -7.3999999999999999e-16 < t < 2.7e-96Initial program 81.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6449.0
Applied rewrites49.0%
Final simplification53.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. 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 (* 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);
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 / (z * c_m));
}
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.
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 / (z * c_m))
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;
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 / (z * c_m));
}
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]) [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 / (z * c_m))
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]) 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(z * c_m))) 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])){:}
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 / (z * c_m));
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.
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[(z * c$95$m), $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])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
c\_s \cdot \frac{b}{z \cdot c\_m}
\end{array}
Initial program 75.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6432.3
Applied rewrites32.3%
Final simplification32.3%
(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 2024251
(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)))