
(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
(let* ((t_1
(fma a (* t (/ -4.0 c)) (fma x (/ (* 9.0 y) (* z c)) (/ b (* z c))))))
(if (<= z -6.5e+25)
t_1
(if (<= z 4.6e+71)
(/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) c) z)
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(a, (t * (-4.0 / c)), fma(x, ((9.0 * y) / (z * c)), (b / (z * c))));
double tmp;
if (z <= -6.5e+25) {
tmp = t_1;
} else if (z <= 4.6e+71) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / c) / z;
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = fma(a, Float64(t * Float64(-4.0 / c)), fma(x, Float64(Float64(9.0 * y) / Float64(z * c)), Float64(b / Float64(z * c)))) tmp = 0.0 if (z <= -6.5e+25) tmp = t_1; elseif (z <= 4.6e+71) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / c) / z); 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[(a * N[(t * N[(-4.0 / c), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(9.0 * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision] + N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6.5e+25], t$95$1, If[LessEqual[z, 4.6e+71], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(a, t \cdot \frac{-4}{c}, \mathsf{fma}\left(x, \frac{9 \cdot y}{z \cdot c}, \frac{b}{z \cdot c}\right)\right)\\
\mathbf{if}\;z \leq -6.5 \cdot 10^{+25}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.6 \cdot 10^{+71}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.50000000000000005e25 or 4.6000000000000005e71 < z Initial program 58.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 rewrites83.3%
if -6.50000000000000005e25 < z < 4.6000000000000005e71Initial program 96.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites98.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -5e-241)
(/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))
(if (<= t_1 0.0)
(/ (fma -4.0 (* t a) (/ b z)) c)
(if (<= t_1 INFINITY)
(/ (fma (* z -4.0) (* t a) (fma x (* 9.0 y) b)) (* z c))
(* (* a -4.0) (/ t c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -5e-241) {
tmp = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
} else if (t_1 <= 0.0) {
tmp = fma(-4.0, (t * a), (b / z)) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = fma((z * -4.0), (t * a), fma(x, (9.0 * y), b)) / (z * c);
} else {
tmp = (a * -4.0) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -5e-241) tmp = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)); elseif (t_1 <= 0.0) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c); elseif (t_1 <= Inf) tmp = Float64(fma(Float64(z * -4.0), Float64(t * a), fma(x, Float64(9.0 * y), b)) / Float64(z * c)); else tmp = Float64(Float64(a * -4.0) * 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[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-241], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(z * -4.0), $MachinePrecision] * N[(t * a), $MachinePrecision] + N[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(a * -4.0), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-241}:\\
\;\;\;\;\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{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\mathsf{fma}\left(z \cdot -4, t \cdot a, \mathsf{fma}\left(x, 9 \cdot y, b\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot -4\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)) < -4.9999999999999998e-241Initial program 91.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6491.3
Applied rewrites91.3%
if -4.9999999999999998e-241 < (/.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 23.9%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites36.6%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6486.8
Applied rewrites86.8%
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 90.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
lower-fma.f64N/A
lift-*.f64N/A
distribute-rgt-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lower-fma.f64N/A
lower-*.f6489.2
Applied rewrites89.2%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites14.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6459.2
Applied rewrites59.2%
Applied rewrites70.1%
Final simplification88.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))))
(if (<= t_1 -5e-241)
t_2
(if (<= t_1 0.0)
(/ (fma -4.0 (* t a) (/ b z)) c)
(if (<= t_1 INFINITY) t_2 (* (* a -4.0) (/ t c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
double tmp;
if (t_1 <= -5e-241) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = fma(-4.0, (t * a), (b / z)) / c;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = (a * -4.0) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)) tmp = 0.0 if (t_1 <= -5e-241) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(Float64(a * -4.0) * 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[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-241], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(N[(a * -4.0), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-241}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot -4\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)) < -4.9999999999999998e-241 or -0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 90.8%
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-*.f6490.8
Applied rewrites90.8%
if -4.9999999999999998e-241 < (/.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 23.9%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites36.6%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6486.8
Applied rewrites86.8%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites14.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6459.2
Applied rewrites59.2%
Applied rewrites70.1%
Final simplification88.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 (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c))))
(if (<= t_1 -2e-284)
(/ (fma (* x 9.0) y (fma a (* -4.0 (* z t)) b)) (* z c))
(if (<= t_1 INFINITY)
(/ (/ (fma (* x y) 9.0 (fma -4.0 (* z (* t a)) b)) c) z)
(* (* a -4.0) (/ t c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c);
double tmp;
if (t_1 <= -2e-284) {
tmp = fma((x * 9.0), y, fma(a, (-4.0 * (z * t)), b)) / (z * c);
} else if (t_1 <= ((double) INFINITY)) {
tmp = (fma((x * y), 9.0, fma(-4.0, (z * (t * a)), b)) / c) / z;
} else {
tmp = (a * -4.0) * (t / c);
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -2e-284) tmp = Float64(fma(Float64(x * 9.0), y, fma(a, Float64(-4.0 * Float64(z * t)), b)) / Float64(z * c)); elseif (t_1 <= Inf) tmp = Float64(Float64(fma(Float64(x * y), 9.0, fma(-4.0, Float64(z * Float64(t * a)), b)) / c) / z); else tmp = Float64(Float64(a * -4.0) * 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[(b + N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e-284], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(N[(x * y), $MachinePrecision] * 9.0 + N[(-4.0 * N[(z * N[(t * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(a * -4.0), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{-284}:\\
\;\;\;\;\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{elif}\;t\_1 \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot y, 9, \mathsf{fma}\left(-4, z \cdot \left(t \cdot a\right), b\right)\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot -4\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)) < -2.00000000000000007e-284Initial program 91.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
lower-fma.f64N/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
metadata-evalN/A
lower-*.f6491.3
Applied rewrites91.3%
if -2.00000000000000007e-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)) < +inf.0Initial program 81.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites89.2%
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6489.2
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6489.2
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6487.5
lift-*.f64N/A
*-commutativeN/A
lower-*.f6487.5
Applied rewrites87.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites14.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6459.2
Applied rewrites59.2%
Applied rewrites70.1%
Final simplification87.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= (/ (+ b (- (* y (* x 9.0)) (* a (* t (* z 4.0))))) (* z c)) INFINITY) (/ (/ (fma x (* 9.0 y) (fma a (* -4.0 (* z t)) b)) c) z) (* (* a -4.0) (/ t c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (((b + ((y * (x * 9.0)) - (a * (t * (z * 4.0))))) / (z * c)) <= ((double) INFINITY)) {
tmp = (fma(x, (9.0 * y), fma(a, (-4.0 * (z * t)), b)) / c) / z;
} else {
tmp = (a * -4.0) * (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(b + Float64(Float64(y * Float64(x * 9.0)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) <= Inf) tmp = Float64(Float64(fma(x, Float64(9.0 * y), fma(a, Float64(-4.0 * Float64(z * t)), b)) / c) / z); else tmp = Float64(Float64(a * -4.0) * 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[(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], Infinity], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(a * -4.0), $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{b + \left(y \cdot \left(x \cdot 9\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c} \leq \infty:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, \mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), b\right)\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot -4\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 86.4%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites88.7%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites14.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6459.2
Applied rewrites59.2%
Applied rewrites70.1%
Final simplification86.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 (* y (* x 9.0))))
(if (<= t_1 -4e+275)
(* 9.0 (* x (/ y (* z c))))
(if (<= t_1 -4e+87)
(/ (/ (fma 9.0 (* x y) b) c) z)
(if (<= t_1 1e-61)
(/ (fma -4.0 (* t a) (/ b z)) c)
(/ (/ (fma x (* 9.0 y) 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 = y * (x * 9.0);
double tmp;
if (t_1 <= -4e+275) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (t_1 <= -4e+87) {
tmp = (fma(9.0, (x * y), b) / c) / z;
} else if (t_1 <= 1e-61) {
tmp = fma(-4.0, (t * a), (b / z)) / c;
} else {
tmp = (fma(x, (9.0 * y), 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(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -4e+275) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); elseif (t_1 <= -4e+87) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / c) / z); elseif (t_1 <= 1e-61) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / z)) / c); else tmp = Float64(Float64(fma(x, Float64(9.0 * y), 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[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+275], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -4e+87], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 1e-61], N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + 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 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+275}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{elif}\;t\_1 \leq -4 \cdot 10^{+87}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 10^{-61}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c}}{z}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999984e275Initial program 61.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites61.9%
Taylor expanded in x around inf
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
if -3.99999999999999984e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.9999999999999998e87Initial program 84.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites88.7%
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6488.8
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6488.8
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6488.8
lift-*.f64N/A
*-commutativeN/A
lower-*.f6488.8
Applied rewrites88.8%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6481.5
Applied rewrites81.5%
if -3.9999999999999998e87 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-61Initial program 75.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites67.2%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6482.1
Applied rewrites82.1%
if 1e-61 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 83.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites84.1%
Taylor expanded in a around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6474.3
Applied rewrites74.3%
Final simplification79.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (/ (fma x (* 9.0 y) b) c) z)) (t_2 (* y (* x 9.0))))
(if (<= t_2 -4e+275)
(* 9.0 (* x (/ y (* z c))))
(if (<= t_2 -4e+87)
t_1
(if (<= t_2 1e-61) (/ (fma -4.0 (* t a) (/ 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, (9.0 * y), b) / c) / z;
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -4e+275) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (t_2 <= -4e+87) {
tmp = t_1;
} else if (t_2 <= 1e-61) {
tmp = fma(-4.0, (t * a), (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(fma(x, Float64(9.0 * y), b) / c) / z) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -4e+275) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); elseif (t_2 <= -4e+87) tmp = t_1; elseif (t_2 <= 1e-61) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / 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[(x * N[(9.0 * y), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+275], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e+87], t$95$1, If[LessEqual[t$95$2, 1e-61], N[(N[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $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{\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{c}}{z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+275}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{+87}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{-61}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999984e275Initial program 61.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites61.9%
Taylor expanded in x around inf
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6476.6
Applied rewrites76.6%
if -3.99999999999999984e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.9999999999999998e87 or 1e-61 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 83.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites85.3%
Taylor expanded in a around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6476.1
Applied rewrites76.1%
if -3.9999999999999998e87 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-61Initial program 75.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites67.2%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6482.1
Applied rewrites82.1%
Final simplification79.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 (* y (* x 9.0))))
(if (<= t_1 -4e+87)
(* 9.0 (* x (/ y (* z c))))
(if (<= t_1 5e-196)
(* t (/ (* a -4.0) c))
(if (<= t_1 2e-12) (/ b (* z c)) (* y (* x (/ 9.0 (* z c)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -4e+87) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (t_1 <= 5e-196) {
tmp = t * ((a * -4.0) / c);
} else if (t_1 <= 2e-12) {
tmp = b / (z * c);
} else {
tmp = y * (x * (9.0 / (z * c)));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = y * (x * 9.0d0)
if (t_1 <= (-4d+87)) then
tmp = 9.0d0 * (x * (y / (z * c)))
else if (t_1 <= 5d-196) then
tmp = t * ((a * (-4.0d0)) / c)
else if (t_1 <= 2d-12) then
tmp = b / (z * c)
else
tmp = y * (x * (9.0d0 / (z * c)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double tmp;
if (t_1 <= -4e+87) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (t_1 <= 5e-196) {
tmp = t * ((a * -4.0) / c);
} else if (t_1 <= 2e-12) {
tmp = b / (z * c);
} else {
tmp = y * (x * (9.0 / (z * c)));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = y * (x * 9.0) tmp = 0 if t_1 <= -4e+87: tmp = 9.0 * (x * (y / (z * c))) elif t_1 <= 5e-196: tmp = t * ((a * -4.0) / c) elif t_1 <= 2e-12: tmp = b / (z * c) else: tmp = y * (x * (9.0 / (z * c))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_1 <= -4e+87) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); elseif (t_1 <= 5e-196) tmp = Float64(t * Float64(Float64(a * -4.0) / c)); elseif (t_1 <= 2e-12) tmp = Float64(b / Float64(z * c)); else tmp = Float64(y * Float64(x * Float64(9.0 / Float64(z * c)))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = y * (x * 9.0);
tmp = 0.0;
if (t_1 <= -4e+87)
tmp = 9.0 * (x * (y / (z * c)));
elseif (t_1 <= 5e-196)
tmp = t * ((a * -4.0) / c);
elseif (t_1 <= 2e-12)
tmp = b / (z * c);
else
tmp = y * (x * (9.0 / (z * c)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+87], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-196], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-12], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(y * N[(x * N[(9.0 / 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}
t_1 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+87}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-196}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-12}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(x \cdot \frac{9}{z \cdot c}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.9999999999999998e87Initial 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
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6467.9
Applied rewrites67.9%
if -3.9999999999999998e87 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000005e-196Initial program 75.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites82.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6456.9
Applied rewrites56.9%
Applied rewrites61.1%
if 5.0000000000000005e-196 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999996e-12Initial program 82.7%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6461.4
Applied rewrites61.4%
if 1.99999999999999996e-12 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 82.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites82.8%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6425.6
Applied rewrites25.6%
Taylor expanded in x 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
*-commutativeN/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.1
Applied rewrites55.1%
Final simplification60.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))) (t_2 (* 9.0 (* x (/ y (* z c))))))
(if (<= t_1 -4e+87)
t_2
(if (<= t_1 5e-196)
(* t (/ (* a -4.0) c))
(if (<= t_1 2e+59) (/ b (* z c)) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (x * 9.0);
double t_2 = 9.0 * (x * (y / (z * c)));
double tmp;
if (t_1 <= -4e+87) {
tmp = t_2;
} else if (t_1 <= 5e-196) {
tmp = t * ((a * -4.0) / c);
} else if (t_1 <= 2e+59) {
tmp = b / (z * c);
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = y * (x * 9.0d0)
t_2 = 9.0d0 * (x * (y / (z * c)))
if (t_1 <= (-4d+87)) then
tmp = t_2
else if (t_1 <= 5d-196) then
tmp = t * ((a * (-4.0d0)) / c)
else if (t_1 <= 2d+59) then
tmp = b / (z * c)
else
tmp = t_2
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 = y * (x * 9.0);
double t_2 = 9.0 * (x * (y / (z * c)));
double tmp;
if (t_1 <= -4e+87) {
tmp = t_2;
} else if (t_1 <= 5e-196) {
tmp = t * ((a * -4.0) / c);
} else if (t_1 <= 2e+59) {
tmp = 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]) def code(x, y, z, t, a, b, c): t_1 = y * (x * 9.0) t_2 = 9.0 * (x * (y / (z * c))) tmp = 0 if t_1 <= -4e+87: tmp = t_2 elif t_1 <= 5e-196: tmp = t * ((a * -4.0) / c) elif t_1 <= 2e+59: tmp = 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(9.0 * Float64(x * Float64(y / Float64(z * c)))) tmp = 0.0 if (t_1 <= -4e+87) tmp = t_2; elseif (t_1 <= 5e-196) tmp = Float64(t * Float64(Float64(a * -4.0) / c)); elseif (t_1 <= 2e+59) tmp = Float64(b / Float64(z * c)); else tmp = t_2; 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 = y * (x * 9.0);
t_2 = 9.0 * (x * (y / (z * c)));
tmp = 0.0;
if (t_1 <= -4e+87)
tmp = t_2;
elseif (t_1 <= 5e-196)
tmp = t * ((a * -4.0) / c);
elseif (t_1 <= 2e+59)
tmp = b / (z * c);
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+87], t$95$2, If[LessEqual[t$95$1, 5e-196], N[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+59], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot 9\right)\\
t_2 := 9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+87}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-196}:\\
\;\;\;\;t \cdot \frac{a \cdot -4}{c}\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+59}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.9999999999999998e87 or 1.99999999999999994e59 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.1%
Taylor expanded in x around inf
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6466.2
Applied rewrites66.2%
if -3.9999999999999998e87 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000005e-196Initial program 75.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites82.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6456.9
Applied rewrites56.9%
Applied rewrites61.1%
if 5.0000000000000005e-196 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.99999999999999994e59Initial program 82.5%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.5
Applied rewrites55.5%
Final simplification62.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(if (<= t_1 -5e+151)
(* 9.0 (* x (/ y (* z c))))
(if (<= t_1 1e-61)
(/ (fma -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+151) {
tmp = 9.0 * (x * (y / (z * c)));
} else if (t_1 <= 1e-61) {
tmp = fma(-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+151) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); elseif (t_1 <= 1e-61) tmp = Float64(fma(-4.0, Float64(t * a), Float64(b / 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, -5e+151], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-61], N[(N[(-4.0 * N[(t * a), $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^{+151}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{elif}\;t\_1 \leq 10^{-61}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, t \cdot a, \frac{b}{z}\right)}{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) < -5.0000000000000002e151Initial program 69.2%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites69.8%
Taylor expanded in x around inf
lower-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6474.6
Applied rewrites74.6%
if -5.0000000000000002e151 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1e-61Initial program 76.5%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites67.5%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6480.0
Applied rewrites80.0%
if 1e-61 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 83.6%
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-*.f6462.4
Applied rewrites62.4%
Taylor expanded in z around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6474.0
Applied rewrites74.0%
Applied rewrites74.1%
Final simplification77.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 -4.0 (* t a) (/ b z)) c)))
(if (<= z -6.2e+17)
t_1
(if (<= z 4.35e-184)
(/ (/ (fma 9.0 (* x y) b) c) z)
(if (<= z 4.3e+107)
(/ (fma a (* -4.0 (* z t)) (* y (* x 9.0))) (* 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(-4.0, (t * a), (b / z)) / c;
double tmp;
if (z <= -6.2e+17) {
tmp = t_1;
} else if (z <= 4.35e-184) {
tmp = (fma(9.0, (x * y), b) / c) / z;
} else if (z <= 4.3e+107) {
tmp = fma(a, (-4.0 * (z * t)), (y * (x * 9.0))) / (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(-4.0, Float64(t * a), Float64(b / z)) / c) tmp = 0.0 if (z <= -6.2e+17) tmp = t_1; elseif (z <= 4.35e-184) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / c) / z); elseif (z <= 4.3e+107) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), Float64(y * Float64(x * 9.0))) / 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[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -6.2e+17], t$95$1, If[LessEqual[z, 4.35e-184], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 4.3e+107], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + N[(y * N[(x * 9.0), $MachinePrecision]), $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(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{if}\;z \leq -6.2 \cdot 10^{+17}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.35 \cdot 10^{-184}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c}}{z}\\
\mathbf{elif}\;z \leq 4.3 \cdot 10^{+107}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), y \cdot \left(x \cdot 9\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.2e17 or 4.3e107 < z Initial program 58.8%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites57.3%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6475.1
Applied rewrites75.1%
if -6.2e17 < z < 4.34999999999999995e-184Initial program 97.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6499.8
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6499.8
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6497.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6488.2
Applied rewrites88.2%
if 4.34999999999999995e-184 < z < 4.3e107Initial program 89.2%
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-*.f6473.6
Applied rewrites73.6%
Applied rewrites73.7%
Final simplification79.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 (/ (fma -4.0 (* t a) (/ b z)) c)))
(if (<= z -6.2e+17)
t_1
(if (<= z 4.35e-184)
(/ (/ (fma 9.0 (* x y) b) c) z)
(if (<= z 4.3e+107)
(/ (fma a (* -4.0 (* z t)) (* 9.0 (* x y))) (* 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(-4.0, (t * a), (b / z)) / c;
double tmp;
if (z <= -6.2e+17) {
tmp = t_1;
} else if (z <= 4.35e-184) {
tmp = (fma(9.0, (x * y), b) / c) / z;
} else if (z <= 4.3e+107) {
tmp = fma(a, (-4.0 * (z * t)), (9.0 * (x * y))) / (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(-4.0, Float64(t * a), Float64(b / z)) / c) tmp = 0.0 if (z <= -6.2e+17) tmp = t_1; elseif (z <= 4.35e-184) tmp = Float64(Float64(fma(9.0, Float64(x * y), b) / c) / z); elseif (z <= 4.3e+107) tmp = Float64(fma(a, Float64(-4.0 * Float64(z * t)), Float64(9.0 * Float64(x * y))) / 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[(-4.0 * N[(t * a), $MachinePrecision] + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -6.2e+17], t$95$1, If[LessEqual[z, 4.35e-184], N[(N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 4.3e+107], N[(N[(a * N[(-4.0 * N[(z * t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$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(-4, t \cdot a, \frac{b}{z}\right)}{c}\\
\mathbf{if}\;z \leq -6.2 \cdot 10^{+17}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.35 \cdot 10^{-184}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{c}}{z}\\
\mathbf{elif}\;z \leq 4.3 \cdot 10^{+107}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, -4 \cdot \left(z \cdot t\right), 9 \cdot \left(x \cdot y\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.2e17 or 4.3e107 < z Initial program 58.8%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites57.3%
Taylor expanded in y around 0
associate-/l/N/A
associate-*r/N/A
div-subN/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-/.f64N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6475.1
Applied rewrites75.1%
if -6.2e17 < z < 4.34999999999999995e-184Initial program 97.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites99.8%
lift-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
lower-fma.f6499.8
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f6499.8
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lift-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lift-*.f64N/A
lower-*.f6497.4
lift-*.f64N/A
*-commutativeN/A
lower-*.f6497.4
Applied rewrites97.4%
Taylor expanded in a around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6488.2
Applied rewrites88.2%
if 4.34999999999999995e-184 < z < 4.3e107Initial program 89.2%
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-*.f6473.6
Applied rewrites73.6%
Final simplification79.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 (* t (/ (* a -4.0) c))))
(if (<= t -8.8e+160)
t_1
(if (<= t 6e-103) (/ (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 = t * ((a * -4.0) / c);
double tmp;
if (t <= -8.8e+160) {
tmp = t_1;
} else if (t <= 6e-103) {
tmp = 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(t * Float64(Float64(a * -4.0) / c)) tmp = 0.0 if (t <= -8.8e+160) tmp = t_1; elseif (t <= 6e-103) tmp = Float64(fma(Float64(x * 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[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8.8e+160], t$95$1, If[LessEqual[t, 6e-103], N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $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 := t \cdot \frac{a \cdot -4}{c}\\
\mathbf{if}\;t \leq -8.8 \cdot 10^{+160}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 6 \cdot 10^{-103}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -8.79999999999999968e160 or 6e-103 < t Initial program 72.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.3%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6451.9
Applied rewrites51.9%
Applied rewrites57.1%
if -8.79999999999999968e160 < t < 6e-103Initial program 82.3%
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-*.f6454.8
Applied rewrites54.8%
Taylor expanded in z around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6467.9
Applied rewrites67.9%
Applied rewrites68.0%
Final simplification63.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 (* t (/ (* a -4.0) c))))
(if (<= t -8.8e+160)
t_1
(if (<= t 6e-103) (/ (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 = t * ((a * -4.0) / c);
double tmp;
if (t <= -8.8e+160) {
tmp = t_1;
} else if (t <= 6e-103) {
tmp = 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(t * Float64(Float64(a * -4.0) / c)) tmp = 0.0 if (t <= -8.8e+160) tmp = t_1; elseif (t <= 6e-103) tmp = Float64(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[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8.8e+160], t$95$1, If[LessEqual[t, 6e-103], N[(N[(x * N[(9.0 * y), $MachinePrecision] + b), $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 := t \cdot \frac{a \cdot -4}{c}\\
\mathbf{if}\;t \leq -8.8 \cdot 10^{+160}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 6 \cdot 10^{-103}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -8.79999999999999968e160 or 6e-103 < t Initial program 72.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.3%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6451.9
Applied rewrites51.9%
Applied rewrites57.1%
if -8.79999999999999968e160 < t < 6e-103Initial program 82.3%
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-*.f6454.8
Applied rewrites54.8%
Taylor expanded in z around 0
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6467.9
Applied rewrites67.9%
Final simplification63.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 (* t (/ (* a -4.0) c))))
(if (<= t -8.8e+160)
t_1
(if (<= t 6e-103) (/ (fma 9.0 (* x 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 = t * ((a * -4.0) / c);
double tmp;
if (t <= -8.8e+160) {
tmp = t_1;
} else if (t <= 6e-103) {
tmp = fma(9.0, (x * 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(t * Float64(Float64(a * -4.0) / c)) tmp = 0.0 if (t <= -8.8e+160) tmp = t_1; elseif (t <= 6e-103) tmp = Float64(fma(9.0, Float64(x * 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[(t * N[(N[(a * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8.8e+160], t$95$1, If[LessEqual[t, 6e-103], N[(N[(9.0 * N[(x * y), $MachinePrecision] + b), $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 := t \cdot \frac{a \cdot -4}{c}\\
\mathbf{if}\;t \leq -8.8 \cdot 10^{+160}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 6 \cdot 10^{-103}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9, x \cdot y, b\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -8.79999999999999968e160 or 6e-103 < t Initial program 72.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.3%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6451.9
Applied rewrites51.9%
Applied rewrites57.1%
if -8.79999999999999968e160 < t < 6e-103Initial program 82.3%
Taylor expanded in z around 0
+-commutativeN/A
lower-fma.f64N/A
lower-*.f6467.9
Applied rewrites67.9%
Final simplification63.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 (* t (/ (* a -4.0) c)))) (if (<= a -3.3e-140) t_1 (if (<= a 0.00115) (/ (/ b c) z) 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 <= -3.3e-140) {
tmp = t_1;
} else if (a <= 0.00115) {
tmp = (b / c) / z;
} 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 <= (-3.3d-140)) then
tmp = t_1
else if (a <= 0.00115d0) then
tmp = (b / c) / z
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 <= -3.3e-140) {
tmp = t_1;
} else if (a <= 0.00115) {
tmp = (b / c) / z;
} 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 <= -3.3e-140: tmp = t_1 elif a <= 0.00115: tmp = (b / c) / z 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 <= -3.3e-140) tmp = t_1; elseif (a <= 0.00115) tmp = Float64(Float64(b / c) / z); 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 <= -3.3e-140)
tmp = t_1;
elseif (a <= 0.00115)
tmp = (b / c) / z;
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, -3.3e-140], t$95$1, If[LessEqual[a, 0.00115], N[(N[(b / c), $MachinePrecision] / z), $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 -3.3 \cdot 10^{-140}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 0.00115:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -3.29999999999999987e-140 or 0.00115 < a Initial program 75.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.3%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6450.7
Applied rewrites50.7%
Applied rewrites57.7%
if -3.29999999999999987e-140 < a < 0.00115Initial program 80.5%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites83.6%
Taylor expanded in b around inf
lower-/.f6447.8
Applied rewrites47.8%
Final simplification53.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (let* ((t_1 (* t (/ (* a -4.0) c)))) (if (<= a -2.15e-123) t_1 (if (<= a 8.8e-57) (/ (/ 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 <= -2.15e-123) {
tmp = t_1;
} else if (a <= 8.8e-57) {
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 <= (-2.15d-123)) then
tmp = t_1
else if (a <= 8.8d-57) 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 <= -2.15e-123) {
tmp = t_1;
} else if (a <= 8.8e-57) {
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 <= -2.15e-123: tmp = t_1 elif a <= 8.8e-57: 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 <= -2.15e-123) tmp = t_1; elseif (a <= 8.8e-57) tmp = Float64(Float64(b / 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 <= -2.15e-123)
tmp = t_1;
elseif (a <= 8.8e-57)
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, -2.15e-123], t$95$1, If[LessEqual[a, 8.8e-57], N[(N[(b / z), $MachinePrecision] / c), $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 -2.15 \cdot 10^{-123}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 8.8 \cdot 10^{-57}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -2.15000000000000016e-123 or 8.79999999999999994e-57 < a Initial program 75.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.4%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6449.5
Applied rewrites49.5%
Applied rewrites56.3%
if -2.15000000000000016e-123 < a < 8.79999999999999994e-57Initial program 80.3%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6443.0
Applied rewrites43.0%
Applied rewrites46.8%
Final simplification52.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (let* ((t_1 (* t (/ (* a -4.0) c)))) (if (<= a -2.15e-123) t_1 (if (<= a 5.2e+43) (* b (/ 1.0 (* 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 <= -2.15e-123) {
tmp = t_1;
} else if (a <= 5.2e+43) {
tmp = b * (1.0 / (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 <= (-2.15d-123)) then
tmp = t_1
else if (a <= 5.2d+43) then
tmp = b * (1.0d0 / (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 <= -2.15e-123) {
tmp = t_1;
} else if (a <= 5.2e+43) {
tmp = b * (1.0 / (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 <= -2.15e-123: tmp = t_1 elif a <= 5.2e+43: tmp = b * (1.0 / (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 <= -2.15e-123) tmp = t_1; elseif (a <= 5.2e+43) tmp = Float64(b * Float64(1.0 / 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 <= -2.15e-123)
tmp = t_1;
elseif (a <= 5.2e+43)
tmp = b * (1.0 / (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, -2.15e-123], t$95$1, If[LessEqual[a, 5.2e+43], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $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 -2.15 \cdot 10^{-123}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 5.2 \cdot 10^{+43}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -2.15000000000000016e-123 or 5.20000000000000042e43 < a Initial program 74.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites78.1%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6452.1
Applied rewrites52.1%
Applied rewrites59.7%
if -2.15000000000000016e-123 < a < 5.20000000000000042e43Initial program 81.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6443.1
Applied rewrites43.1%
Applied rewrites43.0%
Final simplification51.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 (<= t -3.5e+123) (* (* a -4.0) (/ t c)) (if (<= t 5.5e-179) (/ 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 (t <= -3.5e+123) {
tmp = (a * -4.0) * (t / c);
} else if (t <= 5.5e-179) {
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 (t <= (-3.5d+123)) then
tmp = (a * (-4.0d0)) * (t / c)
else if (t <= 5.5d-179) 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 (t <= -3.5e+123) {
tmp = (a * -4.0) * (t / c);
} else if (t <= 5.5e-179) {
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 t <= -3.5e+123: tmp = (a * -4.0) * (t / c) elif t <= 5.5e-179: 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 (t <= -3.5e+123) tmp = Float64(Float64(a * -4.0) * Float64(t / c)); elseif (t <= 5.5e-179) 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 (t <= -3.5e+123)
tmp = (a * -4.0) * (t / c);
elseif (t <= 5.5e-179)
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[t, -3.5e+123], N[(N[(a * -4.0), $MachinePrecision] * N[(t / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5.5e-179], 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}\;t \leq -3.5 \cdot 10^{+123}:\\
\;\;\;\;\left(a \cdot -4\right) \cdot \frac{t}{c}\\
\mathbf{elif}\;t \leq 5.5 \cdot 10^{-179}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(t \cdot a\right)}{c}\\
\end{array}
\end{array}
if t < -3.5e123Initial program 67.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites75.5%
Taylor expanded in a around inf
associate-*r/N/A
lower-/.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6455.5
Applied rewrites55.5%
Applied rewrites60.3%
if -3.5e123 < t < 5.5000000000000003e-179Initial program 82.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6441.1
Applied rewrites41.1%
if 5.5000000000000003e-179 < t Initial program 76.1%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6444.4
Applied rewrites44.4%
Final simplification45.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)) c))) (if (<= t -3.5e+123) t_1 (if (<= t 5.5e-179) (/ 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 (t <= -3.5e+123) {
tmp = t_1;
} else if (t <= 5.5e-179) {
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 (t <= (-3.5d+123)) then
tmp = t_1
else if (t <= 5.5d-179) 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 (t <= -3.5e+123) {
tmp = t_1;
} else if (t <= 5.5e-179) {
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 t <= -3.5e+123: tmp = t_1 elif t <= 5.5e-179: 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 (t <= -3.5e+123) tmp = t_1; elseif (t <= 5.5e-179) 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 (t <= -3.5e+123)
tmp = t_1;
elseif (t <= 5.5e-179)
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[t, -3.5e+123], t$95$1, If[LessEqual[t, 5.5e-179], 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}\;t \leq -3.5 \cdot 10^{+123}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 5.5 \cdot 10^{-179}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -3.5e123 or 5.5000000000000003e-179 < t Initial program 73.6%
Taylor expanded in z around inf
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-*.f6447.4
Applied rewrites47.4%
if -3.5e123 < t < 5.5000000000000003e-179Initial program 82.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6441.1
Applied rewrites41.1%
Final simplification44.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 (/ 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 77.6%
Taylor expanded in b around inf
lower-/.f64N/A
*-commutativeN/A
lower-*.f6431.8
Applied rewrites31.8%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024233
(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)))