
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -2.4e-67)
(/ (fma (* a t) -4.0 (fma (/ (* y x) z) 9.0 (/ b z))) c)
(if (<= z 1.75e-20)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c))
(fma (* (/ x (* z c)) 9.0) y (fma (* (/ a c) t) -4.0 (/ b (* z c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.4e-67) {
tmp = fma((a * t), -4.0, fma(((y * x) / z), 9.0, (b / z))) / c;
} else if (z <= 1.75e-20) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c);
} else {
tmp = fma(((x / (z * c)) * 9.0), y, fma(((a / c) * t), -4.0, (b / (z * c))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.4e-67) tmp = Float64(fma(Float64(a * t), -4.0, fma(Float64(Float64(y * x) / z), 9.0, Float64(b / z))) / c); elseif (z <= 1.75e-20) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c)); else tmp = fma(Float64(Float64(x / Float64(z * c)) * 9.0), y, fma(Float64(Float64(a / c) * t), -4.0, Float64(b / Float64(z * c)))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.4e-67], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 1.75e-20], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0 + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.4 \cdot 10^{-67}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \mathsf{fma}\left(\frac{y \cdot x}{z}, 9, \frac{b}{z}\right)\right)}{c}\\
\mathbf{elif}\;z \leq 1.75 \cdot 10^{-20}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{z \cdot c} \cdot 9, y, \mathsf{fma}\left(\frac{a}{c} \cdot t, -4, \frac{b}{z \cdot c}\right)\right)\\
\end{array}
\end{array}
if z < -2.4e-67Initial program 75.1%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Taylor expanded in c around 0
Applied rewrites97.3%
if -2.4e-67 < z < 1.75000000000000002e-20Initial program 97.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites97.4%
if 1.75000000000000002e-20 < z Initial program 50.7%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6479.3
Applied rewrites79.3%
Applied rewrites87.8%
Final simplification94.8%
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 (/ (+ (- (* (* 9.0 x) y) (* (* (* 4.0 z) t) a)) b) (* z c)))
(t_2 (/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c))))
(if (<= t_1 -4e-80)
t_2
(if (<= t_1 0.0)
(/ (fma (* -4.0 a) t (/ b z)) c)
(if (<= t_1 INFINITY) t_2 (/ (* -4.0 a) (/ c t)))))))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 = ((((9.0 * x) * y) - (((4.0 * z) * t) * a)) + b) / (z * c);
double t_2 = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c);
double tmp;
if (t_1 <= -4e-80) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
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(Float64(Float64(Float64(9.0 * x) * y) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(z * c)) t_2 = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c)) tmp = 0.0 if (t_1 <= -4e-80) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e-80], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\left(\left(9 \cdot x\right) \cdot y - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}\\
t_2 := \frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{-80}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\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)) < -3.99999999999999985e-80 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 91.8%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites90.8%
if -3.99999999999999985e-80 < (/.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 62.2%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6473.8
Applied rewrites73.8%
Taylor expanded in z around -inf
Applied rewrites84.4%
Taylor expanded in c around -inf
Applied rewrites99.7%
Taylor expanded in x around 0
Applied rewrites86.6%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f649.5
Applied rewrites9.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6461.2
Applied rewrites61.2%
Applied rewrites86.9%
Final simplification89.9%
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 (* (* 9.0 x) y))
(t_2 (/ (fma (* -4.0 t) a (* (/ (* y x) z) 9.0)) c)))
(if (<= t_1 -2e-83)
t_2
(if (<= t_1 1e-268)
(/ (fma (* -4.0 a) t (/ b z)) c)
(if (<= t_1 5e+55) (fma (* -4.0 a) (/ t c) (/ b (* z c))) t_2)))))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 = (9.0 * x) * y;
double t_2 = fma((-4.0 * t), a, (((y * x) / z) * 9.0)) / c;
double tmp;
if (t_1 <= -2e-83) {
tmp = t_2;
} else if (t_1 <= 1e-268) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else if (t_1 <= 5e+55) {
tmp = fma((-4.0 * a), (t / c), (b / (z * c)));
} else {
tmp = t_2;
}
return tmp;
}
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(9.0 * x) * y) t_2 = Float64(fma(Float64(-4.0 * t), a, Float64(Float64(Float64(y * x) / z) * 9.0)) / c) tmp = 0.0 if (t_1 <= -2e-83) tmp = t_2; elseif (t_1 <= 1e-268) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c); elseif (t_1 <= 5e+55) tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(-4.0 * t), $MachinePrecision] * a + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-83], t$95$2, If[LessEqual[t$95$1, 1e-268], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+55], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \frac{\mathsf{fma}\left(-4 \cdot t, a, \frac{y \cdot x}{z} \cdot 9\right)}{c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-83}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{-268}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+55}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2.0000000000000001e-83 or 5.00000000000000046e55 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 79.3%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6473.8
Applied rewrites73.8%
Taylor expanded in z around -inf
Applied rewrites84.0%
Taylor expanded in c around -inf
Applied rewrites84.6%
Taylor expanded in b around 0
Applied rewrites78.5%
if -2.0000000000000001e-83 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999958e-269Initial program 76.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.8
Applied rewrites84.8%
Taylor expanded in z around -inf
Applied rewrites83.6%
Taylor expanded in c around -inf
Applied rewrites94.3%
Taylor expanded in x around 0
Applied rewrites91.9%
if 9.99999999999999958e-269 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.00000000000000046e55Initial program 77.7%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6463.4
Applied rewrites63.4%
Taylor expanded in z around -inf
Applied rewrites86.9%
Taylor expanded in x around 0
Applied rewrites77.2%
Final simplification82.3%
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 (* (* 9.0 x) y)))
(if (<= t_1 -4e+121)
(/ (fma (* (* -4.0 t) z) a (* (* y x) 9.0)) (* z c))
(if (<= t_1 1e-268)
(/ (fma (* -4.0 a) t (/ b z)) c)
(if (<= t_1 1e+99)
(fma (* -4.0 a) (/ t c) (/ b (* z c)))
(/ (/ (fma (* y x) 9.0 b) z) 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 = (9.0 * x) * y;
double tmp;
if (t_1 <= -4e+121) {
tmp = fma(((-4.0 * t) * z), a, ((y * x) * 9.0)) / (z * c);
} else if (t_1 <= 1e-268) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else if (t_1 <= 1e+99) {
tmp = fma((-4.0 * a), (t / c), (b / (z * c)));
} else {
tmp = (fma((y * x), 9.0, b) / z) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -4e+121) tmp = Float64(fma(Float64(Float64(-4.0 * t) * z), a, Float64(Float64(y * x) * 9.0)) / Float64(z * c)); elseif (t_1 <= 1e-268) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c); elseif (t_1 <= 1e+99) tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(b / Float64(z * c))); else tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+121], N[(N[(N[(N[(-4.0 * t), $MachinePrecision] * z), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-268], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 1e+99], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot t\right) \cdot z, a, \left(y \cdot x\right) \cdot 9\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 10^{-268}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 10^{+99}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z}}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121Initial program 87.8%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
associate--l+N/A
associate-*r/N/A
div-subN/A
lower-fma.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Taylor expanded in x around inf
Applied rewrites75.2%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6483.7
Applied rewrites83.7%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999958e-269Initial program 75.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Taylor expanded in z around -inf
Applied rewrites83.4%
Taylor expanded in c around -inf
Applied rewrites92.2%
Taylor expanded in x around 0
Applied rewrites84.0%
if 9.99999999999999958e-269 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.6%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6460.1
Applied rewrites60.1%
Taylor expanded in z around -inf
Applied rewrites83.8%
Taylor expanded in x around 0
Applied rewrites76.2%
if 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.2%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
Applied rewrites76.6%
Final simplification80.9%
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 (* (* 9.0 x) y)))
(if (<= t_1 -4e+121)
(/ (fma (* y x) 9.0 (* (* (* t z) a) -4.0)) (* z c))
(if (<= t_1 1e-268)
(/ (fma (* -4.0 a) t (/ b z)) c)
(if (<= t_1 1e+99)
(fma (* -4.0 a) (/ t c) (/ b (* z c)))
(/ (/ (fma (* y x) 9.0 b) z) 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 = (9.0 * x) * y;
double tmp;
if (t_1 <= -4e+121) {
tmp = fma((y * x), 9.0, (((t * z) * a) * -4.0)) / (z * c);
} else if (t_1 <= 1e-268) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else if (t_1 <= 1e+99) {
tmp = fma((-4.0 * a), (t / c), (b / (z * c)));
} else {
tmp = (fma((y * x), 9.0, b) / z) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_1 <= -4e+121) tmp = Float64(fma(Float64(y * x), 9.0, Float64(Float64(Float64(t * z) * a) * -4.0)) / Float64(z * c)); elseif (t_1 <= 1e-268) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c); elseif (t_1 <= 1e+99) tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(b / Float64(z * c))); else tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+121], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + N[(N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-268], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 1e+99], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, \left(\left(t \cdot z\right) \cdot a\right) \cdot -4\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 10^{-268}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 10^{+99}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{b}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z}}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121Initial program 87.8%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
associate--l+N/A
associate-*r/N/A
div-subN/A
lower-fma.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6487.8
Applied rewrites87.8%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6483.6
Applied rewrites83.6%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999958e-269Initial program 75.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Taylor expanded in z around -inf
Applied rewrites83.4%
Taylor expanded in c around -inf
Applied rewrites92.2%
Taylor expanded in x around 0
Applied rewrites84.0%
if 9.99999999999999958e-269 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.6%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6460.1
Applied rewrites60.1%
Taylor expanded in z around -inf
Applied rewrites83.8%
Taylor expanded in x around 0
Applied rewrites76.2%
if 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.2%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
Applied rewrites76.6%
Final simplification80.9%
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 (<= c 4e-20) (/ (- (/ (fma (* y x) 9.0 b) z) (* (* a t) 4.0)) c) (fma (* -4.0 a) (/ t c) (/ (fma (* (/ x c) -9.0) y (/ (- b) c)) (- z)))))
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 (c <= 4e-20) {
tmp = ((fma((y * x), 9.0, b) / z) - ((a * t) * 4.0)) / c;
} else {
tmp = fma((-4.0 * a), (t / c), (fma(((x / c) * -9.0), y, (-b / c)) / -z));
}
return tmp;
}
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 (c <= 4e-20) tmp = Float64(Float64(Float64(fma(Float64(y * x), 9.0, b) / z) - Float64(Float64(a * t) * 4.0)) / c); else tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(fma(Float64(Float64(x / c) * -9.0), y, Float64(Float64(-b) / c)) / Float64(-z))); end return tmp end
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[c, 4e-20], N[(N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] - N[(N[(a * t), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(N[(N[(N[(x / c), $MachinePrecision] * -9.0), $MachinePrecision] * y + N[((-b) / c), $MachinePrecision]), $MachinePrecision] / (-z)), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;c \leq 4 \cdot 10^{-20}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z} - \left(a \cdot t\right) \cdot 4}{c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{\mathsf{fma}\left(\frac{x}{c} \cdot -9, y, \frac{-b}{c}\right)}{-z}\right)\\
\end{array}
\end{array}
if c < 3.99999999999999978e-20Initial program 81.7%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6475.1
Applied rewrites75.1%
Taylor expanded in z around -inf
Applied rewrites80.4%
Taylor expanded in c around -inf
Applied rewrites91.7%
if 3.99999999999999978e-20 < c Initial program 69.9%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6474.7
Applied rewrites74.7%
Taylor expanded in z around -inf
Applied rewrites94.5%
Final simplification92.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (fma (* y x) 9.0 b)) (t_2 (* (* 9.0 x) y)))
(if (<= t_2 -4e+121)
(/ t_1 (* z c))
(if (<= t_2 1e+99) (/ (fma (* -4.0 a) t (/ b z)) c) (/ (/ t_1 z) c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma((y * x), 9.0, b);
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -4e+121) {
tmp = t_1 / (z * c);
} else if (t_2 <= 1e+99) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else {
tmp = (t_1 / z) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = fma(Float64(y * x), 9.0, b) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -4e+121) tmp = Float64(t_1 / Float64(z * c)); elseif (t_2 <= 1e+99) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / z)) / c); else tmp = Float64(Float64(t_1 / 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+121], N[(t$95$1 / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+99], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(t$95$1 / z), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
t_2 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;\frac{t\_1}{z \cdot c}\\
\mathbf{elif}\;t\_2 \leq 10^{+99}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t\_1}{z}}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121Initial program 87.8%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6479.4
Applied rewrites79.4%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.1%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6474.6
Applied rewrites74.6%
Taylor expanded in z around -inf
Applied rewrites83.5%
Taylor expanded in c around -inf
Applied rewrites87.8%
Taylor expanded in x around 0
Applied rewrites79.1%
if 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.2%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
Applied rewrites76.6%
Final simplification78.7%
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 (* (* 9.0 x) y)) (t_2 (/ (fma (* y x) 9.0 b) (* z c))))
(if (<= t_1 -4e+121)
t_2
(if (<= t_1 1e+99) (/ (fma (* -4.0 a) t (/ b z)) c) t_2))))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 = (9.0 * x) * y;
double t_2 = fma((y * x), 9.0, b) / (z * c);
double tmp;
if (t_1 <= -4e+121) {
tmp = t_2;
} else if (t_1 <= 1e+99) {
tmp = fma((-4.0 * a), t, (b / z)) / c;
} else {
tmp = t_2;
}
return tmp;
}
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(9.0 * x) * y) t_2 = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)) tmp = 0.0 if (t_1 <= -4e+121) tmp = t_2; elseif (t_1 <= 1e+99) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(b / 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+121], t$95$2, If[LessEqual[t$95$1, 1e+99], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+99}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121 or 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.2%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6478.0
Applied rewrites78.0%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.1%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6474.6
Applied rewrites74.6%
Taylor expanded in z around -inf
Applied rewrites83.5%
Taylor expanded in c around -inf
Applied rewrites87.8%
Taylor expanded in x around 0
Applied rewrites79.1%
Final simplification78.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -2.4e-67)
(/ (fma (* a t) -4.0 (fma (/ (* y x) z) 9.0 (/ b z))) c)
(if (<= z 2.5e+16)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c))
(/ (- (/ (fma (* y x) 9.0 b) z) (* (* a t) 4.0)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.4e-67) {
tmp = fma((a * t), -4.0, fma(((y * x) / z), 9.0, (b / z))) / c;
} else if (z <= 2.5e+16) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c);
} else {
tmp = ((fma((y * x), 9.0, b) / z) - ((a * t) * 4.0)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.4e-67) tmp = Float64(fma(Float64(a * t), -4.0, fma(Float64(Float64(y * x) / z), 9.0, Float64(b / z))) / c); elseif (z <= 2.5e+16) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(z * c)); else tmp = Float64(Float64(Float64(fma(Float64(y * x), 9.0, b) / z) - Float64(Float64(a * t) * 4.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. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.4e-67], N[(N[(N[(a * t), $MachinePrecision] * -4.0 + N[(N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision] * 9.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.5e+16], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] - N[(N[(a * t), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.4 \cdot 10^{-67}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4, \mathsf{fma}\left(\frac{y \cdot x}{z}, 9, \frac{b}{z}\right)\right)}{c}\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z} - \left(a \cdot t\right) \cdot 4}{c}\\
\end{array}
\end{array}
if z < -2.4e-67Initial program 75.1%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6482.6
Applied rewrites82.6%
Taylor expanded in c around 0
Applied rewrites97.3%
if -2.4e-67 < z < 2.5e16Initial program 95.9%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites96.0%
if 2.5e16 < z Initial program 46.5%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6479.4
Applied rewrites79.4%
Taylor expanded in z around -inf
Applied rewrites80.7%
Taylor expanded in c around -inf
Applied rewrites82.8%
Final simplification93.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ x (* z c))) (t_2 (* (* 9.0 x) y)))
(if (<= t_2 -4e+121)
(* (* t_1 y) 9.0)
(if (<= t_2 1e+99) (/ (* -4.0 a) (/ c t)) (* (* y 9.0) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = x / (z * c);
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -4e+121) {
tmp = (t_1 * y) * 9.0;
} else if (t_2 <= 1e+99) {
tmp = (-4.0 * a) / (c / t);
} else {
tmp = (y * 9.0) * t_1;
}
return tmp;
}
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) :: t_2
real(8) :: tmp
t_1 = x / (z * c)
t_2 = (9.0d0 * x) * y
if (t_2 <= (-4d+121)) then
tmp = (t_1 * y) * 9.0d0
else if (t_2 <= 1d+99) then
tmp = ((-4.0d0) * a) / (c / t)
else
tmp = (y * 9.0d0) * t_1
end if
code = tmp
end function
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 = x / (z * c);
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -4e+121) {
tmp = (t_1 * y) * 9.0;
} else if (t_2 <= 1e+99) {
tmp = (-4.0 * a) / (c / t);
} else {
tmp = (y * 9.0) * t_1;
}
return tmp;
}
[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 = x / (z * c) t_2 = (9.0 * x) * y tmp = 0 if t_2 <= -4e+121: tmp = (t_1 * y) * 9.0 elif t_2 <= 1e+99: tmp = (-4.0 * a) / (c / t) else: tmp = (y * 9.0) * t_1 return tmp
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(x / Float64(z * c)) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -4e+121) tmp = Float64(Float64(t_1 * y) * 9.0); elseif (t_2 <= 1e+99) tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); else tmp = Float64(Float64(y * 9.0) * t_1); end return tmp end
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 = x / (z * c);
t_2 = (9.0 * x) * y;
tmp = 0.0;
if (t_2 <= -4e+121)
tmp = (t_1 * y) * 9.0;
elseif (t_2 <= 1e+99)
tmp = (-4.0 * a) / (c / t);
else
tmp = (y * 9.0) * 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+121], N[(N[(t$95$1 * y), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t$95$2, 1e+99], N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision], N[(N[(y * 9.0), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z \cdot c}\\
t_2 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;\left(t\_1 \cdot y\right) \cdot 9\\
\mathbf{elif}\;t\_2 \leq 10^{+99}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\mathbf{else}:\\
\;\;\;\;\left(y \cdot 9\right) \cdot t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121Initial program 87.8%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6475.4
Applied rewrites75.4%
Taylor expanded in x around 0
Applied rewrites73.5%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6443.0
Applied rewrites43.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6447.9
Applied rewrites47.9%
Applied rewrites52.0%
if 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.2%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6469.9
Applied rewrites69.9%
Applied rewrites71.9%
Applied rewrites76.2%
Final simplification60.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (- (/ (fma (* y x) 9.0 b) z) (* (* a t) 4.0)) c)))
(if (<= z -2.4e-67)
t_1
(if (<= z 2.5e+16)
(/ (fma (* y 9.0) x (fma (* (* -4.0 z) a) t b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((fma((y * x), 9.0, b) / z) - ((a * t) * 4.0)) / c;
double tmp;
if (z <= -2.4e-67) {
tmp = t_1;
} else if (z <= 2.5e+16) {
tmp = fma((y * 9.0), x, fma(((-4.0 * z) * a), t, b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
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(Float64(fma(Float64(y * x), 9.0, b) / z) - Float64(Float64(a * t) * 4.0)) / c) tmp = 0.0 if (z <= -2.4e-67) tmp = t_1; elseif (z <= 2.5e+16) tmp = Float64(fma(Float64(y * 9.0), x, fma(Float64(Float64(-4.0 * z) * a), t, 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] - N[(N[(a * t), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -2.4e-67], t$95$1, If[LessEqual[z, 2.5e+16], N[(N[(N[(y * 9.0), $MachinePrecision] * x + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + 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])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z} - \left(a \cdot t\right) \cdot 4}{c}\\
\mathbf{if}\;z \leq -2.4 \cdot 10^{-67}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot 9, x, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -2.4e-67 or 2.5e16 < z Initial program 63.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6481.2
Applied rewrites81.2%
Taylor expanded in z around -inf
Applied rewrites79.1%
Taylor expanded in c around -inf
Applied rewrites91.1%
if -2.4e-67 < z < 2.5e16Initial program 95.9%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites96.0%
Final simplification93.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ x (* z c))) (t_2 (* (* 9.0 x) y)))
(if (<= t_2 -4e+121)
(* (* t_1 y) 9.0)
(if (<= t_2 1e+99) (* (/ t c) (* -4.0 a)) (* (* y 9.0) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = x / (z * c);
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -4e+121) {
tmp = (t_1 * y) * 9.0;
} else if (t_2 <= 1e+99) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = (y * 9.0) * t_1;
}
return tmp;
}
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) :: t_2
real(8) :: tmp
t_1 = x / (z * c)
t_2 = (9.0d0 * x) * y
if (t_2 <= (-4d+121)) then
tmp = (t_1 * y) * 9.0d0
else if (t_2 <= 1d+99) then
tmp = (t / c) * ((-4.0d0) * a)
else
tmp = (y * 9.0d0) * t_1
end if
code = tmp
end function
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 = x / (z * c);
double t_2 = (9.0 * x) * y;
double tmp;
if (t_2 <= -4e+121) {
tmp = (t_1 * y) * 9.0;
} else if (t_2 <= 1e+99) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = (y * 9.0) * t_1;
}
return tmp;
}
[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 = x / (z * c) t_2 = (9.0 * x) * y tmp = 0 if t_2 <= -4e+121: tmp = (t_1 * y) * 9.0 elif t_2 <= 1e+99: tmp = (t / c) * (-4.0 * a) else: tmp = (y * 9.0) * t_1 return tmp
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(x / Float64(z * c)) t_2 = Float64(Float64(9.0 * x) * y) tmp = 0.0 if (t_2 <= -4e+121) tmp = Float64(Float64(t_1 * y) * 9.0); elseif (t_2 <= 1e+99) tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); else tmp = Float64(Float64(y * 9.0) * t_1); end return tmp end
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 = x / (z * c);
t_2 = (9.0 * x) * y;
tmp = 0.0;
if (t_2 <= -4e+121)
tmp = (t_1 * y) * 9.0;
elseif (t_2 <= 1e+99)
tmp = (t / c) * (-4.0 * a);
else
tmp = (y * 9.0) * 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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+121], N[(N[(t$95$1 * y), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t$95$2, 1e+99], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(y * 9.0), $MachinePrecision] * t$95$1), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{x}{z \cdot c}\\
t_2 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;\left(t\_1 \cdot y\right) \cdot 9\\
\mathbf{elif}\;t\_2 \leq 10^{+99}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;\left(y \cdot 9\right) \cdot t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121Initial program 87.8%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6475.4
Applied rewrites75.4%
Taylor expanded in x around 0
Applied rewrites73.5%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6443.0
Applied rewrites43.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6447.9
Applied rewrites47.9%
Applied rewrites52.0%
if 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 76.2%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6469.9
Applied rewrites69.9%
Applied rewrites71.9%
Applied rewrites76.2%
Final simplification60.3%
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 (* (* 9.0 x) y)) (t_2 (* (* (/ x (* z c)) y) 9.0))) (if (<= t_1 -4e+121) t_2 (if (<= t_1 1e+99) (* (/ t c) (* -4.0 a)) t_2))))
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 = (9.0 * x) * y;
double t_2 = ((x / (z * c)) * y) * 9.0;
double tmp;
if (t_1 <= -4e+121) {
tmp = t_2;
} else if (t_1 <= 1e+99) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = t_2;
}
return tmp;
}
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) :: t_2
real(8) :: tmp
t_1 = (9.0d0 * x) * y
t_2 = ((x / (z * c)) * y) * 9.0d0
if (t_1 <= (-4d+121)) then
tmp = t_2
else if (t_1 <= 1d+99) then
tmp = (t / c) * ((-4.0d0) * a)
else
tmp = t_2
end if
code = tmp
end function
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 = (9.0 * x) * y;
double t_2 = ((x / (z * c)) * y) * 9.0;
double tmp;
if (t_1 <= -4e+121) {
tmp = t_2;
} else if (t_1 <= 1e+99) {
tmp = (t / c) * (-4.0 * a);
} else {
tmp = t_2;
}
return tmp;
}
[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 = (9.0 * x) * y t_2 = ((x / (z * c)) * y) * 9.0 tmp = 0 if t_1 <= -4e+121: tmp = t_2 elif t_1 <= 1e+99: tmp = (t / c) * (-4.0 * a) else: tmp = t_2 return tmp
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(9.0 * x) * y) t_2 = Float64(Float64(Float64(x / Float64(z * c)) * y) * 9.0) tmp = 0.0 if (t_1 <= -4e+121) tmp = t_2; elseif (t_1 <= 1e+99) tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); else tmp = t_2; end return tmp end
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 = (9.0 * x) * y;
t_2 = ((x / (z * c)) * y) * 9.0;
tmp = 0.0;
if (t_1 <= -4e+121)
tmp = t_2;
elseif (t_1 <= 1e+99)
tmp = (t / c) * (-4.0 * a);
else
tmp = t_2;
end
tmp_2 = tmp;
end
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x / N[(z * c), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] * 9.0), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+121], t$95$2, If[LessEqual[t$95$1, 1e+99], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(9 \cdot x\right) \cdot y\\
t_2 := \left(\frac{x}{z \cdot c} \cdot y\right) \cdot 9\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+121}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+99}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.00000000000000015e121 or 9.9999999999999997e98 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.2%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6472.7
Applied rewrites72.7%
Taylor expanded in x around 0
Applied rewrites74.8%
if -4.00000000000000015e121 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999997e98Initial program 76.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6443.0
Applied rewrites43.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6447.9
Applied rewrites47.9%
Applied rewrites52.0%
Final simplification60.3%
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 (<= a -1.82e-69)
(/ (fma -4.0 (* (* t z) a) b) (* z c))
(if (<= a 5.4e+76)
(/ (/ (fma (* y x) 9.0 b) z) c)
(fma (* -4.0 a) (/ t c) (/ b (* z 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 (a <= -1.82e-69) {
tmp = fma(-4.0, ((t * z) * a), b) / (z * c);
} else if (a <= 5.4e+76) {
tmp = (fma((y * x), 9.0, b) / z) / c;
} else {
tmp = fma((-4.0 * a), (t / c), (b / (z * c)));
}
return tmp;
}
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 (a <= -1.82e-69) tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c)); elseif (a <= 5.4e+76) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / z) / c); else tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(b / Float64(z * c))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.82e-69], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 5.4e+76], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.82 \cdot 10^{-69}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z \cdot c}\\
\mathbf{elif}\;a \leq 5.4 \cdot 10^{+76}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{b}{z \cdot c}\right)\\
\end{array}
\end{array}
if a < -1.82e-69Initial program 87.8%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6460.4
Applied rewrites60.4%
if -1.82e-69 < a < 5.3999999999999998e76Initial program 77.9%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6473.4
Applied rewrites73.4%
Applied rewrites77.0%
if 5.3999999999999998e76 < a Initial program 64.0%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6462.4
Applied rewrites62.4%
Taylor expanded in z around -inf
Applied rewrites90.4%
Taylor expanded in x around 0
Applied rewrites77.3%
Final simplification71.7%
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 (<= t -6.2e+187) (/ (fma -4.0 (* (* t z) a) b) (* z c)) (if (<= t 3.3e-40) (/ (fma (* y x) 9.0 b) (* z c)) (/ (* -4.0 a) (/ c t)))))
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 (t <= -6.2e+187) {
tmp = fma(-4.0, ((t * z) * a), b) / (z * c);
} else if (t <= 3.3e-40) {
tmp = fma((y * x), 9.0, b) / (z * c);
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
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 (t <= -6.2e+187) tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c)); elseif (t <= 3.3e-40) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)); else tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -6.2e+187], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.3e-40], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -6.2 \cdot 10^{+187}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z \cdot c}\\
\mathbf{elif}\;t \leq 3.3 \cdot 10^{-40}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\end{array}
\end{array}
if t < -6.20000000000000024e187Initial program 70.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.1
Applied rewrites66.1%
if -6.20000000000000024e187 < t < 3.29999999999999993e-40Initial program 83.9%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6471.7
Applied rewrites71.7%
if 3.29999999999999993e-40 < t Initial program 68.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6427.8
Applied rewrites27.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6444.4
Applied rewrites44.4%
Applied rewrites56.7%
Final simplification66.8%
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 (<= t -4.2e+183) (/ (* -4.0 t) (/ c a)) (if (<= t 3.3e-40) (/ (fma (* y x) 9.0 b) (* z c)) (/ (* -4.0 a) (/ c t)))))
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 (t <= -4.2e+183) {
tmp = (-4.0 * t) / (c / a);
} else if (t <= 3.3e-40) {
tmp = fma((y * x), 9.0, b) / (z * c);
} else {
tmp = (-4.0 * a) / (c / t);
}
return tmp;
}
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 (t <= -4.2e+183) tmp = Float64(Float64(-4.0 * t) / Float64(c / a)); elseif (t <= 3.3e-40) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)); else tmp = Float64(Float64(-4.0 * a) / Float64(c / t)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -4.2e+183], N[(N[(-4.0 * t), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.3e-40], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -4.2 \cdot 10^{+183}:\\
\;\;\;\;\frac{-4 \cdot t}{\frac{c}{a}}\\
\mathbf{elif}\;t \leq 3.3 \cdot 10^{-40}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot a}{\frac{c}{t}}\\
\end{array}
\end{array}
if t < -4.2e183Initial program 70.9%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6421.4
Applied rewrites21.4%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6466.0
Applied rewrites66.0%
Applied rewrites75.3%
Applied rewrites75.4%
if -4.2e183 < t < 3.29999999999999993e-40Initial program 83.9%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6471.7
Applied rewrites71.7%
if 3.29999999999999993e-40 < t Initial program 68.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6427.8
Applied rewrites27.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6444.4
Applied rewrites44.4%
Applied rewrites56.7%
Final simplification67.5%
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 (<= t -5.5e-39) (* (/ t c) (* -4.0 a)) (if (<= t 3.8e-183) (/ b (* z c)) (* (* -4.0 t) (/ a 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 (t <= -5.5e-39) {
tmp = (t / c) * (-4.0 * a);
} else if (t <= 3.8e-183) {
tmp = b / (z * c);
} else {
tmp = (-4.0 * t) * (a / c);
}
return tmp;
}
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 (t <= (-5.5d-39)) then
tmp = (t / c) * ((-4.0d0) * a)
else if (t <= 3.8d-183) then
tmp = b / (z * c)
else
tmp = ((-4.0d0) * t) * (a / c)
end if
code = tmp
end function
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 (t <= -5.5e-39) {
tmp = (t / c) * (-4.0 * a);
} else if (t <= 3.8e-183) {
tmp = b / (z * c);
} else {
tmp = (-4.0 * t) * (a / c);
}
return tmp;
}
[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 t <= -5.5e-39: tmp = (t / c) * (-4.0 * a) elif t <= 3.8e-183: tmp = b / (z * c) else: tmp = (-4.0 * t) * (a / c) return tmp
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 (t <= -5.5e-39) tmp = Float64(Float64(t / c) * Float64(-4.0 * a)); elseif (t <= 3.8e-183) tmp = Float64(b / Float64(z * c)); else tmp = Float64(Float64(-4.0 * t) * Float64(a / c)); end return tmp end
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 (t <= -5.5e-39)
tmp = (t / c) * (-4.0 * a);
elseif (t <= 3.8e-183)
tmp = b / (z * c);
else
tmp = (-4.0 * t) * (a / 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. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -5.5e-39], N[(N[(t / c), $MachinePrecision] * N[(-4.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.8e-183], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * t), $MachinePrecision] * N[(a / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -5.5 \cdot 10^{-39}:\\
\;\;\;\;\frac{t}{c} \cdot \left(-4 \cdot a\right)\\
\mathbf{elif}\;t \leq 3.8 \cdot 10^{-183}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(-4 \cdot t\right) \cdot \frac{a}{c}\\
\end{array}
\end{array}
if t < -5.50000000000000018e-39Initial program 76.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6427.9
Applied rewrites27.9%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6446.8
Applied rewrites46.8%
Applied rewrites52.4%
if -5.50000000000000018e-39 < t < 3.7999999999999996e-183Initial program 88.6%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6440.6
Applied rewrites40.6%
if 3.7999999999999996e-183 < t Initial program 71.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6429.7
Applied rewrites29.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6442.4
Applied rewrites42.4%
Applied rewrites51.9%
Final simplification48.4%
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 t) (/ a c)))) (if (<= t -5.5e-39) t_1 (if (<= t 3.8e-183) (/ b (* z c)) t_1))))
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 * t) * (a / c);
double tmp;
if (t <= -5.5e-39) {
tmp = t_1;
} else if (t <= 3.8e-183) {
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.
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) * t) * (a / c)
if (t <= (-5.5d-39)) then
tmp = t_1
else if (t <= 3.8d-183) 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;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (-4.0 * t) * (a / c);
double tmp;
if (t <= -5.5e-39) {
tmp = t_1;
} else if (t <= 3.8e-183) {
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]) def code(x, y, z, t, a, b, c): t_1 = (-4.0 * t) * (a / c) tmp = 0 if t <= -5.5e-39: tmp = t_1 elif t <= 3.8e-183: 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]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(-4.0 * t) * Float64(a / c)) tmp = 0.0 if (t <= -5.5e-39) tmp = t_1; elseif (t <= 3.8e-183) 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (-4.0 * t) * (a / c);
tmp = 0.0;
if (t <= -5.5e-39)
tmp = t_1;
elseif (t <= 3.8e-183)
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.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(-4.0 * t), $MachinePrecision] * N[(a / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -5.5e-39], t$95$1, If[LessEqual[t, 3.8e-183], 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])\\
\\
\begin{array}{l}
t_1 := \left(-4 \cdot t\right) \cdot \frac{a}{c}\\
\mathbf{if}\;t \leq -5.5 \cdot 10^{-39}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 3.8 \cdot 10^{-183}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -5.50000000000000018e-39 or 3.7999999999999996e-183 < t Initial program 73.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6429.0
Applied rewrites29.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6444.1
Applied rewrites44.1%
Applied rewrites52.6%
if -5.50000000000000018e-39 < t < 3.7999999999999996e-183Initial program 88.6%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6440.6
Applied rewrites40.6%
Final simplification48.7%
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);
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.
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;
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]) 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]) 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])){:}
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. 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])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 78.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6432.7
Applied rewrites32.7%
Final simplification32.7%
(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 2024332
(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)))