
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (fma x (* (/ y z) -9.0) (fma a (* 4.0 t) (/ b (- z)))) (- c))))
(if (<= z -2100000000000.0)
t_1
(if (<= z 5e-36)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma(x, ((y / z) * -9.0), fma(a, (4.0 * t), (b / -z))) / -c;
double tmp;
if (z <= -2100000000000.0) {
tmp = t_1;
} else if (z <= 5e-36) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(x, Float64(Float64(y / z) * -9.0), fma(a, Float64(4.0 * t), Float64(b / Float64(-z)))) / Float64(-c)) tmp = 0.0 if (z <= -2100000000000.0) tmp = t_1; elseif (z <= 5e-36) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision] + N[(a * N[(4.0 * t), $MachinePrecision] + N[(b / (-z)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision]}, If[LessEqual[z, -2100000000000.0], t$95$1, If[LessEqual[z, 5e-36], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(x, \frac{y}{z} \cdot -9, \mathsf{fma}\left(a, 4 \cdot t, \frac{b}{-z}\right)\right)}{-c}\\
\mathbf{if}\;z \leq -2100000000000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5 \cdot 10^{-36}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -2.1e12 or 5.00000000000000004e-36 < z Initial program 64.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites80.9%
Taylor expanded in c around -inf
Applied rewrites95.7%
if -2.1e12 < z < 5.00000000000000004e-36Initial program 97.2%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites96.8%
Final simplification96.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))))
(if (<= t_1 -1e+44)
t_2
(if (<= t_1 2e+148)
(/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) z) c)
(if (<= t_1 INFINITY)
t_2
(/ (fma x (* (/ y z) -9.0) (* 4.0 (* t a))) (- c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
double tmp;
if (t_1 <= -1e+44) {
tmp = t_2;
} else if (t_1 <= 2e+148) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / z) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = fma(x, ((y / z) * -9.0), (4.0 * (t * a))) / -c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e+44) tmp = t_2; elseif (t_1 <= 2e+148) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / z) / c); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(fma(x, Float64(Float64(y / z) * -9.0), Float64(4.0 * Float64(t * a))) / 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_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+44], t$95$2, If[LessEqual[t$95$1, 2e+148], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision] + N[(4.0 * N[(t * a), $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}
t_1 := \frac{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+44}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+148}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, \frac{y}{z} \cdot -9, 4 \cdot \left(t \cdot a\right)\right)}{-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)) < -1.0000000000000001e44 or 2.0000000000000001e148 < (/.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.8%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites87.2%
if -1.0000000000000001e44 < (/.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)) < 2.0000000000000001e148Initial program 80.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites98.2%
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 x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites69.4%
Taylor expanded in c around -inf
Applied rewrites79.3%
Taylor expanded in a around inf
Applied rewrites64.5%
Final simplification88.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* x y))) (t_2 (* y (* x 9.0))))
(if (<= t_2 -1e+73)
(/ (fma z (* t (* a -4.0)) t_1) (* z c))
(if (<= t_2 1e+162)
(/ (- (* 4.0 (* t a)) (/ b z)) (- c))
(/ (fma a (* -4.0 (* z t)) t_1) (* z c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * (x * y);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -1e+73) {
tmp = fma(z, (t * (a * -4.0)), t_1) / (z * c);
} else if (t_2 <= 1e+162) {
tmp = ((4.0 * (t * a)) - (b / z)) / -c;
} else {
tmp = fma(a, (-4.0 * (z * t)), t_1) / (z * c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(x * y)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -1e+73) tmp = Float64(fma(z, Float64(t * Float64(a * -4.0)), t_1) / Float64(z * c)); elseif (t_2 <= 1e+162) tmp = Float64(Float64(Float64(4.0 * Float64(t * a)) - Float64(b / z)) / Float64(-c)); else tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), t_1) / 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_] := Block[{t$95$1 = N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+73], N[(N[(z * N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+162], N[(N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(b / z), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + t$95$1), $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}
t_1 := 9 \cdot \left(x \cdot y\right)\\
t_2 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+73}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot \left(a \cdot -4\right), t\_1\right)}{z \cdot c}\\
\mathbf{elif}\;t\_2 \leq 10^{+162}:\\
\;\;\;\;\frac{4 \cdot \left(t \cdot a\right) - \frac{b}{z}}{-c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), t\_1\right)}{z \cdot c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999983e72Initial program 73.3%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6421.0
Applied rewrites21.0%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6472.1
Applied rewrites72.1%
if -9.99999999999999983e72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999994e161Initial program 80.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites77.4%
Taylor expanded in c around -inf
Applied rewrites89.6%
Taylor expanded in x around 0
Applied rewrites85.7%
if 9.9999999999999994e161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 84.4%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6481.2
Applied rewrites81.2%
Final simplification82.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* x 9.0)))
(t_2 (/ (fma a (* -4.0 (* z t)) (* 9.0 (* x y))) (* z c))))
(if (<= t_1 -1e+73)
t_2
(if (<= t_1 1e+162) (/ (- (* 4.0 (* t a)) (/ b z)) (- c)) t_2))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double t_2 = fma(a, (-4.0 * (z * t)), (9.0 * (x * y))) / (z * c);
double tmp;
if (t_1 <= -1e+73) {
tmp = t_2;
} else if (t_1 <= 1e+162) {
tmp = ((4.0 * (t * a)) - (b / z)) / -c;
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(y * Float64(x * 9.0)) t_2 = Float64(fma(a, Float64(-4.0 * Float64(z * t)), Float64(9.0 * Float64(x * y))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e+73) tmp = t_2; elseif (t_1 <= 1e+162) tmp = Float64(Float64(Float64(4.0 * Float64(t * a)) - Float64(b / z)) / Float64(-c)); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+73], t$95$2, If[LessEqual[t$95$1, 1e+162], N[(N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(b / z), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
t_2 := \frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), 9 \cdot \left(x \cdot y\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+73}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+162}:\\
\;\;\;\;\frac{4 \cdot \left(t \cdot a\right) - \frac{b}{z}}{-c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999983e72 or 9.9999999999999994e161 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.7%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6475.9
Applied rewrites75.9%
if -9.99999999999999983e72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.9999999999999994e161Initial program 80.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites77.4%
Taylor expanded in c around -inf
Applied rewrites89.6%
Taylor expanded in x around 0
Applied rewrites85.7%
Final simplification82.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(if (<= t_1 -5e+214)
(/ (/ (* x (* 9.0 y)) c) z)
(if (<= t_1 1e-21)
(/ (- (* 4.0 (* t a)) (/ b z)) (- c))
(/ (fma (* x 9.0) y 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 t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -5e+214) {
tmp = ((x * (9.0 * y)) / c) / z;
} else if (t_1 <= 1e-21) {
tmp = ((4.0 * (t * a)) - (b / z)) / -c;
} else {
tmp = fma((x * 9.0), y, 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) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -5e+214) tmp = Float64(Float64(Float64(x * Float64(9.0 * y)) / c) / z); elseif (t_1 <= 1e-21) tmp = Float64(Float64(Float64(4.0 * Float64(t * a)) - Float64(b / z)) / Float64(-c)); else tmp = Float64(fma(Float64(x * 9.0), y, 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_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+214], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-21], N[(N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(b / z), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] * y + 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}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+214}:\\
\;\;\;\;\frac{\frac{x \cdot \left(9 \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-21}:\\
\;\;\;\;\frac{4 \cdot \left(t \cdot a\right) - \frac{b}{z}}{-c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -4.99999999999999953e214Initial program 73.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites82.1%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6482.1
Applied rewrites82.1%
Taylor expanded in x around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6482.3
Applied rewrites82.3%
if -4.99999999999999953e214 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999908e-22Initial program 78.8%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites80.7%
Taylor expanded in c around -inf
Applied rewrites90.9%
Taylor expanded in x around 0
Applied rewrites85.7%
if 9.99999999999999908e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 86.0%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6473.5
Applied rewrites73.5%
Applied rewrites73.6%
Final simplification82.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 9.0 (/ (* x y) z) (fma -4.0 (* t a) (/ b z))) c)))
(if (<= z -4000000000000.0)
t_1
(if (<= z 5e-58)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma(9.0, ((x * y) / z), fma(-4.0, (t * a), (b / z))) / c;
double tmp;
if (z <= -4000000000000.0) {
tmp = t_1;
} else if (z <= 5e-58) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(9.0, Float64(Float64(x * y) / z), fma(-4.0, Float64(t * a), Float64(b / z))) / c) tmp = 0.0 if (z <= -4000000000000.0) tmp = t_1; elseif (z <= 5e-58) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -4000000000000.0], t$95$1, If[LessEqual[z, 5e-58], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(9, \frac{x \cdot y}{z}, \mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)\right)}{c}\\
\mathbf{if}\;z \leq -4000000000000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5 \cdot 10^{-58}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4e12 or 4.99999999999999977e-58 < z Initial program 66.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites80.4%
Taylor expanded in c around 0
Applied rewrites93.1%
if -4e12 < z < 4.99999999999999977e-58Initial program 97.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
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites96.7%
Final simplification94.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(if (<= t_1 -1e+73)
(/ (/ (* 9.0 (* x y)) c) z)
(if (<= t_1 1e-21)
(/ (fma z (* t (* a -4.0)) b) (* z c))
(/ (fma (* x 9.0) y 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 t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -1e+73) {
tmp = ((9.0 * (x * y)) / c) / z;
} else if (t_1 <= 1e-21) {
tmp = fma(z, (t * (a * -4.0)), b) / (z * c);
} else {
tmp = fma((x * 9.0), y, 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) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -1e+73) tmp = Float64(Float64(Float64(9.0 * Float64(x * y)) / c) / z); elseif (t_1 <= 1e-21) tmp = Float64(fma(z, Float64(t * Float64(a * -4.0)), b) / Float64(z * c)); else tmp = Float64(fma(Float64(x * 9.0), y, 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_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+73], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-21], N[(N[(z * N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] * y + 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}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+73}:\\
\;\;\;\;\frac{\frac{9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-21}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot \left(a \cdot -4\right), b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999983e72Initial program 73.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites75.6%
Taylor expanded in x around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f6466.3
Applied rewrites66.3%
if -9.99999999999999983e72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999908e-22Initial program 79.3%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6438.4
Applied rewrites38.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.2
Applied rewrites78.2%
if 9.99999999999999908e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 86.0%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6473.5
Applied rewrites73.5%
Applied rewrites73.6%
Final simplification74.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
(let* ((t_1 (* y (* x 9.0))))
(if (<= t_1 -1e+73)
(/ (/ (* x (* 9.0 y)) c) z)
(if (<= t_1 1e-21)
(/ (fma z (* t (* a -4.0)) b) (* z c))
(/ (fma (* x 9.0) y 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 t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -1e+73) {
tmp = ((x * (9.0 * y)) / c) / z;
} else if (t_1 <= 1e-21) {
tmp = fma(z, (t * (a * -4.0)), b) / (z * c);
} else {
tmp = fma((x * 9.0), y, 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) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -1e+73) tmp = Float64(Float64(Float64(x * Float64(9.0 * y)) / c) / z); elseif (t_1 <= 1e-21) tmp = Float64(fma(z, Float64(t * Float64(a * -4.0)), b) / Float64(z * c)); else tmp = Float64(fma(Float64(x * 9.0), y, 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_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+73], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-21], N[(N[(z * N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 9.0), $MachinePrecision] * y + 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}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+73}:\\
\;\;\;\;\frac{\frac{x \cdot \left(9 \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-21}:\\
\;\;\;\;\frac{\mathsf{fma}\left(z, t \cdot \left(a \cdot -4\right), b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.99999999999999983e72Initial program 73.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites75.6%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lower-*.f64N/A
lower-*.f64N/A
lower-/.f6475.6
Applied rewrites75.6%
Taylor expanded in x around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6466.3
Applied rewrites66.3%
if -9.99999999999999983e72 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 9.99999999999999908e-22Initial program 79.3%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6438.4
Applied rewrites38.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6478.2
Applied rewrites78.2%
if 9.99999999999999908e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 86.0%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6473.5
Applied rewrites73.5%
Applied rewrites73.6%
Final simplification74.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
(let* ((t_1 (/ (fma x (* (/ y z) -9.0) (* 4.0 (* t a))) (- c))))
(if (<= z -6.8e+158)
t_1
(if (<= z 2.4e+116)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = fma(x, ((y / z) * -9.0), (4.0 * (t * a))) / -c;
double tmp;
if (z <= -6.8e+158) {
tmp = t_1;
} else if (z <= 2.4e+116) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(fma(x, Float64(Float64(y / z) * -9.0), Float64(4.0 * Float64(t * a))) / Float64(-c)) tmp = 0.0 if (z <= -6.8e+158) tmp = t_1; elseif (z <= 2.4e+116) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision] + N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision]}, If[LessEqual[z, -6.8e+158], t$95$1, If[LessEqual[z, 2.4e+116], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(x, \frac{y}{z} \cdot -9, 4 \cdot \left(t \cdot a\right)\right)}{-c}\\
\mathbf{if}\;z \leq -6.8 \cdot 10^{+158}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.4 \cdot 10^{+116}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.7999999999999998e158 or 2.4e116 < z Initial program 48.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites78.2%
Taylor expanded in c around -inf
Applied rewrites94.6%
Taylor expanded in a around inf
Applied rewrites81.5%
if -6.7999999999999998e158 < z < 2.4e116Initial program 92.4%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites91.0%
Final simplification88.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (- (* 4.0 (* t a)) (/ b z)) (- c))))
(if (<= z -7e+135)
t_1
(if (<= z 8.5e+134)
(/ (fma (* a (* z -4.0)) t (fma x (* 9.0 y) b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((4.0 * (t * a)) - (b / z)) / -c;
double tmp;
if (z <= -7e+135) {
tmp = t_1;
} else if (z <= 8.5e+134) {
tmp = fma((a * (z * -4.0)), t, fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(4.0 * Float64(t * a)) - Float64(b / z)) / Float64(-c)) tmp = 0.0 if (z <= -7e+135) tmp = t_1; elseif (z <= 8.5e+134) tmp = Float64(fma(Float64(a * Float64(z * -4.0)), t, fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(b / z), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision]}, If[LessEqual[z, -7e+135], t$95$1, If[LessEqual[z, 8.5e+134], N[(N[(N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision] * t + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{4 \cdot \left(t \cdot a\right) - \frac{b}{z}}{-c}\\
\mathbf{if}\;z \leq -7 \cdot 10^{+135}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.5 \cdot 10^{+134}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a \cdot \left(z \cdot -4\right), t, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -7.0000000000000005e135 or 8.50000000000000024e134 < z Initial program 48.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites75.9%
Taylor expanded in c around -inf
Applied rewrites95.9%
Taylor expanded in x around 0
Applied rewrites77.8%
if -7.0000000000000005e135 < z < 8.50000000000000024e134Initial program 92.4%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites91.5%
Final simplification87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (- (* 4.0 (* t a)) (/ b z)) (- c))))
(if (<= z -6e+97)
t_1
(if (<= z 9e+137)
(/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((4.0 * (t * a)) - (b / z)) / -c;
double tmp;
if (z <= -6e+97) {
tmp = t_1;
} else if (z <= 9e+137) {
tmp = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) 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(4.0 * Float64(t * a)) - Float64(b / z)) / Float64(-c)) tmp = 0.0 if (z <= -6e+97) tmp = t_1; elseif (z <= 9e+137) tmp = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - N[(b / z), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision]}, If[LessEqual[z, -6e+97], t$95$1, If[LessEqual[z, 9e+137], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{4 \cdot \left(t \cdot a\right) - \frac{b}{z}}{-c}\\
\mathbf{if}\;z \leq -6 \cdot 10^{+97}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 9 \cdot 10^{+137}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -5.9999999999999997e97 or 9.0000000000000003e137 < z Initial program 53.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l/N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-/l*N/A
associate-*l*N/A
*-commutativeN/A
Applied rewrites78.5%
Taylor expanded in c around -inf
Applied rewrites96.3%
Taylor expanded in x around 0
Applied rewrites77.9%
if -5.9999999999999997e97 < z < 9.0000000000000003e137Initial program 92.5%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6492.5
Applied rewrites92.5%
Final simplification87.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -1.8e+86)
(/ (* -4.0 (* t a)) c)
(if (<= z -9.2e-194)
(/ (fma a (* -4.0 (* z t)) b) (* z c))
(if (<= z 2.8e+117)
(/ (fma (* x 9.0) y b) (* z c))
(* t (/ (* a -4.0) c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.8e+86) {
tmp = (-4.0 * (t * a)) / c;
} else if (z <= -9.2e-194) {
tmp = fma(a, (-4.0 * (z * t)), b) / (z * c);
} else if (z <= 2.8e+117) {
tmp = fma((x * 9.0), y, b) / (z * c);
} else {
tmp = t * ((a * -4.0) / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.8e+86) tmp = Float64(Float64(-4.0 * Float64(t * a)) / c); elseif (z <= -9.2e-194) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), b) / Float64(z * c)); elseif (z <= 2.8e+117) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(z * c)); else tmp = Float64(t * Float64(Float64(a * -4.0) / c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.8e+86], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, -9.2e-194], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.8e+117], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.8 \cdot 10^{+86}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{elif}\;z \leq -9.2 \cdot 10^{-194}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)}{z \cdot c}\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+117}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\end{array}
\end{array}
if z < -1.80000000000000003e86Initial program 58.5%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6465.1
Applied rewrites65.1%
if -1.80000000000000003e86 < z < -9.2000000000000001e-194Initial program 92.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6479.0
Applied rewrites79.0%
if -9.2000000000000001e-194 < z < 2.79999999999999997e117Initial program 93.5%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6481.2
Applied rewrites81.2%
Applied rewrites81.3%
if 2.79999999999999997e117 < z Initial program 50.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites59.0%
Taylor expanded in a around inf
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6462.3
Applied rewrites62.3%
Final simplification74.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -3e+96)
(/ (* -4.0 (* t a)) c)
(if (<= z 2.8e+117)
(/ (fma (* x 9.0) y b) (* z c))
(* t (/ (* a -4.0) c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3e+96) {
tmp = (-4.0 * (t * a)) / c;
} else if (z <= 2.8e+117) {
tmp = fma((x * 9.0), y, b) / (z * c);
} else {
tmp = t * ((a * -4.0) / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3e+96) tmp = Float64(Float64(-4.0 * Float64(t * a)) / c); elseif (z <= 2.8e+117) tmp = Float64(fma(Float64(x * 9.0), y, b) / Float64(z * c)); else tmp = Float64(t * Float64(Float64(a * -4.0) / c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -3e+96], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.8e+117], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{+96}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+117}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\end{array}
\end{array}
if z < -3e96Initial program 58.7%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6465.6
Applied rewrites65.6%
if -3e96 < z < 2.79999999999999997e117Initial program 92.8%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6476.4
Applied rewrites76.4%
Applied rewrites76.4%
if 2.79999999999999997e117 < z Initial program 50.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites59.0%
Taylor expanded in a around inf
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6462.3
Applied rewrites62.3%
Final simplification72.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 -3e+96)
(/ (* -4.0 (* t a)) c)
(if (<= z 2.8e+117)
(/ (fma 9.0 (* x y) b) (* z c))
(* t (/ (* a -4.0) c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3e+96) {
tmp = (-4.0 * (t * a)) / c;
} else if (z <= 2.8e+117) {
tmp = fma(9.0, (x * y), b) / (z * c);
} else {
tmp = t * ((a * -4.0) / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3e+96) tmp = Float64(Float64(-4.0 * Float64(t * a)) / c); elseif (z <= 2.8e+117) tmp = Float64(fma(9.0, Float64(x * y), b) / Float64(z * c)); else tmp = Float64(t * Float64(Float64(a * -4.0) / c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -3e+96], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.8e+117], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{+96}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+117}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\end{array}
\end{array}
if z < -3e96Initial program 58.7%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6465.6
Applied rewrites65.6%
if -3e96 < z < 2.79999999999999997e117Initial program 92.8%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6476.4
Applied rewrites76.4%
if 2.79999999999999997e117 < z Initial program 50.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites59.0%
Taylor expanded in a around inf
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6462.3
Applied rewrites62.3%
Final simplification72.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 (* t (/ (* a -4.0) c)))) (if (<= a -1.82e-62) t_1 (if (<= a 2.7e+51) (/ b (* z c)) t_1))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = t * ((a * -4.0) / c);
double tmp;
if (a <= -1.82e-62) {
tmp = t_1;
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) / c)
if (a <= (-1.82d-62)) then
tmp = t_1
else if (a <= 2.7d+51) then
tmp = b / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = t * ((a * -4.0) / c);
double tmp;
if (a <= -1.82e-62) {
tmp = t_1;
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = t * ((a * -4.0) / c) tmp = 0 if a <= -1.82e-62: tmp = t_1 elif a <= 2.7e+51: tmp = b / (z * c) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(t * Float64(Float64(a * -4.0) / c)) tmp = 0.0 if (a <= -1.82e-62) tmp = t_1; elseif (a <= 2.7e+51) tmp = Float64(b / Float64(z * c)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = t * ((a * -4.0) / c);
tmp = 0.0;
if (a <= -1.82e-62)
tmp = t_1;
elseif (a <= 2.7e+51)
tmp = b / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1.82e-62], t$95$1, If[LessEqual[a, 2.7e+51], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := t \cdot \frac{a \cdot -4}{c}\\
\mathbf{if}\;a \leq -1.82 \cdot 10^{-62}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.7 \cdot 10^{+51}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -1.81999999999999999e-62 or 2.69999999999999992e51 < a Initial program 78.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites80.0%
Taylor expanded in a around inf
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6459.0
Applied rewrites59.0%
if -1.81999999999999999e-62 < a < 2.69999999999999992e51Initial program 80.7%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6451.6
Applied rewrites51.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 (if (<= a -1.82e-62) (* (* a -4.0) (/ t c)) (if (<= a 2.7e+51) (/ b (* z c)) (/ (* -4.0 (* t a)) 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.82e-62) {
tmp = (a * -4.0) * (t / c);
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = (-4.0 * (t * a)) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (a <= (-1.82d-62)) then
tmp = (a * (-4.0d0)) * (t / c)
else if (a <= 2.7d+51) then
tmp = b / (z * c)
else
tmp = ((-4.0d0) * (t * a)) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 (a <= -1.82e-62) {
tmp = (a * -4.0) * (t / c);
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = (-4.0 * (t * a)) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [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 a <= -1.82e-62: tmp = (a * -4.0) * (t / c) elif a <= 2.7e+51: tmp = b / (z * c) else: tmp = (-4.0 * (t * a)) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -1.82e-62) tmp = Float64(Float64(a * -4.0) * Float64(t / c)); elseif (a <= 2.7e+51) tmp = Float64(b / Float64(z * c)); else tmp = Float64(Float64(-4.0 * Float64(t * a)) / 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 (a <= -1.82e-62)
tmp = (a * -4.0) * (t / c);
elseif (a <= 2.7e+51)
tmp = b / (z * c);
else
tmp = (-4.0 * (t * a)) / c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -1.82e-62], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.7e+51], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $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}\;a \leq -1.82 \cdot 10^{-62}:\\
\;\;\;\;\left(a \cdot -4\right) \cdot \frac{t}{c}\\
\mathbf{elif}\;a \leq 2.7 \cdot 10^{+51}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\end{array}
\end{array}
if a < -1.81999999999999999e-62Initial program 79.0%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
lower-/.f6480.5
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites80.5%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6456.8
Applied rewrites56.8%
Applied rewrites58.0%
if -1.81999999999999999e-62 < a < 2.69999999999999992e51Initial program 80.7%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6451.6
Applied rewrites51.6%
if 2.69999999999999992e51 < a Initial program 78.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6463.8
Applied rewrites63.8%
Final simplification55.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (let* ((t_1 (/ (* -4.0 (* t a)) c))) (if (<= a -1.82e-62) t_1 (if (<= a 2.7e+51) (/ b (* z c)) t_1))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (-4.0 * (t * a)) / c;
double tmp;
if (a <= -1.82e-62) {
tmp = t_1;
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = ((-4.0d0) * (t * a)) / c
if (a <= (-1.82d-62)) then
tmp = t_1
else if (a <= 2.7d+51) then
tmp = b / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (-4.0 * (t * a)) / c;
double tmp;
if (a <= -1.82e-62) {
tmp = t_1;
} else if (a <= 2.7e+51) {
tmp = b / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (-4.0 * (t * a)) / c tmp = 0 if a <= -1.82e-62: tmp = t_1 elif a <= 2.7e+51: tmp = b / (z * c) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(-4.0 * Float64(t * a)) / c) tmp = 0.0 if (a <= -1.82e-62) tmp = t_1; elseif (a <= 2.7e+51) tmp = Float64(b / Float64(z * c)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (-4.0 * (t * a)) / c;
tmp = 0.0;
if (a <= -1.82e-62)
tmp = t_1;
elseif (a <= 2.7e+51)
tmp = b / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[a, -1.82e-62], t$95$1, If[LessEqual[a, 2.7e+51], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\mathbf{if}\;a \leq -1.82 \cdot 10^{-62}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 2.7 \cdot 10^{+51}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -1.81999999999999999e-62 or 2.69999999999999992e51 < a Initial program 78.9%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6459.4
Applied rewrites59.4%
if -1.81999999999999999e-62 < a < 2.69999999999999992e51Initial program 80.7%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6451.6
Applied rewrites51.6%
Final simplification55.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 (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 79.8%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6436.7
Applied rewrites36.7%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024220
(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)))