
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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) z)
(/ y c)
(* (fma (/ t c) -4.0 (/ b (* (* a z) c))) a))))
(if (<= z -3.5e+96)
t_1
(if (<= z 1.2e+20)
(/ (fma (* (* t z) -4.0) a (fma (* y x) 9.0 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(((x * 9.0) / z), (y / c), (fma((t / c), -4.0, (b / ((a * z) * c))) * a));
double tmp;
if (z <= -3.5e+96) {
tmp = t_1;
} else if (z <= 1.2e+20) {
tmp = fma(((t * z) * -4.0), a, fma((y * x), 9.0, 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(Float64(Float64(x * 9.0) / z), Float64(y / c), Float64(fma(Float64(t / c), -4.0, Float64(b / Float64(Float64(a * z) * c))) * a)) tmp = 0.0 if (z <= -3.5e+96) tmp = t_1; elseif (z <= 1.2e+20) tmp = Float64(fma(Float64(Float64(t * z) * -4.0), a, fma(Float64(y * x), 9.0, b)) / Float64(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[(N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision] * N[(y / c), $MachinePrecision] + N[(N[(N[(t / c), $MachinePrecision] * -4.0 + N[(b / N[(N[(a * z), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.5e+96], t$95$1, If[LessEqual[z, 1.2e+20], N[(N[(N[(N[(t * z), $MachinePrecision] * -4.0), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{x \cdot 9}{z}, \frac{y}{c}, \mathsf{fma}\left(\frac{t}{c}, -4, \frac{b}{\left(a \cdot z\right) \cdot c}\right) \cdot a\right)\\
\mathbf{if}\;z \leq -3.5 \cdot 10^{+96}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.2 \cdot 10^{+20}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot -4, a, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -3.4999999999999999e96 or 1.2e20 < z Initial program 56.2%
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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites63.7%
Taylor expanded in a around inf
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6484.8
Applied rewrites84.8%
if -3.4999999999999999e96 < z < 1.2e20Initial program 92.8%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-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-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.8%
Final simplification89.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)) (* (* (* 4.0 z) t) a)) b) (* c z))))
(if (<= t_1 -5e+249)
(/ (/ (fma (* (* -4.0 z) a) t (fma (* y x) 9.0 b)) z) c)
(if (<= t_1 1e-238)
(/ (fma (/ (* y x) c) 9.0 (/ (fma -4.0 (* (* t z) a) b) c)) z)
(if (<= t_1 INFINITY)
t_1
(fma (/ (* x 9.0) z) (/ y c) (/ (* (* t a) 4.0) (- c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (((y * (x * 9.0)) - (((4.0 * z) * t) * a)) + b) / (c * z);
double tmp;
if (t_1 <= -5e+249) {
tmp = (fma(((-4.0 * z) * a), t, fma((y * x), 9.0, b)) / z) / c;
} else if (t_1 <= 1e-238) {
tmp = fma(((y * x) / c), 9.0, (fma(-4.0, ((t * z) * a), b) / c)) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = fma(((x * 9.0) / z), (y / c), (((t * a) * 4.0) / -c));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(Float64(y * Float64(x * 9.0)) - Float64(Float64(Float64(4.0 * z) * t) * a)) + b) / Float64(c * z)) tmp = 0.0 if (t_1 <= -5e+249) tmp = Float64(Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * x), 9.0, b)) / z) / c); elseif (t_1 <= 1e-238) tmp = Float64(fma(Float64(Float64(y * x) / c), 9.0, Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / c)) / z); elseif (t_1 <= Inf) tmp = t_1; else tmp = fma(Float64(Float64(x * 9.0) / z), Float64(y / c), Float64(Float64(Float64(t * a) * 4.0) / Float64(-c))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(4.0 * z), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+249], N[(N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 1e-238], N[(N[(N[(N[(y * x), $MachinePrecision] / c), $MachinePrecision] * 9.0 + N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$1, N[(N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision] * N[(y / c), $MachinePrecision] + N[(N[(N[(t * a), $MachinePrecision] * 4.0), $MachinePrecision] / (-c)), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\left(y \cdot \left(x \cdot 9\right) - \left(\left(4 \cdot z\right) \cdot t\right) \cdot a\right) + b}{c \cdot z}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+249}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{z}}{c}\\
\mathbf{elif}\;t\_1 \leq 10^{-238}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\frac{y \cdot x}{c}, 9, \frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{c}\right)}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x \cdot 9}{z}, \frac{y}{c}, \frac{\left(t \cdot a\right) \cdot 4}{-c}\right)\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -4.9999999999999996e249Initial program 78.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites86.0%
if -4.9999999999999996e249 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 9.9999999999999999e-239Initial program 85.6%
Taylor expanded in z around 0
lower-/.f64N/A
Applied rewrites93.3%
if 9.9999999999999999e-239 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 89.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
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites29.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.1
Applied rewrites89.1%
Final simplification89.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 (/ (fma (* y x) 9.0 b) (* c z))) (t_2 (* y (* x 9.0))))
(if (<= t_2 -8e+187)
(* (/ x z) (* (/ y c) 9.0))
(if (<= t_2 -4e+77)
t_1
(if (<= t_2 1e+32)
(/ (fma -4.0 (* (* t z) a) b) (* c z))
(if (<= t_2 5e+275) t_1 (* (* (/ 9.0 z) x) (/ y 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 = fma((y * x), 9.0, b) / (c * z);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -8e+187) {
tmp = (x / z) * ((y / c) * 9.0);
} else if (t_2 <= -4e+77) {
tmp = t_1;
} else if (t_2 <= 1e+32) {
tmp = fma(-4.0, ((t * z) * a), b) / (c * z);
} else if (t_2 <= 5e+275) {
tmp = t_1;
} else {
tmp = ((9.0 / z) * x) * (y / 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(fma(Float64(y * x), 9.0, b) / Float64(c * z)) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -8e+187) tmp = Float64(Float64(x / z) * Float64(Float64(y / c) * 9.0)); elseif (t_2 <= -4e+77) tmp = t_1; elseif (t_2 <= 1e+32) tmp = Float64(fma(-4.0, Float64(Float64(t * z) * a), b) / Float64(c * z)); elseif (t_2 <= 5e+275) tmp = t_1; else tmp = Float64(Float64(Float64(9.0 / z) * x) * Float64(y / c)); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -8e+187], N[(N[(x / z), $MachinePrecision] * N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -4e+77], t$95$1, If[LessEqual[t$95$2, 1e+32], N[(N[(-4.0 * N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+275], t$95$1, N[(N[(N[(9.0 / z), $MachinePrecision] * x), $MachinePrecision] * N[(y / 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{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
t_2 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_2 \leq -8 \cdot 10^{+187}:\\
\;\;\;\;\frac{x}{z} \cdot \left(\frac{y}{c} \cdot 9\right)\\
\mathbf{elif}\;t\_2 \leq -4 \cdot 10^{+77}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 10^{+32}:\\
\;\;\;\;\frac{\mathsf{fma}\left(-4, \left(t \cdot z\right) \cdot a, b\right)}{c \cdot z}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+275}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{9}{z} \cdot x\right) \cdot \frac{y}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -7.99999999999999926e187Initial program 58.7%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6481.3
Applied rewrites81.3%
if -7.99999999999999926e187 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999993e77 or 1.00000000000000005e32 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000003e275Initial program 80.0%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6473.9
Applied rewrites73.9%
if -3.99999999999999993e77 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 1.00000000000000005e32Initial program 83.6%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6475.4
Applied rewrites75.4%
if 5.0000000000000003e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.7%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6471.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites71.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.2
Applied rewrites71.2%
Applied rewrites99.8%
Final simplification77.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -3.5e+96)
(fma (/ (* x 9.0) z) (/ y c) (* (fma (/ a c) -4.0 (/ b (* (* c z) t))) t))
(if (<= z 5.5e+99)
(/ (fma (* (* t z) -4.0) a (fma (* y x) 9.0 b)) (* c z))
(fma (* (/ x (* c z)) 9.0) y (fma (/ (* t a) c) -4.0 (/ b (* c z)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -3.5e+96) {
tmp = fma(((x * 9.0) / z), (y / c), (fma((a / c), -4.0, (b / ((c * z) * t))) * t));
} else if (z <= 5.5e+99) {
tmp = fma(((t * z) * -4.0), a, fma((y * x), 9.0, b)) / (c * z);
} else {
tmp = fma(((x / (c * z)) * 9.0), y, fma(((t * a) / c), -4.0, (b / (c * z))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -3.5e+96) tmp = fma(Float64(Float64(x * 9.0) / z), Float64(y / c), Float64(fma(Float64(a / c), -4.0, Float64(b / Float64(Float64(c * z) * t))) * t)); elseif (z <= 5.5e+99) tmp = Float64(fma(Float64(Float64(t * z) * -4.0), a, fma(Float64(y * x), 9.0, b)) / Float64(c * z)); else tmp = fma(Float64(Float64(x / Float64(c * z)) * 9.0), y, fma(Float64(Float64(t * a) / c), -4.0, Float64(b / Float64(c * z)))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -3.5e+96], N[(N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision] * N[(y / c), $MachinePrecision] + N[(N[(N[(a / c), $MachinePrecision] * -4.0 + N[(b / N[(N[(c * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.5e+99], N[(N[(N[(N[(t * z), $MachinePrecision] * -4.0), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0 + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.5 \cdot 10^{+96}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x \cdot 9}{z}, \frac{y}{c}, \mathsf{fma}\left(\frac{a}{c}, -4, \frac{b}{\left(c \cdot z\right) \cdot t}\right) \cdot t\right)\\
\mathbf{elif}\;z \leq 5.5 \cdot 10^{+99}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot -4, a, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{c \cdot z} \cdot 9, y, \mathsf{fma}\left(\frac{t \cdot a}{c}, -4, \frac{b}{c \cdot z}\right)\right)\\
\end{array}
\end{array}
if z < -3.4999999999999999e96Initial program 52.4%
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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites60.1%
Taylor expanded in t around inf
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
associate-*r*N/A
lower-*.f64N/A
lower-*.f6477.6
Applied rewrites77.6%
if -3.4999999999999999e96 < z < 5.5000000000000002e99Initial program 92.5%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-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-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites92.5%
if 5.5000000000000002e99 < z Initial program 43.8%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6484.2
Applied rewrites84.2%
Final simplification89.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 -2e+77)
(/ 1.0 (* (/ c (fma 9.0 (* y x) b)) z))
(if (<= t_1 5e+16)
(/ (fma (* t a) -4.0 (/ b z)) c)
(if (<= t_1 5e+275)
(/ (fma (* y x) 9.0 b) (* c z))
(* (* (/ 9.0 z) x) (/ y 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 <= -2e+77) {
tmp = 1.0 / ((c / fma(9.0, (y * x), b)) * z);
} else if (t_1 <= 5e+16) {
tmp = fma((t * a), -4.0, (b / z)) / c;
} else if (t_1 <= 5e+275) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = ((9.0 / z) * x) * (y / 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 <= -2e+77) tmp = Float64(1.0 / Float64(Float64(c / fma(9.0, Float64(y * x), b)) * z)); elseif (t_1 <= 5e+16) tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); elseif (t_1 <= 5e+275) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(9.0 / z) * x) * Float64(y / 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, -2e+77], N[(1.0 / N[(N[(c / N[(9.0 * N[(y * x), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+16], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+275], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / z), $MachinePrecision] * x), $MachinePrecision] * N[(y / 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 -2 \cdot 10^{+77}:\\
\;\;\;\;\frac{1}{\frac{c}{\mathsf{fma}\left(9, y \cdot x, b\right)} \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+275}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{9}{z} \cdot x\right) \cdot \frac{y}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -1.99999999999999997e77Initial program 70.6%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6468.1
Applied rewrites68.1%
Applied rewrites68.9%
if -1.99999999999999997e77 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e16Initial program 83.2%
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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites79.7%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6480.8
Applied rewrites80.8%
Taylor expanded in x around 0
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6484.9
Applied rewrites84.9%
if 5e16 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000003e275Initial program 80.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.4
Applied rewrites76.4%
if 5.0000000000000003e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.7%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6471.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites71.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.2
Applied rewrites71.2%
Applied rewrites99.8%
Final simplification82.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 -4e+77)
(/ (/ (fma (* x 9.0) y b) c) z)
(if (<= t_1 5e+16)
(/ (fma (* t a) -4.0 (/ b z)) c)
(if (<= t_1 5e+275)
(/ (fma (* y x) 9.0 b) (* c z))
(* (* (/ 9.0 z) x) (/ y 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+77) {
tmp = (fma((x * 9.0), y, b) / c) / z;
} else if (t_1 <= 5e+16) {
tmp = fma((t * a), -4.0, (b / z)) / c;
} else if (t_1 <= 5e+275) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = ((9.0 / z) * x) * (y / 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+77) tmp = Float64(Float64(fma(Float64(x * 9.0), y, b) / c) / z); elseif (t_1 <= 5e+16) tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); elseif (t_1 <= 5e+275) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(9.0 / z) * x) * Float64(y / 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, -4e+77], N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y + b), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, 5e+16], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+275], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / z), $MachinePrecision] * x), $MachinePrecision] * N[(y / 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 -4 \cdot 10^{+77}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(x \cdot 9, y, b\right)}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+275}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{9}{z} \cdot x\right) \cdot \frac{y}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999993e77Initial program 69.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites79.0%
Taylor expanded in b around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6467.6
Applied rewrites67.6%
Taylor expanded in z around 0
lower-/.f64N/A
+-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f6467.3
Applied rewrites67.3%
if -3.99999999999999993e77 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e16Initial program 83.3%
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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites79.8%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6480.9
Applied rewrites80.9%
Taylor expanded in x around 0
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6485.0
Applied rewrites85.0%
if 5e16 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000003e275Initial program 80.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.4
Applied rewrites76.4%
if 5.0000000000000003e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.7%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6471.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites71.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.2
Applied rewrites71.2%
Applied rewrites99.8%
Final simplification81.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (fma (* y x) 9.0 b)) (t_2 (* y (* x 9.0))))
(if (<= t_2 -4e+77)
(/ (/ t_1 c) z)
(if (<= t_2 5e+16)
(/ (fma (* t a) -4.0 (/ b z)) c)
(if (<= t_2 5e+275) (/ t_1 (* c z)) (* (* (/ 9.0 z) x) (/ y 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 = fma((y * x), 9.0, b);
double t_2 = y * (x * 9.0);
double tmp;
if (t_2 <= -4e+77) {
tmp = (t_1 / c) / z;
} else if (t_2 <= 5e+16) {
tmp = fma((t * a), -4.0, (b / z)) / c;
} else if (t_2 <= 5e+275) {
tmp = t_1 / (c * z);
} else {
tmp = ((9.0 / z) * x) * (y / 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 = fma(Float64(y * x), 9.0, b) t_2 = Float64(y * Float64(x * 9.0)) tmp = 0.0 if (t_2 <= -4e+77) tmp = Float64(Float64(t_1 / c) / z); elseif (t_2 <= 5e+16) tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); elseif (t_2 <= 5e+275) tmp = Float64(t_1 / Float64(c * z)); else tmp = Float64(Float64(Float64(9.0 / z) * x) * Float64(y / 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[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -4e+77], N[(N[(t$95$1 / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$2, 5e+16], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$2, 5e+275], N[(t$95$1 / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / z), $MachinePrecision] * x), $MachinePrecision] * N[(y / 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 := \mathsf{fma}\left(y \cdot x, 9, b\right)\\
t_2 := y \cdot \left(x \cdot 9\right)\\
\mathbf{if}\;t\_2 \leq -4 \cdot 10^{+77}:\\
\;\;\;\;\frac{\frac{t\_1}{c}}{z}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+275}:\\
\;\;\;\;\frac{t\_1}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{9}{z} \cdot x\right) \cdot \frac{y}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -3.99999999999999993e77Initial program 69.9%
Taylor expanded in z around 0
associate-/r*N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6467.3
Applied rewrites67.3%
if -3.99999999999999993e77 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e16Initial program 83.3%
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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites79.8%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6480.9
Applied rewrites80.9%
Taylor expanded in x around 0
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6485.0
Applied rewrites85.0%
if 5e16 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000003e275Initial program 80.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.4
Applied rewrites76.4%
if 5.0000000000000003e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.7%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6471.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites71.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.2
Applied rewrites71.2%
Applied rewrites99.8%
Final simplification81.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* x 9.0))))
(if (<= t_1 -8e+187)
(* (/ x z) (* (/ y c) 9.0))
(if (<= t_1 5e+16)
(/ (fma (* t a) -4.0 (/ b z)) c)
(if (<= t_1 5e+275)
(/ (fma (* y x) 9.0 b) (* c z))
(* (* (/ 9.0 z) x) (/ y 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 <= -8e+187) {
tmp = (x / z) * ((y / c) * 9.0);
} else if (t_1 <= 5e+16) {
tmp = fma((t * a), -4.0, (b / z)) / c;
} else if (t_1 <= 5e+275) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = ((9.0 / z) * x) * (y / 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 <= -8e+187) tmp = Float64(Float64(x / z) * Float64(Float64(y / c) * 9.0)); elseif (t_1 <= 5e+16) tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); elseif (t_1 <= 5e+275) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(9.0 / z) * x) * Float64(y / 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, -8e+187], N[(N[(x / z), $MachinePrecision] * N[(N[(y / c), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+16], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t$95$1, 5e+275], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(9.0 / z), $MachinePrecision] * x), $MachinePrecision] * N[(y / 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 -8 \cdot 10^{+187}:\\
\;\;\;\;\frac{x}{z} \cdot \left(\frac{y}{c} \cdot 9\right)\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+16}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+275}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{9}{z} \cdot x\right) \cdot \frac{y}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -7.99999999999999926e187Initial program 58.7%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
times-fracN/A
lower-*.f64N/A
*-commutativeN/A
associate-*l/N/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f6481.3
Applied rewrites81.3%
if -7.99999999999999926e187 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5e16Initial program 83.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
sub-negN/A
lift-*.f64N/A
lift-*.f64N/A
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites78.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6477.0
Applied rewrites77.0%
Taylor expanded in x around 0
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6480.5
Applied rewrites80.5%
if 5e16 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 5.0000000000000003e275Initial program 80.7%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.4
Applied rewrites76.4%
if 5.0000000000000003e275 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 70.7%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6471.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites71.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.2
Applied rewrites71.2%
Applied rewrites99.8%
Final simplification81.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1
(fma (* (/ x (* c z)) 9.0) y (fma (/ (* t a) c) -4.0 (/ b (* c z))))))
(if (<= z -2.3e+24)
t_1
(if (<= z 9.2e+109)
(/ (/ (fma (* (* -4.0 z) a) t (fma (* y x) 9.0 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(((x / (c * z)) * 9.0), y, fma(((t * a) / c), -4.0, (b / (c * z))));
double tmp;
if (z <= -2.3e+24) {
tmp = t_1;
} else if (z <= 9.2e+109) {
tmp = (fma(((-4.0 * z) * a), t, fma((y * x), 9.0, 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(Float64(Float64(x / Float64(c * z)) * 9.0), y, fma(Float64(Float64(t * a) / c), -4.0, Float64(b / Float64(c * z)))) tmp = 0.0 if (z <= -2.3e+24) tmp = t_1; elseif (z <= 9.2e+109) tmp = Float64(Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(y * x), 9.0, 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[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y + N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0 + N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.3e+24], t$95$1, If[LessEqual[z, 9.2e+109], N[(N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(y * x), $MachinePrecision] * 9.0 + 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(\frac{x}{c \cdot z} \cdot 9, y, \mathsf{fma}\left(\frac{t \cdot a}{c}, -4, \frac{b}{c \cdot z}\right)\right)\\
\mathbf{if}\;z \leq -2.3 \cdot 10^{+24}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 9.2 \cdot 10^{+109}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -2.2999999999999999e24 or 9.20000000000000042e109 < z Initial program 56.7%
Taylor expanded in x around 0
associate--l+N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6483.3
Applied rewrites83.3%
if -2.2999999999999999e24 < z < 9.20000000000000042e109Initial program 92.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites93.5%
Final simplification89.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 (fma (/ (* x 9.0) z) (/ y c) (/ (* (* t a) 4.0) (- c)))))
(if (<= z -1.2e+124)
t_1
(if (<= z 6.4e+139)
(/ (fma (* (* t z) -4.0) a (fma (* y x) 9.0 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(((x * 9.0) / z), (y / c), (((t * a) * 4.0) / -c));
double tmp;
if (z <= -1.2e+124) {
tmp = t_1;
} else if (z <= 6.4e+139) {
tmp = fma(((t * z) * -4.0), a, fma((y * x), 9.0, 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(Float64(Float64(x * 9.0) / z), Float64(y / c), Float64(Float64(Float64(t * a) * 4.0) / Float64(-c))) tmp = 0.0 if (z <= -1.2e+124) tmp = t_1; elseif (z <= 6.4e+139) tmp = Float64(fma(Float64(Float64(t * z) * -4.0), a, fma(Float64(y * x), 9.0, b)) / Float64(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[(N[(N[(x * 9.0), $MachinePrecision] / z), $MachinePrecision] * N[(y / c), $MachinePrecision] + N[(N[(N[(t * a), $MachinePrecision] * 4.0), $MachinePrecision] / (-c)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.2e+124], t$95$1, If[LessEqual[z, 6.4e+139], N[(N[(N[(N[(t * z), $MachinePrecision] * -4.0), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(\frac{x \cdot 9}{z}, \frac{y}{c}, \frac{\left(t \cdot a\right) \cdot 4}{-c}\right)\\
\mathbf{if}\;z \leq -1.2 \cdot 10^{+124}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6.4 \cdot 10^{+139}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot -4, a, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -1.20000000000000003e124 or 6.4000000000000002e139 < z Initial program 45.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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites57.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6479.3
Applied rewrites79.3%
if -1.20000000000000003e124 < z < 6.4000000000000002e139Initial program 90.5%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-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-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites90.5%
Final simplification87.7%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (fma (* t a) -4.0 (/ b z)) c)))
(if (<= z -7e+96)
t_1
(if (<= z 1.15e+123)
(/ (fma (* (* t z) -4.0) a (fma (* y x) 9.0 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((t * a), -4.0, (b / z)) / c;
double tmp;
if (z <= -7e+96) {
tmp = t_1;
} else if (z <= 1.15e+123) {
tmp = fma(((t * z) * -4.0), a, fma((y * x), 9.0, 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(fma(Float64(t * a), -4.0, Float64(b / z)) / c) tmp = 0.0 if (z <= -7e+96) tmp = t_1; elseif (z <= 1.15e+123) tmp = Float64(fma(Float64(Float64(t * z) * -4.0), a, fma(Float64(y * x), 9.0, b)) / Float64(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[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -7e+96], t$95$1, If[LessEqual[z, 1.15e+123], N[(N[(N[(N[(t * z), $MachinePrecision] * -4.0), $MachinePrecision] * a + N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $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(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{if}\;z \leq -7 \cdot 10^{+96}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{+123}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\left(t \cdot z\right) \cdot -4, a, \mathsf{fma}\left(y \cdot x, 9, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.9999999999999998e96 or 1.14999999999999995e123 < z Initial program 47.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
times-fracN/A
lower-fma.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-neg.f64N/A
lift-*.f64N/A
Applied rewrites56.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6473.6
Applied rewrites73.6%
Taylor expanded in x around 0
*-commutativeN/A
associate-/r*N/A
associate-*r/N/A
div-subN/A
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f6476.3
Applied rewrites76.3%
if -6.9999999999999998e96 < z < 1.14999999999999995e123Initial program 91.6%
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
lift-*.f64N/A
distribute-lft-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-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites91.6%
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 (<= t -1.12e+39)
(* (* (/ t c) a) -4.0)
(if (<= t 6.2e-223)
(* (* (/ y (* c z)) x) 9.0)
(if (<= t 1.15e-82) (/ (/ b z) c) (* (* (/ -4.0 c) a) t)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = ((y / (c * z)) * x) * 9.0;
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-1.12d+39)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (t <= 6.2d-223) then
tmp = ((y / (c * z)) * x) * 9.0d0
else if (t <= 1.15d-82) then
tmp = (b / z) / c
else
tmp = (((-4.0d0) / c) * a) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = ((y / (c * z)) * x) * 9.0;
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.12e+39: tmp = ((t / c) * a) * -4.0 elif t <= 6.2e-223: tmp = ((y / (c * z)) * x) * 9.0 elif t <= 1.15e-82: tmp = (b / z) / c else: tmp = ((-4.0 / c) * a) * t return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.12e+39) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (t <= 6.2e-223) tmp = Float64(Float64(Float64(y / Float64(c * z)) * x) * 9.0); elseif (t <= 1.15e-82) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(Float64(-4.0 / c) * a) * t); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.12e+39)
tmp = ((t / c) * a) * -4.0;
elseif (t <= 6.2e-223)
tmp = ((y / (c * z)) * x) * 9.0;
elseif (t <= 1.15e-82)
tmp = (b / z) / c;
else
tmp = ((-4.0 / c) * a) * t;
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, -1.12e+39], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t, 6.2e-223], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * 9.0), $MachinePrecision], If[LessEqual[t, 1.15e-82], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(-4.0 / c), $MachinePrecision] * a), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.12 \cdot 10^{+39}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;t \leq 6.2 \cdot 10^{-223}:\\
\;\;\;\;\left(\frac{y}{c \cdot z} \cdot x\right) \cdot 9\\
\mathbf{elif}\;t \leq 1.15 \cdot 10^{-82}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-4}{c} \cdot a\right) \cdot t\\
\end{array}
\end{array}
if t < -1.12e39Initial program 77.8%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6479.6
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
Applied rewrites67.7%
if -1.12e39 < t < 6.20000000000000036e-223Initial program 84.6%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6484.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites80.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.6
Applied rewrites45.6%
Applied rewrites47.8%
Applied rewrites48.1%
if 6.20000000000000036e-223 < t < 1.14999999999999998e-82Initial program 78.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6453.6
Applied rewrites53.6%
Applied rewrites59.6%
if 1.14999999999999998e-82 < t Initial program 76.0%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6476.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6439.3
Applied rewrites39.3%
Applied rewrites39.3%
Applied rewrites40.5%
Final simplification52.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -1.12e+39)
(* (* (/ t c) a) -4.0)
(if (<= t 6.2e-223)
(* (* (/ y (* c z)) 9.0) x)
(if (<= t 1.15e-82) (/ (/ b z) c) (* (* (/ -4.0 c) a) t)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-1.12d+39)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (t <= 6.2d-223) then
tmp = ((y / (c * z)) * 9.0d0) * x
else if (t <= 1.15d-82) then
tmp = (b / z) / c
else
tmp = (((-4.0d0) / c) * a) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.12e+39: tmp = ((t / c) * a) * -4.0 elif t <= 6.2e-223: tmp = ((y / (c * z)) * 9.0) * x elif t <= 1.15e-82: tmp = (b / z) / c else: tmp = ((-4.0 / c) * a) * t return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.12e+39) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (t <= 6.2e-223) tmp = Float64(Float64(Float64(y / Float64(c * z)) * 9.0) * x); elseif (t <= 1.15e-82) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(Float64(-4.0 / c) * a) * t); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.12e+39)
tmp = ((t / c) * a) * -4.0;
elseif (t <= 6.2e-223)
tmp = ((y / (c * z)) * 9.0) * x;
elseif (t <= 1.15e-82)
tmp = (b / z) / c;
else
tmp = ((-4.0 / c) * a) * t;
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, -1.12e+39], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t, 6.2e-223], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[t, 1.15e-82], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(-4.0 / c), $MachinePrecision] * a), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.12 \cdot 10^{+39}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;t \leq 6.2 \cdot 10^{-223}:\\
\;\;\;\;\left(\frac{y}{c \cdot z} \cdot 9\right) \cdot x\\
\mathbf{elif}\;t \leq 1.15 \cdot 10^{-82}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-4}{c} \cdot a\right) \cdot t\\
\end{array}
\end{array}
if t < -1.12e39Initial program 77.8%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6479.6
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
Applied rewrites67.7%
if -1.12e39 < t < 6.20000000000000036e-223Initial program 84.6%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6484.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites80.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.6
Applied rewrites45.6%
Applied rewrites47.8%
Applied rewrites48.0%
if 6.20000000000000036e-223 < t < 1.14999999999999998e-82Initial program 78.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6453.6
Applied rewrites53.6%
Applied rewrites59.6%
if 1.14999999999999998e-82 < t Initial program 76.0%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6476.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6439.3
Applied rewrites39.3%
Applied rewrites39.3%
Applied rewrites40.5%
Final simplification52.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -1.12e+39)
(* (* (/ t c) a) -4.0)
(if (<= t 6.2e-223)
(* (/ y (* c z)) (* x 9.0))
(if (<= t 1.15e-82) (/ (/ b z) c) (* (* (/ -4.0 c) a) t)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = (y / (c * z)) * (x * 9.0);
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-1.12d+39)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (t <= 6.2d-223) then
tmp = (y / (c * z)) * (x * 9.0d0)
else if (t <= 1.15d-82) then
tmp = (b / z) / c
else
tmp = (((-4.0d0) / c) * a) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.12e+39) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 6.2e-223) {
tmp = (y / (c * z)) * (x * 9.0);
} else if (t <= 1.15e-82) {
tmp = (b / z) / c;
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.12e+39: tmp = ((t / c) * a) * -4.0 elif t <= 6.2e-223: tmp = (y / (c * z)) * (x * 9.0) elif t <= 1.15e-82: tmp = (b / z) / c else: tmp = ((-4.0 / c) * a) * t return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.12e+39) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (t <= 6.2e-223) tmp = Float64(Float64(y / Float64(c * z)) * Float64(x * 9.0)); elseif (t <= 1.15e-82) tmp = Float64(Float64(b / z) / c); else tmp = Float64(Float64(Float64(-4.0 / c) * a) * t); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.12e+39)
tmp = ((t / c) * a) * -4.0;
elseif (t <= 6.2e-223)
tmp = (y / (c * z)) * (x * 9.0);
elseif (t <= 1.15e-82)
tmp = (b / z) / c;
else
tmp = ((-4.0 / c) * a) * t;
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, -1.12e+39], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t, 6.2e-223], N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(x * 9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.15e-82], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], N[(N[(N[(-4.0 / c), $MachinePrecision] * a), $MachinePrecision] * t), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.12 \cdot 10^{+39}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;t \leq 6.2 \cdot 10^{-223}:\\
\;\;\;\;\frac{y}{c \cdot z} \cdot \left(x \cdot 9\right)\\
\mathbf{elif}\;t \leq 1.15 \cdot 10^{-82}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-4}{c} \cdot a\right) \cdot t\\
\end{array}
\end{array}
if t < -1.12e39Initial program 77.8%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6479.6
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6459.6
Applied rewrites59.6%
Applied rewrites67.7%
if -1.12e39 < t < 6.20000000000000036e-223Initial program 84.6%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6484.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites80.1%
Taylor expanded in x around inf
associate-*r/N/A
*-commutativeN/A
times-fracN/A
lower-*.f64N/A
lower-/.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6445.6
Applied rewrites45.6%
Applied rewrites48.0%
if 6.20000000000000036e-223 < t < 1.14999999999999998e-82Initial program 78.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6453.6
Applied rewrites53.6%
Applied rewrites59.6%
if 1.14999999999999998e-82 < t Initial program 76.0%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6476.2
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites82.7%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6439.3
Applied rewrites39.3%
Applied rewrites39.3%
Applied rewrites40.5%
Final simplification52.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -1.5e+86)
(* (* (/ t c) a) -4.0)
(if (<= t 2.45e-26)
(/ (fma (* y x) 9.0 b) (* c z))
(* (* (/ -4.0 c) a) t))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.5e+86) {
tmp = ((t / c) * a) * -4.0;
} else if (t <= 2.45e-26) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = ((-4.0 / c) * a) * t;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.5e+86) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (t <= 2.45e-26) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(-4.0 / c) * a) * t); 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[t, -1.5e+86], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t, 2.45e-26], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 / c), $MachinePrecision] * a), $MachinePrecision] * t), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.5 \cdot 10^{+86}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;t \leq 2.45 \cdot 10^{-26}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{-4}{c} \cdot a\right) \cdot t\\
\end{array}
\end{array}
if t < -1.49999999999999988e86Initial program 76.0%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6478.1
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites81.4%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6460.0
Applied rewrites60.0%
Applied rewrites69.4%
if -1.49999999999999988e86 < t < 2.45e-26Initial program 82.4%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6467.9
Applied rewrites67.9%
if 2.45e-26 < t Initial program 76.2%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6473.3
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites81.4%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6439.3
Applied rewrites39.3%
Applied rewrites39.2%
Applied rewrites40.7%
Final simplification61.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= b -7.5e+62) (/ b (* c z)) (if (<= b 5.9e+25) (* (* (/ t c) a) -4.0) (/ (/ b c) z))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -7.5e+62) {
tmp = b / (c * z);
} else if (b <= 5.9e+25) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (b <= (-7.5d+62)) then
tmp = b / (c * z)
else if (b <= 5.9d+25) then
tmp = ((t / c) * a) * (-4.0d0)
else
tmp = (b / c) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -7.5e+62) {
tmp = b / (c * z);
} else if (b <= 5.9e+25) {
tmp = ((t / c) * a) * -4.0;
} else {
tmp = (b / c) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -7.5e+62: tmp = b / (c * z) elif b <= 5.9e+25: tmp = ((t / c) * a) * -4.0 else: tmp = (b / c) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -7.5e+62) tmp = Float64(b / Float64(c * z)); elseif (b <= 5.9e+25) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); else tmp = Float64(Float64(b / c) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -7.5e+62)
tmp = b / (c * z);
elseif (b <= 5.9e+25)
tmp = ((t / c) * a) * -4.0;
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -7.5e+62], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.9e+25], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -7.5 \cdot 10^{+62}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{elif}\;b \leq 5.9 \cdot 10^{+25}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if b < -7.49999999999999998e62Initial program 79.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6456.7
Applied rewrites56.7%
if -7.49999999999999998e62 < b < 5.9e25Initial program 77.4%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6479.9
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites81.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6447.6
Applied rewrites47.6%
Applied rewrites49.8%
if 5.9e25 < b Initial program 85.7%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6464.3
Applied rewrites64.3%
Applied rewrites67.8%
Final simplification54.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 (/ b (* c z)))) (if (<= b -7.5e+62) t_1 (if (<= b 5.9e+25) (* (* (/ t c) a) -4.0) 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 = b / (c * z);
double tmp;
if (b <= -7.5e+62) {
tmp = t_1;
} else if (b <= 5.9e+25) {
tmp = ((t / c) * a) * -4.0;
} 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 = b / (c * z)
if (b <= (-7.5d+62)) then
tmp = t_1
else if (b <= 5.9d+25) then
tmp = ((t / c) * a) * (-4.0d0)
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 = b / (c * z);
double tmp;
if (b <= -7.5e+62) {
tmp = t_1;
} else if (b <= 5.9e+25) {
tmp = ((t / c) * a) * -4.0;
} 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 = b / (c * z) tmp = 0 if b <= -7.5e+62: tmp = t_1 elif b <= 5.9e+25: tmp = ((t / c) * a) * -4.0 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(b / Float64(c * z)) tmp = 0.0 if (b <= -7.5e+62) tmp = t_1; elseif (b <= 5.9e+25) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); 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 = b / (c * z);
tmp = 0.0;
if (b <= -7.5e+62)
tmp = t_1;
elseif (b <= 5.9e+25)
tmp = ((t / c) * a) * -4.0;
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[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -7.5e+62], t$95$1, If[LessEqual[b, 5.9e+25], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $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{b}{c \cdot z}\\
\mathbf{if}\;b \leq -7.5 \cdot 10^{+62}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 5.9 \cdot 10^{+25}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if b < -7.49999999999999998e62 or 5.9e25 < b Initial program 82.7%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6460.7
Applied rewrites60.7%
if -7.49999999999999998e62 < b < 5.9e25Initial program 77.4%
lift-/.f64N/A
clear-numN/A
lift-*.f64N/A
associate-/l*N/A
associate-/r*N/A
lower-/.f64N/A
inv-powN/A
lower-pow.f64N/A
lower-/.f6479.9
lift-+.f64N/A
lift--.f64N/A
sub-negN/A
+-commutativeN/A
associate-+l+N/A
Applied rewrites81.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6447.6
Applied rewrites47.6%
Applied rewrites49.8%
Final simplification54.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 (* (/ (* t a) c) -4.0))) (if (<= z -470000.0) t_1 (if (<= z 4.2e-47) (/ 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) / c) * -4.0;
double tmp;
if (z <= -470000.0) {
tmp = t_1;
} else if (z <= 4.2e-47) {
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) / c) * (-4.0d0)
if (z <= (-470000.0d0)) then
tmp = t_1
else if (z <= 4.2d-47) 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) / c) * -4.0;
double tmp;
if (z <= -470000.0) {
tmp = t_1;
} else if (z <= 4.2e-47) {
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) / c) * -4.0 tmp = 0 if z <= -470000.0: tmp = t_1 elif z <= 4.2e-47: 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(Float64(Float64(t * a) / c) * -4.0) tmp = 0.0 if (z <= -470000.0) tmp = t_1; elseif (z <= 4.2e-47) tmp = Float64(b / Float64(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) / c) * -4.0;
tmp = 0.0;
if (z <= -470000.0)
tmp = t_1;
elseif (z <= 4.2e-47)
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[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]}, If[LessEqual[z, -470000.0], t$95$1, If[LessEqual[z, 4.2e-47], N[(b / N[(c * z), $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{t \cdot a}{c} \cdot -4\\
\mathbf{if}\;z \leq -470000:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 4.2 \cdot 10^{-47}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.7e5 or 4.2000000000000001e-47 < z Initial program 67.6%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6455.4
Applied rewrites55.4%
if -4.7e5 < z < 4.2000000000000001e-47Initial program 92.2%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6450.5
Applied rewrites50.5%
Final simplification53.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 (/ b (* c z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (c * z)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (c * z);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) [x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (c * z)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(c * z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (c * z);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{c \cdot z}
\end{array}
Initial program 79.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6435.9
Applied rewrites35.9%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024295
(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)))