
(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 17 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)))
(if (<=
(-
(- (+ (- (* t_1 t) (* t (* a 4.0))) (* b c)) (* (* x 4.0) i))
(* (* j 27.0) k))
INFINITY)
(+
(* t (+ t_1 (* a -4.0)))
(+ (* -27.0 (* j k)) (+ (* b c) (* x (* i -4.0)))))
(* x (+ (* i -4.0) (* 18.0 (* z (* y t))))))))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;
double tmp;
if ((((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= ((double) INFINITY)) {
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = x * ((i * -4.0) + (18.0 * (z * (y * t))));
}
return tmp;
}
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 t_1 = ((x * 18.0) * y) * z;
double tmp;
if ((((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= Double.POSITIVE_INFINITY) {
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = x * ((i * -4.0) + (18.0 * (z * (y * t))));
}
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): t_1 = ((x * 18.0) * y) * z tmp = 0 if (((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= math.inf: tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) else: tmp = x * ((i * -4.0) + (18.0 * (z * (y * t)))) 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(x * 18.0) * y) * z) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(t_1 * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) <= Inf) tmp = Float64(Float64(t * Float64(t_1 + Float64(a * -4.0))) + Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(b * c) + Float64(x * Float64(i * -4.0))))); else tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(18.0 * Float64(z * Float64(y * t))))); 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)
t_1 = ((x * 18.0) * y) * z;
tmp = 0.0;
if ((((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)) <= Inf)
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
else
tmp = x * ((i * -4.0) + (18.0 * (z * (y * t))));
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_] := Block[{t$95$1 = N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(t$95$1 * 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], Infinity], N[(N[(t * N[(t$95$1 + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(18.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $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(x \cdot 18\right) \cdot y\right) \cdot z\\
\mathbf{if}\;\left(\left(\left(t\_1 \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 \leq \infty:\\
\;\;\;\;t \cdot \left(t\_1 + a \cdot -4\right) + \left(-27 \cdot \left(j \cdot k\right) + \left(b \cdot c + x \cdot \left(i \cdot -4\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + 18 \cdot \left(z \cdot \left(y \cdot t\right)\right)\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 94.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified94.4%
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%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified15.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.0%
Simplified70.0%
Final simplification91.3%
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 4.0) i)))
(if (<= (* b c) -2e+120)
(- (- (* b c) t_1) (* (* j 27.0) k))
(if (<= (* b c) 1e+72)
(- (* t (+ (* a -4.0) (* x (* 18.0 (* y z))))) (+ t_1 (* j (* 27.0 k))))
(+ (* b c) (* t (+ (* (* (* x 18.0) y) z) (* a -4.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 * 4.0) * i;
double tmp;
if ((b * c) <= -2e+120) {
tmp = ((b * c) - t_1) - ((j * 27.0) * k);
} else if ((b * c) <= 1e+72) {
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (t_1 + (j * (27.0 * k)));
} else {
tmp = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
}
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) :: t_1
real(8) :: tmp
t_1 = (x * 4.0d0) * i
if ((b * c) <= (-2d+120)) then
tmp = ((b * c) - t_1) - ((j * 27.0d0) * k)
else if ((b * c) <= 1d+72) then
tmp = (t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))) - (t_1 + (j * (27.0d0 * k)))
else
tmp = (b * c) + (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0))))
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 t_1 = (x * 4.0) * i;
double tmp;
if ((b * c) <= -2e+120) {
tmp = ((b * c) - t_1) - ((j * 27.0) * k);
} else if ((b * c) <= 1e+72) {
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (t_1 + (j * (27.0 * k)));
} else {
tmp = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
}
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): t_1 = (x * 4.0) * i tmp = 0 if (b * c) <= -2e+120: tmp = ((b * c) - t_1) - ((j * 27.0) * k) elif (b * c) <= 1e+72: tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (t_1 + (j * (27.0 * k))) else: tmp = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.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(x * 4.0) * i) tmp = 0.0 if (Float64(b * c) <= -2e+120) tmp = Float64(Float64(Float64(b * c) - t_1) - Float64(Float64(j * 27.0) * k)); elseif (Float64(b * c) <= 1e+72) tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) - Float64(t_1 + Float64(j * Float64(27.0 * k)))); else tmp = Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0)))); 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)
t_1 = (x * 4.0) * i;
tmp = 0.0;
if ((b * c) <= -2e+120)
tmp = ((b * c) - t_1) - ((j * 27.0) * k);
elseif ((b * c) <= 1e+72)
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (t_1 + (j * (27.0 * k)));
else
tmp = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
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_] := Block[{t$95$1 = N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -2e+120], N[(N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1e+72], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t$95$1 + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $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(x \cdot 4\right) \cdot i\\
\mathbf{if}\;b \cdot c \leq -2 \cdot 10^{+120}:\\
\;\;\;\;\left(b \cdot c - t\_1\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{elif}\;b \cdot c \leq 10^{+72}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right) - \left(t\_1 + j \cdot \left(27 \cdot k\right)\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c + t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -2e120Initial program 86.1%
Taylor expanded in t around 0
*-lowering-*.f6486.8%
Simplified86.8%
if -2e120 < (*.f64 b c) < 9.99999999999999944e71Initial program 82.3%
Taylor expanded in b around 0
associate--r+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate--l+N/A
Simplified83.2%
if 9.99999999999999944e71 < (*.f64 b c) Initial program 79.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified81.2%
Taylor expanded in b around inf
*-lowering-*.f6477.5%
Simplified77.5%
Final simplification82.6%
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 (- (* -4.0 (* x i)) t_1)))
(if (<= i -6e+125)
t_2
(if (<= i -5.2e+38)
(* c (+ b (* x (/ (* i -4.0) c))))
(if (<= i -4.8e-234)
(- (* -4.0 (* t a)) t_1)
(if (<= i 2.7e-305)
(* (* x (* z t)) (* 18.0 y))
(if (<= i 230000.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 = (-4.0 * (x * i)) - t_1;
double tmp;
if (i <= -6e+125) {
tmp = t_2;
} else if (i <= -5.2e+38) {
tmp = c * (b + (x * ((i * -4.0) / c)));
} else if (i <= -4.8e-234) {
tmp = (-4.0 * (t * a)) - t_1;
} else if (i <= 2.7e-305) {
tmp = (x * (z * t)) * (18.0 * y);
} else if (i <= 230000.0) {
tmp = (b * c) - t_1;
} else {
tmp = t_2;
}
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (j * 27.0d0) * k
t_2 = ((-4.0d0) * (x * i)) - t_1
if (i <= (-6d+125)) then
tmp = t_2
else if (i <= (-5.2d+38)) then
tmp = c * (b + (x * ((i * (-4.0d0)) / c)))
else if (i <= (-4.8d-234)) then
tmp = ((-4.0d0) * (t * a)) - t_1
else if (i <= 2.7d-305) then
tmp = (x * (z * t)) * (18.0d0 * y)
else if (i <= 230000.0d0) then
tmp = (b * c) - t_1
else
tmp = t_2
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 t_1 = (j * 27.0) * k;
double t_2 = (-4.0 * (x * i)) - t_1;
double tmp;
if (i <= -6e+125) {
tmp = t_2;
} else if (i <= -5.2e+38) {
tmp = c * (b + (x * ((i * -4.0) / c)));
} else if (i <= -4.8e-234) {
tmp = (-4.0 * (t * a)) - t_1;
} else if (i <= 2.7e-305) {
tmp = (x * (z * t)) * (18.0 * y);
} else if (i <= 230000.0) {
tmp = (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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (j * 27.0) * k t_2 = (-4.0 * (x * i)) - t_1 tmp = 0 if i <= -6e+125: tmp = t_2 elif i <= -5.2e+38: tmp = c * (b + (x * ((i * -4.0) / c))) elif i <= -4.8e-234: tmp = (-4.0 * (t * a)) - t_1 elif i <= 2.7e-305: tmp = (x * (z * t)) * (18.0 * y) elif i <= 230000.0: tmp = (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(-4.0 * Float64(x * i)) - t_1) tmp = 0.0 if (i <= -6e+125) tmp = t_2; elseif (i <= -5.2e+38) tmp = Float64(c * Float64(b + Float64(x * Float64(Float64(i * -4.0) / c)))); elseif (i <= -4.8e-234) tmp = Float64(Float64(-4.0 * Float64(t * a)) - t_1); elseif (i <= 2.7e-305) tmp = Float64(Float64(x * Float64(z * t)) * Float64(18.0 * y)); elseif (i <= 230000.0) tmp = Float64(Float64(b * c) - t_1); else tmp = t_2; 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)
t_1 = (j * 27.0) * k;
t_2 = (-4.0 * (x * i)) - t_1;
tmp = 0.0;
if (i <= -6e+125)
tmp = t_2;
elseif (i <= -5.2e+38)
tmp = c * (b + (x * ((i * -4.0) / c)));
elseif (i <= -4.8e-234)
tmp = (-4.0 * (t * a)) - t_1;
elseif (i <= 2.7e-305)
tmp = (x * (z * t)) * (18.0 * y);
elseif (i <= 230000.0)
tmp = (b * c) - t_1;
else
tmp = t_2;
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_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[i, -6e+125], t$95$2, If[LessEqual[i, -5.2e+38], N[(c * N[(b + N[(x * N[(N[(i * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, -4.8e-234], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[i, 2.7e-305], N[(N[(x * N[(z * t), $MachinePrecision]), $MachinePrecision] * N[(18.0 * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, 230000.0], N[(N[(b * c), $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 := -4 \cdot \left(x \cdot i\right) - t\_1\\
\mathbf{if}\;i \leq -6 \cdot 10^{+125}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;i \leq -5.2 \cdot 10^{+38}:\\
\;\;\;\;c \cdot \left(b + x \cdot \frac{i \cdot -4}{c}\right)\\
\mathbf{elif}\;i \leq -4.8 \cdot 10^{-234}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right) - t\_1\\
\mathbf{elif}\;i \leq 2.7 \cdot 10^{-305}:\\
\;\;\;\;\left(x \cdot \left(z \cdot t\right)\right) \cdot \left(18 \cdot y\right)\\
\mathbf{elif}\;i \leq 230000:\\
\;\;\;\;b \cdot c - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if i < -6.0000000000000003e125 or 2.3e5 < i Initial program 77.1%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6465.3%
Simplified65.3%
if -6.0000000000000003e125 < i < -5.1999999999999998e38Initial program 89.4%
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6489.4%
Applied egg-rr89.4%
Taylor expanded in b around inf
Simplified84.5%
Taylor expanded in i around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.5%
Simplified58.5%
Taylor expanded in c around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
associate-*r*N/A
*-commutativeN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6453.9%
Simplified53.9%
if -5.1999999999999998e38 < i < -4.7999999999999998e-234Initial program 87.8%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.2%
Simplified62.2%
if -4.7999999999999998e-234 < i < 2.6999999999999999e-305Initial program 86.6%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.6%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6462.8%
Simplified62.8%
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6467.5%
Applied egg-rr67.5%
if 2.6999999999999999e-305 < i < 2.3e5Initial program 81.6%
Taylor expanded in b around inf
*-lowering-*.f6452.1%
Simplified52.1%
Final simplification59.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 (* -4.0 (* x i))) (t_2 (* j (* k -27.0))))
(if (<= j -5.5e+147)
t_2
(if (<= j -9e-65)
t_1
(if (<= j -1.02e-300)
(* -4.0 (* t a))
(if (<= j 2.9e-208) t_1 (if (<= j 4.3e+43) (* b c) 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 = -4.0 * (x * i);
double t_2 = j * (k * -27.0);
double tmp;
if (j <= -5.5e+147) {
tmp = t_2;
} else if (j <= -9e-65) {
tmp = t_1;
} else if (j <= -1.02e-300) {
tmp = -4.0 * (t * a);
} else if (j <= 2.9e-208) {
tmp = t_1;
} else if (j <= 4.3e+43) {
tmp = b * c;
} else {
tmp = t_2;
}
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * (x * i)
t_2 = j * (k * (-27.0d0))
if (j <= (-5.5d+147)) then
tmp = t_2
else if (j <= (-9d-65)) then
tmp = t_1
else if (j <= (-1.02d-300)) then
tmp = (-4.0d0) * (t * a)
else if (j <= 2.9d-208) then
tmp = t_1
else if (j <= 4.3d+43) then
tmp = b * c
else
tmp = t_2
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 t_1 = -4.0 * (x * i);
double t_2 = j * (k * -27.0);
double tmp;
if (j <= -5.5e+147) {
tmp = t_2;
} else if (j <= -9e-65) {
tmp = t_1;
} else if (j <= -1.02e-300) {
tmp = -4.0 * (t * a);
} else if (j <= 2.9e-208) {
tmp = t_1;
} else if (j <= 4.3e+43) {
tmp = b * c;
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * (x * i) t_2 = j * (k * -27.0) tmp = 0 if j <= -5.5e+147: tmp = t_2 elif j <= -9e-65: tmp = t_1 elif j <= -1.02e-300: tmp = -4.0 * (t * a) elif j <= 2.9e-208: tmp = t_1 elif j <= 4.3e+43: tmp = b * c 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(-4.0 * Float64(x * i)) t_2 = Float64(j * Float64(k * -27.0)) tmp = 0.0 if (j <= -5.5e+147) tmp = t_2; elseif (j <= -9e-65) tmp = t_1; elseif (j <= -1.02e-300) tmp = Float64(-4.0 * Float64(t * a)); elseif (j <= 2.9e-208) tmp = t_1; elseif (j <= 4.3e+43) tmp = Float64(b * c); else tmp = t_2; 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)
t_1 = -4.0 * (x * i);
t_2 = j * (k * -27.0);
tmp = 0.0;
if (j <= -5.5e+147)
tmp = t_2;
elseif (j <= -9e-65)
tmp = t_1;
elseif (j <= -1.02e-300)
tmp = -4.0 * (t * a);
elseif (j <= 2.9e-208)
tmp = t_1;
elseif (j <= 4.3e+43)
tmp = b * c;
else
tmp = t_2;
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_] := Block[{t$95$1 = N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -5.5e+147], t$95$2, If[LessEqual[j, -9e-65], t$95$1, If[LessEqual[j, -1.02e-300], N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 2.9e-208], t$95$1, If[LessEqual[j, 4.3e+43], N[(b * c), $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 := -4 \cdot \left(x \cdot i\right)\\
t_2 := j \cdot \left(k \cdot -27\right)\\
\mathbf{if}\;j \leq -5.5 \cdot 10^{+147}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;j \leq -9 \cdot 10^{-65}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq -1.02 \cdot 10^{-300}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right)\\
\mathbf{elif}\;j \leq 2.9 \cdot 10^{-208}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq 4.3 \cdot 10^{+43}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if j < -5.4999999999999997e147 or 4.3e43 < j Initial program 77.2%
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6478.2%
Applied egg-rr78.2%
Taylor expanded in j around inf
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6452.5%
Simplified52.5%
if -5.4999999999999997e147 < j < -8.9999999999999995e-65 or -1.0200000000000001e-300 < j < 2.8999999999999999e-208Initial program 86.6%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.6%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6431.3%
Simplified31.3%
if -8.9999999999999995e-65 < j < -1.0200000000000001e-300Initial program 80.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.3%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6429.6%
Simplified29.6%
if 2.8999999999999999e-208 < j < 4.3e43Initial program 86.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified89.1%
Taylor expanded in b around inf
*-lowering-*.f6435.5%
Simplified35.5%
Final simplification39.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 (* -4.0 (* x i))) (t_2 (* -27.0 (* j k))))
(if (<= j -4e+147)
t_2
(if (<= j -3.3e-65)
t_1
(if (<= j -2.75e-301)
(* -4.0 (* t a))
(if (<= j 4e-209) t_1 (if (<= j 3e+39) (* b c) 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 = -4.0 * (x * i);
double t_2 = -27.0 * (j * k);
double tmp;
if (j <= -4e+147) {
tmp = t_2;
} else if (j <= -3.3e-65) {
tmp = t_1;
} else if (j <= -2.75e-301) {
tmp = -4.0 * (t * a);
} else if (j <= 4e-209) {
tmp = t_1;
} else if (j <= 3e+39) {
tmp = b * c;
} else {
tmp = t_2;
}
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * (x * i)
t_2 = (-27.0d0) * (j * k)
if (j <= (-4d+147)) then
tmp = t_2
else if (j <= (-3.3d-65)) then
tmp = t_1
else if (j <= (-2.75d-301)) then
tmp = (-4.0d0) * (t * a)
else if (j <= 4d-209) then
tmp = t_1
else if (j <= 3d+39) then
tmp = b * c
else
tmp = t_2
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 t_1 = -4.0 * (x * i);
double t_2 = -27.0 * (j * k);
double tmp;
if (j <= -4e+147) {
tmp = t_2;
} else if (j <= -3.3e-65) {
tmp = t_1;
} else if (j <= -2.75e-301) {
tmp = -4.0 * (t * a);
} else if (j <= 4e-209) {
tmp = t_1;
} else if (j <= 3e+39) {
tmp = b * c;
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * (x * i) t_2 = -27.0 * (j * k) tmp = 0 if j <= -4e+147: tmp = t_2 elif j <= -3.3e-65: tmp = t_1 elif j <= -2.75e-301: tmp = -4.0 * (t * a) elif j <= 4e-209: tmp = t_1 elif j <= 3e+39: tmp = b * c 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(-4.0 * Float64(x * i)) t_2 = Float64(-27.0 * Float64(j * k)) tmp = 0.0 if (j <= -4e+147) tmp = t_2; elseif (j <= -3.3e-65) tmp = t_1; elseif (j <= -2.75e-301) tmp = Float64(-4.0 * Float64(t * a)); elseif (j <= 4e-209) tmp = t_1; elseif (j <= 3e+39) tmp = Float64(b * c); else tmp = t_2; 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)
t_1 = -4.0 * (x * i);
t_2 = -27.0 * (j * k);
tmp = 0.0;
if (j <= -4e+147)
tmp = t_2;
elseif (j <= -3.3e-65)
tmp = t_1;
elseif (j <= -2.75e-301)
tmp = -4.0 * (t * a);
elseif (j <= 4e-209)
tmp = t_1;
elseif (j <= 3e+39)
tmp = b * c;
else
tmp = t_2;
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_] := Block[{t$95$1 = N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -4e+147], t$95$2, If[LessEqual[j, -3.3e-65], t$95$1, If[LessEqual[j, -2.75e-301], N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 4e-209], t$95$1, If[LessEqual[j, 3e+39], N[(b * c), $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 := -4 \cdot \left(x \cdot i\right)\\
t_2 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;j \leq -4 \cdot 10^{+147}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;j \leq -3.3 \cdot 10^{-65}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq -2.75 \cdot 10^{-301}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right)\\
\mathbf{elif}\;j \leq 4 \cdot 10^{-209}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq 3 \cdot 10^{+39}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if j < -3.9999999999999999e147 or 3e39 < j Initial program 77.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified81.8%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6452.5%
Simplified52.5%
if -3.9999999999999999e147 < j < -3.3000000000000001e-65 or -2.75000000000000003e-301 < j < 4.0000000000000002e-209Initial program 86.6%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.6%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6431.3%
Simplified31.3%
if -3.3000000000000001e-65 < j < -2.75000000000000003e-301Initial program 80.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.3%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6429.6%
Simplified29.6%
if 4.0000000000000002e-209 < j < 3e39Initial program 86.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified89.1%
Taylor expanded in b around inf
*-lowering-*.f6435.5%
Simplified35.5%
Final simplification39.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 (* (* y z) (* (* x 18.0) t))))
(if (<= x -3.6e+50)
t_1
(if (<= x -1.8e-51)
(* b c)
(if (<= x 2.3e-90)
(* -27.0 (* j k))
(if (<= x 1.14e+54) (* -4.0 (* t a)) 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 = (y * z) * ((x * 18.0) * t);
double tmp;
if (x <= -3.6e+50) {
tmp = t_1;
} else if (x <= -1.8e-51) {
tmp = b * c;
} else if (x <= 2.3e-90) {
tmp = -27.0 * (j * k);
} else if (x <= 1.14e+54) {
tmp = -4.0 * (t * a);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = (y * z) * ((x * 18.0d0) * t)
if (x <= (-3.6d+50)) then
tmp = t_1
else if (x <= (-1.8d-51)) then
tmp = b * c
else if (x <= 2.3d-90) then
tmp = (-27.0d0) * (j * k)
else if (x <= 1.14d+54) then
tmp = (-4.0d0) * (t * a)
else
tmp = t_1
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 t_1 = (y * z) * ((x * 18.0) * t);
double tmp;
if (x <= -3.6e+50) {
tmp = t_1;
} else if (x <= -1.8e-51) {
tmp = b * c;
} else if (x <= 2.3e-90) {
tmp = -27.0 * (j * k);
} else if (x <= 1.14e+54) {
tmp = -4.0 * (t * a);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (y * z) * ((x * 18.0) * t) tmp = 0 if x <= -3.6e+50: tmp = t_1 elif x <= -1.8e-51: tmp = b * c elif x <= 2.3e-90: tmp = -27.0 * (j * k) elif x <= 1.14e+54: tmp = -4.0 * (t * a) 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(y * z) * Float64(Float64(x * 18.0) * t)) tmp = 0.0 if (x <= -3.6e+50) tmp = t_1; elseif (x <= -1.8e-51) tmp = Float64(b * c); elseif (x <= 2.3e-90) tmp = Float64(-27.0 * Float64(j * k)); elseif (x <= 1.14e+54) tmp = Float64(-4.0 * Float64(t * a)); else tmp = t_1; 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)
t_1 = (y * z) * ((x * 18.0) * t);
tmp = 0.0;
if (x <= -3.6e+50)
tmp = t_1;
elseif (x <= -1.8e-51)
tmp = b * c;
elseif (x <= 2.3e-90)
tmp = -27.0 * (j * k);
elseif (x <= 1.14e+54)
tmp = -4.0 * (t * a);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(N[(y * z), $MachinePrecision] * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.6e+50], t$95$1, If[LessEqual[x, -1.8e-51], N[(b * c), $MachinePrecision], If[LessEqual[x, 2.3e-90], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.14e+54], N[(-4.0 * N[(t * a), $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 := \left(y \cdot z\right) \cdot \left(\left(x \cdot 18\right) \cdot t\right)\\
\mathbf{if}\;x \leq -3.6 \cdot 10^{+50}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -1.8 \cdot 10^{-51}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;x \leq 2.3 \cdot 10^{-90}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;x \leq 1.14 \cdot 10^{+54}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -3.59999999999999986e50 or 1.14000000000000003e54 < x Initial program 68.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified70.8%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6452.8%
Simplified52.8%
if -3.59999999999999986e50 < x < -1.8e-51Initial program 90.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified90.8%
Taylor expanded in b around inf
*-lowering-*.f6439.4%
Simplified39.4%
if -1.8e-51 < x < 2.2999999999999998e-90Initial program 94.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified94.5%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6438.2%
Simplified38.2%
if 2.2999999999999998e-90 < x < 1.14000000000000003e54Initial program 89.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified94.4%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6436.3%
Simplified36.3%
Final simplification44.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 (* x (+ (* i -4.0) (* 18.0 (* z (* y t)))))))
(if (<= x -6e+28)
t_2
(if (<= x 1.35e-244)
(- (* b c) t_1)
(if (<= x 3.4e+48) (- (* -4.0 (* t a)) 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 * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -6e+28) {
tmp = t_2;
} else if (x <= 1.35e-244) {
tmp = (b * c) - t_1;
} else if (x <= 3.4e+48) {
tmp = (-4.0 * (t * a)) - t_1;
} else {
tmp = t_2;
}
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (j * 27.0d0) * k
t_2 = x * ((i * (-4.0d0)) + (18.0d0 * (z * (y * t))))
if (x <= (-6d+28)) then
tmp = t_2
else if (x <= 1.35d-244) then
tmp = (b * c) - t_1
else if (x <= 3.4d+48) then
tmp = ((-4.0d0) * (t * a)) - t_1
else
tmp = t_2
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 t_1 = (j * 27.0) * k;
double t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -6e+28) {
tmp = t_2;
} else if (x <= 1.35e-244) {
tmp = (b * c) - t_1;
} else if (x <= 3.4e+48) {
tmp = (-4.0 * (t * a)) - 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (j * 27.0) * k t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t)))) tmp = 0 if x <= -6e+28: tmp = t_2 elif x <= 1.35e-244: tmp = (b * c) - t_1 elif x <= 3.4e+48: tmp = (-4.0 * (t * a)) - 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(x * Float64(Float64(i * -4.0) + Float64(18.0 * Float64(z * Float64(y * t))))) tmp = 0.0 if (x <= -6e+28) tmp = t_2; elseif (x <= 1.35e-244) tmp = Float64(Float64(b * c) - t_1); elseif (x <= 3.4e+48) tmp = Float64(Float64(-4.0 * Float64(t * a)) - t_1); else tmp = t_2; 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)
t_1 = (j * 27.0) * k;
t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
tmp = 0.0;
if (x <= -6e+28)
tmp = t_2;
elseif (x <= 1.35e-244)
tmp = (b * c) - t_1;
elseif (x <= 3.4e+48)
tmp = (-4.0 * (t * a)) - t_1;
else
tmp = t_2;
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_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(18.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -6e+28], t$95$2, If[LessEqual[x, 1.35e-244], N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[x, 3.4e+48], N[(N[(-4.0 * N[(t * a), $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 \left(i \cdot -4 + 18 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right)\\
\mathbf{if}\;x \leq -6 \cdot 10^{+28}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq 1.35 \cdot 10^{-244}:\\
\;\;\;\;b \cdot c - t\_1\\
\mathbf{elif}\;x \leq 3.4 \cdot 10^{+48}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -6.0000000000000002e28 or 3.4000000000000003e48 < x Initial program 68.6%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified71.2%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.0%
Simplified74.0%
if -6.0000000000000002e28 < x < 1.35e-244Initial program 94.7%
Taylor expanded in b around inf
*-lowering-*.f6463.2%
Simplified63.2%
if 1.35e-244 < x < 3.4000000000000003e48Initial program 92.0%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.8%
Simplified54.8%
Final simplification66.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 (+ (* b c) (* t (+ (* (* (* x 18.0) y) z) (* a -4.0))))))
(if (<= t -6.8e-18)
t_1
(if (<= t 3.1e+41)
(- (- (* b c) (* (* x 4.0) i)) (* (* j 27.0) k))
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 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
double tmp;
if (t <= -6.8e-18) {
tmp = t_1;
} else if (t <= 3.1e+41) {
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = (b * c) + (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0))))
if (t <= (-6.8d-18)) then
tmp = t_1
else if (t <= 3.1d+41) then
tmp = ((b * c) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
else
tmp = t_1
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 t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
double tmp;
if (t <= -6.8e-18) {
tmp = t_1;
} else if (t <= 3.1e+41) {
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0))) tmp = 0 if t <= -6.8e-18: tmp = t_1 elif t <= 3.1e+41: tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k) 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(b * c) + Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0)))) tmp = 0.0 if (t <= -6.8e-18) tmp = t_1; elseif (t <= 3.1e+41) tmp = Float64(Float64(Float64(b * c) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)); else tmp = t_1; 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)
t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
tmp = 0.0;
if (t <= -6.8e-18)
tmp = t_1;
elseif (t <= 3.1e+41)
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -6.8e-18], t$95$1, If[LessEqual[t, 3.1e+41], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $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 := b \cdot c + t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
\mathbf{if}\;t \leq -6.8 \cdot 10^{-18}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 3.1 \cdot 10^{+41}:\\
\;\;\;\;\left(b \cdot c - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -6.80000000000000002e-18 or 3.1e41 < t Initial program 81.8%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.9%
Taylor expanded in b around inf
*-lowering-*.f6474.2%
Simplified74.2%
if -6.80000000000000002e-18 < t < 3.1e41Initial program 82.6%
Taylor expanded in t around 0
*-lowering-*.f6475.8%
Simplified75.8%
Final simplification75.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 (* t (+ (* a -4.0) (* x (* 18.0 (* y z)))))))
(if (<= t -7.2e+43)
t_1
(if (<= t 6e+41) (- (- (* b c) (* (* x 4.0) i)) (* (* j 27.0) k)) 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) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -7.2e+43) {
tmp = t_1;
} else if (t <= 6e+41) {
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
if (t <= (-7.2d+43)) then
tmp = t_1
else if (t <= 6d+41) then
tmp = ((b * c) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
else
tmp = t_1
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 t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -7.2e+43) {
tmp = t_1;
} else if (t <= 6e+41) {
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z)))) tmp = 0 if t <= -7.2e+43: tmp = t_1 elif t <= 6e+41: tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k) 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(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) tmp = 0.0 if (t <= -7.2e+43) tmp = t_1; elseif (t <= 6e+41) tmp = Float64(Float64(Float64(b * c) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)); else tmp = t_1; 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)
t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
tmp = 0.0;
if (t <= -7.2e+43)
tmp = t_1;
elseif (t <= 6e+41)
tmp = ((b * c) - ((x * 4.0) * i)) - ((j * 27.0) * k);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -7.2e+43], t$95$1, If[LessEqual[t, 6e+41], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $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 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;t \leq -7.2 \cdot 10^{+43}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 6 \cdot 10^{+41}:\\
\;\;\;\;\left(b \cdot c - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -7.2000000000000002e43 or 5.9999999999999997e41 < t Initial program 80.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.6%
Simplified70.6%
if -7.2000000000000002e43 < t < 5.9999999999999997e41Initial program 83.4%
Taylor expanded in t around 0
*-lowering-*.f6474.6%
Simplified74.6%
Final simplification72.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 (* z (* y (* (* x 18.0) t)))) (t_2 (* (* j 27.0) k)))
(if (<= x -7.5e+155)
t_1
(if (<= x -1.95e+31)
(- (* -4.0 (* x i)) t_2)
(if (<= x 3.9e+60) (- (* b c) t_2) 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 = z * (y * ((x * 18.0) * t));
double t_2 = (j * 27.0) * k;
double tmp;
if (x <= -7.5e+155) {
tmp = t_1;
} else if (x <= -1.95e+31) {
tmp = (-4.0 * (x * i)) - t_2;
} else if (x <= 3.9e+60) {
tmp = (b * c) - t_2;
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = z * (y * ((x * 18.0d0) * t))
t_2 = (j * 27.0d0) * k
if (x <= (-7.5d+155)) then
tmp = t_1
else if (x <= (-1.95d+31)) then
tmp = ((-4.0d0) * (x * i)) - t_2
else if (x <= 3.9d+60) then
tmp = (b * c) - t_2
else
tmp = t_1
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 t_1 = z * (y * ((x * 18.0) * t));
double t_2 = (j * 27.0) * k;
double tmp;
if (x <= -7.5e+155) {
tmp = t_1;
} else if (x <= -1.95e+31) {
tmp = (-4.0 * (x * i)) - t_2;
} else if (x <= 3.9e+60) {
tmp = (b * c) - t_2;
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = z * (y * ((x * 18.0) * t)) t_2 = (j * 27.0) * k tmp = 0 if x <= -7.5e+155: tmp = t_1 elif x <= -1.95e+31: tmp = (-4.0 * (x * i)) - t_2 elif x <= 3.9e+60: tmp = (b * c) - t_2 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(z * Float64(y * Float64(Float64(x * 18.0) * t))) t_2 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (x <= -7.5e+155) tmp = t_1; elseif (x <= -1.95e+31) tmp = Float64(Float64(-4.0 * Float64(x * i)) - t_2); elseif (x <= 3.9e+60) tmp = Float64(Float64(b * c) - t_2); else tmp = t_1; 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)
t_1 = z * (y * ((x * 18.0) * t));
t_2 = (j * 27.0) * k;
tmp = 0.0;
if (x <= -7.5e+155)
tmp = t_1;
elseif (x <= -1.95e+31)
tmp = (-4.0 * (x * i)) - t_2;
elseif (x <= 3.9e+60)
tmp = (b * c) - t_2;
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(z * N[(y * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[x, -7.5e+155], t$95$1, If[LessEqual[x, -1.95e+31], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], If[LessEqual[x, 3.9e+60], N[(N[(b * c), $MachinePrecision] - t$95$2), $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 := z \cdot \left(y \cdot \left(\left(x \cdot 18\right) \cdot t\right)\right)\\
t_2 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;x \leq -7.5 \cdot 10^{+155}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq -1.95 \cdot 10^{+31}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - t\_2\\
\mathbf{elif}\;x \leq 3.9 \cdot 10^{+60}:\\
\;\;\;\;b \cdot c - t\_2\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -7.4999999999999999e155 or 3.9000000000000003e60 < x Initial program 66.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified70.0%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.1%
Simplified55.1%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6456.4%
Applied egg-rr56.4%
if -7.4999999999999999e155 < x < -1.95e31Initial program 70.7%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6457.2%
Simplified57.2%
if -1.95e31 < x < 3.9000000000000003e60Initial program 93.7%
Taylor expanded in b around inf
*-lowering-*.f6454.3%
Simplified54.3%
Final simplification55.3%
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 (* z (* y (* (* x 18.0) t)))))
(if (<= x -0.00017)
t_1
(if (<= x 1.4e-89)
(* -27.0 (* j k))
(if (<= x 2.5e+70) (* -4.0 (* t a)) 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 = z * (y * ((x * 18.0) * t));
double tmp;
if (x <= -0.00017) {
tmp = t_1;
} else if (x <= 1.4e-89) {
tmp = -27.0 * (j * k);
} else if (x <= 2.5e+70) {
tmp = -4.0 * (t * a);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = z * (y * ((x * 18.0d0) * t))
if (x <= (-0.00017d0)) then
tmp = t_1
else if (x <= 1.4d-89) then
tmp = (-27.0d0) * (j * k)
else if (x <= 2.5d+70) then
tmp = (-4.0d0) * (t * a)
else
tmp = t_1
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 t_1 = z * (y * ((x * 18.0) * t));
double tmp;
if (x <= -0.00017) {
tmp = t_1;
} else if (x <= 1.4e-89) {
tmp = -27.0 * (j * k);
} else if (x <= 2.5e+70) {
tmp = -4.0 * (t * a);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = z * (y * ((x * 18.0) * t)) tmp = 0 if x <= -0.00017: tmp = t_1 elif x <= 1.4e-89: tmp = -27.0 * (j * k) elif x <= 2.5e+70: tmp = -4.0 * (t * a) 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(z * Float64(y * Float64(Float64(x * 18.0) * t))) tmp = 0.0 if (x <= -0.00017) tmp = t_1; elseif (x <= 1.4e-89) tmp = Float64(-27.0 * Float64(j * k)); elseif (x <= 2.5e+70) tmp = Float64(-4.0 * Float64(t * a)); else tmp = t_1; 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)
t_1 = z * (y * ((x * 18.0) * t));
tmp = 0.0;
if (x <= -0.00017)
tmp = t_1;
elseif (x <= 1.4e-89)
tmp = -27.0 * (j * k);
elseif (x <= 2.5e+70)
tmp = -4.0 * (t * a);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(z * N[(y * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -0.00017], t$95$1, If[LessEqual[x, 1.4e-89], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.5e+70], N[(-4.0 * N[(t * a), $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 := z \cdot \left(y \cdot \left(\left(x \cdot 18\right) \cdot t\right)\right)\\
\mathbf{if}\;x \leq -0.00017:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 1.4 \cdot 10^{-89}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;x \leq 2.5 \cdot 10^{+70}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -1.7e-4 or 2.5000000000000001e70 < x Initial program 69.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified72.0%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6449.3%
Simplified49.3%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6450.6%
Applied egg-rr50.6%
if -1.7e-4 < x < 1.3999999999999999e-89Initial program 95.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified95.0%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6435.7%
Simplified35.7%
if 1.3999999999999999e-89 < x < 2.5000000000000001e70Initial program 87.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified92.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6436.2%
Simplified36.2%
Final simplification42.5%
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) (* x (* 18.0 (* y z)))))))
(if (<= t -2.8e+41)
t_1
(if (<= t 7.5e+41) (- (* -4.0 (* x i)) (* (* j 27.0) k)) 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) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -2.8e+41) {
tmp = t_1;
} else if (t <= 7.5e+41) {
tmp = (-4.0 * (x * i)) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
if (t <= (-2.8d+41)) then
tmp = t_1
else if (t <= 7.5d+41) then
tmp = ((-4.0d0) * (x * i)) - ((j * 27.0d0) * k)
else
tmp = t_1
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 t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -2.8e+41) {
tmp = t_1;
} else if (t <= 7.5e+41) {
tmp = (-4.0 * (x * i)) - ((j * 27.0) * k);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z)))) tmp = 0 if t <= -2.8e+41: tmp = t_1 elif t <= 7.5e+41: tmp = (-4.0 * (x * i)) - ((j * 27.0) * k) 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(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) tmp = 0.0 if (t <= -2.8e+41) tmp = t_1; elseif (t <= 7.5e+41) tmp = Float64(Float64(-4.0 * Float64(x * i)) - Float64(Float64(j * 27.0) * k)); else tmp = t_1; 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)
t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
tmp = 0.0;
if (t <= -2.8e+41)
tmp = t_1;
elseif (t <= 7.5e+41)
tmp = (-4.0 * (x * i)) - ((j * 27.0) * k);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.8e+41], t$95$1, If[LessEqual[t, 7.5e+41], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $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 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;t \leq -2.8 \cdot 10^{+41}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 7.5 \cdot 10^{+41}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -2.7999999999999999e41 or 7.50000000000000072e41 < t Initial program 80.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.6%
Simplified70.6%
if -2.7999999999999999e41 < t < 7.50000000000000072e41Initial program 83.4%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6454.8%
Simplified54.8%
Final simplification61.5%
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 (* -27.0 (* j k))))
(if (<= j -4.2e+147)
t_1
(if (<= j 2.1e-208) (* -4.0 (* x i)) (if (<= j 1.55e+41) (* b c) 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 = -27.0 * (j * k);
double tmp;
if (j <= -4.2e+147) {
tmp = t_1;
} else if (j <= 2.1e-208) {
tmp = -4.0 * (x * i);
} else if (j <= 1.55e+41) {
tmp = b * c;
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = (-27.0d0) * (j * k)
if (j <= (-4.2d+147)) then
tmp = t_1
else if (j <= 2.1d-208) then
tmp = (-4.0d0) * (x * i)
else if (j <= 1.55d+41) then
tmp = b * c
else
tmp = t_1
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 t_1 = -27.0 * (j * k);
double tmp;
if (j <= -4.2e+147) {
tmp = t_1;
} else if (j <= 2.1e-208) {
tmp = -4.0 * (x * i);
} else if (j <= 1.55e+41) {
tmp = b * c;
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -27.0 * (j * k) tmp = 0 if j <= -4.2e+147: tmp = t_1 elif j <= 2.1e-208: tmp = -4.0 * (x * i) elif j <= 1.55e+41: tmp = b * c 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(-27.0 * Float64(j * k)) tmp = 0.0 if (j <= -4.2e+147) tmp = t_1; elseif (j <= 2.1e-208) tmp = Float64(-4.0 * Float64(x * i)); elseif (j <= 1.55e+41) tmp = Float64(b * c); else tmp = t_1; 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)
t_1 = -27.0 * (j * k);
tmp = 0.0;
if (j <= -4.2e+147)
tmp = t_1;
elseif (j <= 2.1e-208)
tmp = -4.0 * (x * i);
elseif (j <= 1.55e+41)
tmp = b * c;
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -4.2e+147], t$95$1, If[LessEqual[j, 2.1e-208], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 1.55e+41], N[(b * c), $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 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;j \leq -4.2 \cdot 10^{+147}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq 2.1 \cdot 10^{-208}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;j \leq 1.55 \cdot 10^{+41}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if j < -4.20000000000000012e147 or 1.55e41 < j Initial program 77.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified81.8%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6452.5%
Simplified52.5%
if -4.20000000000000012e147 < j < 2.10000000000000012e-208Initial program 84.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified84.1%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6427.1%
Simplified27.1%
if 2.10000000000000012e-208 < j < 1.55e41Initial program 86.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified89.1%
Taylor expanded in b around inf
*-lowering-*.f6435.5%
Simplified35.5%
Final simplification37.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 (* z (* y (* (* x 18.0) t)))))
(if (<= x -4e+50)
t_1
(if (<= x 7.5e+63) (- (* b c) (* (* j 27.0) k)) 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 = z * (y * ((x * 18.0) * t));
double tmp;
if (x <= -4e+50) {
tmp = t_1;
} else if (x <= 7.5e+63) {
tmp = (b * c) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
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) :: t_1
real(8) :: tmp
t_1 = z * (y * ((x * 18.0d0) * t))
if (x <= (-4d+50)) then
tmp = t_1
else if (x <= 7.5d+63) then
tmp = (b * c) - ((j * 27.0d0) * k)
else
tmp = t_1
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 t_1 = z * (y * ((x * 18.0) * t));
double tmp;
if (x <= -4e+50) {
tmp = t_1;
} else if (x <= 7.5e+63) {
tmp = (b * c) - ((j * 27.0) * k);
} 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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = z * (y * ((x * 18.0) * t)) tmp = 0 if x <= -4e+50: tmp = t_1 elif x <= 7.5e+63: tmp = (b * c) - ((j * 27.0) * k) 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(z * Float64(y * Float64(Float64(x * 18.0) * t))) tmp = 0.0 if (x <= -4e+50) tmp = t_1; elseif (x <= 7.5e+63) tmp = Float64(Float64(b * c) - Float64(Float64(j * 27.0) * k)); else tmp = t_1; 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)
t_1 = z * (y * ((x * 18.0) * t));
tmp = 0.0;
if (x <= -4e+50)
tmp = t_1;
elseif (x <= 7.5e+63)
tmp = (b * c) - ((j * 27.0) * k);
else
tmp = t_1;
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_] := Block[{t$95$1 = N[(z * N[(y * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4e+50], t$95$1, If[LessEqual[x, 7.5e+63], N[(N[(b * c), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $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 := z \cdot \left(y \cdot \left(\left(x \cdot 18\right) \cdot t\right)\right)\\
\mathbf{if}\;x \leq -4 \cdot 10^{+50}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 7.5 \cdot 10^{+63}:\\
\;\;\;\;b \cdot c - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -4.0000000000000003e50 or 7.5000000000000005e63 < x Initial program 67.8%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified70.6%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6452.4%
Simplified52.4%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6452.9%
Applied egg-rr52.9%
if -4.0000000000000003e50 < x < 7.5000000000000005e63Initial program 92.6%
Taylor expanded in b around inf
*-lowering-*.f6453.2%
Simplified53.2%
Final simplification53.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 (<= y -1.45e+134)
(* z (* y (* (* x 18.0) t)))
(if (<= y 1.75e-18)
(+ (* b c) (* x (* i -4.0)))
(* y (* (* x 18.0) (* z t))))))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 (y <= -1.45e+134) {
tmp = z * (y * ((x * 18.0) * t));
} else if (y <= 1.75e-18) {
tmp = (b * c) + (x * (i * -4.0));
} else {
tmp = y * ((x * 18.0) * (z * t));
}
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 (y <= (-1.45d+134)) then
tmp = z * (y * ((x * 18.0d0) * t))
else if (y <= 1.75d-18) then
tmp = (b * c) + (x * (i * (-4.0d0)))
else
tmp = y * ((x * 18.0d0) * (z * t))
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 (y <= -1.45e+134) {
tmp = z * (y * ((x * 18.0) * t));
} else if (y <= 1.75e-18) {
tmp = (b * c) + (x * (i * -4.0));
} else {
tmp = y * ((x * 18.0) * (z * t));
}
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 y <= -1.45e+134: tmp = z * (y * ((x * 18.0) * t)) elif y <= 1.75e-18: tmp = (b * c) + (x * (i * -4.0)) else: tmp = y * ((x * 18.0) * (z * t)) 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 (y <= -1.45e+134) tmp = Float64(z * Float64(y * Float64(Float64(x * 18.0) * t))); elseif (y <= 1.75e-18) tmp = Float64(Float64(b * c) + Float64(x * Float64(i * -4.0))); else tmp = Float64(y * Float64(Float64(x * 18.0) * Float64(z * t))); 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 (y <= -1.45e+134)
tmp = z * (y * ((x * 18.0) * t));
elseif (y <= 1.75e-18)
tmp = (b * c) + (x * (i * -4.0));
else
tmp = y * ((x * 18.0) * (z * t));
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[y, -1.45e+134], N[(z * N[(y * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.75e-18], N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(x * 18.0), $MachinePrecision] * N[(z * t), $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}
\mathbf{if}\;y \leq -1.45 \cdot 10^{+134}:\\
\;\;\;\;z \cdot \left(y \cdot \left(\left(x \cdot 18\right) \cdot t\right)\right)\\
\mathbf{elif}\;y \leq 1.75 \cdot 10^{-18}:\\
\;\;\;\;b \cdot c + x \cdot \left(i \cdot -4\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(\left(x \cdot 18\right) \cdot \left(z \cdot t\right)\right)\\
\end{array}
\end{array}
if y < -1.45000000000000006e134Initial program 72.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified72.9%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.2%
Simplified45.2%
associate-*r*N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6450.8%
Applied egg-rr50.8%
if -1.45000000000000006e134 < y < 1.7499999999999999e-18Initial program 89.5%
associate-*l*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6484.5%
Applied egg-rr84.5%
Taylor expanded in b around inf
Simplified77.9%
Taylor expanded in i around inf
associate-*r/N/A
/-lowering-/.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6444.3%
Simplified44.3%
distribute-rgt-inN/A
+-commutativeN/A
div-invN/A
associate-*l*N/A
lft-mult-inverseN/A
*-rgt-identityN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6444.3%
Applied egg-rr44.3%
if 1.7499999999999999e-18 < y Initial program 74.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified78.6%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6443.9%
Simplified43.9%
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6444.9%
Applied egg-rr44.9%
Final simplification45.6%
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) -4.5e+305) (* b c) (if (<= (* b c) 7.2e+138) (* -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) <= -4.5e+305) {
tmp = b * c;
} else if ((b * c) <= 7.2e+138) {
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) <= (-4.5d+305)) then
tmp = b * c
else if ((b * c) <= 7.2d+138) 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) <= -4.5e+305) {
tmp = b * c;
} else if ((b * c) <= 7.2e+138) {
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) <= -4.5e+305: tmp = b * c elif (b * c) <= 7.2e+138: 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) <= -4.5e+305) tmp = Float64(b * c); elseif (Float64(b * c) <= 7.2e+138) 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) <= -4.5e+305)
tmp = b * c;
elseif ((b * c) <= 7.2e+138)
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], -4.5e+305], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 7.2e+138], 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 -4.5 \cdot 10^{+305}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq 7.2 \cdot 10^{+138}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -4.5000000000000003e305 or 7.2000000000000002e138 < (*.f64 b c) Initial program 78.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.0%
Taylor expanded in b around inf
*-lowering-*.f6461.3%
Simplified61.3%
if -4.5000000000000003e305 < (*.f64 b c) < 7.2000000000000002e138Initial program 83.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.2%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6427.8%
Simplified27.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 (* 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 82.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified84.2%
Taylor expanded in b around inf
*-lowering-*.f6418.6%
Simplified18.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 2024160
(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)))