
(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 18 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}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.7e+21) (not (<= z 1.4e-94))) (/ (fma (* -4.0 t) a (fma (* y 9.0) (/ x z) (/ b z))) c) (/ (fma (* (* -4.0 z) a) t (fma (* y 9.0) x b)) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.7e+21) || !(z <= 1.4e-94)) {
tmp = fma((-4.0 * t), a, fma((y * 9.0), (x / z), (b / z))) / c;
} else {
tmp = fma(((-4.0 * z) * a), t, fma((y * 9.0), x, b)) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.7e+21) || !(z <= 1.4e-94)) tmp = Float64(fma(Float64(-4.0 * t), a, fma(Float64(y * 9.0), Float64(x / z), Float64(b / z))) / c); else tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * 9.0), x, b)) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.7e+21], N[Not[LessEqual[z, 1.4e-94]], $MachinePrecision]], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(N[(y * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * 9.0), $MachinePrecision] * x + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.7 \cdot 10^{+21} \lor \neg \left(z \leq 1.4 \cdot 10^{-94}\right):\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \mathsf{fma}\left(y \cdot 9, \frac{x}{z}, \frac{b}{z}\right)\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot 9, x, b\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.7e21 or 1.3999999999999999e-94 < z Initial program 64.8%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites86.2%
Applied rewrites90.5%
if -1.7e21 < z < 1.3999999999999999e-94Initial program 98.0%
lift-+.f64N/A
lift--.f64N/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites96.2%
Final simplification92.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* x 9.0) y)))
(if (<= t_1 -2e+267)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_1 -1e-93)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 1e-26)
(fma (* -4.0 t) (/ a c) (/ b (* z c)))
(if (<= t_1 5e+215)
(/ (fma (* -4.0 a) t (* (/ (* y x) z) 9.0)) c)
(* (* (/ y c) 9.0) (/ x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double tmp;
if (t_1 <= -2e+267) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_1 <= -1e-93) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= 1e-26) {
tmp = fma((-4.0 * t), (a / c), (b / (z * c)));
} else if (t_1 <= 5e+215) {
tmp = fma((-4.0 * a), t, (((y * x) / z) * 9.0)) / c;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+267) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_1 <= -1e-93) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= 1e-26) tmp = fma(Float64(-4.0 * t), Float64(a / c), Float64(b / Float64(z * c))); elseif (t_1 <= 5e+215) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(Float64(Float64(y * x) / z) * 9.0)) / c); else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+267], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-93], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-26], N[(N[(-4.0 * t), $MachinePrecision] * N[(a / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+215], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+267}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-93}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-26}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot t, \frac{a}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+215}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{y \cdot x}{z} \cdot 9\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e267Initial program 67.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites73.4%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
if -1.9999999999999999e267 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.999999999999999e-94Initial program 87.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites93.4%
Taylor expanded in z around 0
associate-/r*N/A
+-commutativeN/A
div-add-revN/A
associate-*r/N/A
lower-/.f64N/A
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.1
Applied rewrites79.1%
if -9.999999999999999e-94 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-26Initial program 79.6%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites88.0%
Applied rewrites85.3%
Taylor expanded in x around 0
Applied rewrites84.6%
if 1e-26 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000001e215Initial program 81.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites89.6%
Taylor expanded in b around 0
Applied rewrites77.9%
if 5.0000000000000001e215 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 52.3%
Taylor expanded in x 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-/.f6487.6
Applied rewrites87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* x 9.0) y)))
(if (<= t_1 -2e+267)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_1 -1e-93)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 1e-26)
(fma (* -4.0 t) (/ a c) (/ b (* z c)))
(if (<= t_1 5e+215)
(/ (fma (* z (* -4.0 a)) t (* (* 9.0 x) y)) (* z c))
(* (* (/ y c) 9.0) (/ x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double tmp;
if (t_1 <= -2e+267) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_1 <= -1e-93) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= 1e-26) {
tmp = fma((-4.0 * t), (a / c), (b / (z * c)));
} else if (t_1 <= 5e+215) {
tmp = fma((z * (-4.0 * a)), t, ((9.0 * x) * y)) / (z * c);
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+267) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_1 <= -1e-93) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= 1e-26) tmp = fma(Float64(-4.0 * t), Float64(a / c), Float64(b / Float64(z * c))); elseif (t_1 <= 5e+215) tmp = Float64(fma(Float64(z * Float64(-4.0 * a)), t, Float64(Float64(9.0 * x) * y)) / Float64(z * c)); else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+267], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-93], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-26], N[(N[(-4.0 * t), $MachinePrecision] * N[(a / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+215], N[(N[(N[(z * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision] * t + N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+267}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-93}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-26}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot t, \frac{a}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+215}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(-4 \cdot a\right), t, \left(9 \cdot x\right) \cdot y\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e267Initial program 67.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites73.4%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
if -1.9999999999999999e267 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.999999999999999e-94Initial program 87.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites93.4%
Taylor expanded in z around 0
associate-/r*N/A
+-commutativeN/A
div-add-revN/A
associate-*r/N/A
lower-/.f64N/A
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.1
Applied rewrites79.1%
if -9.999999999999999e-94 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-26Initial program 79.6%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites88.0%
Applied rewrites85.3%
Taylor expanded in x around 0
Applied rewrites84.6%
if 1e-26 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000001e215Initial program 81.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6444.5
Applied rewrites44.5%
Taylor expanded in b around 0
fp-cancel-sub-sign-invN/A
metadata-evalN/A
+-commutativeN/A
associate-*r*N/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6467.4
Applied rewrites67.4%
Applied rewrites70.1%
if 5.0000000000000001e215 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 52.3%
Taylor expanded in x 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-/.f6487.6
Applied rewrites87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (/ (fma (* y x) 9.0 b) c) z)) (t_2 (* (* x 9.0) y)))
(if (<= t_2 -2e+267)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_2 -1e-103)
t_1
(if (<= t_2 1e-26)
(/ (fma (* (* a t) -4.0) z b) (* z c))
(if (<= t_2 1e+206) t_1 (* (* (/ y c) 9.0) (/ x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (fma((y * x), 9.0, b) / c) / z;
double t_2 = (x * 9.0) * y;
double tmp;
if (t_2 <= -2e+267) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_2 <= -1e-103) {
tmp = t_1;
} else if (t_2 <= 1e-26) {
tmp = fma(((a * t) * -4.0), z, b) / (z * c);
} else if (t_2 <= 1e+206) {
tmp = t_1;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z) t_2 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_2 <= -2e+267) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_2 <= -1e-103) tmp = t_1; elseif (t_2 <= 1e-26) tmp = Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / Float64(z * c)); elseif (t_2 <= 1e+206) tmp = t_1; else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+267], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-103], t$95$1, If[LessEqual[t$95$2, 1e-26], N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+206], t$95$1, N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
t_2 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+267}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-103}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-26}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_2 \leq 10^{+206}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e267Initial program 67.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites73.4%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
if -1.9999999999999999e267 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999958e-104 or 1e-26 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e206Initial program 85.0%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites91.9%
Taylor expanded in z around 0
associate-/r*N/A
+-commutativeN/A
div-add-revN/A
associate-*r/N/A
lower-/.f64N/A
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6474.1
Applied rewrites74.1%
if -9.99999999999999958e-104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-26Initial program 80.3%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6478.6
Applied rewrites78.6%
Applied rewrites78.8%
if 1e206 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 50.7%
Taylor expanded in x 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.7
Applied rewrites84.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (fma (* y x) 9.0 b) (* z c))) (t_2 (* (* x 9.0) y)))
(if (<= t_2 -1e+256)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_2 -1e-103)
t_1
(if (<= t_2 2e-29)
(/ (fma (* (* a t) -4.0) z b) (* z c))
(if (<= t_2 1e+206) t_1 (* (* (/ y c) 9.0) (/ x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma((y * x), 9.0, b) / (z * c);
double t_2 = (x * 9.0) * y;
double tmp;
if (t_2 <= -1e+256) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_2 <= -1e-103) {
tmp = t_1;
} else if (t_2 <= 2e-29) {
tmp = fma(((a * t) * -4.0), z, b) / (z * c);
} else if (t_2 <= 1e+206) {
tmp = t_1;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)) t_2 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_2 <= -1e+256) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_2 <= -1e-103) tmp = t_1; elseif (t_2 <= 2e-29) tmp = Float64(fma(Float64(Float64(a * t) * -4.0), z, b) / Float64(z * c)); elseif (t_2 <= 1e+206) tmp = t_1; else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+256], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-103], t$95$1, If[LessEqual[t$95$2, 2e-29], N[(N[(N[(N[(a * t), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+206], t$95$1, N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
t_2 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+256}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-103}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-29}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(a \cdot t\right) \cdot -4, z, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_2 \leq 10^{+206}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e256Initial program 70.7%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites79.1%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.7
Applied rewrites78.7%
if -1e256 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999958e-104 or 1.99999999999999989e-29 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e206Initial program 84.5%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6471.5
Applied rewrites71.5%
if -9.99999999999999958e-104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999989e-29Initial program 80.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6479.2
Applied rewrites79.2%
Applied rewrites79.3%
if 1e206 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 50.7%
Taylor expanded in x 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.7
Applied rewrites84.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (fma (* y x) 9.0 b) (* z c))) (t_2 (* (* x 9.0) y)))
(if (<= t_2 -1e+256)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_2 -1e-103)
t_1
(if (<= t_2 1e-26)
(/ (fma -4.0 (* (* t z) a) b) (* z c))
(if (<= t_2 1e+206) t_1 (* (* (/ y c) 9.0) (/ x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma((y * x), 9.0, b) / (z * c);
double t_2 = (x * 9.0) * y;
double tmp;
if (t_2 <= -1e+256) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_2 <= -1e-103) {
tmp = t_1;
} else if (t_2 <= 1e-26) {
tmp = fma(-4.0, ((t * z) * a), b) / (z * c);
} else if (t_2 <= 1e+206) {
tmp = t_1;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)) t_2 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_2 <= -1e+256) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_2 <= -1e-103) tmp = t_1; elseif (t_2 <= 1e-26) tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c)); elseif (t_2 <= 1e+206) tmp = t_1; else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+256], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-103], t$95$1, If[LessEqual[t$95$2, 1e-26], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+206], t$95$1, N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
t_2 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+256}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-103}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-26}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_2 \leq 10^{+206}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1e256Initial program 70.7%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites79.1%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.7
Applied rewrites78.7%
if -1e256 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999958e-104 or 1e-26 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e206Initial program 85.2%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6471.9
Applied rewrites71.9%
if -9.99999999999999958e-104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-26Initial program 80.3%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6478.6
Applied rewrites78.6%
if 1e206 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 50.7%
Taylor expanded in x 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.7
Applied rewrites84.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* x 9.0) y)))
(if (<= t_1 -2e+267)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_1 -1e-93)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 5e+215)
(fma (* -4.0 t) (/ a c) (/ b (* z c)))
(* (* (/ y c) 9.0) (/ x z)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double tmp;
if (t_1 <= -2e+267) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_1 <= -1e-93) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= 5e+215) {
tmp = fma((-4.0 * t), (a / c), (b / (z * c)));
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+267) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_1 <= -1e-93) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= 5e+215) tmp = fma(Float64(-4.0 * t), Float64(a / c), Float64(b / Float64(z * c))); else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+267], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-93], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+215], N[(N[(-4.0 * t), $MachinePrecision] * N[(a / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+267}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-93}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+215}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot t, \frac{a}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e267Initial program 67.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites73.4%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
if -1.9999999999999999e267 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.999999999999999e-94Initial program 87.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites93.4%
Taylor expanded in z around 0
associate-/r*N/A
+-commutativeN/A
div-add-revN/A
associate-*r/N/A
lower-/.f64N/A
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.1
Applied rewrites79.1%
if -9.999999999999999e-94 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000001e215Initial program 80.2%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites88.4%
Applied rewrites87.6%
Taylor expanded in x around 0
Applied rewrites77.0%
if 5.0000000000000001e215 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 52.3%
Taylor expanded in x 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-/.f6487.6
Applied rewrites87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (* x 9.0) y)))
(if (<= t_1 -2e+267)
(* (* 9.0 (/ x c)) (/ y z))
(if (<= t_1 -1e-93)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 5e+215)
(/ (fma (* -4.0 t) a (/ b z)) c)
(* (* (/ y c) 9.0) (/ x z)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double tmp;
if (t_1 <= -2e+267) {
tmp = (9.0 * (x / c)) * (y / z);
} else if (t_1 <= -1e-93) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= 5e+215) {
tmp = fma((-4.0 * t), a, (b / z)) / c;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+267) tmp = Float64(Float64(9.0 * Float64(x / c)) * Float64(y / z)); elseif (t_1 <= -1e-93) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= 5e+215) tmp = Float64(fma(Float64(-4.0 * t), a, Float64(b / z)) / c); else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+267], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-93], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+215], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+267}:\\
\;\;\;\;\left(9 \cdot \frac{x}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-93}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+215}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.9999999999999999e267Initial program 67.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites73.4%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6478.1
Applied rewrites78.1%
if -1.9999999999999999e267 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.999999999999999e-94Initial program 87.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites93.4%
Taylor expanded in z around 0
associate-/r*N/A
+-commutativeN/A
div-add-revN/A
associate-*r/N/A
lower-/.f64N/A
associate-*r/N/A
div-add-revN/A
+-commutativeN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.1
Applied rewrites79.1%
if -9.999999999999999e-94 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000001e215Initial program 80.2%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites88.4%
Taylor expanded in x around 0
Applied rewrites78.9%
if 5.0000000000000001e215 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 52.3%
Taylor expanded in x 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-/.f6487.6
Applied rewrites87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (fma (* y x) 9.0 b)))
(if (<= z -1.7e+21)
(/ (fma (* -4.0 t) a (/ t_1 z)) c)
(if (<= z 1.6e+32)
(/ (fma (* (* -4.0 z) a) t (fma (* y 9.0) x b)) (* z c))
(* (/ (fma -4.0 a (/ t_1 (* t z))) c) t)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma((y * x), 9.0, b);
double tmp;
if (z <= -1.7e+21) {
tmp = fma((-4.0 * t), a, (t_1 / z)) / c;
} else if (z <= 1.6e+32) {
tmp = fma(((-4.0 * z) * a), t, fma((y * 9.0), x, b)) / (z * c);
} else {
tmp = (fma(-4.0, a, (t_1 / (t * z))) / c) * t;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = fma(Float64(y * x), 9.0, b) tmp = 0.0 if (z <= -1.7e+21) tmp = Float64(fma(Float64(-4.0 * t), a, Float64(t_1 / z)) / c); elseif (z <= 1.6e+32) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * 9.0), x, b)) / Float64(z * c)); else tmp = Float64(Float64(fma(-4.0, a, Float64(t_1 / Float64(t * z))) / c) * t); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, If[LessEqual[z, -1.7e+21], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(t$95$1 / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 1.6e+32], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * 9.0), $MachinePrecision] * x + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * a + N[(t$95$1 / N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
\mathbf{if}\;z \leq -1.7 \cdot 10^{+21}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{t\_1}{z}\right)}{c}\\
\mathbf{elif}\;z \leq 1.6 \cdot 10^{+32}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot 9, x, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, a, \frac{t\_1}{t \cdot z}\right)}{c} \cdot t\\
\end{array}
\end{array}
if z < -1.7e21Initial program 63.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites92.0%
if -1.7e21 < z < 1.5999999999999999e32Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites94.3%
if 1.5999999999999999e32 < z Initial program 50.3%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites77.8%
Applied rewrites76.2%
Taylor expanded in t around inf
Applied rewrites77.9%
Applied rewrites81.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.7e+21) (not (<= z 1.4e-94))) (/ (fma (* -4.0 t) a (/ (fma (* y x) 9.0 b) z)) c) (/ (fma (* (* -4.0 z) a) t (fma (* y 9.0) x b)) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.7e+21) || !(z <= 1.4e-94)) {
tmp = fma((-4.0 * t), a, (fma((y * x), 9.0, b) / z)) / c;
} else {
tmp = fma(((-4.0 * z) * a), t, fma((y * 9.0), x, b)) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.7e+21) || !(z <= 1.4e-94)) tmp = Float64(fma(Float64(-4.0 * t), a, Float64(fma(Float64(y * x), 9.0, b) / z)) / c); else tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * 9.0), x, b)) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.7e+21], N[Not[LessEqual[z, 1.4e-94]], $MachinePrecision]], N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * 9.0), $MachinePrecision] * x + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.7 \cdot 10^{+21} \lor \neg \left(z \leq 1.4 \cdot 10^{-94}\right):\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot 9, x, b\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.7e21 or 1.3999999999999999e-94 < z Initial program 64.8%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites86.2%
if -1.7e21 < z < 1.3999999999999999e-94Initial program 98.0%
lift-+.f64N/A
lift--.f64N/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites96.2%
Final simplification90.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -5.5e+118)
(/ (fma (* -4.0 a) t (* (/ (* y x) z) 9.0)) c)
(if (<= z 8.6e+91)
(/ (fma (* (* -4.0 z) a) t (fma (* y 9.0) x b)) (* z c))
(* (fma (/ a c) -4.0 (/ b (* (* t z) c))) t))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -5.5e+118) {
tmp = fma((-4.0 * a), t, (((y * x) / z) * 9.0)) / c;
} else if (z <= 8.6e+91) {
tmp = fma(((-4.0 * z) * a), t, fma((y * 9.0), x, b)) / (z * c);
} else {
tmp = fma((a / c), -4.0, (b / ((t * z) * c))) * t;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -5.5e+118) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(Float64(Float64(y * x) / z) * 9.0)) / c); elseif (z <= 8.6e+91) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * 9.0), x, b)) / Float64(z * c)); else tmp = Float64(fma(Float64(a / c), -4.0, Float64(b / Float64(Float64(t * z) * c))) * t); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -5.5e+118], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 8.6e+91], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * 9.0), $MachinePrecision] * x + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a / c), $MachinePrecision] * -4.0 + N[(b / N[(N[(t * z), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -5.5 \cdot 10^{+118}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{y \cdot x}{z} \cdot 9\right)}{c}\\
\mathbf{elif}\;z \leq 8.6 \cdot 10^{+91}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot 9, x, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a}{c}, -4, \frac{b}{\left(t \cdot z\right) \cdot c}\right) \cdot t\\
\end{array}
\end{array}
if z < -5.5000000000000003e118Initial program 53.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites90.9%
Taylor expanded in b around 0
Applied rewrites76.6%
if -5.5000000000000003e118 < z < 8.6000000000000001e91Initial program 94.0%
lift-+.f64N/A
lift--.f64N/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
+-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites92.3%
if 8.6000000000000001e91 < z Initial program 42.7%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites76.7%
Applied rewrites72.6%
Taylor expanded in t around inf
Applied rewrites74.8%
Taylor expanded in x around 0
Applied rewrites72.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -3e+174)
(/ (fma (* -4.0 a) t (* (/ (* y x) z) 9.0)) c)
(if (<= z 8.6e+91)
(/ (fma (* 9.0 x) y (fma (* -4.0 z) (* a t) b)) (* z c))
(* (fma (/ a c) -4.0 (/ b (* (* t z) c))) t))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3e+174) {
tmp = fma((-4.0 * a), t, (((y * x) / z) * 9.0)) / c;
} else if (z <= 8.6e+91) {
tmp = fma((9.0 * x), y, fma((-4.0 * z), (a * t), b)) / (z * c);
} else {
tmp = fma((a / c), -4.0, (b / ((t * z) * c))) * t;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3e+174) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(Float64(Float64(y * x) / z) * 9.0)) / c); elseif (z <= 8.6e+91) tmp = Float64(fma(Float64(9.0 * x), y, fma(Float64(-4.0 * z), Float64(a * t), b)) / Float64(z * c)); else tmp = Float64(fma(Float64(a / c), -4.0, Float64(b / Float64(Float64(t * z) * c))) * t); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -3e+174], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 8.6e+91], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(-4.0 * z), $MachinePrecision] * N[(a * t), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(a / c), $MachinePrecision] * -4.0 + N[(b / N[(N[(t * z), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{+174}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{y \cdot x}{z} \cdot 9\right)}{c}\\
\mathbf{elif}\;z \leq 8.6 \cdot 10^{+91}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \mathsf{fma}\left(-4 \cdot z, a \cdot t, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{a}{c}, -4, \frac{b}{\left(t \cdot z\right) \cdot c}\right) \cdot t\\
\end{array}
\end{array}
if z < -3e174Initial program 44.3%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites89.2%
Taylor expanded in b around 0
Applied rewrites74.9%
if -3e174 < z < 8.6000000000000001e91Initial program 94.2%
lift-+.f64N/A
lift--.f64N/A
lift-*.f64N/A
fp-cancel-sub-sign-invN/A
associate-+l+N/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
distribute-lft-neg-inN/A
associate-*r*N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
*-commutativeN/A
lower-*.f6493.1
Applied rewrites93.1%
if 8.6000000000000001e91 < z Initial program 42.7%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites76.7%
Applied rewrites72.6%
Taylor expanded in t around inf
Applied rewrites74.8%
Taylor expanded in x around 0
Applied rewrites72.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= b -1e+65)
(/ (/ b c) z)
(if (<= b 6.2e-105)
(* (* t (/ a c)) -4.0)
(if (<= b 780000000.0) (/ (* (* x 9.0) y) (* z c)) (/ b (* c z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1e+65) {
tmp = (b / c) / z;
} else if (b <= 6.2e-105) {
tmp = (t * (a / c)) * -4.0;
} else if (b <= 780000000.0) {
tmp = ((x * 9.0) * y) / (z * c);
} else {
tmp = b / (c * z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
if (b <= (-1d+65)) then
tmp = (b / c) / z
else if (b <= 6.2d-105) then
tmp = (t * (a / c)) * (-4.0d0)
else if (b <= 780000000.0d0) then
tmp = ((x * 9.0d0) * y) / (z * c)
else
tmp = b / (c * z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -1e+65) {
tmp = (b / c) / z;
} else if (b <= 6.2e-105) {
tmp = (t * (a / c)) * -4.0;
} else if (b <= 780000000.0) {
tmp = ((x * 9.0) * y) / (z * c);
} else {
tmp = b / (c * z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1e+65: tmp = (b / c) / z elif b <= 6.2e-105: tmp = (t * (a / c)) * -4.0 elif b <= 780000000.0: tmp = ((x * 9.0) * y) / (z * c) else: tmp = b / (c * z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -1e+65) tmp = Float64(Float64(b / c) / z); elseif (b <= 6.2e-105) tmp = Float64(Float64(t * Float64(a / c)) * -4.0); elseif (b <= 780000000.0) tmp = Float64(Float64(Float64(x * 9.0) * y) / Float64(z * c)); else tmp = Float64(b / Float64(c * z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -1e+65)
tmp = (b / c) / z;
elseif (b <= 6.2e-105)
tmp = (t * (a / c)) * -4.0;
elseif (b <= 780000000.0)
tmp = ((x * 9.0) * y) / (z * c);
else
tmp = b / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -1e+65], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[b, 6.2e-105], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[b, 780000000.0], N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1 \cdot 10^{+65}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;b \leq 6.2 \cdot 10^{-105}:\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\mathbf{elif}\;b \leq 780000000:\\
\;\;\;\;\frac{\left(x \cdot 9\right) \cdot y}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\end{array}
\end{array}
if b < -9.9999999999999999e64Initial program 75.9%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6454.8
Applied rewrites54.8%
Applied rewrites62.3%
if -9.9999999999999999e64 < b < 6.20000000000000029e-105Initial program 74.5%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites83.4%
Applied rewrites80.7%
Taylor expanded in t around inf
Applied rewrites72.4%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6450.9
Applied rewrites50.9%
if 6.20000000000000029e-105 < b < 7.8e8Initial program 83.7%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites93.0%
Taylor expanded in x around inf
times-fracN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6445.0
Applied rewrites45.0%
Applied rewrites50.1%
if 7.8e8 < b Initial program 82.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6458.2
Applied rewrites58.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8e+20) (not (<= z 7e+90))) (* (* t (/ a c)) -4.0) (/ (fma (* y x) 9.0 b) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8e+20) || !(z <= 7e+90)) {
tmp = (t * (a / c)) * -4.0;
} else {
tmp = fma((y * x), 9.0, b) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8e+20) || !(z <= 7e+90)) tmp = Float64(Float64(t * Float64(a / c)) * -4.0); else tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8e+20], N[Not[LessEqual[z, 7e+90]], $MachinePrecision]], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{+20} \lor \neg \left(z \leq 7 \cdot 10^{+90}\right):\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -8e20 or 6.9999999999999997e90 < z Initial program 54.9%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites85.6%
Applied rewrites69.8%
Taylor expanded in t around inf
Applied rewrites68.9%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6455.9
Applied rewrites55.9%
if -8e20 < z < 6.9999999999999997e90Initial program 94.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6480.7
Applied rewrites80.7%
Final simplification70.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= b -1.02e+65) (not (<= b 3.5e+41))) (/ b (* c z)) (* (* t (/ a c)) -4.0)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((b <= -1.02e+65) || !(b <= 3.5e+41)) {
tmp = b / (c * z);
} else {
tmp = (t * (a / c)) * -4.0;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
if ((b <= (-1.02d+65)) .or. (.not. (b <= 3.5d+41))) then
tmp = b / (c * z)
else
tmp = (t * (a / c)) * (-4.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((b <= -1.02e+65) || !(b <= 3.5e+41)) {
tmp = b / (c * z);
} else {
tmp = (t * (a / c)) * -4.0;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (b <= -1.02e+65) or not (b <= 3.5e+41): tmp = b / (c * z) else: tmp = (t * (a / c)) * -4.0 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((b <= -1.02e+65) || !(b <= 3.5e+41)) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(t * Float64(a / c)) * -4.0); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((b <= -1.02e+65) || ~((b <= 3.5e+41)))
tmp = b / (c * z);
else
tmp = (t * (a / c)) * -4.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[b, -1.02e+65], N[Not[LessEqual[b, 3.5e+41]], $MachinePrecision]], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.02 \cdot 10^{+65} \lor \neg \left(b \leq 3.5 \cdot 10^{+41}\right):\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\end{array}
\end{array}
if b < -1.02000000000000005e65 or 3.4999999999999999e41 < b Initial program 78.0%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6458.6
Applied rewrites58.6%
if -1.02000000000000005e65 < b < 3.4999999999999999e41Initial program 77.6%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites86.1%
Applied rewrites82.2%
Taylor expanded in t around inf
Applied rewrites72.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6447.1
Applied rewrites47.1%
Final simplification51.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= b -1.02e+65) (not (<= b 4.8e+54))) (/ b (* c z)) (* -4.0 (/ (* a t) c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((b <= -1.02e+65) || !(b <= 4.8e+54)) {
tmp = b / (c * z);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
if ((b <= (-1.02d+65)) .or. (.not. (b <= 4.8d+54))) then
tmp = b / (c * z)
else
tmp = (-4.0d0) * ((a * t) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((b <= -1.02e+65) || !(b <= 4.8e+54)) {
tmp = b / (c * z);
} else {
tmp = -4.0 * ((a * t) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (b <= -1.02e+65) or not (b <= 4.8e+54): tmp = b / (c * z) else: tmp = -4.0 * ((a * t) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((b <= -1.02e+65) || !(b <= 4.8e+54)) tmp = Float64(b / Float64(c * z)); else tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((b <= -1.02e+65) || ~((b <= 4.8e+54)))
tmp = b / (c * z);
else
tmp = -4.0 * ((a * t) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[b, -1.02e+65], N[Not[LessEqual[b, 4.8e+54]], $MachinePrecision]], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.02 \cdot 10^{+65} \lor \neg \left(b \leq 4.8 \cdot 10^{+54}\right):\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\end{array}
\end{array}
if b < -1.02000000000000005e65 or 4.79999999999999997e54 < b Initial program 78.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6459.3
Applied rewrites59.3%
if -1.02000000000000005e65 < b < 4.79999999999999997e54Initial program 77.4%
Taylor expanded in z around inf
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6448.1
Applied rewrites48.1%
Final simplification52.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -5.6e+64) (/ (/ b c) z) (if (<= b 3.5e+41) (* (* t (/ a c)) -4.0) (/ b (* c z)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -5.6e+64) {
tmp = (b / c) / z;
} else if (b <= 3.5e+41) {
tmp = (t * (a / c)) * -4.0;
} else {
tmp = b / (c * z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) :: tmp
if (b <= (-5.6d+64)) then
tmp = (b / c) / z
else if (b <= 3.5d+41) then
tmp = (t * (a / c)) * (-4.0d0)
else
tmp = b / (c * z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -5.6e+64) {
tmp = (b / c) / z;
} else if (b <= 3.5e+41) {
tmp = (t * (a / c)) * -4.0;
} else {
tmp = b / (c * z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -5.6e+64: tmp = (b / c) / z elif b <= 3.5e+41: tmp = (t * (a / c)) * -4.0 else: tmp = b / (c * z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -5.6e+64) tmp = Float64(Float64(b / c) / z); elseif (b <= 3.5e+41) tmp = Float64(Float64(t * Float64(a / c)) * -4.0); else tmp = Float64(b / Float64(c * z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -5.6e+64)
tmp = (b / c) / z;
elseif (b <= 3.5e+41)
tmp = (t * (a / c)) * -4.0;
else
tmp = b / (c * z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -5.6e+64], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[b, 3.5e+41], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -5.6 \cdot 10^{+64}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;b \leq 3.5 \cdot 10^{+41}:\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\end{array}
\end{array}
if b < -5.60000000000000047e64Initial program 74.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6453.7
Applied rewrites53.7%
Applied rewrites61.1%
if -5.60000000000000047e64 < b < 3.4999999999999999e41Initial program 78.1%
Taylor expanded in x around 0
fp-cancel-sub-sign-invN/A
+-commutativeN/A
associate-*r/N/A
div-addN/A
*-commutativeN/A
associate-/r*N/A
metadata-evalN/A
associate-*r/N/A
div-add-revN/A
div-addN/A
associate-*r/N/A
+-commutativeN/A
metadata-evalN/A
fp-cancel-sub-sign-invN/A
lower-/.f64N/A
Applied rewrites86.6%
Applied rewrites82.8%
Taylor expanded in t around inf
Applied rewrites73.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f6447.4
Applied rewrites47.4%
if 3.4999999999999999e41 < b Initial program 79.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6462.1
Applied rewrites62.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* c z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 = b / (c * z)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (c * z)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(c * z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (c * z);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{c \cdot z}
\end{array}
Initial program 77.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6432.8
Applied rewrites32.8%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024339
(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)))