
(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
(*
c_s
(if (<= c_m 8.2e-50)
(/ (/ (fma (* a (* z -4.0)) t (fma (* y x) 9.0 b)) z) c_m)
(fma
(* a -4.0)
(/ t c_m)
(/ (fma (* -9.0 x) (/ y 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 (c_m <= 8.2e-50) {
tmp = (fma((a * (z * -4.0)), t, fma((y * x), 9.0, b)) / z) / c_m;
} else {
tmp = fma((a * -4.0), (t / c_m), (fma((-9.0 * x), (y / c_m), (-b / c_m)) / -z));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) 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 <= 8.2e-50) tmp = Float64(Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(Float64(y * x), 9.0, b)) / z) / c_m); else tmp = fma(Float64(a * -4.0), Float64(t / c_m), Float64(fma(Float64(-9.0 * x), Float64(y / c_m), Float64(Float64(-b) / c_m)) / Float64(-z))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, 8.2e-50], N[(N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(N[(N[(-9.0 * x), $MachinePrecision] * N[(y / c$95$m), $MachinePrecision] + N[((-b) / c$95$m), $MachinePrecision]), $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}\;c\_m \leq 8.2 \cdot 10^{-50}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{\mathsf{fma}\left(-9 \cdot x, \frac{y}{c\_m}, \frac{-b}{c\_m}\right)}{-z}\right)\\
\end{array}
\end{array}
if c < 8.19999999999999971e-50Initial program 85.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.4%
if 8.19999999999999971e-50 < c Initial program 64.3%
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 rewrites86.3%
Taylor expanded in z around -inf
Applied rewrites89.8%
Final simplification81.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* z -4.0)))
(t_2 (/ (- b (- (* (* (* 4.0 z) t) a) (* (* 9.0 x) y))) (* z c_m))))
(*
c_s
(if (<= t_2 -5e+45)
(/ 1.0 (/ (* z c_m) (fma t_1 t (fma (* y x) 9.0 b))))
(if (<= t_2 4e+29)
(/ (/ (fma (* 9.0 y) x (fma (* (* t a) -4.0) z b)) z) c_m)
(if (<= t_2 INFINITY)
(/ (fma (* 9.0 x) y (fma t_1 t b)) (* z c_m))
(fma (* a -4.0) (/ t c_m) (/ 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 t_1 = a * (z * -4.0);
double t_2 = (b - ((((4.0 * z) * t) * a) - ((9.0 * x) * y))) / (z * c_m);
double tmp;
if (t_2 <= -5e+45) {
tmp = 1.0 / ((z * c_m) / fma(t_1, t, fma((y * x), 9.0, b)));
} else if (t_2 <= 4e+29) {
tmp = (fma((9.0 * y), x, fma(((t * a) * -4.0), z, b)) / z) / c_m;
} else if (t_2 <= ((double) INFINITY)) {
tmp = fma((9.0 * x), y, fma(t_1, t, b)) / (z * c_m);
} else {
tmp = fma((a * -4.0), (t / c_m), (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) t_1 = Float64(a * Float64(z * -4.0)) t_2 = Float64(Float64(b - Float64(Float64(Float64(Float64(4.0 * z) * t) * a) - Float64(Float64(9.0 * x) * y))) / Float64(z * c_m)) tmp = 0.0 if (t_2 <= -5e+45) tmp = Float64(1.0 / Float64(Float64(z * c_m) / fma(t_1, t, fma(Float64(y * x), 9.0, b)))); elseif (t_2 <= 4e+29) tmp = Float64(Float64(fma(Float64(9.0 * y), x, fma(Float64(Float64(t * a) * -4.0), z, b)) / z) / c_m); elseif (t_2 <= Inf) tmp = Float64(fma(Float64(9.0 * x), y, fma(t_1, t, b)) / Float64(z * c_m)); else tmp = fma(Float64(a * -4.0), Float64(t / c_m), 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_] := Block[{t$95$1 = N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b - N[(N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] - N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+45], N[(1.0 / N[(N[(z * c$95$m), $MachinePrecision] / N[(t$95$1 * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 4e+29], N[(N[(N[(N[(9.0 * y), $MachinePrecision] * x + N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(t$95$1 * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := a \cdot \left(z \cdot -4\right)\\
t_2 := \frac{b - \left(\left(\left(4 \cdot z\right) \cdot t\right) \cdot a - \left(9 \cdot x\right) \cdot y\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+45}:\\
\;\;\;\;\frac{1}{\frac{z \cdot c\_m}{\mathsf{fma}\left(t\_1, t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}}\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+29}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9 \cdot y, x, \mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(t\_1, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{b}{z \cdot c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -5e45Initial program 91.1%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6491.1
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
Applied rewrites90.1%
if -5e45 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 3.99999999999999966e29Initial program 85.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites90.0%
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
associate-+l+N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
+-commutativeN/A
lift-fma.f64N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6499.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
if 3.99999999999999966e29 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 86.9%
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 rewrites86.0%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in b around 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 rewrites70.2%
Taylor expanded in z around -inf
Applied rewrites84.5%
Taylor expanded in b around inf
Applied rewrites76.1%
Final simplification89.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 (* z -4.0)))
(t_2 (/ (- b (- (* (* (* 4.0 z) t) a) (* (* 9.0 x) y))) (* z c_m))))
(*
c_s
(if (<= t_2 -5e+45)
(* (/ 1.0 (* z c_m)) (fma t_1 t (fma (* y x) 9.0 b)))
(if (<= t_2 4e+29)
(/ (/ (fma (* 9.0 y) x (fma (* (* t a) -4.0) z b)) z) c_m)
(if (<= t_2 INFINITY)
(/ (fma (* 9.0 x) y (fma t_1 t b)) (* z c_m))
(fma (* a -4.0) (/ t c_m) (/ 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 t_1 = a * (z * -4.0);
double t_2 = (b - ((((4.0 * z) * t) * a) - ((9.0 * x) * y))) / (z * c_m);
double tmp;
if (t_2 <= -5e+45) {
tmp = (1.0 / (z * c_m)) * fma(t_1, t, fma((y * x), 9.0, b));
} else if (t_2 <= 4e+29) {
tmp = (fma((9.0 * y), x, fma(((t * a) * -4.0), z, b)) / z) / c_m;
} else if (t_2 <= ((double) INFINITY)) {
tmp = fma((9.0 * x), y, fma(t_1, t, b)) / (z * c_m);
} else {
tmp = fma((a * -4.0), (t / c_m), (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) t_1 = Float64(a * Float64(z * -4.0)) t_2 = Float64(Float64(b - Float64(Float64(Float64(Float64(4.0 * z) * t) * a) - Float64(Float64(9.0 * x) * y))) / Float64(z * c_m)) tmp = 0.0 if (t_2 <= -5e+45) tmp = Float64(Float64(1.0 / Float64(z * c_m)) * fma(t_1, t, fma(Float64(y * x), 9.0, b))); elseif (t_2 <= 4e+29) tmp = Float64(Float64(fma(Float64(9.0 * y), x, fma(Float64(Float64(t * a) * -4.0), z, b)) / z) / c_m); elseif (t_2 <= Inf) tmp = Float64(fma(Float64(9.0 * x), y, fma(t_1, t, b)) / Float64(z * c_m)); else tmp = fma(Float64(a * -4.0), Float64(t / c_m), 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_] := Block[{t$95$1 = N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b - N[(N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] - N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+45], N[(N[(1.0 / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 4e+29], N[(N[(N[(N[(9.0 * y), $MachinePrecision] * x + N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(t$95$1 * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := a \cdot \left(z \cdot -4\right)\\
t_2 := \frac{b - \left(\left(\left(4 \cdot z\right) \cdot t\right) \cdot a - \left(9 \cdot x\right) \cdot y\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+45}:\\
\;\;\;\;\frac{1}{z \cdot c\_m} \cdot \mathsf{fma}\left(t\_1, t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+29}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9 \cdot y, x, \mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(t\_1, t, b\right)\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{b}{z \cdot c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -5e45Initial program 91.1%
lift-/.f64N/A
clear-numN/A
frac-2negN/A
associate-/r/N/A
lower-*.f64N/A
neg-mul-1N/A
associate-/r*N/A
metadata-evalN/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-neg.f6491.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
Applied rewrites90.0%
if -5e45 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 3.99999999999999966e29Initial program 85.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites90.0%
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
associate-+l+N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
+-commutativeN/A
lift-fma.f64N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6499.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
if 3.99999999999999966e29 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 86.9%
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 rewrites86.0%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in b around 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 rewrites70.2%
Taylor expanded in z around -inf
Applied rewrites84.5%
Taylor expanded in b around inf
Applied rewrites76.1%
Final simplification89.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (- b (- (* (* (* 4.0 z) t) a) (* (* 9.0 x) y))) (* z c_m)))
(t_2 (/ (fma (* 9.0 x) y (fma (* a (* z -4.0)) t b)) (* z c_m))))
(*
c_s
(if (<= t_1 -5e+45)
t_2
(if (<= t_1 4e+29)
(/ (/ (fma (* 9.0 y) x (fma (* (* t a) -4.0) z b)) z) c_m)
(if (<= t_1 INFINITY)
t_2
(fma (* a -4.0) (/ t c_m) (/ 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 t_1 = (b - ((((4.0 * z) * t) * a) - ((9.0 * x) * y))) / (z * c_m);
double t_2 = fma((9.0 * x), y, fma((a * (z * -4.0)), t, b)) / (z * c_m);
double tmp;
if (t_1 <= -5e+45) {
tmp = t_2;
} else if (t_1 <= 4e+29) {
tmp = (fma((9.0 * y), x, fma(((t * a) * -4.0), z, b)) / z) / c_m;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma((a * -4.0), (t / c_m), (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) t_1 = Float64(Float64(b - Float64(Float64(Float64(Float64(4.0 * z) * t) * a) - Float64(Float64(9.0 * x) * y))) / Float64(z * c_m)) t_2 = Float64(fma(Float64(9.0 * x), y, fma(Float64(a * Float64(z * -4.0)), t, b)) / Float64(z * c_m)) tmp = 0.0 if (t_1 <= -5e+45) tmp = t_2; elseif (t_1 <= 4e+29) tmp = Float64(Float64(fma(Float64(9.0 * y), x, fma(Float64(Float64(t * a) * -4.0), z, b)) / z) / c_m); elseif (t_1 <= Inf) tmp = t_2; else tmp = fma(Float64(a * -4.0), Float64(t / c_m), 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_] := Block[{t$95$1 = N[(N[(b - N[(N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] - N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -5e+45], t$95$2, If[LessEqual[t$95$1, 4e+29], N[(N[(N[(N[(9.0 * y), $MachinePrecision] * x + N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b - \left(\left(\left(4 \cdot z\right) \cdot t\right) \cdot a - \left(9 \cdot x\right) \cdot y\right)}{z \cdot c\_m}\\
t_2 := \frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+45}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+29}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9 \cdot y, x, \mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)\right)}{z}}{c\_m}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{b}{z \cdot c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -5e45 or 3.99999999999999966e29 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 89.1%
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 rewrites88.1%
if -5e45 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 3.99999999999999966e29Initial program 85.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites90.0%
lift-fma.f64N/A
+-commutativeN/A
lift-fma.f64N/A
associate-+l+N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
+-commutativeN/A
lift-fma.f64N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6499.6
lift-*.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in b around 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 rewrites70.2%
Taylor expanded in z around -inf
Applied rewrites84.5%
Taylor expanded in b around inf
Applied rewrites76.1%
Final simplification89.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (- b (- (* (* (* 4.0 z) t) a) (* (* 9.0 x) y))) (* z c_m)))
(t_2 (/ (fma (* 9.0 x) y (fma (* a (* z -4.0)) t b)) (* z c_m))))
(*
c_s
(if (<= t_1 -2e-242)
t_2
(if (<= t_1 0.0)
(/ (/ (fma (* y x) 9.0 b) c_m) z)
(if (<= t_1 INFINITY)
t_2
(fma (* a -4.0) (/ t c_m) (/ 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 t_1 = (b - ((((4.0 * z) * t) * a) - ((9.0 * x) * y))) / (z * c_m);
double t_2 = fma((9.0 * x), y, fma((a * (z * -4.0)), t, b)) / (z * c_m);
double tmp;
if (t_1 <= -2e-242) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = (fma((y * x), 9.0, b) / c_m) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma((a * -4.0), (t / c_m), (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) t_1 = Float64(Float64(b - Float64(Float64(Float64(Float64(4.0 * z) * t) * a) - Float64(Float64(9.0 * x) * y))) / Float64(z * c_m)) t_2 = Float64(fma(Float64(9.0 * x), y, fma(Float64(a * Float64(z * -4.0)), t, b)) / Float64(z * c_m)) tmp = 0.0 if (t_1 <= -2e-242) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c_m) / z); elseif (t_1 <= Inf) tmp = t_2; else tmp = fma(Float64(a * -4.0), Float64(t / c_m), 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_] := Block[{t$95$1 = N[(N[(b - N[(N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] - N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -2e-242], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]]]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\
\\
\begin{array}{l}
t_1 := \frac{b - \left(\left(\left(4 \cdot z\right) \cdot t\right) \cdot a - \left(9 \cdot x\right) \cdot y\right)}{z \cdot c\_m}\\
t_2 := \frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-242}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c\_m}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{b}{z \cdot c\_m}\right)\\
\end{array}
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -2e-242 or -0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.1%
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 rewrites88.9%
if -2e-242 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -0.0Initial program 55.0%
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-*.f6489.4
Applied rewrites89.4%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in 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 rewrites70.2%
Taylor expanded in z around -inf
Applied rewrites84.5%
Taylor expanded in b around inf
Applied rewrites76.1%
Final simplification87.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (/ (/ (fma (* y x) 9.0 b) c_m) z)) (t_2 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_2 -5e+200)
(* (/ x z) (/ (* 9.0 y) c_m))
(if (<= t_2 -5e-51)
t_1
(if (<= t_2 4e-156)
(fma (* a -4.0) (/ t c_m) (/ b (* z c_m)))
(if (<= t_2 4e+210) t_1 (* (* (/ y c_m) 9.0) (/ x 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 t_1 = (fma((y * x), 9.0, b) / c_m) / z;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -5e+200) {
tmp = (x / z) * ((9.0 * y) / c_m);
} else if (t_2 <= -5e-51) {
tmp = t_1;
} else if (t_2 <= 4e-156) {
tmp = fma((a * -4.0), (t / c_m), (b / (z * c_m)));
} else if (t_2 <= 4e+210) {
tmp = t_1;
} else {
tmp = ((y / c_m) * 9.0) * (x / 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) t_1 = Float64(Float64(fma(Float64(y * x), 9.0, b) / c_m) / z) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -5e+200) tmp = Float64(Float64(x / z) * Float64(Float64(9.0 * y) / c_m)); elseif (t_2 <= -5e-51) tmp = t_1; elseif (t_2 <= 4e-156) tmp = fma(Float64(a * -4.0), Float64(t / c_m), Float64(b / Float64(z * c_m))); elseif (t_2 <= 4e+210) tmp = t_1; else tmp = Float64(Float64(Float64(y / c_m) * 9.0) * Float64(x / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -5e+200], N[(N[(x / z), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -5e-51], t$95$1, If[LessEqual[t$95$2, 4e-156], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c$95$m), $MachinePrecision] + N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 4e+210], t$95$1, N[(N[(N[(y / c$95$m), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / 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])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c\_m}}{z}\\
t_2 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+200}:\\
\;\;\;\;\frac{x}{z} \cdot \frac{9 \cdot y}{c\_m}\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-51}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{-156}:\\
\;\;\;\;\mathsf{fma}\left(a \cdot -4, \frac{t}{c\_m}, \frac{b}{z \cdot c\_m}\right)\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+210}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c\_m} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000019e200Initial program 67.1%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6484.0
Applied rewrites84.0%
Applied rewrites84.0%
if -5.00000000000000019e200 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000004e-51 or 4.00000000000000016e-156 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.99999999999999971e210Initial program 85.0%
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-*.f6475.1
Applied rewrites75.1%
if -5.00000000000000004e-51 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.00000000000000016e-156Initial program 81.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 rewrites86.3%
Taylor expanded in z around -inf
Applied rewrites87.7%
Taylor expanded in b around inf
Applied rewrites90.3%
if 3.99999999999999971e210 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 63.0%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
Final simplification82.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 (* (* 9.0 x) y)) (t_2 (/ (/ (fma (* y x) 9.0 b) c_m) z)))
(*
c_s
(if (<= t_1 (- INFINITY))
(* (/ x z) (/ (* 9.0 y) c_m))
(if (<= t_1 -4e-82)
t_2
(if (<= t_1 5e-149)
(/ (fma (* a (* z -4.0)) t b) (* z c_m))
(if (<= t_1 4e+210) t_2 (* (* (/ y c_m) 9.0) (/ x 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 t_1 = (9.0 * x) * y;
double t_2 = (fma((y * x), 9.0, b) / c_m) / z;
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (x / z) * ((9.0 * y) / c_m);
} else if (t_1 <= -4e-82) {
tmp = t_2;
} else if (t_1 <= 5e-149) {
tmp = fma((a * (z * -4.0)), t, b) / (z * c_m);
} else if (t_1 <= 4e+210) {
tmp = t_2;
} else {
tmp = ((y / c_m) * 9.0) * (x / 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) t_1 = Float64(Float64(9.0 * x) * y) t_2 = Float64(Float64(fma(Float64(y * x), 9.0, b) / c_m) / z) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(x / z) * Float64(Float64(9.0 * y) / c_m)); elseif (t_1 <= -4e-82) tmp = t_2; elseif (t_1 <= 5e-149) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, b) / Float64(z * c_m)); elseif (t_1 <= 4e+210) tmp = t_2; else tmp = Float64(Float64(Float64(y / c_m) * 9.0) * Float64(x / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c$95$m), $MachinePrecision] / z), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(N[(x / z), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e-82], t$95$2, If[LessEqual[t$95$1, 5e-149], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+210], t$95$2, N[(N[(N[(y / c$95$m), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / 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])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c\_m}}{z}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{x}{z} \cdot \frac{9 \cdot y}{c\_m}\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{-82}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-149}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+210}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c\_m} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -inf.0Initial program 42.6%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6480.3
Applied rewrites80.3%
Applied rewrites80.3%
if -inf.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4e-82 or 4.99999999999999968e-149 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.99999999999999971e210Initial program 85.1%
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-*.f6476.1
Applied rewrites76.1%
if -4e-82 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999968e-149Initial program 82.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-*.f6478.9
Applied rewrites78.9%
Applied rewrites76.3%
if 3.99999999999999971e210 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 63.0%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.6
Applied rewrites78.6%
Final simplification76.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* 9.0 x) y)) (t_2 (/ (fma (* y x) 9.0 b) (* z c_m))))
(*
c_s
(if (<= t_1 (- INFINITY))
(* (/ x z) (/ (* 9.0 y) c_m))
(if (<= t_1 -5e-16)
t_2
(if (<= t_1 2e-199)
(/ (fma (* (* t a) -4.0) z b) (* z c_m))
(if (<= t_1 5e+228) t_2 (* (* (/ y c_m) 9.0) (/ x 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 t_1 = (9.0 * x) * y;
double t_2 = fma((y * x), 9.0, b) / (z * c_m);
double tmp;
if (t_1 <= -((double) INFINITY)) {
tmp = (x / z) * ((9.0 * y) / c_m);
} else if (t_1 <= -5e-16) {
tmp = t_2;
} else if (t_1 <= 2e-199) {
tmp = fma(((t * a) * -4.0), z, b) / (z * c_m);
} else if (t_1 <= 5e+228) {
tmp = t_2;
} else {
tmp = ((y / c_m) * 9.0) * (x / 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) t_1 = Float64(Float64(9.0 * x) * y) t_2 = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)) tmp = 0.0 if (t_1 <= Float64(-Inf)) tmp = Float64(Float64(x / z) * Float64(Float64(9.0 * y) / c_m)); elseif (t_1 <= -5e-16) tmp = t_2; elseif (t_1 <= 2e-199) tmp = Float64(fma(Float64(Float64(t * a) * -4.0), z, b) / Float64(z * c_m)); elseif (t_1 <= 5e+228) tmp = t_2; else tmp = Float64(Float64(Float64(y / c_m) * 9.0) * Float64(x / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, (-Infinity)], N[(N[(x / z), $MachinePrecision] * N[(N[(9.0 * y), $MachinePrecision] / c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e-16], t$95$2, If[LessEqual[t$95$1, 2e-199], N[(N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+228], t$95$2, N[(N[(N[(y / c$95$m), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / 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])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -\infty:\\
\;\;\;\;\frac{x}{z} \cdot \frac{9 \cdot y}{c\_m}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{-16}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-199}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+228}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c\_m} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -inf.0Initial program 42.6%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6480.3
Applied rewrites80.3%
Applied rewrites80.3%
if -inf.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.0000000000000004e-16 or 1.99999999999999996e-199 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e228Initial program 83.7%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6471.9
Applied rewrites71.9%
if -5.0000000000000004e-16 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999996e-199Initial program 83.3%
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-*.f6477.4
Applied rewrites77.4%
if 5e228 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.0%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6484.4
Applied rewrites84.4%
Final simplification75.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
(let* ((t_1 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_1 -1e+31)
(* (* (/ y c_m) x) (/ 9.0 z))
(if (<= t_1 2e-199)
(/ (fma (* a (* z -4.0)) t b) (* z c_m))
(if (<= t_1 5e+228)
(/ (fma (* y x) 9.0 b) (* z c_m))
(* (* (/ y c_m) 9.0) (/ x 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 t_1 = (9.0 * x) * y;
double tmp;
if (t_1 <= -1e+31) {
tmp = ((y / c_m) * x) * (9.0 / z);
} else if (t_1 <= 2e-199) {
tmp = fma((a * (z * -4.0)), t, b) / (z * c_m);
} else if (t_1 <= 5e+228) {
tmp = fma((y * x), 9.0, b) / (z * c_m);
} else {
tmp = ((y / c_m) * 9.0) * (x / 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) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -1e+31) tmp = Float64(Float64(Float64(y / c_m) * x) * Float64(9.0 / z)); elseif (t_1 <= 2e-199) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, b) / Float64(z * c_m)); elseif (t_1 <= 5e+228) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(y / c_m) * 9.0) * Float64(x / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$1, -1e+31], N[(N[(N[(y / c$95$m), $MachinePrecision] * x), $MachinePrecision] * N[(9.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-199], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+228], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / c$95$m), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / 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])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+31}:\\
\;\;\;\;\left(\frac{y}{c\_m} \cdot x\right) \cdot \frac{9}{z}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-199}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, b\right)}{z \cdot c\_m}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+228}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c\_m} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999996e30Initial program 72.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites62.6%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6421.4
Applied rewrites21.4%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6476.3
Applied rewrites76.3%
if -9.9999999999999996e30 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999996e-199Initial program 83.4%
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-*.f6475.0
Applied rewrites75.0%
Applied rewrites74.4%
if 1.99999999999999996e-199 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e228Initial program 82.4%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6469.9
Applied rewrites69.9%
if 5e228 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 64.0%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6484.4
Applied rewrites84.4%
Final simplification74.3%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
(FPCore (c_s x y z t a b c_m)
:precision binary64
(let* ((t_1 (* (* (/ y (* z c_m)) x) 9.0)) (t_2 (* (* 9.0 x) y)))
(*
c_s
(if (<= t_2 -1e-14)
t_1
(if (<= t_2 0.0)
(* (/ (* t a) c_m) -4.0)
(if (<= t_2 10.0) (/ 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 = ((y / (z * c_m)) * x) * 9.0;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -1e-14) {
tmp = t_1;
} else if (t_2 <= 0.0) {
tmp = ((t * a) / c_m) * -4.0;
} else if (t_2 <= 10.0) {
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) :: t_2
real(8) :: tmp
t_1 = ((y / (z * c_m)) * x) * 9.0d0
t_2 = (9.0d0 * x) * y
if (t_2 <= (-1d-14)) then
tmp = t_1
else if (t_2 <= 0.0d0) then
tmp = ((t * a) / c_m) * (-4.0d0)
else if (t_2 <= 10.0d0) 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 = ((y / (z * c_m)) * x) * 9.0;
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -1e-14) {
tmp = t_1;
} else if (t_2 <= 0.0) {
tmp = ((t * a) / c_m) * -4.0;
} else if (t_2 <= 10.0) {
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 = ((y / (z * c_m)) * x) * 9.0 t_2 = (9.0 * x) * y tmp = 0 if t_2 <= -1e-14: tmp = t_1 elif t_2 <= 0.0: tmp = ((t * a) / c_m) * -4.0 elif t_2 <= 10.0: 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(y / Float64(z * c_m)) * x) * 9.0) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -1e-14) tmp = t_1; elseif (t_2 <= 0.0) tmp = Float64(Float64(Float64(t * a) / c_m) * -4.0); elseif (t_2 <= 10.0) 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 = ((y / (z * c_m)) * x) * 9.0;
t_2 = (9.0 * x) * y;
tmp = 0.0;
if (t_2 <= -1e-14)
tmp = t_1;
elseif (t_2 <= 0.0)
tmp = ((t * a) / c_m) * -4.0;
elseif (t_2 <= 10.0)
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[(y / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * 9.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, N[(c$95$s * If[LessEqual[t$95$2, -1e-14], t$95$1, If[LessEqual[t$95$2, 0.0], N[(N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$2, 10.0], 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 := \left(\frac{y}{z \cdot c\_m} \cdot x\right) \cdot 9\\
t_2 := \left(9 \cdot x\right) \cdot y\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{-14}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 0:\\
\;\;\;\;\frac{t \cdot a}{c\_m} \cdot -4\\
\mathbf{elif}\;t\_2 \leq 10:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999999e-15 or 10 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites71.6%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
associate-/l*N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6457.1
Applied rewrites57.1%
if -9.99999999999999999e-15 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 0.0Initial program 81.1%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.9
Applied rewrites55.9%
if 0.0 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 10Initial program 84.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6465.5
Applied rewrites65.5%
Final simplification58.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
(if (<= c_m 1.46e-98)
(/ (/ (fma (* a (* z -4.0)) t (fma (* y x) 9.0 b)) z) c_m)
(fma
(/ (* 9.0 y) (* z c_m))
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 <= 1.46e-98) {
tmp = (fma((a * (z * -4.0)), t, fma((y * x), 9.0, b)) / z) / c_m;
} else {
tmp = fma(((9.0 * y) / (z * c_m)), 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 <= 1.46e-98) tmp = Float64(Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(Float64(y * x), 9.0, b)) / z) / c_m); else tmp = fma(Float64(Float64(9.0 * y) / Float64(z * c_m)), 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, 1.46e-98], N[(N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(N[(9.0 * y), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $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 1.46 \cdot 10^{-98}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{9 \cdot y}{z \cdot c\_m}, 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 < 1.46000000000000007e-98Initial program 85.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.4%
if 1.46000000000000007e-98 < c Initial program 66.7%
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.9%
Applied rewrites87.9%
Final simplification81.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
(if (<= c_m 1.4e-98)
(/ (/ (fma (* a (* z -4.0)) t (fma (* y x) 9.0 b)) z) c_m)
(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 <= 1.4e-98) {
tmp = (fma((a * (z * -4.0)), t, fma((y * x), 9.0, b)) / z) / c_m;
} 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 <= 1.4e-98) tmp = Float64(Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(Float64(y * x), 9.0, b)) / z) / c_m); 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, 1.4e-98], N[(N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $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 1.4 \cdot 10^{-98}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z}}{c\_m}\\
\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 < 1.3999999999999999e-98Initial program 85.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.4%
if 1.3999999999999999e-98 < c Initial program 66.7%
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.9%
Final simplification81.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
(if (<= c_m 3.5e-22)
(/ (/ 1.0 (/ z (fma (* a (* z -4.0)) t (fma (* 9.0 x) y b)))) c_m)
(fma (/ a c_m) (* t -4.0) (/ (/ (- b (* (* -9.0 x) y)) 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 (c_m <= 3.5e-22) {
tmp = (1.0 / (z / fma((a * (z * -4.0)), t, fma((9.0 * x), y, b)))) / c_m;
} else {
tmp = fma((a / c_m), (t * -4.0), (((b - ((-9.0 * x) * y)) / 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 (c_m <= 3.5e-22) tmp = Float64(Float64(1.0 / Float64(z / fma(Float64(a * Float64(z * -4.0)), t, fma(Float64(9.0 * x), y, b)))) / c_m); else tmp = fma(Float64(a / c_m), Float64(t * -4.0), Float64(Float64(Float64(b - Float64(Float64(-9.0 * x) * y)) / c_m) / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 3.5e-22], N[(N[(1.0 / N[(z / N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(N[(9.0 * x), $MachinePrecision] * y + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision] + N[(N[(N[(b - N[(N[(-9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;c\_m \leq 3.5 \cdot 10^{-22}:\\
\;\;\;\;\frac{\frac{1}{\frac{z}{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(9 \cdot x, y, b\right)\right)}}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a}{c\_m}, t \cdot -4, \frac{\frac{b - \left(-9 \cdot x\right) \cdot y}{c\_m}}{z}\right)\\
\end{array}
\end{array}
if c < 3.50000000000000005e-22Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.8%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6478.8
lift-fma.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f6478.8
Applied rewrites78.8%
if 3.50000000000000005e-22 < c Initial program 63.6%
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 rewrites85.5%
Taylor expanded in z around -inf
Applied rewrites89.2%
Applied rewrites87.1%
Final simplification80.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 (<= c_m 2.3e-51)
(/ (/ (fma (* a (* z -4.0)) t (fma (* y x) 9.0 b)) z) c_m)
(fma (/ a c_m) (* t -4.0) (/ (/ (- b (* (* -9.0 x) y)) 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 (c_m <= 2.3e-51) {
tmp = (fma((a * (z * -4.0)), t, fma((y * x), 9.0, b)) / z) / c_m;
} else {
tmp = fma((a / c_m), (t * -4.0), (((b - ((-9.0 * x) * y)) / 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 (c_m <= 2.3e-51) tmp = Float64(Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(Float64(y * x), 9.0, b)) / z) / c_m); else tmp = fma(Float64(a / c_m), Float64(t * -4.0), Float64(Float64(Float64(b - Float64(Float64(-9.0 * x) * y)) / c_m) / z)); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
code[c$95$s_, x_, y_, z_, t_, a_, b_, c$95$m_] := N[(c$95$s * If[LessEqual[c$95$m, 2.3e-51], N[(N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c$95$m), $MachinePrecision], N[(N[(a / c$95$m), $MachinePrecision] * N[(t * -4.0), $MachinePrecision] + N[(N[(N[(b - N[(N[(-9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] / c$95$m), $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}\;c\_m \leq 2.3 \cdot 10^{-51}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z}}{c\_m}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a}{c\_m}, t \cdot -4, \frac{\frac{b - \left(-9 \cdot x\right) \cdot y}{c\_m}}{z}\right)\\
\end{array}
\end{array}
if c < 2.30000000000000002e-51Initial program 85.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.4%
if 2.30000000000000002e-51 < c Initial program 64.3%
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 rewrites86.3%
Taylor expanded in z around -inf
Applied rewrites89.8%
Applied rewrites87.9%
Final simplification81.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 (<= z -1.22e+54)
(/ (* (* t a) -4.0) c_m)
(if (<= z 4e+58)
(/ (fma (* y x) 9.0 b) (* z c_m))
(/ 1.0 (/ c_m (* (* t -4.0) a)))))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 <= -1.22e+54) {
tmp = ((t * a) * -4.0) / c_m;
} else if (z <= 4e+58) {
tmp = fma((y * x), 9.0, b) / (z * c_m);
} else {
tmp = 1.0 / (c_m / ((t * -4.0) * a));
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) 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 <= -1.22e+54) tmp = Float64(Float64(Float64(t * a) * -4.0) / c_m); elseif (z <= 4e+58) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)); else tmp = Float64(1.0 / Float64(c_m / Float64(Float64(t * -4.0) * a))); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, -1.22e+54], N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 4e+58], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(c$95$m / N[(N[(t * -4.0), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]
\begin{array}{l}
c\_m = \left|c\right|
\\
c\_s = \mathsf{copysign}\left(1, c\right)
\\
[x, y, z, t, a, b, c_m] = \mathsf{sort}([x, y, z, t, a, b, c_m])\\\\
[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 -1.22 \cdot 10^{+54}:\\
\;\;\;\;\frac{\left(t \cdot a\right) \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{+58}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{c\_m}{\left(t \cdot -4\right) \cdot a}}\\
\end{array}
\end{array}
if z < -1.22e54Initial program 62.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites71.0%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6452.2
Applied rewrites52.2%
if -1.22e54 < z < 3.99999999999999978e58Initial program 96.5%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.7
Applied rewrites79.7%
if 3.99999999999999978e58 < z Initial program 46.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites56.1%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6461.5
Applied rewrites61.5%
lift-/.f64N/A
clear-numN/A
lower-/.f64N/A
lower-/.f6461.5
Applied rewrites61.5%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 -1.22e+54)
(/ (* (* t a) -4.0) c_m)
(if (<= z 4e+58)
(/ (fma (* y x) 9.0 b) (* z c_m))
(* (/ (* t a) c_m) -4.0)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 <= -1.22e+54) {
tmp = ((t * a) * -4.0) / c_m;
} else if (z <= 4e+58) {
tmp = fma((y * x), 9.0, b) / (z * c_m);
} else {
tmp = ((t * a) / c_m) * -4.0;
}
return c_s * tmp;
}
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) 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 <= -1.22e+54) tmp = Float64(Float64(Float64(t * a) * -4.0) / c_m); elseif (z <= 4e+58) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c_m)); else tmp = Float64(Float64(Float64(t * a) / c_m) * -4.0); end return Float64(c_s * tmp) end
c\_m = N[Abs[c], $MachinePrecision]
c\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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, -1.22e+54], N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 4e+58], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $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 -1.22 \cdot 10^{+54}:\\
\;\;\;\;\frac{\left(t \cdot a\right) \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 4 \cdot 10^{+58}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot a}{c\_m} \cdot -4\\
\end{array}
\end{array}
if z < -1.22e54Initial program 62.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites71.0%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6452.2
Applied rewrites52.2%
if -1.22e54 < z < 3.99999999999999978e58Initial program 96.5%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.7
Applied rewrites79.7%
if 3.99999999999999978e58 < z Initial program 46.6%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6461.5
Applied rewrites61.5%
Final simplification70.7%
c\_m = (fabs.f64 c)
c\_s = (copysign.f64 #s(literal 1 binary64) c)
NOTE: x, y, z, t, a, b, and c_m should be sorted in increasing order before calling this function.
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 -1.1e-56)
(/ (* (* t a) -4.0) c_m)
(if (<= z 1.9e+17) (/ b (* z c_m)) (* (/ (* t a) c_m) -4.0)))))c\_m = fabs(c);
c\_s = copysign(1.0, c);
assert(x < y && y < z && z < t && t < a && a < b && b < c_m);
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 <= -1.1e-56) {
tmp = ((t * a) * -4.0) / c_m;
} else if (z <= 1.9e+17) {
tmp = b / (z * c_m);
} else {
tmp = ((t * a) / c_m) * -4.0;
}
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 (z <= (-1.1d-56)) then
tmp = ((t * a) * (-4.0d0)) / c_m
else if (z <= 1.9d+17) then
tmp = b / (z * c_m)
else
tmp = ((t * a) / c_m) * (-4.0d0)
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 (z <= -1.1e-56) {
tmp = ((t * a) * -4.0) / c_m;
} else if (z <= 1.9e+17) {
tmp = b / (z * c_m);
} else {
tmp = ((t * a) / c_m) * -4.0;
}
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 z <= -1.1e-56: tmp = ((t * a) * -4.0) / c_m elif z <= 1.9e+17: tmp = b / (z * c_m) else: tmp = ((t * a) / c_m) * -4.0 return c_s * tmp
c\_m = abs(c) c\_s = copysign(1.0, c) x, y, z, t, a, b, c_m = sort([x, y, z, t, a, b, c_m]) 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 <= -1.1e-56) tmp = Float64(Float64(Float64(t * a) * -4.0) / c_m); elseif (z <= 1.9e+17) tmp = Float64(b / Float64(z * c_m)); else tmp = Float64(Float64(Float64(t * a) / c_m) * -4.0); 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 (z <= -1.1e-56)
tmp = ((t * a) * -4.0) / c_m;
elseif (z <= 1.9e+17)
tmp = b / (z * c_m);
else
tmp = ((t * a) / c_m) * -4.0;
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[z, -1.1e-56], N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] / c$95$m), $MachinePrecision], If[LessEqual[z, 1.9e+17], N[(b / N[(z * c$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $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 -1.1 \cdot 10^{-56}:\\
\;\;\;\;\frac{\left(t \cdot a\right) \cdot -4}{c\_m}\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{+17}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot a}{c\_m} \cdot -4\\
\end{array}
\end{array}
if z < -1.10000000000000002e-56Initial program 71.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.3%
Taylor expanded in a around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6450.9
Applied rewrites50.9%
if -1.10000000000000002e-56 < z < 1.9e17Initial program 96.6%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6455.2
Applied rewrites55.2%
if 1.9e17 < z Initial program 54.0%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.0
Applied rewrites60.0%
Final simplification55.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 (* (/ (* t a) c_m) -4.0))) (* c_s (if (<= z -1.1e-56) t_1 (if (<= z 1.9e+17) (/ 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 = ((t * a) / c_m) * -4.0;
double tmp;
if (z <= -1.1e-56) {
tmp = t_1;
} else if (z <= 1.9e+17) {
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 = ((t * a) / c_m) * (-4.0d0)
if (z <= (-1.1d-56)) then
tmp = t_1
else if (z <= 1.9d+17) 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 = ((t * a) / c_m) * -4.0;
double tmp;
if (z <= -1.1e-56) {
tmp = t_1;
} else if (z <= 1.9e+17) {
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 = ((t * a) / c_m) * -4.0 tmp = 0 if z <= -1.1e-56: tmp = t_1 elif z <= 1.9e+17: 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(t * a) / c_m) * -4.0) tmp = 0.0 if (z <= -1.1e-56) tmp = t_1; elseif (z <= 1.9e+17) 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 = ((t * a) / c_m) * -4.0;
tmp = 0.0;
if (z <= -1.1e-56)
tmp = t_1;
elseif (z <= 1.9e+17)
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[(t * a), $MachinePrecision] / c$95$m), $MachinePrecision] * -4.0), $MachinePrecision]}, N[(c$95$s * If[LessEqual[z, -1.1e-56], t$95$1, If[LessEqual[z, 1.9e+17], 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{t \cdot a}{c\_m} \cdot -4\\
c\_s \cdot \begin{array}{l}
\mathbf{if}\;z \leq -1.1 \cdot 10^{-56}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.9 \cdot 10^{+17}:\\
\;\;\;\;\frac{b}{z \cdot c\_m}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
\end{array}
if z < -1.10000000000000002e-56 or 1.9e17 < z Initial program 62.7%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.5
Applied rewrites55.5%
if -1.10000000000000002e-56 < z < 1.9e17Initial program 96.6%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6455.2
Applied rewrites55.2%
Final simplification55.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 (/ 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 79.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6437.9
Applied rewrites37.9%
Final simplification37.9%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024248
(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)))