
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
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 (/ (* y (fma 9.0 (/ x z) (/ (fma -4.0 (* a t) (/ b z)) y))) c)))
(if (<= z -8.5e+43)
t_1
(if (<= z 550.0)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))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 = (y * fma(9.0, (x / z), (fma(-4.0, (a * t), (b / z)) / y))) / c;
double tmp;
if (z <= -8.5e+43) {
tmp = t_1;
} else if (z <= 550.0) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
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(y * fma(9.0, Float64(x / z), Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / y))) / c) tmp = 0.0 if (z <= -8.5e+43) tmp = t_1; elseif (z <= 550.0) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; 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 * N[(9.0 * N[(x / z), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -8.5e+43], t$95$1, If[LessEqual[z, 550.0], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\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{y \cdot \mathsf{fma}\left(9, \frac{x}{z}, \frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{y}\right)}{c}\\
\mathbf{if}\;z \leq -8.5 \cdot 10^{+43}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 550:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -8.5e43 or 550 < z Initial program 55.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites66.0%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites92.9%
if -8.5e43 < z < 550Initial program 97.4%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites95.2%
Final simplification94.0%
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 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (fma a (* -4.0 (* z t)) b)))
(if (<= t_1 -1e-202)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* z c))
(if (<= t_1 5e+95)
(/ (/ (fma x (* 9.0 y) t_2) z) c)
(if (<= t_1 INFINITY)
(/ (fma (* x 9.0) y t_2) (* z c))
(fma (/ (* x 9.0) c) (/ y 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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma(a, (-4.0 * (z * t)), b);
double tmp;
if (t_1 <= -1e-202) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (z * c);
} else if (t_1 <= 5e+95) {
tmp = (fma(x, (9.0 * y), t_2) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((x * 9.0), y, t_2) / (z * c);
} else {
tmp = fma(((x * 9.0) / c), (y / z), ((-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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = fma(a, Float64(-4.0 * Float64(z * t)), b) tmp = 0.0 if (t_1 <= -1e-202) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); elseif (t_1 <= 5e+95) tmp = Float64(Float64(fma(x, Float64(9.0 * y), t_2) / z) / c); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(x * 9.0), y, t_2) / Float64(z * c)); else tmp = fma(Float64(Float64(x * 9.0) / c), Float64(y / z), Float64(Float64(-4.0 * Float64(a * t)) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-202], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+95], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + t$95$2), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x * 9.0), $MachinePrecision] * y + t$95$2), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] / c), $MachinePrecision] * N[(y / z), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+95}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, t\_2\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, t\_2\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x \cdot 9}{c}, \frac{y}{z}, \frac{-4 \cdot \left(a \cdot t\right)}{c}\right)\\
\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)) < -1e-202Initial program 84.6%
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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if -1e-202 < (/.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)) < 5.00000000000000025e95Initial program 67.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.6%
if 5.00000000000000025e95 < (/.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.6%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6489.7
Applied rewrites89.7%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites45.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6495.4
Applied rewrites95.4%
Final simplification91.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 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (fma a (* -4.0 (* z t)) b)))
(if (<= t_1 -1e-202)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* z c))
(if (<= t_1 5e+95)
(/ (/ (fma x (* 9.0 y) t_2) z) c)
(if (<= t_1 INFINITY)
(/ (fma (* x 9.0) y t_2) (* z c))
(fma 9.0 (* y (/ x (* z c))) (/ (* -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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma(a, (-4.0 * (z * t)), b);
double tmp;
if (t_1 <= -1e-202) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (z * c);
} else if (t_1 <= 5e+95) {
tmp = (fma(x, (9.0 * y), t_2) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((x * 9.0), y, t_2) / (z * c);
} else {
tmp = fma(9.0, (y * (x / (z * c))), ((-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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = fma(a, Float64(-4.0 * Float64(z * t)), b) tmp = 0.0 if (t_1 <= -1e-202) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); elseif (t_1 <= 5e+95) tmp = Float64(Float64(fma(x, Float64(9.0 * y), t_2) / z) / c); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(x * 9.0), y, t_2) / Float64(z * c)); else tmp = fma(9.0, Float64(y * Float64(x / Float64(z * c))), Float64(Float64(-4.0 * Float64(a * t)) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-202], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+95], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + t$95$2), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x * 9.0), $MachinePrecision] * y + t$95$2), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(y * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+95}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, t\_2\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, t\_2\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(9, y \cdot \frac{x}{z \cdot c}, \frac{-4 \cdot \left(a \cdot t\right)}{c}\right)\\
\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)) < -1e-202Initial program 84.6%
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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if -1e-202 < (/.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)) < 5.00000000000000025e95Initial program 67.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.6%
if 5.00000000000000025e95 < (/.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.6%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6489.7
Applied rewrites89.7%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in x around 0
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
metadata-evalN/A
Applied rewrites60.8%
Taylor expanded in a around inf
Applied rewrites56.6%
Final simplification88.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
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (fma a (* -4.0 (* z t)) b)))
(if (<= t_1 -1e-202)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* z c))
(if (<= t_1 0.0)
(/ (/ (fma x (* 9.0 y) t_2) c) z)
(if (<= t_1 INFINITY)
(/ (fma (* x 9.0) y t_2) (* z c))
(fma 9.0 (* y (/ x (* z c))) (/ (* -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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma(a, (-4.0 * (z * t)), b);
double tmp;
if (t_1 <= -1e-202) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (z * c);
} else if (t_1 <= 0.0) {
tmp = (fma(x, (9.0 * y), t_2) / c) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((x * 9.0), y, t_2) / (z * c);
} else {
tmp = fma(9.0, (y * (x / (z * c))), ((-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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = fma(a, Float64(-4.0 * Float64(z * t)), b) tmp = 0.0 if (t_1 <= -1e-202) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(x, Float64(9.0 * y), t_2) / c) / z); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(x * 9.0), y, t_2) / Float64(z * c)); else tmp = fma(9.0, Float64(y * Float64(x / Float64(z * c))), Float64(Float64(-4.0 * Float64(a * t)) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-202], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + t$95$2), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x * 9.0), $MachinePrecision] * y + t$95$2), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(y * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, t\_2\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, t\_2\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(9, y \cdot \frac{x}{z \cdot c}, \frac{-4 \cdot \left(a \cdot t\right)}{c}\right)\\
\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)) < -1e-202Initial program 84.6%
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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if -1e-202 < (/.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 37.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites99.6%
if 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.4%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6491.5
Applied rewrites91.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in x around 0
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
metadata-evalN/A
Applied rewrites60.8%
Taylor expanded in a around inf
Applied rewrites56.6%
Final simplification88.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
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -1e-202)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* z c))
(if (<= t_1 0.0)
(/ (/ (fma 9.0 (* x y) b) z) c)
(if (<= t_1 INFINITY)
(/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))
(fma 9.0 (* y (/ x (* z c))) (/ (* -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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -1e-202) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (z * c);
} else if (t_1 <= 0.0) {
tmp = (fma(9.0, (x * y), b) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
} else {
tmp = fma(9.0, (y * (x / (z * c))), ((-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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-202) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / z) / c); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)); else tmp = fma(9.0, Float64(y * Float64(x / Float64(z * c))), Float64(Float64(-4.0 * Float64(a * t)) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-202], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(9.0 * N[(y * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(9, y \cdot \frac{x}{z \cdot c}, \frac{-4 \cdot \left(a \cdot t\right)}{c}\right)\\
\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)) < -1e-202Initial program 84.6%
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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if -1e-202 < (/.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 37.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6491.2
Applied rewrites91.2%
if 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.4%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6491.5
Applied rewrites91.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in x around 0
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
metadata-evalN/A
Applied rewrites60.8%
Taylor expanded in a around inf
Applied rewrites56.6%
Final simplification87.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
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -1e-202)
(/ (fma (* z -4.0) (* a t) (fma x (* 9.0 y) b)) (* z c))
(if (<= t_1 0.0)
(/ (/ (fma 9.0 (* x y) b) z) c)
(if (<= t_1 INFINITY)
(/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))
(/ (* y (/ (* x 9.0) 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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -1e-202) {
tmp = fma((z * -4.0), (a * t), fma(x, (9.0 * y), b)) / (z * c);
} else if (t_1 <= 0.0) {
tmp = (fma(9.0, (x * y), b) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
} else {
tmp = (y * ((x * 9.0) / 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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-202) tmp = Float64(fma(Float64(z * -4.0), Float64(a * t), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / z) / c); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)); else tmp = Float64(Float64(y * Float64(Float64(x * 9.0) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-202], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(a * t), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(y * N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-202}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, a \cdot t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot \frac{x \cdot 9}{z}}{c}\\
\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)) < -1e-202Initial program 84.6%
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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if -1e-202 < (/.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 37.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.8%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6491.2
Applied rewrites91.2%
if 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.4%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6491.5
Applied rewrites91.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites95.1%
Taylor expanded in x around inf
Applied rewrites44.2%
Final simplification86.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
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))))
(if (<= t_1 -1e-196)
t_2
(if (<= t_1 0.0)
(/ (/ (fma 9.0 (* x y) b) z) c)
(if (<= t_1 INFINITY) t_2 (/ (* y (/ (* x 9.0) 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 t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
double tmp;
if (t_1 <= -1e-196) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = (fma(9.0, (x * y), b) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = (y * ((x * 9.0) / 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) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-196) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / z) / c); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(Float64(y * Float64(Float64(x * 9.0) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-196], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(y * N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-196}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{y \cdot \frac{x \cdot 9}{z}}{c}\\
\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)) < -1e-196 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 88.0%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6488.0
Applied rewrites88.0%
if -1e-196 < (/.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 40.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.7%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6487.4
Applied rewrites87.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%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites7.0%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites95.1%
Taylor expanded in x around inf
Applied rewrites44.2%
Final simplification84.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
(let* ((t_1 (* y (* x 9.0))) (t_2 (/ (* y (/ (* x 9.0) z)) c)))
(if (<= t_1 -2e+262)
t_2
(if (<= t_1 -2e+46)
(/ (/ (fma 9.0 (* x y) b) z) c)
(if (<= t_1 4e-66)
(/ (fma (* z (* a t)) -4.0 b) (* z c))
(if (<= t_1 5e+207)
(/ (fma a (* -4.0 (* z t)) (* 9.0 (* x y))) (* z c))
t_2))))))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 = y * (x * 9.0);
double t_2 = (y * ((x * 9.0) / z)) / c;
double tmp;
if (t_1 <= -2e+262) {
tmp = t_2;
} else if (t_1 <= -2e+46) {
tmp = (fma(9.0, (x * y), b) / z) / c;
} else if (t_1 <= 4e-66) {
tmp = fma((z * (a * t)), -4.0, b) / (z * c);
} else if (t_1 <= 5e+207) {
tmp = fma(a, (-4.0 * (z * t)), (9.0 * (x * y))) / (z * c);
} else {
tmp = t_2;
}
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(y * Float64(x * 9.0)) t_2 = Float64(Float64(y * Float64(Float64(x * 9.0) / z)) / c) tmp = 0.0 if (t_1 <= -2e+262) tmp = t_2; elseif (t_1 <= -2e+46) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / z) / c); elseif (t_1 <= 4e-66) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(z * c)); elseif (t_1 <= 5e+207) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), Float64(9.0 * Float64(x * y))) / Float64(z * c)); else tmp = t_2; 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+262], t$95$2, If[LessEqual[t$95$1, -2e+46], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 4e-66], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+207], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]
\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 := y \cdot \left(x \cdot 9\right)\\
t_2 := \frac{y \cdot \frac{x \cdot 9}{z}}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+262}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+46}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-66}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+207}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), 9 \cdot \left(x \cdot y\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e262 or 4.9999999999999999e207 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 61.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites67.9%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites92.5%
Taylor expanded in x around inf
Applied rewrites82.3%
if -2e262 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e46Initial program 73.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.1%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6473.7
Applied rewrites73.7%
if -2e46 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 3.9999999999999999e-66Initial program 81.1%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6478.9
Applied rewrites78.9%
Applied rewrites84.6%
if 3.9999999999999999e-66 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.9999999999999999e207Initial program 81.7%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6472.9
Applied rewrites72.9%
Final simplification80.4%
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 (* y (* x 9.0))) (t_2 (/ (* y (/ (* x 9.0) z)) c)))
(if (<= t_1 -2e+262)
t_2
(if (<= t_1 -2e+46)
(/ (/ (fma 9.0 (* x y) b) z) c)
(if (<= t_1 5e+78)
(/ (fma (* z (* a t)) -4.0 b) (* z c))
(if (<= t_1 5e+207) (/ (/ (* 9.0 (* x y)) c) z) t_2))))))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 = y * (x * 9.0);
double t_2 = (y * ((x * 9.0) / z)) / c;
double tmp;
if (t_1 <= -2e+262) {
tmp = t_2;
} else if (t_1 <= -2e+46) {
tmp = (fma(9.0, (x * y), b) / z) / c;
} else if (t_1 <= 5e+78) {
tmp = fma((z * (a * t)), -4.0, b) / (z * c);
} else if (t_1 <= 5e+207) {
tmp = ((9.0 * (x * y)) / c) / z;
} else {
tmp = t_2;
}
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(y * Float64(x * 9.0)) t_2 = Float64(Float64(y * Float64(Float64(x * 9.0) / z)) / c) tmp = 0.0 if (t_1 <= -2e+262) tmp = t_2; elseif (t_1 <= -2e+46) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / z) / c); elseif (t_1 <= 5e+78) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(z * c)); elseif (t_1 <= 5e+207) tmp = Float64(Float64(Float64(9.0 * Float64(x * y)) / c) / z); else tmp = t_2; 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+262], t$95$2, If[LessEqual[t$95$1, -2e+46], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+78], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+207], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], t$95$2]]]]]]
\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 := y \cdot \left(x \cdot 9\right)\\
t_2 := \frac{y \cdot \frac{x \cdot 9}{z}}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+262}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+46}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+78}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+207}:\\
\;\;\;\;\frac{\frac{9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e262 or 4.9999999999999999e207 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 61.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites67.9%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites92.5%
Taylor expanded in x around inf
Applied rewrites82.3%
if -2e262 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e46Initial program 73.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.1%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6473.7
Applied rewrites73.7%
if -2e46 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999984e78Initial program 82.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6475.6
Applied rewrites75.6%
Applied rewrites80.3%
if 4.99999999999999984e78 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.9999999999999999e207Initial program 76.8%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites57.5%
Taylor expanded in z around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6476.5
Applied rewrites76.5%
Taylor expanded in x around inf
Applied rewrites80.5%
Final simplification80.0%
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 (* y (* x 9.0))) (t_2 (/ (* y (/ (* x 9.0) z)) c)))
(if (<= t_1 -2e+46)
t_2
(if (<= t_1 5e+78)
(/ (fma (* z (* a t)) -4.0 b) (* z c))
(if (<= t_1 5e+207) (/ (/ (* 9.0 (* x y)) c) z) t_2)))))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 = y * (x * 9.0);
double t_2 = (y * ((x * 9.0) / z)) / c;
double tmp;
if (t_1 <= -2e+46) {
tmp = t_2;
} else if (t_1 <= 5e+78) {
tmp = fma((z * (a * t)), -4.0, b) / (z * c);
} else if (t_1 <= 5e+207) {
tmp = ((9.0 * (x * y)) / c) / z;
} else {
tmp = t_2;
}
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(y * Float64(x * 9.0)) t_2 = Float64(Float64(y * Float64(Float64(x * 9.0) / z)) / c) tmp = 0.0 if (t_1 <= -2e+46) tmp = t_2; elseif (t_1 <= 5e+78) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(z * c)); elseif (t_1 <= 5e+207) tmp = Float64(Float64(Float64(9.0 * Float64(x * y)) / c) / z); else tmp = t_2; 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y * N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+46], t$95$2, If[LessEqual[t$95$1, 5e+78], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+207], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], t$95$2]]]]]
\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 := y \cdot \left(x \cdot 9\right)\\
t_2 := \frac{y \cdot \frac{x \cdot 9}{z}}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+46}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+78}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+207}:\\
\;\;\;\;\frac{\frac{9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e46 or 4.9999999999999999e207 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 66.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites72.2%
Taylor expanded in y around inf
lower-*.f64N/A
+-commutativeN/A
associate-+l+N/A
associate-*r/N/A
metadata-evalN/A
distribute-lft-neg-inN/A
distribute-frac-negN/A
sub-negN/A
*-commutativeN/A
associate-/r*N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
Applied rewrites91.5%
Taylor expanded in x around inf
Applied rewrites73.5%
if -2e46 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999984e78Initial program 82.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6475.6
Applied rewrites75.6%
Applied rewrites80.3%
if 4.99999999999999984e78 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.9999999999999999e207Initial program 76.8%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites57.5%
Taylor expanded in z around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6476.5
Applied rewrites76.5%
Taylor expanded in x around inf
Applied rewrites80.5%
Final simplification78.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
(let* ((t_1 (fma 9.0 (* y (/ x (* z c))) (/ (fma -4.0 (* a t) (/ b z)) c))))
(if (<= z -4.6e+24)
t_1
(if (<= z 1.35e-77)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))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(9.0, (y * (x / (z * c))), (fma(-4.0, (a * t), (b / z)) / c));
double tmp;
if (z <= -4.6e+24) {
tmp = t_1;
} else if (z <= 1.35e-77) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
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(9.0, Float64(y * Float64(x / Float64(z * c))), Float64(fma(-4.0, Float64(a * t), Float64(b / z)) / c)) tmp = 0.0 if (z <= -4.6e+24) tmp = t_1; elseif (z <= 1.35e-77) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; 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[(9.0 * N[(y * N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-4.0 * N[(a * t), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.6e+24], t$95$1, If[LessEqual[z, 1.35e-77], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\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(9, y \cdot \frac{x}{z \cdot c}, \frac{\mathsf{fma}\left(-4, a \cdot t, \frac{b}{z}\right)}{c}\right)\\
\mathbf{if}\;z \leq -4.6 \cdot 10^{+24}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.35 \cdot 10^{-77}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.5999999999999998e24 or 1.35e-77 < z Initial program 59.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites69.3%
Taylor expanded in x around 0
+-commutativeN/A
associate-+r+N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
metadata-evalN/A
distribute-rgt-neg-inN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
metadata-evalN/A
Applied rewrites86.1%
if -4.5999999999999998e24 < z < 1.35e-77Initial program 98.7%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites96.1%
Final simplification90.4%
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 (* y (* x 9.0))) (t_2 (/ (/ (* 9.0 (* x y)) c) z)))
(if (<= t_1 -2e+46)
t_2
(if (<= t_1 5e+78) (/ (fma (* z (* a t)) -4.0 b) (* z c)) t_2))))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 = y * (x * 9.0);
double t_2 = ((9.0 * (x * y)) / c) / z;
double tmp;
if (t_1 <= -2e+46) {
tmp = t_2;
} else if (t_1 <= 5e+78) {
tmp = fma((z * (a * t)), -4.0, b) / (z * c);
} else {
tmp = t_2;
}
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(y * Float64(x * 9.0)) t_2 = Float64(Float64(Float64(9.0 * Float64(x * y)) / c) / z) tmp = 0.0 if (t_1 <= -2e+46) tmp = t_2; elseif (t_1 <= 5e+78) tmp = Float64(fma(Float64(z * Float64(a * t)), -4.0, b) / Float64(z * c)); else tmp = t_2; 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+46], t$95$2, If[LessEqual[t$95$1, 5e+78], N[(N[(N[(z * N[(a * t), $MachinePrecision]), $MachinePrecision] * -4.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\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 := y \cdot \left(x \cdot 9\right)\\
t_2 := \frac{\frac{9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+46}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+78}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot \left(a \cdot t\right), -4, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e46 or 4.99999999999999984e78 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 68.5%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites71.9%
Taylor expanded in z around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6468.4
Applied rewrites68.4%
Taylor expanded in x around inf
Applied rewrites66.9%
if -2e46 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999984e78Initial program 82.0%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6475.6
Applied rewrites75.6%
Applied rewrites80.3%
Final simplification74.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 (* y (* x 9.0))))
(if (<= t_1 -1.0)
(/ (fma 9.0 (* x y) b) (* z c))
(if (<= t_1 5e+78)
(/ (fma a (* -4.0 (* z t)) b) (* z c))
(/ (/ (* 9.0 (* x y)) 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 t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -1.0) {
tmp = fma(9.0, (x * y), b) / (z * c);
} else if (t_1 <= 5e+78) {
tmp = fma(a, (-4.0 * (z * t)), b) / (z * c);
} else {
tmp = ((9.0 * (x * y)) / 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) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -1.0) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(z * c)); elseif (t_1 <= 5e+78) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), b) / Float64(z * c)); else tmp = Float64(Float64(Float64(9.0 * Float64(x * y)) / c) / 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1.0], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+78], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $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 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -1:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+78}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1Initial program 64.1%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6457.0
Applied rewrites57.0%
if -1 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999984e78Initial program 82.6%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6476.5
Applied rewrites76.5%
if 4.99999999999999984e78 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 74.9%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lower-/.f64N/A
Applied rewrites73.1%
Taylor expanded in z around 0
lower-/.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6476.2
Applied rewrites76.2%
Taylor expanded in x around inf
Applied rewrites76.6%
Final simplification71.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 (* -4.0 (* a t))))
(if (<= z -4.8e+78)
(/ t_1 c)
(if (<= z 4.2e-277)
(* x (* y (/ 9.0 (* z c))))
(if (<= z 8.8e-8) (/ b (* z c)) (* t_1 (/ 1.0 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 t_1 = -4.0 * (a * t);
double tmp;
if (z <= -4.8e+78) {
tmp = t_1 / c;
} else if (z <= 4.2e-277) {
tmp = x * (y * (9.0 / (z * c)));
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1 * (1.0 / 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) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * (a * t)
if (z <= (-4.8d+78)) then
tmp = t_1 / c
else if (z <= 4.2d-277) then
tmp = x * (y * (9.0d0 / (z * c)))
else if (z <= 8.8d-8) then
tmp = b / (z * c)
else
tmp = t_1 * (1.0d0 / 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 t_1 = -4.0 * (a * t);
double tmp;
if (z <= -4.8e+78) {
tmp = t_1 / c;
} else if (z <= 4.2e-277) {
tmp = x * (y * (9.0 / (z * c)));
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1 * (1.0 / 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): t_1 = -4.0 * (a * t) tmp = 0 if z <= -4.8e+78: tmp = t_1 / c elif z <= 4.2e-277: tmp = x * (y * (9.0 / (z * c))) elif z <= 8.8e-8: tmp = b / (z * c) else: tmp = t_1 * (1.0 / 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) t_1 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if (z <= -4.8e+78) tmp = Float64(t_1 / c); elseif (z <= 4.2e-277) tmp = Float64(x * Float64(y * Float64(9.0 / Float64(z * c)))); elseif (z <= 8.8e-8) tmp = Float64(b / Float64(z * c)); else tmp = Float64(t_1 * Float64(1.0 / 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)
t_1 = -4.0 * (a * t);
tmp = 0.0;
if (z <= -4.8e+78)
tmp = t_1 / c;
elseif (z <= 4.2e-277)
tmp = x * (y * (9.0 / (z * c)));
elseif (z <= 8.8e-8)
tmp = b / (z * c);
else
tmp = t_1 * (1.0 / 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_] := Block[{t$95$1 = N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.8e+78], N[(t$95$1 / c), $MachinePrecision], If[LessEqual[z, 4.2e-277], N[(x * N[(y * N[(9.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.8e-8], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(1.0 / 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}
t_1 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -4.8 \cdot 10^{+78}:\\
\;\;\;\;\frac{t\_1}{c}\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-277}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{9}{z \cdot c}\right)\\
\mathbf{elif}\;z \leq 8.8 \cdot 10^{-8}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1}{c}\\
\end{array}
\end{array}
if z < -4.7999999999999997e78Initial program 48.5%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6459.3
Applied rewrites59.3%
if -4.7999999999999997e78 < z < 4.1999999999999999e-277Initial program 97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites93.3%
Taylor expanded in x around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.6
Applied rewrites55.6%
if 4.1999999999999999e-277 < z < 8.7999999999999994e-8Initial program 93.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.1
Applied rewrites60.1%
if 8.7999999999999994e-8 < z Initial program 58.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lower-*.f64N/A
Applied rewrites70.5%
Taylor expanded in a around inf
lower-*.f64N/A
lower-*.f6454.2
Applied rewrites54.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
(let* ((t_1 (/ (* -4.0 (* a t)) c)))
(if (<= z -4.8e+78)
t_1
(if (<= z 4.2e-277)
(* x (* y (/ 9.0 (* z c))))
(if (<= z 8.8e-8) (/ b (* z c)) t_1)))))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 = (-4.0 * (a * t)) / c;
double tmp;
if (z <= -4.8e+78) {
tmp = t_1;
} else if (z <= 4.2e-277) {
tmp = x * (y * (9.0 / (z * c)));
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = ((-4.0d0) * (a * t)) / c
if (z <= (-4.8d+78)) then
tmp = t_1
else if (z <= 4.2d-277) then
tmp = x * (y * (9.0d0 / (z * c)))
else if (z <= 8.8d-8) then
tmp = b / (z * c)
else
tmp = t_1
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 t_1 = (-4.0 * (a * t)) / c;
double tmp;
if (z <= -4.8e+78) {
tmp = t_1;
} else if (z <= 4.2e-277) {
tmp = x * (y * (9.0 / (z * c)));
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
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): t_1 = (-4.0 * (a * t)) / c tmp = 0 if z <= -4.8e+78: tmp = t_1 elif z <= 4.2e-277: tmp = x * (y * (9.0 / (z * c))) elif z <= 8.8e-8: tmp = b / (z * c) else: tmp = t_1 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(-4.0 * Float64(a * t)) / c) tmp = 0.0 if (z <= -4.8e+78) tmp = t_1; elseif (z <= 4.2e-277) tmp = Float64(x * Float64(y * Float64(9.0 / Float64(z * c)))); elseif (z <= 8.8e-8) tmp = Float64(b / Float64(z * c)); else tmp = t_1; 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)
t_1 = (-4.0 * (a * t)) / c;
tmp = 0.0;
if (z <= -4.8e+78)
tmp = t_1;
elseif (z <= 4.2e-277)
tmp = x * (y * (9.0 / (z * c)));
elseif (z <= 8.8e-8)
tmp = b / (z * c);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -4.8e+78], t$95$1, If[LessEqual[z, 4.2e-277], N[(x * N[(y * N[(9.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.8e-8], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\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{-4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{if}\;z \leq -4.8 \cdot 10^{+78}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-277}:\\
\;\;\;\;x \cdot \left(y \cdot \frac{9}{z \cdot c}\right)\\
\mathbf{elif}\;z \leq 8.8 \cdot 10^{-8}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.7999999999999997e78 or 8.7999999999999994e-8 < z Initial program 53.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6456.3
Applied rewrites56.3%
if -4.7999999999999997e78 < z < 4.1999999999999999e-277Initial program 97.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites93.3%
Taylor expanded in x around inf
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.6
Applied rewrites55.6%
if 4.1999999999999999e-277 < z < 8.7999999999999994e-8Initial program 93.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.1
Applied rewrites60.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
(let* ((t_1 (* -4.0 (* a t))))
(if (<= z -2.1e+128)
(/ t_1 c)
(if (<= z 2.3e+117) (/ (fma 9.0 (* x y) b) (* z c)) (* t_1 (/ 1.0 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 t_1 = -4.0 * (a * t);
double tmp;
if (z <= -2.1e+128) {
tmp = t_1 / c;
} else if (z <= 2.3e+117) {
tmp = fma(9.0, (x * y), b) / (z * c);
} else {
tmp = t_1 * (1.0 / 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) t_1 = Float64(-4.0 * Float64(a * t)) tmp = 0.0 if (z <= -2.1e+128) tmp = Float64(t_1 / c); elseif (z <= 2.3e+117) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(z * c)); else tmp = Float64(t_1 * Float64(1.0 / 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_] := Block[{t$95$1 = N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.1e+128], N[(t$95$1 / c), $MachinePrecision], If[LessEqual[z, 2.3e+117], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * N[(1.0 / 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}
t_1 := -4 \cdot \left(a \cdot t\right)\\
\mathbf{if}\;z \leq -2.1 \cdot 10^{+128}:\\
\;\;\;\;\frac{t\_1}{c}\\
\mathbf{elif}\;z \leq 2.3 \cdot 10^{+117}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1}{c}\\
\end{array}
\end{array}
if z < -2.1e128Initial program 35.2%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6465.4
Applied rewrites65.4%
if -2.1e128 < z < 2.29999999999999988e117Initial program 92.3%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6474.1
Applied rewrites74.1%
if 2.29999999999999988e117 < z Initial program 50.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
div-invN/A
lower-*.f64N/A
Applied rewrites62.5%
Taylor expanded in a around inf
lower-*.f64N/A
lower-*.f6461.1
Applied rewrites61.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 (<= b -1.5e+48) (/ b (* z c)) (if (<= b 950000000000.0) (/ (* -4.0 (* a t)) c) (/ (/ 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 (b <= -1.5e+48) {
tmp = b / (z * c);
} else if (b <= 950000000000.0) {
tmp = (-4.0 * (a * t)) / c;
} else {
tmp = (b / z) / 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.5d+48)) then
tmp = b / (z * c)
else if (b <= 950000000000.0d0) then
tmp = ((-4.0d0) * (a * t)) / c
else
tmp = (b / z) / 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.5e+48) {
tmp = b / (z * c);
} else if (b <= 950000000000.0) {
tmp = (-4.0 * (a * t)) / c;
} else {
tmp = (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]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -1.5e+48: tmp = b / (z * c) elif b <= 950000000000.0: tmp = (-4.0 * (a * t)) / c else: tmp = (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 (b <= -1.5e+48) tmp = Float64(b / Float64(z * c)); elseif (b <= 950000000000.0) tmp = Float64(Float64(-4.0 * Float64(a * t)) / c); else tmp = Float64(Float64(b / z) / 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.5e+48)
tmp = b / (z * c);
elseif (b <= 950000000000.0)
tmp = (-4.0 * (a * t)) / c;
else
tmp = (b / z) / 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[LessEqual[b, -1.5e+48], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 950000000000.0], N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b / z), $MachinePrecision] / c), $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.5 \cdot 10^{+48}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 950000000000:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\end{array}
\end{array}
if b < -1.5e48Initial program 79.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.9
Applied rewrites64.9%
if -1.5e48 < b < 9.5e11Initial program 72.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6449.7
Applied rewrites49.7%
if 9.5e11 < b Initial program 83.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites88.0%
Taylor expanded in b around inf
lower-/.f6458.4
Applied rewrites58.4%
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 -1.5e+48) (/ b (* z c)) (if (<= b 950000000000.0) (/ (* -4.0 (* a t)) 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 <= -1.5e+48) {
tmp = b / (z * c);
} else if (b <= 950000000000.0) {
tmp = (-4.0 * (a * t)) / 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 <= (-1.5d+48)) then
tmp = b / (z * c)
else if (b <= 950000000000.0d0) then
tmp = ((-4.0d0) * (a * t)) / 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 <= -1.5e+48) {
tmp = b / (z * c);
} else if (b <= 950000000000.0) {
tmp = (-4.0 * (a * t)) / 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 <= -1.5e+48: tmp = b / (z * c) elif b <= 950000000000.0: tmp = (-4.0 * (a * t)) / 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 <= -1.5e+48) tmp = Float64(b / Float64(z * c)); elseif (b <= 950000000000.0) tmp = Float64(Float64(-4.0 * Float64(a * t)) / c); else tmp = Float64(Float64(b / 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 <= -1.5e+48)
tmp = b / (z * c);
elseif (b <= 950000000000.0)
tmp = (-4.0 * (a * t)) / 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, -1.5e+48], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 950000000000.0], N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $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.5 \cdot 10^{+48}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;b \leq 950000000000:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -1.5e48Initial program 79.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.9
Applied rewrites64.9%
if -1.5e48 < b < 9.5e11Initial program 72.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6449.7
Applied rewrites49.7%
if 9.5e11 < b Initial program 83.9%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6454.4
Applied rewrites54.4%
Applied rewrites58.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 (let* ((t_1 (/ (* -4.0 (* a t)) c))) (if (<= z -3.2e+61) t_1 (if (<= z 8.8e-8) (/ b (* z c)) t_1))))
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 = (-4.0 * (a * t)) / c;
double tmp;
if (z <= -3.2e+61) {
tmp = t_1;
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = ((-4.0d0) * (a * t)) / c
if (z <= (-3.2d+61)) then
tmp = t_1
else if (z <= 8.8d-8) then
tmp = b / (z * c)
else
tmp = t_1
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 t_1 = (-4.0 * (a * t)) / c;
double tmp;
if (z <= -3.2e+61) {
tmp = t_1;
} else if (z <= 8.8e-8) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
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): t_1 = (-4.0 * (a * t)) / c tmp = 0 if z <= -3.2e+61: tmp = t_1 elif z <= 8.8e-8: tmp = b / (z * c) else: tmp = t_1 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(-4.0 * Float64(a * t)) / c) tmp = 0.0 if (z <= -3.2e+61) tmp = t_1; elseif (z <= 8.8e-8) tmp = Float64(b / Float64(z * c)); else tmp = t_1; 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)
t_1 = (-4.0 * (a * t)) / c;
tmp = 0.0;
if (z <= -3.2e+61)
tmp = t_1;
elseif (z <= 8.8e-8)
tmp = b / (z * c);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -3.2e+61], t$95$1, If[LessEqual[z, 8.8e-8], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\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{-4 \cdot \left(a \cdot t\right)}{c}\\
\mathbf{if}\;z \leq -3.2 \cdot 10^{+61}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.8 \cdot 10^{-8}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -3.1999999999999998e61 or 8.7999999999999994e-8 < z Initial program 55.2%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6453.7
Applied rewrites53.7%
if -3.1999999999999998e61 < z < 8.7999999999999994e-8Initial program 97.4%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6453.7
Applied rewrites53.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 (/ 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) {
return b / (z * c);
}
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 / (z * c)
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 / (z * c);
}
[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 / (z * c)
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(z * c)) 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 / (z * c);
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[(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])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 76.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6435.9
Applied rewrites35.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 2024219
(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)))