
(FPCore (x y z t a b c i j k) :precision binary64 (- (- (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c)) (* (* x 4.0) i)) (* (* j 27.0) k)))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
code = (((((((x * 18.0d0) * y) * z) * t) - ((a * 4.0d0) * t)) + (b * c)) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
def code(x, y, z, t, a, b, c, i, j, k): return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)
function code(x, y, z, t, a, b, c, i, j, k) return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(Float64(a * 4.0) * t)) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) end
function tmp = code(x, y, z, t, a, b, c, i, j, k) tmp = (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i j k) :precision binary64 (- (- (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c)) (* (* x 4.0) i)) (* (* j 27.0) k)))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
code = (((((((x * 18.0d0) * y) * z) * t) - ((a * 4.0d0) * t)) + (b * c)) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
def code(x, y, z, t, a, b, c, i, j, k): return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)
function code(x, y, z, t, a, b, c, i, j, k) return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(Float64(a * 4.0) * t)) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) end
function tmp = code(x, y, z, t, a, b, c, i, j, k) tmp = (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k
\end{array}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1
(-
(-
(+ (- (* (* (* (* x 18.0) y) z) t) (* t (* a 4.0))) (* b c))
(* (* x 4.0) i))
(* (* j 27.0) k))))
(if (<= t_1 INFINITY)
t_1
(* j (fma x (/ (fma y (* z (* 18.0 t)) (* i -4.0)) j) (* k -27.0))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
double tmp;
if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = j * fma(x, (fma(y, (z * (18.0 * t)), (i * -4.0)) / j), (k * -27.0));
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) tmp = 0.0 if (t_1 <= Inf) tmp = t_1; else tmp = Float64(j * fma(x, Float64(fma(y, Float64(z * Float64(18.0 * t)), Float64(i * -4.0)) / j), Float64(k * -27.0))); end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(j * N[(x * N[(N[(y * N[(z * N[(18.0 * t), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision] / j), $MachinePrecision] + N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t\_1 \leq \infty:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;j \cdot \mathsf{fma}\left(x, \frac{\mathsf{fma}\left(y, z \cdot \left(18 \cdot t\right), i \cdot -4\right)}{j}, k \cdot -27\right)\\
\end{array}
\end{array}
if (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) < +inf.0Initial program 96.7%
if +inf.0 < (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) Initial program 0.0%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6454.8
Simplified54.8%
Taylor expanded in j around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-/l*N/A
metadata-evalN/A
lower-fma.f64N/A
Simplified73.0%
Final simplification94.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* j (* k -27.0))))
(if (<= (* b c) -2e+119)
(fma b c t_1)
(if (<= (* b c) -1e-133)
(* t (fma x (* z (* 18.0 y)) (* a -4.0)))
(if (<= (* b c) -2e-316)
(fma x (* i -4.0) t_1)
(if (<= (* b c) 2e+84)
(- (* t (* a -4.0)) (* (* j 27.0) k))
(fma t (* a -4.0) (* b c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = j * (k * -27.0);
double tmp;
if ((b * c) <= -2e+119) {
tmp = fma(b, c, t_1);
} else if ((b * c) <= -1e-133) {
tmp = t * fma(x, (z * (18.0 * y)), (a * -4.0));
} else if ((b * c) <= -2e-316) {
tmp = fma(x, (i * -4.0), t_1);
} else if ((b * c) <= 2e+84) {
tmp = (t * (a * -4.0)) - ((j * 27.0) * k);
} else {
tmp = fma(t, (a * -4.0), (b * c));
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(j * Float64(k * -27.0)) tmp = 0.0 if (Float64(b * c) <= -2e+119) tmp = fma(b, c, t_1); elseif (Float64(b * c) <= -1e-133) tmp = Float64(t * fma(x, Float64(z * Float64(18.0 * y)), Float64(a * -4.0))); elseif (Float64(b * c) <= -2e-316) tmp = fma(x, Float64(i * -4.0), t_1); elseif (Float64(b * c) <= 2e+84) tmp = Float64(Float64(t * Float64(a * -4.0)) - Float64(Float64(j * 27.0) * k)); else tmp = fma(t, Float64(a * -4.0), Float64(b * c)); end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -2e+119], N[(b * c + t$95$1), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1e-133], N[(t * N[(x * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -2e-316], N[(x * N[(i * -4.0), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2e+84], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := j \cdot \left(k \cdot -27\right)\\
\mathbf{if}\;b \cdot c \leq -2 \cdot 10^{+119}:\\
\;\;\;\;\mathsf{fma}\left(b, c, t\_1\right)\\
\mathbf{elif}\;b \cdot c \leq -1 \cdot 10^{-133}:\\
\;\;\;\;t \cdot \mathsf{fma}\left(x, z \cdot \left(18 \cdot y\right), a \cdot -4\right)\\
\mathbf{elif}\;b \cdot c \leq -2 \cdot 10^{-316}:\\
\;\;\;\;\mathsf{fma}\left(x, i \cdot -4, t\_1\right)\\
\mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{+84}:\\
\;\;\;\;t \cdot \left(a \cdot -4\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, b \cdot c\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -1.99999999999999989e119Initial program 91.4%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6491.5
Simplified91.5%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6483.1
Simplified83.1%
if -1.99999999999999989e119 < (*.f64 b c) < -1.0000000000000001e-133Initial program 82.3%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6482.7
Simplified82.7%
Taylor expanded in t around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6459.7
Simplified59.7%
if -1.0000000000000001e-133 < (*.f64 b c) < -2.000000017e-316Initial program 93.3%
Taylor expanded in i around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.4
Simplified68.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6468.4
Simplified68.4%
if -2.000000017e-316 < (*.f64 b c) < 2.00000000000000012e84Initial program 87.7%
Taylor expanded in a around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6462.3
Simplified62.3%
if 2.00000000000000012e84 < (*.f64 b c) Initial program 90.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6481.4
Simplified81.4%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.0
Simplified76.0%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f6470.6
Simplified70.6%
Final simplification67.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (fma b c (* j (* k -27.0))))
(t_2 (* x (fma y (* z (* 18.0 t)) (* i -4.0)))))
(if (<= x -8e+198)
t_2
(if (<= x -85000000000000.0)
(fma x (* y (* 18.0 (* z t))) t_1)
(if (<= x 8e-58)
(fma t (* a -4.0) t_1)
(if (<= x 2.9e+108)
(- (* t (fma 18.0 (* z (* x y)) (* a -4.0))) (* (* j 27.0) k))
t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = fma(b, c, (j * (k * -27.0)));
double t_2 = x * fma(y, (z * (18.0 * t)), (i * -4.0));
double tmp;
if (x <= -8e+198) {
tmp = t_2;
} else if (x <= -85000000000000.0) {
tmp = fma(x, (y * (18.0 * (z * t))), t_1);
} else if (x <= 8e-58) {
tmp = fma(t, (a * -4.0), t_1);
} else if (x <= 2.9e+108) {
tmp = (t * fma(18.0, (z * (x * y)), (a * -4.0))) - ((j * 27.0) * k);
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = fma(b, c, Float64(j * Float64(k * -27.0))) t_2 = Float64(x * fma(y, Float64(z * Float64(18.0 * t)), Float64(i * -4.0))) tmp = 0.0 if (x <= -8e+198) tmp = t_2; elseif (x <= -85000000000000.0) tmp = fma(x, Float64(y * Float64(18.0 * Float64(z * t))), t_1); elseif (x <= 8e-58) tmp = fma(t, Float64(a * -4.0), t_1); elseif (x <= 2.9e+108) tmp = Float64(Float64(t * fma(18.0, Float64(z * Float64(x * y)), Float64(a * -4.0))) - Float64(Float64(j * 27.0) * k)); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(y * N[(z * N[(18.0 * t), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8e+198], t$95$2, If[LessEqual[x, -85000000000000.0], N[(x * N[(y * N[(18.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 8e-58], N[(t * N[(a * -4.0), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 2.9e+108], N[(N[(t * N[(18.0 * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
t_2 := x \cdot \mathsf{fma}\left(y, z \cdot \left(18 \cdot t\right), i \cdot -4\right)\\
\mathbf{if}\;x \leq -8 \cdot 10^{+198}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq -85000000000000:\\
\;\;\;\;\mathsf{fma}\left(x, y \cdot \left(18 \cdot \left(z \cdot t\right)\right), t\_1\right)\\
\mathbf{elif}\;x \leq 8 \cdot 10^{-58}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, t\_1\right)\\
\mathbf{elif}\;x \leq 2.9 \cdot 10^{+108}:\\
\;\;\;\;t \cdot \mathsf{fma}\left(18, z \cdot \left(x \cdot y\right), a \cdot -4\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -8.00000000000000014e198 or 2.90000000000000007e108 < x Initial program 79.9%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6490.7
Simplified90.7%
Taylor expanded in x around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6482.8
Simplified82.8%
if -8.00000000000000014e198 < x < -8.5e13Initial program 74.5%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6471.1
Simplified71.1%
Taylor expanded in a around 0
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.3
Simplified75.3%
Taylor expanded in z around 0
lower-*.f64N/A
lower-*.f6475.3
Simplified75.3%
if -8.5e13 < x < 8.0000000000000002e-58Initial program 96.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6495.4
Simplified95.4%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6489.0
Simplified89.0%
if 8.0000000000000002e-58 < x < 2.90000000000000007e108Initial program 88.5%
Taylor expanded in t around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6477.5
Simplified77.5%
Final simplification84.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* j 27.0) k))
(t_2 (- (fma x (fma (* y z) (* 18.0 t) (* i -4.0)) (* b c)) t_1)))
(if (<= x -1.95e+62)
t_2
(if (<= x 1.85e+74)
(- (fma t (fma 18.0 (* z (* x y)) (* a -4.0)) (* b c)) t_1)
t_2))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double t_2 = fma(x, fma((y * z), (18.0 * t), (i * -4.0)), (b * c)) - t_1;
double tmp;
if (x <= -1.95e+62) {
tmp = t_2;
} else if (x <= 1.85e+74) {
tmp = fma(t, fma(18.0, (z * (x * y)), (a * -4.0)), (b * c)) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(j * 27.0) * k) t_2 = Float64(fma(x, fma(Float64(y * z), Float64(18.0 * t), Float64(i * -4.0)), Float64(b * c)) - t_1) tmp = 0.0 if (x <= -1.95e+62) tmp = t_2; elseif (x <= 1.85e+74) tmp = Float64(fma(t, fma(18.0, Float64(z * Float64(x * y)), Float64(a * -4.0)), Float64(b * c)) - t_1); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(N[(y * z), $MachinePrecision] * N[(18.0 * t), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[x, -1.95e+62], t$95$2, If[LessEqual[x, 1.85e+74], N[(N[(t * N[(18.0 * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(j \cdot 27\right) \cdot k\\
t_2 := \mathsf{fma}\left(x, \mathsf{fma}\left(y \cdot z, 18 \cdot t, i \cdot -4\right), b \cdot c\right) - t\_1\\
\mathbf{if}\;x \leq -1.95 \cdot 10^{+62}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq 1.85 \cdot 10^{+74}:\\
\;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(18, z \cdot \left(x \cdot y\right), a \cdot -4\right), b \cdot c\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -1.95e62 or 1.8500000000000001e74 < x Initial program 79.2%
Taylor expanded in a around 0
cancel-sign-sub-invN/A
+-commutativeN/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
Simplified89.9%
if -1.95e62 < x < 1.8500000000000001e74Initial program 94.2%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6493.8
Simplified93.8%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* j 27.0) k))
(t_2 (- (* x (fma (* y z) (* 18.0 t) (* i -4.0))) t_1)))
(if (<= x -4.7e+176)
t_2
(if (<= x 1.6e+79)
(- (fma t (fma 18.0 (* z (* x y)) (* a -4.0)) (* b c)) t_1)
t_2))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double t_2 = (x * fma((y * z), (18.0 * t), (i * -4.0))) - t_1;
double tmp;
if (x <= -4.7e+176) {
tmp = t_2;
} else if (x <= 1.6e+79) {
tmp = fma(t, fma(18.0, (z * (x * y)), (a * -4.0)), (b * c)) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(j * 27.0) * k) t_2 = Float64(Float64(x * fma(Float64(y * z), Float64(18.0 * t), Float64(i * -4.0))) - t_1) tmp = 0.0 if (x <= -4.7e+176) tmp = t_2; elseif (x <= 1.6e+79) tmp = Float64(fma(t, fma(18.0, Float64(z * Float64(x * y)), Float64(a * -4.0)), Float64(b * c)) - t_1); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(N[(y * z), $MachinePrecision] * N[(18.0 * t), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[x, -4.7e+176], t$95$2, If[LessEqual[x, 1.6e+79], N[(N[(t * N[(18.0 * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(j \cdot 27\right) \cdot k\\
t_2 := x \cdot \mathsf{fma}\left(y \cdot z, 18 \cdot t, i \cdot -4\right) - t\_1\\
\mathbf{if}\;x \leq -4.7 \cdot 10^{+176}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq 1.6 \cdot 10^{+79}:\\
\;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(18, z \cdot \left(x \cdot y\right), a \cdot -4\right), b \cdot c\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -4.69999999999999981e176 or 1.60000000000000001e79 < x Initial program 78.4%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6490.5
Simplified90.5%
if -4.69999999999999981e176 < x < 1.60000000000000001e79Initial program 92.1%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6490.2
Simplified90.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (fma t (* a -4.0) (* b c))))
(if (<= (* a 4.0) -6e+56)
t_1
(if (<= (* a 4.0) -5e-91)
(- (* b c) (* (* j 27.0) k))
(if (<= (* a 4.0) 2e+61) (fma x (* i -4.0) (* j (* k -27.0))) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = fma(t, (a * -4.0), (b * c));
double tmp;
if ((a * 4.0) <= -6e+56) {
tmp = t_1;
} else if ((a * 4.0) <= -5e-91) {
tmp = (b * c) - ((j * 27.0) * k);
} else if ((a * 4.0) <= 2e+61) {
tmp = fma(x, (i * -4.0), (j * (k * -27.0)));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = fma(t, Float64(a * -4.0), Float64(b * c)) tmp = 0.0 if (Float64(a * 4.0) <= -6e+56) tmp = t_1; elseif (Float64(a * 4.0) <= -5e-91) tmp = Float64(Float64(b * c) - Float64(Float64(j * 27.0) * k)); elseif (Float64(a * 4.0) <= 2e+61) tmp = fma(x, Float64(i * -4.0), Float64(j * Float64(k * -27.0))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * 4.0), $MachinePrecision], -6e+56], t$95$1, If[LessEqual[N[(a * 4.0), $MachinePrecision], -5e-91], N[(N[(b * c), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(a * 4.0), $MachinePrecision], 2e+61], N[(x * N[(i * -4.0), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(t, a \cdot -4, b \cdot c\right)\\
\mathbf{if}\;a \cdot 4 \leq -6 \cdot 10^{+56}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \cdot 4 \leq -5 \cdot 10^{-91}:\\
\;\;\;\;b \cdot c - \left(j \cdot 27\right) \cdot k\\
\mathbf{elif}\;a \cdot 4 \leq 2 \cdot 10^{+61}:\\
\;\;\;\;\mathsf{fma}\left(x, i \cdot -4, j \cdot \left(k \cdot -27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 a #s(literal 4 binary64)) < -6.00000000000000012e56 or 1.9999999999999999e61 < (*.f64 a #s(literal 4 binary64)) Initial program 85.6%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6490.0
Simplified90.0%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6471.9
Simplified71.9%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f6463.9
Simplified63.9%
if -6.00000000000000012e56 < (*.f64 a #s(literal 4 binary64)) < -4.99999999999999997e-91Initial program 90.3%
Taylor expanded in b around inf
lower-*.f6460.2
Simplified60.2%
if -4.99999999999999997e-91 < (*.f64 a #s(literal 4 binary64)) < 1.9999999999999999e61Initial program 90.1%
Taylor expanded in i around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.9
Simplified58.9%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6459.0
Simplified59.0%
Final simplification61.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (- (* x (fma (* y z) (* 18.0 t) (* i -4.0))) (* (* j 27.0) k))))
(if (<= x -6.2e+88)
t_1
(if (<= x 5.7e-55) (fma t (* a -4.0) (fma b c (* j (* k -27.0)))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (x * fma((y * z), (18.0 * t), (i * -4.0))) - ((j * 27.0) * k);
double tmp;
if (x <= -6.2e+88) {
tmp = t_1;
} else if (x <= 5.7e-55) {
tmp = fma(t, (a * -4.0), fma(b, c, (j * (k * -27.0))));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(x * fma(Float64(y * z), Float64(18.0 * t), Float64(i * -4.0))) - Float64(Float64(j * 27.0) * k)) tmp = 0.0 if (x <= -6.2e+88) tmp = t_1; elseif (x <= 5.7e-55) tmp = fma(t, Float64(a * -4.0), fma(b, c, Float64(j * Float64(k * -27.0)))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(N[(y * z), $MachinePrecision] * N[(18.0 * t), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -6.2e+88], t$95$1, If[LessEqual[x, 5.7e-55], N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \mathsf{fma}\left(y \cdot z, 18 \cdot t, i \cdot -4\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;x \leq -6.2 \cdot 10^{+88}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.7 \cdot 10^{-55}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, \mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -6.2000000000000003e88 or 5.7000000000000002e-55 < x Initial program 82.0%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6483.2
Simplified83.2%
if -6.2000000000000003e88 < x < 5.7000000000000002e-55Initial program 93.7%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6493.1
Simplified93.1%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6487.8
Simplified87.8%
Final simplification85.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (fma b c (* j (* k -27.0))))
(t_2 (* x (fma y (* z (* 18.0 t)) (* i -4.0)))))
(if (<= x -8e+198)
t_2
(if (<= x -85000000000000.0)
(fma x (* y (* 18.0 (* z t))) t_1)
(if (<= x 2.4e-40) (fma t (* a -4.0) t_1) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = fma(b, c, (j * (k * -27.0)));
double t_2 = x * fma(y, (z * (18.0 * t)), (i * -4.0));
double tmp;
if (x <= -8e+198) {
tmp = t_2;
} else if (x <= -85000000000000.0) {
tmp = fma(x, (y * (18.0 * (z * t))), t_1);
} else if (x <= 2.4e-40) {
tmp = fma(t, (a * -4.0), t_1);
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = fma(b, c, Float64(j * Float64(k * -27.0))) t_2 = Float64(x * fma(y, Float64(z * Float64(18.0 * t)), Float64(i * -4.0))) tmp = 0.0 if (x <= -8e+198) tmp = t_2; elseif (x <= -85000000000000.0) tmp = fma(x, Float64(y * Float64(18.0 * Float64(z * t))), t_1); elseif (x <= 2.4e-40) tmp = fma(t, Float64(a * -4.0), t_1); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(y * N[(z * N[(18.0 * t), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8e+198], t$95$2, If[LessEqual[x, -85000000000000.0], N[(x * N[(y * N[(18.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 2.4e-40], N[(t * N[(a * -4.0), $MachinePrecision] + t$95$1), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
t_2 := x \cdot \mathsf{fma}\left(y, z \cdot \left(18 \cdot t\right), i \cdot -4\right)\\
\mathbf{if}\;x \leq -8 \cdot 10^{+198}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq -85000000000000:\\
\;\;\;\;\mathsf{fma}\left(x, y \cdot \left(18 \cdot \left(z \cdot t\right)\right), t\_1\right)\\
\mathbf{elif}\;x \leq 2.4 \cdot 10^{-40}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -8.00000000000000014e198 or 2.39999999999999991e-40 < x Initial program 82.1%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6486.2
Simplified86.2%
Taylor expanded in x around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6476.0
Simplified76.0%
if -8.00000000000000014e198 < x < -8.5e13Initial program 74.5%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6471.1
Simplified71.1%
Taylor expanded in a around 0
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6475.3
Simplified75.3%
Taylor expanded in z around 0
lower-*.f64N/A
lower-*.f6475.3
Simplified75.3%
if -8.5e13 < x < 2.39999999999999991e-40Initial program 96.9%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6495.5
Simplified95.5%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6488.4
Simplified88.4%
Final simplification82.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* j 27.0) k)))
(if (<= t_1 -2e+14)
(- (* b c) t_1)
(if (<= t_1 20000000.0)
(fma t (* a -4.0) (* b c))
(fma b c (* j (* k -27.0)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double tmp;
if (t_1 <= -2e+14) {
tmp = (b * c) - t_1;
} else if (t_1 <= 20000000.0) {
tmp = fma(t, (a * -4.0), (b * c));
} else {
tmp = fma(b, c, (j * (k * -27.0)));
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (t_1 <= -2e+14) tmp = Float64(Float64(b * c) - t_1); elseif (t_1 <= 20000000.0) tmp = fma(t, Float64(a * -4.0), Float64(b * c)); else tmp = fma(b, c, Float64(j * Float64(k * -27.0))); end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+14], N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t$95$1, 20000000.0], N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision], N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+14}:\\
\;\;\;\;b \cdot c - t\_1\\
\mathbf{elif}\;t\_1 \leq 20000000:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, b \cdot c\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -2e14Initial program 88.7%
Taylor expanded in b around inf
lower-*.f6463.6
Simplified63.6%
if -2e14 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2e7Initial program 89.7%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.3
Simplified77.3%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6458.0
Simplified58.0%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f6455.7
Simplified55.7%
if 2e7 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 85.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6486.9
Simplified86.9%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6456.6
Simplified56.6%
Final simplification57.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= (* b c) -2e+119)
(fma b c (* j (* k -27.0)))
(if (<= (* b c) 2e+84)
(- (* t (* a -4.0)) (* (* j 27.0) k))
(fma t (* a -4.0) (* b c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -2e+119) {
tmp = fma(b, c, (j * (k * -27.0)));
} else if ((b * c) <= 2e+84) {
tmp = (t * (a * -4.0)) - ((j * 27.0) * k);
} else {
tmp = fma(t, (a * -4.0), (b * c));
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -2e+119) tmp = fma(b, c, Float64(j * Float64(k * -27.0))); elseif (Float64(b * c) <= 2e+84) tmp = Float64(Float64(t * Float64(a * -4.0)) - Float64(Float64(j * 27.0) * k)); else tmp = fma(t, Float64(a * -4.0), Float64(b * c)); end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -2e+119], N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2e+84], N[(N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -2 \cdot 10^{+119}:\\
\;\;\;\;\mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
\mathbf{elif}\;b \cdot c \leq 2 \cdot 10^{+84}:\\
\;\;\;\;t \cdot \left(a \cdot -4\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, b \cdot c\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -1.99999999999999989e119Initial program 91.4%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6491.5
Simplified91.5%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6483.1
Simplified83.1%
if -1.99999999999999989e119 < (*.f64 b c) < 2.00000000000000012e84Initial program 87.1%
Taylor expanded in a around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6455.2
Simplified55.2%
if 2.00000000000000012e84 < (*.f64 b c) Initial program 90.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6481.4
Simplified81.4%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6476.0
Simplified76.0%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f6470.6
Simplified70.6%
Final simplification62.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= (* b c) -3.2e+115)
(* b c)
(if (<= (* b c) -9.5e-127)
(* t (* a -4.0))
(if (<= (* b c) 5.5e+87) (* j (* k -27.0)) (* b c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -3.2e+115) {
tmp = b * c;
} else if ((b * c) <= -9.5e-127) {
tmp = t * (a * -4.0);
} else if ((b * c) <= 5.5e+87) {
tmp = j * (k * -27.0);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-3.2d+115)) then
tmp = b * c
else if ((b * c) <= (-9.5d-127)) then
tmp = t * (a * (-4.0d0))
else if ((b * c) <= 5.5d+87) then
tmp = j * (k * (-27.0d0))
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -3.2e+115) {
tmp = b * c;
} else if ((b * c) <= -9.5e-127) {
tmp = t * (a * -4.0);
} else if ((b * c) <= 5.5e+87) {
tmp = j * (k * -27.0);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -3.2e+115: tmp = b * c elif (b * c) <= -9.5e-127: tmp = t * (a * -4.0) elif (b * c) <= 5.5e+87: tmp = j * (k * -27.0) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -3.2e+115) tmp = Float64(b * c); elseif (Float64(b * c) <= -9.5e-127) tmp = Float64(t * Float64(a * -4.0)); elseif (Float64(b * c) <= 5.5e+87) tmp = Float64(j * Float64(k * -27.0)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -3.2e+115)
tmp = b * c;
elseif ((b * c) <= -9.5e-127)
tmp = t * (a * -4.0);
elseif ((b * c) <= 5.5e+87)
tmp = j * (k * -27.0);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -3.2e+115], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -9.5e-127], N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5.5e+87], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -3.2 \cdot 10^{+115}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -9.5 \cdot 10^{-127}:\\
\;\;\;\;t \cdot \left(a \cdot -4\right)\\
\mathbf{elif}\;b \cdot c \leq 5.5 \cdot 10^{+87}:\\
\;\;\;\;j \cdot \left(k \cdot -27\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -3.2e115 or 5.50000000000000022e87 < (*.f64 b c) Initial program 91.0%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6485.5
Simplified85.5%
Taylor expanded in b around inf
lower-*.f6464.4
Simplified64.4%
if -3.2e115 < (*.f64 b c) < -9.4999999999999997e-127Initial program 83.6%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6481.9
Simplified81.9%
Taylor expanded in a around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6434.1
Simplified34.1%
if -9.4999999999999997e-127 < (*.f64 b c) < 5.50000000000000022e87Initial program 88.5%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6479.9
Simplified79.9%
Taylor expanded in j around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6436.3
Simplified36.3%
Final simplification45.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* x (fma y (* z (* 18.0 t)) (* i -4.0)))))
(if (<= x -1.65e+89)
t_1
(if (<= x 2.4e-40) (fma t (* a -4.0) (fma b c (* j (* k -27.0)))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * fma(y, (z * (18.0 * t)), (i * -4.0));
double tmp;
if (x <= -1.65e+89) {
tmp = t_1;
} else if (x <= 2.4e-40) {
tmp = fma(t, (a * -4.0), fma(b, c, (j * (k * -27.0))));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(x * fma(y, Float64(z * Float64(18.0 * t)), Float64(i * -4.0))) tmp = 0.0 if (x <= -1.65e+89) tmp = t_1; elseif (x <= 2.4e-40) tmp = fma(t, Float64(a * -4.0), fma(b, c, Float64(j * Float64(k * -27.0)))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(y * N[(z * N[(18.0 * t), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.65e+89], t$95$1, If[LessEqual[x, 2.4e-40], N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \mathsf{fma}\left(y, z \cdot \left(18 \cdot t\right), i \cdot -4\right)\\
\mathbf{if}\;x \leq -1.65 \cdot 10^{+89}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 2.4 \cdot 10^{-40}:\\
\;\;\;\;\mathsf{fma}\left(t, a \cdot -4, \mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.64999999999999987e89 or 2.39999999999999991e-40 < x Initial program 81.7%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6482.9
Simplified82.9%
Taylor expanded in x around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6472.7
Simplified72.7%
if -1.64999999999999987e89 < x < 2.39999999999999991e-40Initial program 93.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6493.2
Simplified93.2%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6487.3
Simplified87.3%
Final simplification80.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* x (fma y (* z (* 18.0 t)) (* i -4.0)))))
(if (<= x -1.05e+89)
t_1
(if (<= x 5.8e-55) (fma b c (* j (* k -27.0))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * fma(y, (z * (18.0 * t)), (i * -4.0));
double tmp;
if (x <= -1.05e+89) {
tmp = t_1;
} else if (x <= 5.8e-55) {
tmp = fma(b, c, (j * (k * -27.0)));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(x * fma(y, Float64(z * Float64(18.0 * t)), Float64(i * -4.0))) tmp = 0.0 if (x <= -1.05e+89) tmp = t_1; elseif (x <= 5.8e-55) tmp = fma(b, c, Float64(j * Float64(k * -27.0))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(y * N[(z * N[(18.0 * t), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.05e+89], t$95$1, If[LessEqual[x, 5.8e-55], N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \mathsf{fma}\left(y, z \cdot \left(18 \cdot t\right), i \cdot -4\right)\\
\mathbf{if}\;x \leq -1.05 \cdot 10^{+89}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 5.8 \cdot 10^{-55}:\\
\;\;\;\;\mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.04999999999999993e89 or 5.8e-55 < x Initial program 82.0%
Taylor expanded in x around inf
lower-*.f64N/A
cancel-sign-sub-invN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6483.2
Simplified83.2%
Taylor expanded in x around inf
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6472.3
Simplified72.3%
if -1.04999999999999993e89 < x < 5.8e-55Initial program 93.7%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6493.1
Simplified93.1%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6462.4
Simplified62.4%
Final simplification66.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (fma t (* a -4.0) (* b c))))
(if (<= (* a 4.0) -6e+56)
t_1
(if (<= (* a 4.0) 2e+61) (fma b c (* j (* k -27.0))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = fma(t, (a * -4.0), (b * c));
double tmp;
if ((a * 4.0) <= -6e+56) {
tmp = t_1;
} else if ((a * 4.0) <= 2e+61) {
tmp = fma(b, c, (j * (k * -27.0)));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = fma(t, Float64(a * -4.0), Float64(b * c)) tmp = 0.0 if (Float64(a * 4.0) <= -6e+56) tmp = t_1; elseif (Float64(a * 4.0) <= 2e+61) tmp = fma(b, c, Float64(j * Float64(k * -27.0))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * 4.0), $MachinePrecision], -6e+56], t$95$1, If[LessEqual[N[(a * 4.0), $MachinePrecision], 2e+61], N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \mathsf{fma}\left(t, a \cdot -4, b \cdot c\right)\\
\mathbf{if}\;a \cdot 4 \leq -6 \cdot 10^{+56}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \cdot 4 \leq 2 \cdot 10^{+61}:\\
\;\;\;\;\mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 a #s(literal 4 binary64)) < -6.00000000000000012e56 or 1.9999999999999999e61 < (*.f64 a #s(literal 4 binary64)) Initial program 85.6%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6490.0
Simplified90.0%
Taylor expanded in z around 0
associate--l+N/A
associate-*r*N/A
*-commutativeN/A
lower-fma.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6471.9
Simplified71.9%
Taylor expanded in b around inf
*-commutativeN/A
lower-*.f6463.9
Simplified63.9%
if -6.00000000000000012e56 < (*.f64 a #s(literal 4 binary64)) < 1.9999999999999999e61Initial program 90.1%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6477.5
Simplified77.5%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6455.1
Simplified55.1%
Final simplification58.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (* a -4.0))))
(if (<= (* a 4.0) -5e+135)
t_1
(if (<= (* a 4.0) 2e+165) (fma b c (* j (* k -27.0))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * (a * -4.0);
double tmp;
if ((a * 4.0) <= -5e+135) {
tmp = t_1;
} else if ((a * 4.0) <= 2e+165) {
tmp = fma(b, c, (j * (k * -27.0)));
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(a * -4.0)) tmp = 0.0 if (Float64(a * 4.0) <= -5e+135) tmp = t_1; elseif (Float64(a * 4.0) <= 2e+165) tmp = fma(b, c, Float64(j * Float64(k * -27.0))); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(a * 4.0), $MachinePrecision], -5e+135], t$95$1, If[LessEqual[N[(a * 4.0), $MachinePrecision], 2e+165], N[(b * c + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right)\\
\mathbf{if}\;a \cdot 4 \leq -5 \cdot 10^{+135}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \cdot 4 \leq 2 \cdot 10^{+165}:\\
\;\;\;\;\mathsf{fma}\left(b, c, j \cdot \left(k \cdot -27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 a #s(literal 4 binary64)) < -5.00000000000000029e135 or 1.9999999999999998e165 < (*.f64 a #s(literal 4 binary64)) Initial program 84.1%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6490.8
Simplified90.8%
Taylor expanded in a around inf
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6455.2
Simplified55.2%
if -5.00000000000000029e135 < (*.f64 a #s(literal 4 binary64)) < 1.9999999999999998e165Initial program 89.8%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6479.5
Simplified79.5%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6453.9
Simplified53.9%
Final simplification54.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. (FPCore (x y z t a b c i j k) :precision binary64 (if (<= (* b c) -1.45e+97) (* b c) (if (<= (* b c) 5.5e+87) (* j (* k -27.0)) (* b c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.45e+97) {
tmp = b * c;
} else if ((b * c) <= 5.5e+87) {
tmp = j * (k * -27.0);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-1.45d+97)) then
tmp = b * c
else if ((b * c) <= 5.5d+87) then
tmp = j * (k * (-27.0d0))
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.45e+97) {
tmp = b * c;
} else if ((b * c) <= 5.5e+87) {
tmp = j * (k * -27.0);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -1.45e+97: tmp = b * c elif (b * c) <= 5.5e+87: tmp = j * (k * -27.0) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -1.45e+97) tmp = Float64(b * c); elseif (Float64(b * c) <= 5.5e+87) tmp = Float64(j * Float64(k * -27.0)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -1.45e+97)
tmp = b * c;
elseif ((b * c) <= 5.5e+87)
tmp = j * (k * -27.0);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -1.45e+97], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5.5e+87], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -1.45 \cdot 10^{+97}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq 5.5 \cdot 10^{+87}:\\
\;\;\;\;j \cdot \left(k \cdot -27\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.44999999999999994e97 or 5.50000000000000022e87 < (*.f64 b c) Initial program 90.1%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.8
Simplified84.8%
Taylor expanded in b around inf
lower-*.f6463.0
Simplified63.0%
if -1.44999999999999994e97 < (*.f64 b c) < 5.50000000000000022e87Initial program 87.5%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6480.8
Simplified80.8%
Taylor expanded in j around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6431.4
Simplified31.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. (FPCore (x y z t a b c i j k) :precision binary64 (if (<= (* b c) -1.45e+97) (* b c) (if (<= (* b c) 5.5e+87) (* -27.0 (* j k)) (* b c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.45e+97) {
tmp = b * c;
} else if ((b * c) <= 5.5e+87) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-1.45d+97)) then
tmp = b * c
else if ((b * c) <= 5.5d+87) then
tmp = (-27.0d0) * (j * k)
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.45e+97) {
tmp = b * c;
} else if ((b * c) <= 5.5e+87) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -1.45e+97: tmp = b * c elif (b * c) <= 5.5e+87: tmp = -27.0 * (j * k) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -1.45e+97) tmp = Float64(b * c); elseif (Float64(b * c) <= 5.5e+87) tmp = Float64(-27.0 * Float64(j * k)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -1.45e+97)
tmp = b * c;
elseif ((b * c) <= 5.5e+87)
tmp = -27.0 * (j * k);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -1.45e+97], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5.5e+87], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -1.45 \cdot 10^{+97}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq 5.5 \cdot 10^{+87}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.44999999999999994e97 or 5.50000000000000022e87 < (*.f64 b c) Initial program 90.1%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6484.8
Simplified84.8%
Taylor expanded in b around inf
lower-*.f6463.0
Simplified63.0%
if -1.44999999999999994e97 < (*.f64 b c) < 5.50000000000000022e87Initial program 87.5%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6480.8
Simplified80.8%
Taylor expanded in c around inf
lower-*.f64N/A
associate--l+N/A
associate-*r/N/A
div-subN/A
lower-+.f64N/A
lower-/.f64N/A
Simplified67.0%
Taylor expanded in j around inf
lower-*.f64N/A
lower-*.f6431.4
Simplified31.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. (FPCore (x y z t a b c i j k) :precision binary64 (* b c))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return b * c;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
code = b * c
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return b * c;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): return b * c
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) return Float64(b * c) end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp = code(x, y, z, t, a, b, c, i, j, k)
tmp = b * c;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(b * c), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
b \cdot c
\end{array}
Initial program 88.4%
Taylor expanded in i around 0
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
distribute-rgt-out--N/A
+-commutativeN/A
lower-fma.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
lower-fma.f64N/A
associate-*r*N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-*.f6482.2
Simplified82.2%
Taylor expanded in b around inf
lower-*.f6424.6
Simplified24.6%
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (+ (* a t) (* i x)) 4.0))
(t_2
(-
(- (* (* 18.0 t) (* (* x y) z)) t_1)
(- (* (* k j) 27.0) (* c b)))))
(if (< t -1.6210815397541398e-69)
t_2
(if (< t 165.68027943805222)
(+ (- (* (* 18.0 y) (* x (* z t))) t_1) (- (* c b) (* 27.0 (* k j))))
t_2))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = ((a * t) + (i * x)) * 4.0;
double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
double tmp;
if (t < -1.6210815397541398e-69) {
tmp = t_2;
} else if (t < 165.68027943805222) {
tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j, k)
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), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = ((a * t) + (i * x)) * 4.0d0
t_2 = (((18.0d0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0d0) - (c * b))
if (t < (-1.6210815397541398d-69)) then
tmp = t_2
else if (t < 165.68027943805222d0) then
tmp = (((18.0d0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0d0 * (k * j)))
else
tmp = 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 i, double j, double k) {
double t_1 = ((a * t) + (i * x)) * 4.0;
double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
double tmp;
if (t < -1.6210815397541398e-69) {
tmp = t_2;
} else if (t < 165.68027943805222) {
tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j, k): t_1 = ((a * t) + (i * x)) * 4.0 t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b)) tmp = 0 if t < -1.6210815397541398e-69: tmp = t_2 elif t < 165.68027943805222: tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j))) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(Float64(a * t) + Float64(i * x)) * 4.0) t_2 = Float64(Float64(Float64(Float64(18.0 * t) * Float64(Float64(x * y) * z)) - t_1) - Float64(Float64(Float64(k * j) * 27.0) - Float64(c * b))) tmp = 0.0 if (t < -1.6210815397541398e-69) tmp = t_2; elseif (t < 165.68027943805222) tmp = Float64(Float64(Float64(Float64(18.0 * y) * Float64(x * Float64(z * t))) - t_1) + Float64(Float64(c * b) - Float64(27.0 * Float64(k * j)))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k) t_1 = ((a * t) + (i * x)) * 4.0; t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b)); tmp = 0.0; if (t < -1.6210815397541398e-69) tmp = t_2; elseif (t < 165.68027943805222) tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j))); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] + N[(i * x), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(18.0 * t), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - N[(N[(N[(k * j), $MachinePrecision] * 27.0), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -1.6210815397541398e-69], t$95$2, If[Less[t, 165.68027943805222], N[(N[(N[(N[(18.0 * y), $MachinePrecision] * N[(x * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] + N[(N[(c * b), $MachinePrecision] - N[(27.0 * N[(k * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(a \cdot t + i \cdot x\right) \cdot 4\\
t_2 := \left(\left(18 \cdot t\right) \cdot \left(\left(x \cdot y\right) \cdot z\right) - t\_1\right) - \left(\left(k \cdot j\right) \cdot 27 - c \cdot b\right)\\
\mathbf{if}\;t < -1.6210815397541398 \cdot 10^{-69}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t < 165.68027943805222:\\
\;\;\;\;\left(\left(18 \cdot y\right) \cdot \left(x \cdot \left(z \cdot t\right)\right) - t\_1\right) + \left(c \cdot b - 27 \cdot \left(k \cdot j\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024215
(FPCore (x y z t a b c i j k)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, E"
:precision binary64
:alt
(! :herbie-platform default (if (< t -8105407698770699/5000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (- (* (* 18 t) (* (* x y) z)) (* (+ (* a t) (* i x)) 4)) (- (* (* k j) 27) (* c b))) (if (< t 8284013971902611/50000000000000) (+ (- (* (* 18 y) (* x (* z t))) (* (+ (* a t) (* i x)) 4)) (- (* c b) (* 27 (* k j)))) (- (- (* (* 18 t) (* (* x y) z)) (* (+ (* a t) (* i x)) 4)) (- (* (* k j) 27) (* c b))))))
(- (- (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c)) (* (* x 4.0) i)) (* (* j 27.0) k)))