
(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 21 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) INFINITY)
(/ (fma (* 4.0 t) a (/ (fma (* 9.0 x) y b) (- z))) (- c))
(*
(- a)
(fma (/ t c) 4.0 (/ (fma (* (/ y c) 9.0) (/ x z) (/ b (* c z))) (- a))))))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 ((((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)) <= ((double) INFINITY)) {
tmp = fma((4.0 * t), a, (fma((9.0 * x), y, b) / -z)) / -c;
} else {
tmp = -a * fma((t / c), 4.0, (fma(((y / c) * 9.0), (x / z), (b / (c * z))) / -a));
}
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 (Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) <= Inf) tmp = Float64(fma(Float64(4.0 * t), a, Float64(fma(Float64(9.0 * x), y, b) / Float64(-z))) / Float64(-c)); else tmp = Float64(Float64(-a) * fma(Float64(t / c), 4.0, Float64(fma(Float64(Float64(y / c) * 9.0), Float64(x / z), Float64(b / Float64(c * z))) / Float64(-a)))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[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], Infinity], N[(N[(N[(4.0 * t), $MachinePrecision] * a + N[(N[(N[(9.0 * x), $MachinePrecision] * y + b), $MachinePrecision] / (-z)), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], N[((-a) * N[(N[(t / c), $MachinePrecision] * 4.0 + N[(N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision] + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-a)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;\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} \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(4 \cdot t, a, \frac{\mathsf{fma}\left(9 \cdot x, y, b\right)}{-z}\right)}{-c}\\
\mathbf{else}:\\
\;\;\;\;\left(-a\right) \cdot \mathsf{fma}\left(\frac{t}{c}, 4, \frac{\mathsf{fma}\left(\frac{y}{c} \cdot 9, \frac{x}{z}, \frac{b}{c \cdot z}\right)}{-a}\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)) < +inf.0Initial program 85.1%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites86.8%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6492.9
Applied rewrites92.9%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites92.9%
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 a around -inf
associate-*r*N/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
Applied rewrites94.7%
Final simplification93.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 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c))))
(if (<= t_1 -1e-283)
t_1
(if (<= t_1 0.0)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 INFINITY)
(/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* 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 = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
double tmp;
if (t_1 <= -1e-283) {
tmp = t_1;
} else if (t_1 <= 0.0) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
} else {
tmp = (-4.0 * a) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-283) tmp = t_1; elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); else tmp = Float64(Float64(-4.0 * a) * Float64(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[(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]}, If[LessEqual[t$95$1, -1e-283], t$95$1, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / 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{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-283}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{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)) < -9.99999999999999947e-284Initial program 92.4%
if -9.99999999999999947e-284 < (/.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 28.4%
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-*.f6467.2
Applied rewrites67.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 88.0%
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
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites89.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 z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6420.9
Applied rewrites20.9%
Applied rewrites54.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 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c))))
(if (<= t_1 -1e-283)
(/ (+ (fma (* a t) (* -4.0 z) (* y (* 9.0 x))) b) (* z c))
(if (<= t_1 0.0)
(/ (/ (fma (* y x) 9.0 b) c) z)
(if (<= t_1 INFINITY)
(/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* 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 = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
double tmp;
if (t_1 <= -1e-283) {
tmp = (fma((a * t), (-4.0 * z), (y * (9.0 * x))) + b) / (z * c);
} else if (t_1 <= 0.0) {
tmp = (fma((y * x), 9.0, b) / c) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
} else {
tmp = (-4.0 * a) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-283) tmp = Float64(Float64(fma(Float64(a * t), Float64(-4.0 * z), Float64(y * Float64(9.0 * x))) + b) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / c) / z); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); else tmp = Float64(Float64(-4.0 * a) * Float64(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[(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]}, If[LessEqual[t$95$1, -1e-283], N[(N[(N[(N[(a * t), $MachinePrecision] * N[(-4.0 * z), $MachinePrecision] + N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / 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{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-283}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot t, -4 \cdot z, y \cdot \left(9 \cdot x\right)\right) + b}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{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)) < -9.99999999999999947e-284Initial program 92.4%
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-eval91.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6491.4
Applied rewrites91.4%
if -9.99999999999999947e-284 < (/.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 28.4%
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-*.f6467.2
Applied rewrites67.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 88.0%
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
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites89.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 z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6420.9
Applied rewrites20.9%
Applied rewrites54.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 c) z))
(t_2 (* (* x 9.0) y))
(t_3 (* (* 9.0 x) (/ y (* c z)))))
(if (<= t_2 -5e+104)
t_3
(if (<= t_2 -4e+34)
(* (* -4.0 a) (/ t c))
(if (<= t_2 -4e-137)
t_1
(if (<= t_2 5e-58)
(/ (* a -4.0) (/ c t))
(if (<= t_2 5e+15) t_1 t_3)))))))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 / c) / z;
double t_2 = (x * 9.0) * y;
double t_3 = (9.0 * x) * (y / (c * z));
double tmp;
if (t_2 <= -5e+104) {
tmp = t_3;
} else if (t_2 <= -4e+34) {
tmp = (-4.0 * a) * (t / c);
} else if (t_2 <= -4e-137) {
tmp = t_1;
} else if (t_2 <= 5e-58) {
tmp = (a * -4.0) / (c / t);
} else if (t_2 <= 5e+15) {
tmp = t_1;
} else {
tmp = t_3;
}
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) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (b / c) / z
t_2 = (x * 9.0d0) * y
t_3 = (9.0d0 * x) * (y / (c * z))
if (t_2 <= (-5d+104)) then
tmp = t_3
else if (t_2 <= (-4d+34)) then
tmp = ((-4.0d0) * a) * (t / c)
else if (t_2 <= (-4d-137)) then
tmp = t_1
else if (t_2 <= 5d-58) then
tmp = (a * (-4.0d0)) / (c / t)
else if (t_2 <= 5d+15) then
tmp = t_1
else
tmp = t_3
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 = (b / c) / z;
double t_2 = (x * 9.0) * y;
double t_3 = (9.0 * x) * (y / (c * z));
double tmp;
if (t_2 <= -5e+104) {
tmp = t_3;
} else if (t_2 <= -4e+34) {
tmp = (-4.0 * a) * (t / c);
} else if (t_2 <= -4e-137) {
tmp = t_1;
} else if (t_2 <= 5e-58) {
tmp = (a * -4.0) / (c / t);
} else if (t_2 <= 5e+15) {
tmp = t_1;
} else {
tmp = t_3;
}
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 = (b / c) / z t_2 = (x * 9.0) * y t_3 = (9.0 * x) * (y / (c * z)) tmp = 0 if t_2 <= -5e+104: tmp = t_3 elif t_2 <= -4e+34: tmp = (-4.0 * a) * (t / c) elif t_2 <= -4e-137: tmp = t_1 elif t_2 <= 5e-58: tmp = (a * -4.0) / (c / t) elif t_2 <= 5e+15: tmp = t_1 else: tmp = t_3 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 / c) / z) t_2 = Float64(Float64(x * 9.0) * y) t_3 = Float64(Float64(9.0 * x) * Float64(y / Float64(c * z))) tmp = 0.0 if (t_2 <= -5e+104) tmp = t_3; elseif (t_2 <= -4e+34) tmp = Float64(Float64(-4.0 * a) * Float64(t / c)); elseif (t_2 <= -4e-137) tmp = t_1; elseif (t_2 <= 5e-58) tmp = Float64(Float64(a * -4.0) / Float64(c / t)); elseif (t_2 <= 5e+15) tmp = t_1; else tmp = t_3; 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 = (b / c) / z;
t_2 = (x * 9.0) * y;
t_3 = (9.0 * x) * (y / (c * z));
tmp = 0.0;
if (t_2 <= -5e+104)
tmp = t_3;
elseif (t_2 <= -4e+34)
tmp = (-4.0 * a) * (t / c);
elseif (t_2 <= -4e-137)
tmp = t_1;
elseif (t_2 <= 5e-58)
tmp = (a * -4.0) / (c / t);
elseif (t_2 <= 5e+15)
tmp = t_1;
else
tmp = t_3;
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[(b / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$3 = N[(N[(9.0 * x), $MachinePrecision] * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+104], t$95$3, If[LessEqual[t$95$2, -4e+34], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e-137], t$95$1, If[LessEqual[t$95$2, 5e-58], N[(N[(a * -4.0), $MachinePrecision] / N[(c / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+15], t$95$1, t$95$3]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{b}{c}}{z}\\
t_2 := \left(x \cdot 9\right) \cdot y\\
t_3 := \left(9 \cdot x\right) \cdot \frac{y}{c \cdot z}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+104}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{+34}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{c}\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{-137}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{-58}:\\
\;\;\;\;\frac{a \cdot -4}{\frac{c}{t}}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+15}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104 or 5e15 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 73.5%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites78.4%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6482.2
Applied rewrites82.2%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6473.3
Applied rewrites73.3%
Applied rewrites69.6%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999978e34Initial program 88.3%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6463.0
Applied rewrites63.0%
Applied rewrites68.1%
if -3.99999999999999978e34 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999991e-137 or 4.99999999999999977e-58 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e15Initial program 78.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6456.4
Applied rewrites56.4%
Applied rewrites66.2%
if -3.99999999999999991e-137 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999977e-58Initial program 82.6%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6451.7
Applied rewrites51.7%
Applied rewrites52.4%
Applied rewrites52.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 (/ (/ b c) z))
(t_2 (* (* -4.0 a) (/ t c)))
(t_3 (* (* x 9.0) y))
(t_4 (* (* 9.0 x) (/ y (* c z)))))
(if (<= t_3 -5e+104)
t_4
(if (<= t_3 -4e+34)
t_2
(if (<= t_3 -4e-137)
t_1
(if (<= t_3 5e-58) t_2 (if (<= t_3 5e+15) t_1 t_4)))))))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 / c) / z;
double t_2 = (-4.0 * a) * (t / c);
double t_3 = (x * 9.0) * y;
double t_4 = (9.0 * x) * (y / (c * z));
double tmp;
if (t_3 <= -5e+104) {
tmp = t_4;
} else if (t_3 <= -4e+34) {
tmp = t_2;
} else if (t_3 <= -4e-137) {
tmp = t_1;
} else if (t_3 <= 5e-58) {
tmp = t_2;
} else if (t_3 <= 5e+15) {
tmp = t_1;
} else {
tmp = t_4;
}
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) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_1 = (b / c) / z
t_2 = ((-4.0d0) * a) * (t / c)
t_3 = (x * 9.0d0) * y
t_4 = (9.0d0 * x) * (y / (c * z))
if (t_3 <= (-5d+104)) then
tmp = t_4
else if (t_3 <= (-4d+34)) then
tmp = t_2
else if (t_3 <= (-4d-137)) then
tmp = t_1
else if (t_3 <= 5d-58) then
tmp = t_2
else if (t_3 <= 5d+15) then
tmp = t_1
else
tmp = t_4
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 = (b / c) / z;
double t_2 = (-4.0 * a) * (t / c);
double t_3 = (x * 9.0) * y;
double t_4 = (9.0 * x) * (y / (c * z));
double tmp;
if (t_3 <= -5e+104) {
tmp = t_4;
} else if (t_3 <= -4e+34) {
tmp = t_2;
} else if (t_3 <= -4e-137) {
tmp = t_1;
} else if (t_3 <= 5e-58) {
tmp = t_2;
} else if (t_3 <= 5e+15) {
tmp = t_1;
} else {
tmp = t_4;
}
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 = (b / c) / z t_2 = (-4.0 * a) * (t / c) t_3 = (x * 9.0) * y t_4 = (9.0 * x) * (y / (c * z)) tmp = 0 if t_3 <= -5e+104: tmp = t_4 elif t_3 <= -4e+34: tmp = t_2 elif t_3 <= -4e-137: tmp = t_1 elif t_3 <= 5e-58: tmp = t_2 elif t_3 <= 5e+15: tmp = t_1 else: tmp = t_4 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 / c) / z) t_2 = Float64(Float64(-4.0 * a) * Float64(t / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(9.0 * x) * Float64(y / Float64(c * z))) tmp = 0.0 if (t_3 <= -5e+104) tmp = t_4; elseif (t_3 <= -4e+34) tmp = t_2; elseif (t_3 <= -4e-137) tmp = t_1; elseif (t_3 <= 5e-58) tmp = t_2; elseif (t_3 <= 5e+15) tmp = t_1; else tmp = t_4; 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 = (b / c) / z;
t_2 = (-4.0 * a) * (t / c);
t_3 = (x * 9.0) * y;
t_4 = (9.0 * x) * (y / (c * z));
tmp = 0.0;
if (t_3 <= -5e+104)
tmp = t_4;
elseif (t_3 <= -4e+34)
tmp = t_2;
elseif (t_3 <= -4e-137)
tmp = t_1;
elseif (t_3 <= 5e-58)
tmp = t_2;
elseif (t_3 <= 5e+15)
tmp = t_1;
else
tmp = t_4;
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[(b / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(9.0 * x), $MachinePrecision] * N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -5e+104], t$95$4, If[LessEqual[t$95$3, -4e+34], t$95$2, If[LessEqual[t$95$3, -4e-137], t$95$1, If[LessEqual[t$95$3, 5e-58], t$95$2, If[LessEqual[t$95$3, 5e+15], t$95$1, t$95$4]]]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{b}{c}}{z}\\
t_2 := \left(-4 \cdot a\right) \cdot \frac{t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(9 \cdot x\right) \cdot \frac{y}{c \cdot z}\\
\mathbf{if}\;t\_3 \leq -5 \cdot 10^{+104}:\\
\;\;\;\;t\_4\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{+34}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq -4 \cdot 10^{-137}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{-58}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+15}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_4\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104 or 5e15 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 73.5%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites78.4%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6482.2
Applied rewrites82.2%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6473.3
Applied rewrites73.3%
Applied rewrites69.6%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999978e34 or -3.99999999999999991e-137 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999977e-58Initial program 83.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6453.6
Applied rewrites53.6%
Applied rewrites54.9%
if -3.99999999999999978e34 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999991e-137 or 4.99999999999999977e-58 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e15Initial program 78.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6456.4
Applied rewrites56.4%
Applied rewrites66.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 (* (* x 9.0) y)) (t_2 (* (* t z) a)))
(if (<= t_1 -5e+225)
(* (* (/ y c) 9.0) (/ x z))
(if (<= t_1 -5e+24)
(/ (fma t_2 -4.0 (* 9.0 (* y x))) (* z c))
(if (<= t_1 2e+67)
(/ (/ (fma (* (* t a) -4.0) z b) c) z)
(if (<= t_1 5e+255)
(/ (fma (* y x) 9.0 (* t_2 -4.0)) (* z c))
(* (* x (/ 9.0 c)) (/ y z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double t_2 = (t * z) * a;
double tmp;
if (t_1 <= -5e+225) {
tmp = ((y / c) * 9.0) * (x / z);
} else if (t_1 <= -5e+24) {
tmp = fma(t_2, -4.0, (9.0 * (y * x))) / (z * c);
} else if (t_1 <= 2e+67) {
tmp = (fma(((t * a) * -4.0), z, b) / c) / z;
} else if (t_1 <= 5e+255) {
tmp = fma((y * x), 9.0, (t_2 * -4.0)) / (z * c);
} else {
tmp = (x * (9.0 / c)) * (y / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) t_2 = Float64(Float64(t * z) * a) tmp = 0.0 if (t_1 <= -5e+225) tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); elseif (t_1 <= -5e+24) tmp = Float64(fma(t_2, -4.0, Float64(9.0 * Float64(y * x))) / Float64(z * c)); elseif (t_1 <= 2e+67) tmp = Float64(Float64(fma(Float64(Float64(t * a) * -4.0), z, b) / c) / z); elseif (t_1 <= 5e+255) tmp = Float64(fma(Float64(y * x), 9.0, Float64(t_2 * -4.0)) / Float64(z * c)); else tmp = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+225], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -5e+24], N[(N[(t$95$2 * -4.0 + N[(9.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+67], N[(N[(N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+255], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + N[(t$95$2 * -4.0), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
t_2 := \left(t \cdot z\right) \cdot a\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+225}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\mathbf{elif}\;t\_1 \leq -5 \cdot 10^{+24}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t\_2, -4, 9 \cdot \left(y \cdot x\right)\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+67}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+255}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, t\_2 \cdot -4\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.99999999999999981e225Initial program 78.0%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
if -4.99999999999999981e225 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000045e24Initial program 88.2%
Taylor expanded in a around -inf
mul-1-negN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
Applied rewrites79.3%
Taylor expanded in z around inf
Applied rewrites36.7%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6482.1
Applied rewrites82.1%
if -5.00000000000000045e24 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999997e67Initial program 80.1%
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-*.f6471.6
Applied rewrites71.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites77.4%
if 1.99999999999999997e67 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e255Initial program 88.2%
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-*.f6445.9
Applied rewrites45.9%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.7
Applied rewrites84.7%
if 5.0000000000000002e255 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 44.5%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites53.8%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6454.3
Applied rewrites54.3%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6491.2
Applied rewrites91.2%
Applied rewrites91.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 (/ (fma (* y x) 9.0 (* (* (* t z) a) -4.0)) (* z c)))
(t_2 (* (* x 9.0) y))
(t_3 (* (* x (/ 9.0 c)) (/ y z))))
(if (<= t_2 -5e+104)
t_3
(if (<= t_2 -5e+24)
t_1
(if (<= t_2 2e+67)
(/ (/ (fma (* (* t a) -4.0) z b) c) z)
(if (<= t_2 5e+255) t_1 t_3))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma((y * x), 9.0, (((t * z) * a) * -4.0)) / (z * c);
double t_2 = (x * 9.0) * y;
double t_3 = (x * (9.0 / c)) * (y / z);
double tmp;
if (t_2 <= -5e+104) {
tmp = t_3;
} else if (t_2 <= -5e+24) {
tmp = t_1;
} else if (t_2 <= 2e+67) {
tmp = (fma(((t * a) * -4.0), z, b) / c) / z;
} else if (t_2 <= 5e+255) {
tmp = t_1;
} else {
tmp = t_3;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(Float64(y * x), 9.0, Float64(Float64(Float64(t * z) * a) * -4.0)) / Float64(z * c)) t_2 = Float64(Float64(x * 9.0) * y) t_3 = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / z)) tmp = 0.0 if (t_2 <= -5e+104) tmp = t_3; elseif (t_2 <= -5e+24) tmp = t_1; elseif (t_2 <= 2e+67) tmp = Float64(Float64(fma(Float64(Float64(t * a) * -4.0), z, b) / c) / z); elseif (t_2 <= 5e+255) tmp = t_1; else tmp = t_3; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + N[(N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+104], t$95$3, If[LessEqual[t$95$2, -5e+24], t$95$1, If[LessEqual[t$95$2, 2e+67], N[(N[(N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$2, 5e+255], t$95$1, t$95$3]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(y \cdot x, 9, \left(\left(t \cdot z\right) \cdot a\right) \cdot -4\right)}{z \cdot c}\\
t_2 := \left(x \cdot 9\right) \cdot y\\
t_3 := \left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+104}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq -5 \cdot 10^{+24}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+67}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+255}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104 or 5.0000000000000002e255 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.9%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites72.6%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6475.6
Applied rewrites75.6%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6486.9
Applied rewrites86.9%
Applied rewrites86.9%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -5.00000000000000045e24 or 1.99999999999999997e67 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e255Initial program 89.0%
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-*.f6451.4
Applied rewrites51.4%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.8
Applied rewrites84.8%
if -5.00000000000000045e24 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999997e67Initial program 80.1%
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-*.f6471.6
Applied rewrites71.6%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites77.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 (<= (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) INFINITY) (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* 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 tmp;
if ((((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)) <= ((double) INFINITY)) {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
} else {
tmp = (-4.0 * a) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) <= Inf) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); else tmp = Float64(Float64(-4.0 * a) * Float64(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_] := If[LessEqual[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], Infinity], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;\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} \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{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)) < +inf.0Initial program 85.1%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites85.4%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6420.9
Applied rewrites20.9%
Applied rewrites54.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 (if (<= (* (* x 9.0) y) 1e+255) (/ (fma (* 4.0 t) a (/ (fma (* 9.0 x) y b) (- z))) (- c)) (fma (* 9.0 (/ x c)) (/ y z) (fma (/ (* t a) c) -4.0 (/ b (* z c))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (((x * 9.0) * y) <= 1e+255) {
tmp = fma((4.0 * t), a, (fma((9.0 * x), y, b) / -z)) / -c;
} else {
tmp = fma((9.0 * (x / c)), (y / z), fma(((t * a) / c), -4.0, (b / (z * c))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (Float64(Float64(x * 9.0) * y) <= 1e+255) tmp = Float64(fma(Float64(4.0 * t), a, Float64(fma(Float64(9.0 * x), y, b) / Float64(-z))) / Float64(-c)); else tmp = fma(Float64(9.0 * Float64(x / c)), Float64(y / z), fma(Float64(Float64(t * a) / c), -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. 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[N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision], 1e+255], N[(N[(N[(4.0 * t), $MachinePrecision] * a + N[(N[(N[(9.0 * x), $MachinePrecision] * y + b), $MachinePrecision] / (-z)), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], N[(N[(9.0 * N[(x / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision] + N[(N[(N[(t * a), $MachinePrecision] / c), $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])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(x \cdot 9\right) \cdot y \leq 10^{+255}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4 \cdot t, a, \frac{\mathsf{fma}\left(9 \cdot x, y, b\right)}{-z}\right)}{-c}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(9 \cdot \frac{x}{c}, \frac{y}{z}, \mathsf{fma}\left(\frac{t \cdot a}{c}, -4, \frac{b}{z \cdot c}\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999988e254Initial program 81.8%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites84.5%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6491.1
Applied rewrites91.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites91.2%
if 9.99999999999999988e254 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 46.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6410.8
Applied rewrites10.8%
Taylor expanded in x around 0
associate--l+N/A
times-fracN/A
associate-*r*N/A
lower-fma.f64N/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
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6495.6
Applied rewrites95.6%
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 (* (* x 9.0) y)) (t_2 (* (* x (/ 9.0 c)) (/ y z))))
(if (<= t_1 -5e+104)
t_2
(if (<= t_1 2e-25)
(/ (fma -4.0 (* (* t z) a) b) (* z c))
(if (<= t_1 5e+255) (/ (fma (* y x) 9.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 = (x * 9.0) * y;
double t_2 = (x * (9.0 / c)) * (y / z);
double tmp;
if (t_1 <= -5e+104) {
tmp = t_2;
} else if (t_1 <= 2e-25) {
tmp = fma(-4.0, ((t * z) * a), b) / (z * c);
} else if (t_1 <= 5e+255) {
tmp = fma((y * x), 9.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(Float64(x * 9.0) * y) t_2 = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / z)) tmp = 0.0 if (t_1 <= -5e+104) tmp = t_2; elseif (t_1 <= 2e-25) tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(z * c)); elseif (t_1 <= 5e+255) tmp = Float64(fma(Float64(y * x), 9.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[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+104], t$95$2, If[LessEqual[t$95$1, 2e-25], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+255], N[(N[(N[(y * x), $MachinePrecision] * 9.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 := \left(x \cdot 9\right) \cdot y\\
t_2 := \left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+104}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-25}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z \cdot c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+255}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104 or 5.0000000000000002e255 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 67.9%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites72.6%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6475.6
Applied rewrites75.6%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6486.9
Applied rewrites86.9%
Applied rewrites86.9%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2.00000000000000008e-25Initial program 82.3%
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-*.f6472.1
Applied rewrites72.1%
if 2.00000000000000008e-25 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000002e255Initial program 81.9%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6463.9
Applied rewrites63.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8e+42) (not (<= z 1.2e-121))) (/ (fma (* 4.0 t) a (- (fma (* (/ x z) 9.0) y (/ b z)))) (- c)) (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8e+42) || !(z <= 1.2e-121)) {
tmp = fma((4.0 * t), a, -fma(((x / z) * 9.0), y, (b / z))) / -c;
} else {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8e+42) || !(z <= 1.2e-121)) tmp = Float64(fma(Float64(4.0 * t), a, Float64(-fma(Float64(Float64(x / z) * 9.0), y, Float64(b / z)))) / Float64(-c)); else tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8e+42], N[Not[LessEqual[z, 1.2e-121]], $MachinePrecision]], N[(N[(N[(4.0 * t), $MachinePrecision] * a + (-N[(N[(N[(x / z), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(b / z), $MachinePrecision]), $MachinePrecision])), $MachinePrecision] / (-c)), $MachinePrecision], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{+42} \lor \neg \left(z \leq 1.2 \cdot 10^{-121}\right):\\
\;\;\;\;\frac{\mathsf{fma}\left(4 \cdot t, a, -\mathsf{fma}\left(\frac{x}{z} \cdot 9, y, \frac{b}{z}\right)\right)}{-c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -8.00000000000000036e42 or 1.20000000000000002e-121 < z Initial program 68.3%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites77.6%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6487.1
Applied rewrites87.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites87.2%
Taylor expanded in x around 0
Applied rewrites92.0%
if -8.00000000000000036e42 < z < 1.20000000000000002e-121Initial program 93.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
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites94.4%
Final simplification93.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 (* (* x 9.0) y)))
(if (or (<= t_1 -5e+104) (not (<= t_1 2e+248)))
(* (* x (/ 9.0 c)) (/ y z))
(/ (/ (fma (* (* t a) -4.0) z 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 t_1 = (x * 9.0) * y;
double tmp;
if ((t_1 <= -5e+104) || !(t_1 <= 2e+248)) {
tmp = (x * (9.0 / c)) * (y / z);
} else {
tmp = (fma(((t * a) * -4.0), z, 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) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if ((t_1 <= -5e+104) || !(t_1 <= 2e+248)) tmp = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / z)); else tmp = Float64(Float64(fma(Float64(Float64(t * a) * -4.0), z, b) / 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[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -5e+104], N[Not[LessEqual[t$95$1, 2e+248]], $MachinePrecision]], N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(t * a), $MachinePrecision] * -4.0), $MachinePrecision] * z + b), $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 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+104} \lor \neg \left(t\_1 \leq 2 \cdot 10^{+248}\right):\\
\;\;\;\;\left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(t \cdot a\right) \cdot -4, z, b\right)}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104 or 2.00000000000000009e248 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 69.3%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites72.4%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6475.3
Applied rewrites75.3%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6487.4
Applied rewrites87.4%
Applied rewrites87.4%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 2.00000000000000009e248Initial program 82.0%
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-*.f6467.8
Applied rewrites67.8%
lift-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites73.3%
Final simplification77.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 (* (* x 9.0) y)))
(if (<= t_1 -5e+104)
(* (* x (/ 9.0 c)) (/ y z))
(if (<= t_1 1e+71)
(/ (/ (fma -4.0 (* (* t z) a) b) z) c)
(* (* (/ y c) 9.0) (/ x z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (x * 9.0) * y;
double tmp;
if (t_1 <= -5e+104) {
tmp = (x * (9.0 / c)) * (y / z);
} else if (t_1 <= 1e+71) {
tmp = (fma(-4.0, ((t * z) * a), b) / z) / c;
} else {
tmp = ((y / c) * 9.0) * (x / z);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(x * 9.0) * y) tmp = 0.0 if (t_1 <= -5e+104) tmp = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / z)); elseif (t_1 <= 1e+71) tmp = Float64(Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / z) / c); else tmp = Float64(Float64(Float64(y / c) * 9.0) * Float64(x / z)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+104], N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+71], N[(N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+104}:\\
\;\;\;\;\left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{+71}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{y}{c} \cdot 9\right) \cdot \frac{x}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.9999999999999997e104Initial program 80.2%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites82.4%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6486.8
Applied rewrites86.8%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6484.6
Applied rewrites84.6%
Applied rewrites84.6%
if -4.9999999999999997e104 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e71Initial program 81.4%
Taylor expanded in x around 0
associate-/l/N/A
lower-/.f64N/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6475.2
Applied rewrites75.2%
if 1e71 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 66.6%
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-/.f6470.7
Applied rewrites70.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -8e+42) (not (<= z 1.2e-121))) (/ (fma (* (/ x z) 9.0) y (fma (* t a) -4.0 (/ b z))) c) (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -8e+42) || !(z <= 1.2e-121)) {
tmp = fma(((x / z) * 9.0), y, fma((t * a), -4.0, (b / z))) / c;
} else {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -8e+42) || !(z <= 1.2e-121)) tmp = Float64(fma(Float64(Float64(x / z) * 9.0), y, fma(Float64(t * a), -4.0, Float64(b / z))) / c); else tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -8e+42], N[Not[LessEqual[z, 1.2e-121]], $MachinePrecision]], N[(N[(N[(N[(x / z), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{+42} \lor \neg \left(z \leq 1.2 \cdot 10^{-121}\right):\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{x}{z} \cdot 9, y, \mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -8.00000000000000036e42 or 1.20000000000000002e-121 < z Initial program 68.3%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites77.6%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6487.1
Applied rewrites87.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites87.2%
Taylor expanded in z around inf
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6491.9
Applied rewrites91.9%
if -8.00000000000000036e42 < z < 1.20000000000000002e-121Initial program 93.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
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites94.4%
Final simplification92.9%
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 (<= (* (* x 9.0) y) 1e+255) (/ (fma (* 4.0 t) a (/ (fma (* 9.0 x) y b) (- z))) (- c)) (* (* x (/ 9.0 c)) (/ y 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 (((x * 9.0) * y) <= 1e+255) {
tmp = fma((4.0 * t), a, (fma((9.0 * x), y, b) / -z)) / -c;
} else {
tmp = (x * (9.0 / c)) * (y / 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 (Float64(Float64(x * 9.0) * y) <= 1e+255) tmp = Float64(fma(Float64(4.0 * t), a, Float64(fma(Float64(9.0 * x), y, b) / Float64(-z))) / Float64(-c)); else tmp = Float64(Float64(x * Float64(9.0 / c)) * Float64(y / 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_] := If[LessEqual[N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision], 1e+255], N[(N[(N[(4.0 * t), $MachinePrecision] * a + N[(N[(N[(9.0 * x), $MachinePrecision] * y + b), $MachinePrecision] / (-z)), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], N[(N[(x * N[(9.0 / c), $MachinePrecision]), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(x \cdot 9\right) \cdot y \leq 10^{+255}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4 \cdot t, a, \frac{\mathsf{fma}\left(9 \cdot x, y, b\right)}{-z}\right)}{-c}\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \frac{9}{c}\right) \cdot \frac{y}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999988e254Initial program 81.8%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites84.5%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6491.1
Applied rewrites91.1%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites91.2%
if 9.99999999999999988e254 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 46.8%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites55.7%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6456.2
Applied rewrites56.2%
Taylor expanded in x around inf
associate-*r/N/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f6491.6
Applied rewrites91.6%
Applied rewrites91.6%
Final simplification91.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -1.45e+217)
(* (* -4.0 a) (/ t c))
(if (<= z 1.7e+108)
(/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) (* z c))
(/ (fma (* 4.0 t) a (* -9.0 (/ (* y x) z))) (- c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.45e+217) {
tmp = (-4.0 * a) * (t / c);
} else if (z <= 1.7e+108) {
tmp = fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / (z * c);
} else {
tmp = fma((4.0 * t), a, (-9.0 * ((y * x) / z))) / -c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.45e+217) tmp = Float64(Float64(-4.0 * a) * Float64(t / c)); elseif (z <= 1.7e+108) tmp = Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / Float64(z * c)); else tmp = Float64(fma(Float64(4.0 * t), a, Float64(-9.0 * Float64(Float64(y * x) / z))) / Float64(-c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.45e+217], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.7e+108], N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(4.0 * t), $MachinePrecision] * a + N[(-9.0 * N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision]), $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}
\mathbf{if}\;z \leq -1.45 \cdot 10^{+217}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{c}\\
\mathbf{elif}\;z \leq 1.7 \cdot 10^{+108}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(4 \cdot t, a, -9 \cdot \frac{y \cdot x}{z}\right)}{-c}\\
\end{array}
\end{array}
if z < -1.44999999999999992e217Initial program 35.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6449.4
Applied rewrites49.4%
Applied rewrites62.1%
if -1.44999999999999992e217 < z < 1.69999999999999998e108Initial program 87.5%
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
*-commutativeN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
Applied rewrites89.4%
if 1.69999999999999998e108 < z Initial program 56.9%
lift-/.f64N/A
frac-2negN/A
neg-mul-1N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
times-fracN/A
distribute-neg-frac2N/A
lower-*.f64N/A
lower-/.f64N/A
distribute-neg-fracN/A
lower-/.f64N/A
Applied rewrites64.3%
Taylor expanded in z around inf
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
mul-1-negN/A
distribute-neg-frac2N/A
mul-1-negN/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
mul-1-negN/A
lower-neg.f6489.6
Applied rewrites89.6%
lift-*.f64N/A
lift-/.f64N/A
associate-*l/N/A
lower-/.f64N/A
Applied rewrites89.8%
Taylor expanded in b around 0
Applied rewrites80.1%
Final simplification85.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= a -1.6e-10) (not (<= a 2.4e+175))) (* (* t (/ a c)) -4.0) (/ (/ (fma (* y x) 9.0 b) c) z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -1.6e-10) || !(a <= 2.4e+175)) {
tmp = (t * (a / c)) * -4.0;
} else {
tmp = (fma((y * x), 9.0, 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 ((a <= -1.6e-10) || !(a <= 2.4e+175)) tmp = Float64(Float64(t * Float64(a / c)) * -4.0); else tmp = Float64(Float64(fma(Float64(y * x), 9.0, b) / 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_] := If[Or[LessEqual[a, -1.6e-10], N[Not[LessEqual[a, 2.4e+175]], $MachinePrecision]], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $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}
\mathbf{if}\;a \leq -1.6 \cdot 10^{-10} \lor \neg \left(a \leq 2.4 \cdot 10^{+175}\right):\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c}}{z}\\
\end{array}
\end{array}
if a < -1.5999999999999999e-10 or 2.4e175 < a Initial program 74.6%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6457.3
Applied rewrites57.3%
Applied rewrites63.5%
if -1.5999999999999999e-10 < a < 2.4e175Initial program 81.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-*.f6475.0
Applied rewrites75.0%
Final simplification70.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= a -1.6e-10) (not (<= a 2.5e+175))) (* (* t (/ a c)) -4.0) (/ (fma (* y x) 9.0 b) (* z c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -1.6e-10) || !(a <= 2.5e+175)) {
tmp = (t * (a / c)) * -4.0;
} else {
tmp = fma((y * x), 9.0, b) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((a <= -1.6e-10) || !(a <= 2.5e+175)) tmp = Float64(Float64(t * Float64(a / c)) * -4.0); else tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(z * c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[a, -1.6e-10], N[Not[LessEqual[a, 2.5e+175]], $MachinePrecision]], N[(N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -1.6 \cdot 10^{-10} \lor \neg \left(a \leq 2.5 \cdot 10^{+175}\right):\\
\;\;\;\;\left(t \cdot \frac{a}{c}\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{z \cdot c}\\
\end{array}
\end{array}
if a < -1.5999999999999999e-10 or 2.5e175 < a Initial program 74.6%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6457.3
Applied rewrites57.3%
Applied rewrites63.5%
if -1.5999999999999999e-10 < a < 2.5e175Initial program 81.2%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6473.5
Applied rewrites73.5%
Final simplification69.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= t -4.8e+135) (* (/ (* a t) c) -4.0) (if (<= t 1.4e-84) (/ (/ b c) z) (* (* -4.0 a) (/ t c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -4.8e+135) {
tmp = ((a * t) / c) * -4.0;
} else if (t <= 1.4e-84) {
tmp = (b / c) / z;
} else {
tmp = (-4.0 * a) * (t / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-4.8d+135)) then
tmp = ((a * t) / c) * (-4.0d0)
else if (t <= 1.4d-84) then
tmp = (b / c) / z
else
tmp = ((-4.0d0) * a) * (t / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -4.8e+135) {
tmp = ((a * t) / c) * -4.0;
} else if (t <= 1.4e-84) {
tmp = (b / c) / z;
} else {
tmp = (-4.0 * a) * (t / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -4.8e+135: tmp = ((a * t) / c) * -4.0 elif t <= 1.4e-84: tmp = (b / c) / z else: tmp = (-4.0 * a) * (t / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -4.8e+135) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); elseif (t <= 1.4e-84) tmp = Float64(Float64(b / c) / z); else tmp = Float64(Float64(-4.0 * a) * Float64(t / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -4.8e+135)
tmp = ((a * t) / c) * -4.0;
elseif (t <= 1.4e-84)
tmp = (b / c) / z;
else
tmp = (-4.0 * a) * (t / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -4.8e+135], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t, 1.4e-84], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -4.8 \cdot 10^{+135}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{elif}\;t \leq 1.4 \cdot 10^{-84}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{c}\\
\end{array}
\end{array}
if t < -4.79999999999999995e135Initial program 76.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6463.3
Applied rewrites63.3%
if -4.79999999999999995e135 < t < 1.39999999999999991e-84Initial program 79.7%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6436.2
Applied rewrites36.2%
Applied rewrites39.1%
if 1.39999999999999991e-84 < t Initial program 77.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6443.4
Applied rewrites43.4%
Applied rewrites52.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -1.6e-43) (not (<= t 8.8e-153))) (* (* -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 ((t <= -1.6e-43) || !(t <= 8.8e-153)) {
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 ((t <= (-1.6d-43)) .or. (.not. (t <= 8.8d-153))) 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 ((t <= -1.6e-43) || !(t <= 8.8e-153)) {
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 (t <= -1.6e-43) or not (t <= 8.8e-153): 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 ((t <= -1.6e-43) || !(t <= 8.8e-153)) tmp = Float64(Float64(-4.0 * a) * Float64(t / c)); else tmp = Float64(b / Float64(c * z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -1.6e-43) || ~((t <= 8.8e-153)))
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[Or[LessEqual[t, -1.6e-43], N[Not[LessEqual[t, 8.8e-153]], $MachinePrecision]], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.6 \cdot 10^{-43} \lor \neg \left(t \leq 8.8 \cdot 10^{-153}\right):\\
\;\;\;\;\left(-4 \cdot a\right) \cdot \frac{t}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\end{array}
\end{array}
if t < -1.59999999999999992e-43 or 8.80000000000000003e-153 < t Initial program 78.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6446.6
Applied rewrites46.6%
Applied rewrites52.6%
if -1.59999999999999992e-43 < t < 8.80000000000000003e-153Initial program 78.1%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6439.0
Applied rewrites39.0%
Final simplification47.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 (/ b (* c z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (c * z)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (c * z)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(c * z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (c * z);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{c \cdot z}
\end{array}
Initial program 78.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6431.1
Applied rewrites31.1%
(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 2024307
(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)))