
(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 25 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.
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)) (* j (* 27.0 k))))
(t_2 (* t (* a 4.0)))
(t_3
(-
(- (- (* b c) (- t_2 (* (* (* (* x 18.0) y) z) t))) (* (* x 4.0) i))
(* (* j 27.0) k))))
(if (<= t_3 (- INFINITY))
(- (+ (* b c) (- (* x (* (* 18.0 y) (* z t))) t_2)) t_1)
(if (<= t_3 INFINITY)
(- (+ (* (* 18.0 t) (* z (* x y))) (- (* b c) t_2)) t_1)
(* x (+ (* (* 18.0 t) (* y z)) (* i -4.0)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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)) + (j * (27.0 * k));
double t_2 = t * (a * 4.0);
double t_3 = (((b * c) - (t_2 - ((((x * 18.0) * y) * z) * t))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - t_2)) - t_1;
} else if (t_3 <= ((double) INFINITY)) {
tmp = (((18.0 * t) * (z * (x * y))) + ((b * c) - t_2)) - t_1;
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -4.0));
}
return tmp;
}
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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)) + (j * (27.0 * k));
double t_2 = t * (a * 4.0);
double t_3 = (((b * c) - (t_2 - ((((x * 18.0) * y) * z) * t))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
double tmp;
if (t_3 <= -Double.POSITIVE_INFINITY) {
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - t_2)) - t_1;
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = (((18.0 * t) * (z * (x * y))) + ((b * c) - t_2)) - t_1;
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) [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)) + (j * (27.0 * k)) t_2 = t * (a * 4.0) t_3 = (((b * c) - (t_2 - ((((x * 18.0) * y) * z) * t))) - ((x * 4.0) * i)) - ((j * 27.0) * k) tmp = 0 if t_3 <= -math.inf: tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - t_2)) - t_1 elif t_3 <= math.inf: tmp = (((18.0 * t) * (z * (x * y))) + ((b * c) - t_2)) - t_1 else: tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) 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 * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k))) t_2 = Float64(t * Float64(a * 4.0)) t_3 = Float64(Float64(Float64(Float64(b * c) - Float64(t_2 - Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t))) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = Float64(Float64(Float64(b * c) + Float64(Float64(x * Float64(Float64(18.0 * y) * Float64(z * t))) - t_2)) - t_1); elseif (t_3 <= Inf) tmp = Float64(Float64(Float64(Float64(18.0 * t) * Float64(z * Float64(x * y))) + Float64(Float64(b * c) - t_2)) - t_1); else tmp = Float64(x * Float64(Float64(Float64(18.0 * t) * Float64(y * z)) + Float64(i * -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])){:}
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)) + (j * (27.0 * k));
t_2 = t * (a * 4.0);
t_3 = (((b * c) - (t_2 - ((((x * 18.0) * y) * z) * t))) - ((x * 4.0) * i)) - ((j * 27.0) * k);
tmp = 0.0;
if (t_3 <= -Inf)
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - t_2)) - t_1;
elseif (t_3 <= Inf)
tmp = (((18.0 * t) * (z * (x * y))) + ((b * c) - t_2)) - t_1;
else
tmp = x * (((18.0 * t) * (y * z)) + (i * -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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(b * c), $MachinePrecision] - N[(t$95$2 - N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(x * N[(N[(18.0 * y), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[(N[(18.0 * t), $MachinePrecision] * N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(x * N[(N[(N[(18.0 * t), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\\
t_2 := t \cdot \left(a \cdot 4\right)\\
t_3 := \left(\left(b \cdot c - \left(t\_2 - \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t\right)\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;\left(b \cdot c + \left(x \cdot \left(\left(18 \cdot y\right) \cdot \left(z \cdot t\right)\right) - t\_2\right)\right) - t\_1\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\left(\left(18 \cdot t\right) \cdot \left(z \cdot \left(x \cdot y\right)\right) + \left(b \cdot c - t\_2\right)\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(18 \cdot t\right) \cdot \left(y \cdot z\right) + i \cdot -4\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 84.5%
Simplified91.7%
associate-*r*84.5%
distribute-rgt-out--84.5%
associate-+l-84.5%
associate-*l*87.1%
fmm-def87.1%
associate-*l*87.0%
*-commutative87.0%
Applied egg-rr87.0%
fmm-undef87.0%
*-commutative87.0%
Simplified87.0%
associate--r-87.0%
associate-*l*98.5%
Applied egg-rr98.5%
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)) < +inf.0Initial program 96.5%
Simplified90.7%
associate-*r*96.5%
distribute-rgt-out--96.5%
associate-+l-96.5%
associate-*l*90.0%
fmm-def90.0%
associate-*l*90.0%
*-commutative90.0%
Applied egg-rr90.0%
fmm-undef90.0%
*-commutative90.0%
Simplified90.0%
Taylor expanded in x around 0 91.3%
associate-*r*91.3%
associate-*r*96.5%
Simplified96.5%
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%
Simplified26.3%
associate-*r*15.8%
distribute-rgt-out--0.0%
associate-+l-0.0%
associate-*l*0.0%
fmm-def0.0%
associate-*l*0.0%
*-commutative0.0%
Applied egg-rr0.0%
fmm-undef0.0%
*-commutative0.0%
Simplified0.0%
Taylor expanded in x around inf 73.7%
associate-*r*73.7%
cancel-sign-sub-inv73.7%
*-commutative73.7%
metadata-eval73.7%
Simplified73.7%
Final simplification95.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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)) (* j (* 27.0 k)))))
(if (or (<= t -3e+93) (not (<= t 1e+45)))
(- (- (* b c) (* t (- (* a 4.0) (* (* x 18.0) (* y z))))) t_1)
(- (+ (* b c) (- (* x (* (* 18.0 y) (* z t))) (* t (* a 4.0)))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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)) + (j * (27.0 * k));
double tmp;
if ((t <= -3e+93) || !(t <= 1e+45)) {
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
} else {
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - (t * (a * 4.0)))) - 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.
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)) + (j * (27.0d0 * k))
if ((t <= (-3d+93)) .or. (.not. (t <= 1d+45))) then
tmp = ((b * c) - (t * ((a * 4.0d0) - ((x * 18.0d0) * (y * z))))) - t_1
else
tmp = ((b * c) + ((x * ((18.0d0 * y) * (z * t))) - (t * (a * 4.0d0)))) - 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;
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)) + (j * (27.0 * k));
double tmp;
if ((t <= -3e+93) || !(t <= 1e+45)) {
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
} else {
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - (t * (a * 4.0)))) - 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]) [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)) + (j * (27.0 * k)) tmp = 0 if (t <= -3e+93) or not (t <= 1e+45): tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1 else: tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - (t * (a * 4.0)))) - 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]) 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 * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k))) tmp = 0.0 if ((t <= -3e+93) || !(t <= 1e+45)) tmp = Float64(Float64(Float64(b * c) - Float64(t * Float64(Float64(a * 4.0) - Float64(Float64(x * 18.0) * Float64(y * z))))) - t_1); else tmp = Float64(Float64(Float64(b * c) + Float64(Float64(x * Float64(Float64(18.0 * y) * Float64(z * t))) - Float64(t * Float64(a * 4.0)))) - 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])){:}
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)) + (j * (27.0 * k));
tmp = 0.0;
if ((t <= -3e+93) || ~((t <= 1e+45)))
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
else
tmp = ((b * c) + ((x * ((18.0 * y) * (z * t))) - (t * (a * 4.0)))) - 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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t, -3e+93], N[Not[LessEqual[t, 1e+45]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(t * N[(N[(a * 4.0), $MachinePrecision] - N[(N[(x * 18.0), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(x * N[(N[(18.0 * y), $MachinePrecision] * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\\
\mathbf{if}\;t \leq -3 \cdot 10^{+93} \lor \neg \left(t \leq 10^{+45}\right):\\
\;\;\;\;\left(b \cdot c - t \cdot \left(a \cdot 4 - \left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot c + \left(x \cdot \left(\left(18 \cdot y\right) \cdot \left(z \cdot t\right)\right) - t \cdot \left(a \cdot 4\right)\right)\right) - t\_1\\
\end{array}
\end{array}
if t < -2.99999999999999978e93 or 9.9999999999999993e44 < t Initial program 85.6%
Simplified88.7%
if -2.99999999999999978e93 < t < 9.9999999999999993e44Initial program 86.4%
Simplified84.7%
associate-*r*86.4%
distribute-rgt-out--86.4%
associate-+l-86.4%
associate-*l*88.6%
fmm-def88.6%
associate-*l*88.6%
*-commutative88.6%
Applied egg-rr88.6%
fmm-undef88.6%
*-commutative88.6%
Simplified88.6%
associate--r-88.6%
associate-*l*94.4%
Applied egg-rr94.4%
Final simplification92.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (* a -4.0))))
(if (<= (* b c) -20500000000.0)
(* b c)
(if (<= (* b c) -7.8e-123)
t_1
(if (<= (* b c) 2.4e-268)
(* x (* 18.0 (* t (* y z))))
(if (<= (* b c) 0.48)
(* -4.0 (* x i))
(if (<= (* b c) 2.4e+92) t_1 (* b c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * (a * -4.0);
double tmp;
if ((b * c) <= -20500000000.0) {
tmp = b * c;
} else if ((b * c) <= -7.8e-123) {
tmp = t_1;
} else if ((b * c) <= 2.4e-268) {
tmp = x * (18.0 * (t * (y * z)));
} else if ((b * c) <= 0.48) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 2.4e+92) {
tmp = t_1;
} 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.
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))
if ((b * c) <= (-20500000000.0d0)) then
tmp = b * c
else if ((b * c) <= (-7.8d-123)) then
tmp = t_1
else if ((b * c) <= 2.4d-268) then
tmp = x * (18.0d0 * (t * (y * z)))
else if ((b * c) <= 0.48d0) then
tmp = (-4.0d0) * (x * i)
else if ((b * c) <= 2.4d+92) then
tmp = t_1
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;
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);
double tmp;
if ((b * c) <= -20500000000.0) {
tmp = b * c;
} else if ((b * c) <= -7.8e-123) {
tmp = t_1;
} else if ((b * c) <= 2.4e-268) {
tmp = x * (18.0 * (t * (y * z)));
} else if ((b * c) <= 0.48) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 2.4e+92) {
tmp = t_1;
} 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]) [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) tmp = 0 if (b * c) <= -20500000000.0: tmp = b * c elif (b * c) <= -7.8e-123: tmp = t_1 elif (b * c) <= 2.4e-268: tmp = x * (18.0 * (t * (y * z))) elif (b * c) <= 0.48: tmp = -4.0 * (x * i) elif (b * c) <= 2.4e+92: tmp = t_1 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(a * -4.0)) tmp = 0.0 if (Float64(b * c) <= -20500000000.0) tmp = Float64(b * c); elseif (Float64(b * c) <= -7.8e-123) tmp = t_1; elseif (Float64(b * c) <= 2.4e-268) tmp = Float64(x * Float64(18.0 * Float64(t * Float64(y * z)))); elseif (Float64(b * c) <= 0.48) tmp = Float64(-4.0 * Float64(x * i)); elseif (Float64(b * c) <= 2.4e+92) tmp = t_1; 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])){:}
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);
tmp = 0.0;
if ((b * c) <= -20500000000.0)
tmp = b * c;
elseif ((b * c) <= -7.8e-123)
tmp = t_1;
elseif ((b * c) <= 2.4e-268)
tmp = x * (18.0 * (t * (y * z)));
elseif ((b * c) <= 0.48)
tmp = -4.0 * (x * i);
elseif ((b * c) <= 2.4e+92)
tmp = t_1;
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -20500000000.0], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -7.8e-123], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.4e-268], N[(x * N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 0.48], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.4e+92], t$95$1, 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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right)\\
\mathbf{if}\;b \cdot c \leq -20500000000:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -7.8 \cdot 10^{-123}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \cdot c \leq 2.4 \cdot 10^{-268}:\\
\;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{elif}\;b \cdot c \leq 0.48:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 2.4 \cdot 10^{+92}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -2.05e10 or 2.40000000000000005e92 < (*.f64 b c) Initial program 82.2%
Simplified84.9%
associate-*r*84.0%
distribute-rgt-out--82.2%
associate-+l-82.2%
associate-*l*79.6%
fmm-def79.6%
associate-*l*79.7%
*-commutative79.7%
Applied egg-rr79.7%
fmm-undef79.7%
*-commutative79.7%
Simplified79.7%
Taylor expanded in b around inf 56.9%
if -2.05e10 < (*.f64 b c) < -7.79999999999999952e-123 or 0.47999999999999998 < (*.f64 b c) < 2.40000000000000005e92Initial program 90.0%
Simplified87.9%
associate-*r*89.9%
distribute-rgt-out--89.9%
associate-+l-89.9%
associate-*l*81.4%
fmm-def81.4%
associate-*l*81.4%
*-commutative81.4%
Applied egg-rr81.4%
fmm-undef81.4%
*-commutative81.4%
Simplified81.4%
Taylor expanded in x around 0 88.0%
associate-*r*88.0%
associate-*r*90.0%
Simplified90.0%
Taylor expanded in a around inf 40.5%
metadata-eval40.5%
distribute-lft-neg-in40.5%
*-commutative40.5%
*-commutative40.5%
associate-*l*40.5%
*-commutative40.5%
distribute-rgt-neg-in40.5%
distribute-lft-neg-in40.5%
metadata-eval40.5%
*-commutative40.5%
Simplified40.5%
if -7.79999999999999952e-123 < (*.f64 b c) < 2.3999999999999999e-268Initial program 86.1%
Simplified86.1%
Taylor expanded in x around inf 54.8%
Taylor expanded in t around inf 38.1%
if 2.3999999999999999e-268 < (*.f64 b c) < 0.47999999999999998Initial program 92.4%
Simplified87.9%
associate-*r*92.4%
distribute-rgt-out--92.4%
associate-+l-92.4%
associate-*l*87.6%
fmm-def87.6%
associate-*l*87.6%
*-commutative87.6%
Applied egg-rr87.6%
fmm-undef87.6%
*-commutative87.6%
Simplified87.6%
Taylor expanded in i around inf 41.5%
*-commutative41.5%
Simplified41.5%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (* a -4.0))))
(if (<= (* b c) -3700000000.0)
(* b c)
(if (<= (* b c) -3.3e-122)
t_1
(if (<= (* b c) 1.6e-270)
(* t (* x (* z (* 18.0 y))))
(if (<= (* b c) 0.0018)
(* -4.0 (* x i))
(if (<= (* b c) 7.6e+94) t_1 (* b c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * (a * -4.0);
double tmp;
if ((b * c) <= -3700000000.0) {
tmp = b * c;
} else if ((b * c) <= -3.3e-122) {
tmp = t_1;
} else if ((b * c) <= 1.6e-270) {
tmp = t * (x * (z * (18.0 * y)));
} else if ((b * c) <= 0.0018) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 7.6e+94) {
tmp = t_1;
} 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.
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))
if ((b * c) <= (-3700000000.0d0)) then
tmp = b * c
else if ((b * c) <= (-3.3d-122)) then
tmp = t_1
else if ((b * c) <= 1.6d-270) then
tmp = t * (x * (z * (18.0d0 * y)))
else if ((b * c) <= 0.0018d0) then
tmp = (-4.0d0) * (x * i)
else if ((b * c) <= 7.6d+94) then
tmp = t_1
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;
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);
double tmp;
if ((b * c) <= -3700000000.0) {
tmp = b * c;
} else if ((b * c) <= -3.3e-122) {
tmp = t_1;
} else if ((b * c) <= 1.6e-270) {
tmp = t * (x * (z * (18.0 * y)));
} else if ((b * c) <= 0.0018) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 7.6e+94) {
tmp = t_1;
} 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]) [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) tmp = 0 if (b * c) <= -3700000000.0: tmp = b * c elif (b * c) <= -3.3e-122: tmp = t_1 elif (b * c) <= 1.6e-270: tmp = t * (x * (z * (18.0 * y))) elif (b * c) <= 0.0018: tmp = -4.0 * (x * i) elif (b * c) <= 7.6e+94: tmp = t_1 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(a * -4.0)) tmp = 0.0 if (Float64(b * c) <= -3700000000.0) tmp = Float64(b * c); elseif (Float64(b * c) <= -3.3e-122) tmp = t_1; elseif (Float64(b * c) <= 1.6e-270) tmp = Float64(t * Float64(x * Float64(z * Float64(18.0 * y)))); elseif (Float64(b * c) <= 0.0018) tmp = Float64(-4.0 * Float64(x * i)); elseif (Float64(b * c) <= 7.6e+94) tmp = t_1; 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])){:}
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);
tmp = 0.0;
if ((b * c) <= -3700000000.0)
tmp = b * c;
elseif ((b * c) <= -3.3e-122)
tmp = t_1;
elseif ((b * c) <= 1.6e-270)
tmp = t * (x * (z * (18.0 * y)));
elseif ((b * c) <= 0.0018)
tmp = -4.0 * (x * i);
elseif ((b * c) <= 7.6e+94)
tmp = t_1;
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -3700000000.0], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -3.3e-122], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 1.6e-270], N[(t * N[(x * N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 0.0018], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 7.6e+94], t$95$1, 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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right)\\
\mathbf{if}\;b \cdot c \leq -3700000000:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -3.3 \cdot 10^{-122}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \cdot c \leq 1.6 \cdot 10^{-270}:\\
\;\;\;\;t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right)\right)\right)\\
\mathbf{elif}\;b \cdot c \leq 0.0018:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 7.6 \cdot 10^{+94}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -3.7e9 or 7.5999999999999993e94 < (*.f64 b c) Initial program 82.2%
Simplified84.9%
associate-*r*84.0%
distribute-rgt-out--82.2%
associate-+l-82.2%
associate-*l*79.6%
fmm-def79.6%
associate-*l*79.7%
*-commutative79.7%
Applied egg-rr79.7%
fmm-undef79.7%
*-commutative79.7%
Simplified79.7%
Taylor expanded in b around inf 56.9%
if -3.7e9 < (*.f64 b c) < -3.29999999999999999e-122 or 0.0018 < (*.f64 b c) < 7.5999999999999993e94Initial program 90.0%
Simplified87.9%
associate-*r*89.9%
distribute-rgt-out--89.9%
associate-+l-89.9%
associate-*l*81.4%
fmm-def81.4%
associate-*l*81.4%
*-commutative81.4%
Applied egg-rr81.4%
fmm-undef81.4%
*-commutative81.4%
Simplified81.4%
Taylor expanded in x around 0 88.0%
associate-*r*88.0%
associate-*r*90.0%
Simplified90.0%
Taylor expanded in a around inf 40.5%
metadata-eval40.5%
distribute-lft-neg-in40.5%
*-commutative40.5%
*-commutative40.5%
associate-*l*40.5%
*-commutative40.5%
distribute-rgt-neg-in40.5%
distribute-lft-neg-in40.5%
metadata-eval40.5%
*-commutative40.5%
Simplified40.5%
if -3.29999999999999999e-122 < (*.f64 b c) < 1.59999999999999994e-270Initial program 86.1%
Simplified86.1%
associate-*r*87.9%
distribute-rgt-out--86.1%
associate-+l-86.1%
associate-*l*85.8%
fmm-def85.8%
associate-*l*85.7%
*-commutative85.7%
Applied egg-rr85.7%
fmm-undef85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in t around inf 48.5%
Taylor expanded in x around inf 36.4%
*-commutative36.4%
associate-*l*36.4%
*-commutative36.4%
associate-*r*36.5%
Simplified36.5%
if 1.59999999999999994e-270 < (*.f64 b c) < 0.0018Initial program 92.4%
Simplified87.9%
associate-*r*92.4%
distribute-rgt-out--92.4%
associate-+l-92.4%
associate-*l*87.6%
fmm-def87.6%
associate-*l*87.6%
*-commutative87.6%
Applied egg-rr87.6%
fmm-undef87.6%
*-commutative87.6%
Simplified87.6%
Taylor expanded in i around inf 41.5%
*-commutative41.5%
Simplified41.5%
Final simplification47.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (* a -4.0))))
(if (<= (* b c) -560000000.0)
(* b c)
(if (<= (* b c) -4.65e-122)
t_1
(if (<= (* b c) 2.3e-268)
(* t (* 18.0 (* x (* y z))))
(if (<= (* b c) 0.00034)
(* -4.0 (* x i))
(if (<= (* b c) 9.5e+91) t_1 (* b c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * (a * -4.0);
double tmp;
if ((b * c) <= -560000000.0) {
tmp = b * c;
} else if ((b * c) <= -4.65e-122) {
tmp = t_1;
} else if ((b * c) <= 2.3e-268) {
tmp = t * (18.0 * (x * (y * z)));
} else if ((b * c) <= 0.00034) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 9.5e+91) {
tmp = t_1;
} 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.
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))
if ((b * c) <= (-560000000.0d0)) then
tmp = b * c
else if ((b * c) <= (-4.65d-122)) then
tmp = t_1
else if ((b * c) <= 2.3d-268) then
tmp = t * (18.0d0 * (x * (y * z)))
else if ((b * c) <= 0.00034d0) then
tmp = (-4.0d0) * (x * i)
else if ((b * c) <= 9.5d+91) then
tmp = t_1
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;
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);
double tmp;
if ((b * c) <= -560000000.0) {
tmp = b * c;
} else if ((b * c) <= -4.65e-122) {
tmp = t_1;
} else if ((b * c) <= 2.3e-268) {
tmp = t * (18.0 * (x * (y * z)));
} else if ((b * c) <= 0.00034) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 9.5e+91) {
tmp = t_1;
} 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]) [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) tmp = 0 if (b * c) <= -560000000.0: tmp = b * c elif (b * c) <= -4.65e-122: tmp = t_1 elif (b * c) <= 2.3e-268: tmp = t * (18.0 * (x * (y * z))) elif (b * c) <= 0.00034: tmp = -4.0 * (x * i) elif (b * c) <= 9.5e+91: tmp = t_1 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(a * -4.0)) tmp = 0.0 if (Float64(b * c) <= -560000000.0) tmp = Float64(b * c); elseif (Float64(b * c) <= -4.65e-122) tmp = t_1; elseif (Float64(b * c) <= 2.3e-268) tmp = Float64(t * Float64(18.0 * Float64(x * Float64(y * z)))); elseif (Float64(b * c) <= 0.00034) tmp = Float64(-4.0 * Float64(x * i)); elseif (Float64(b * c) <= 9.5e+91) tmp = t_1; 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])){:}
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);
tmp = 0.0;
if ((b * c) <= -560000000.0)
tmp = b * c;
elseif ((b * c) <= -4.65e-122)
tmp = t_1;
elseif ((b * c) <= 2.3e-268)
tmp = t * (18.0 * (x * (y * z)));
elseif ((b * c) <= 0.00034)
tmp = -4.0 * (x * i);
elseif ((b * c) <= 9.5e+91)
tmp = t_1;
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -560000000.0], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -4.65e-122], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 2.3e-268], N[(t * N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 0.00034], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 9.5e+91], t$95$1, 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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4\right)\\
\mathbf{if}\;b \cdot c \leq -560000000:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -4.65 \cdot 10^{-122}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \cdot c \leq 2.3 \cdot 10^{-268}:\\
\;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{elif}\;b \cdot c \leq 0.00034:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 9.5 \cdot 10^{+91}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -5.6e8 or 9.5000000000000001e91 < (*.f64 b c) Initial program 82.2%
Simplified84.9%
associate-*r*84.0%
distribute-rgt-out--82.2%
associate-+l-82.2%
associate-*l*79.6%
fmm-def79.6%
associate-*l*79.7%
*-commutative79.7%
Applied egg-rr79.7%
fmm-undef79.7%
*-commutative79.7%
Simplified79.7%
Taylor expanded in b around inf 56.9%
if -5.6e8 < (*.f64 b c) < -4.6499999999999998e-122 or 3.4e-4 < (*.f64 b c) < 9.5000000000000001e91Initial program 90.0%
Simplified87.9%
associate-*r*89.9%
distribute-rgt-out--89.9%
associate-+l-89.9%
associate-*l*81.4%
fmm-def81.4%
associate-*l*81.4%
*-commutative81.4%
Applied egg-rr81.4%
fmm-undef81.4%
*-commutative81.4%
Simplified81.4%
Taylor expanded in x around 0 88.0%
associate-*r*88.0%
associate-*r*90.0%
Simplified90.0%
Taylor expanded in a around inf 40.5%
metadata-eval40.5%
distribute-lft-neg-in40.5%
*-commutative40.5%
*-commutative40.5%
associate-*l*40.5%
*-commutative40.5%
distribute-rgt-neg-in40.5%
distribute-lft-neg-in40.5%
metadata-eval40.5%
*-commutative40.5%
Simplified40.5%
if -4.6499999999999998e-122 < (*.f64 b c) < 2.3000000000000001e-268Initial program 86.1%
Simplified86.1%
associate-*r*87.9%
distribute-rgt-out--86.1%
associate-+l-86.1%
associate-*l*85.8%
fmm-def85.8%
associate-*l*85.7%
*-commutative85.7%
Applied egg-rr85.7%
fmm-undef85.7%
*-commutative85.7%
Simplified85.7%
Taylor expanded in t around inf 48.5%
Taylor expanded in x around inf 36.4%
if 2.3000000000000001e-268 < (*.f64 b c) < 3.4e-4Initial program 92.4%
Simplified87.9%
associate-*r*92.4%
distribute-rgt-out--92.4%
associate-+l-92.4%
associate-*l*87.6%
fmm-def87.6%
associate-*l*87.6%
*-commutative87.6%
Applied egg-rr87.6%
fmm-undef87.6%
*-commutative87.6%
Simplified87.6%
Taylor expanded in i around inf 41.5%
*-commutative41.5%
Simplified41.5%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* j (* k -27.0)))
(t_2 (+ (* b c) t_1))
(t_3 (+ t_1 (* -4.0 (* t a)))))
(if (<= (* b c) -18000000000.0)
t_2
(if (<= (* b c) -1.52e-305)
t_3
(if (<= (* b c) 0.0031)
(+ t_1 (* -4.0 (* x i)))
(if (<= (* b c) 6.8e+85) t_3 t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = j * (k * -27.0);
double t_2 = (b * c) + t_1;
double t_3 = t_1 + (-4.0 * (t * a));
double tmp;
if ((b * c) <= -18000000000.0) {
tmp = t_2;
} else if ((b * c) <= -1.52e-305) {
tmp = t_3;
} else if ((b * c) <= 0.0031) {
tmp = t_1 + (-4.0 * (x * i));
} else if ((b * c) <= 6.8e+85) {
tmp = t_3;
} 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.
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) :: t_3
real(8) :: tmp
t_1 = j * (k * (-27.0d0))
t_2 = (b * c) + t_1
t_3 = t_1 + ((-4.0d0) * (t * a))
if ((b * c) <= (-18000000000.0d0)) then
tmp = t_2
else if ((b * c) <= (-1.52d-305)) then
tmp = t_3
else if ((b * c) <= 0.0031d0) then
tmp = t_1 + ((-4.0d0) * (x * i))
else if ((b * c) <= 6.8d+85) then
tmp = t_3
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;
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 * (k * -27.0);
double t_2 = (b * c) + t_1;
double t_3 = t_1 + (-4.0 * (t * a));
double tmp;
if ((b * c) <= -18000000000.0) {
tmp = t_2;
} else if ((b * c) <= -1.52e-305) {
tmp = t_3;
} else if ((b * c) <= 0.0031) {
tmp = t_1 + (-4.0 * (x * i));
} else if ((b * c) <= 6.8e+85) {
tmp = t_3;
} 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]) [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 * (k * -27.0) t_2 = (b * c) + t_1 t_3 = t_1 + (-4.0 * (t * a)) tmp = 0 if (b * c) <= -18000000000.0: tmp = t_2 elif (b * c) <= -1.52e-305: tmp = t_3 elif (b * c) <= 0.0031: tmp = t_1 + (-4.0 * (x * i)) elif (b * c) <= 6.8e+85: tmp = t_3 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(j * Float64(k * -27.0)) t_2 = Float64(Float64(b * c) + t_1) t_3 = Float64(t_1 + Float64(-4.0 * Float64(t * a))) tmp = 0.0 if (Float64(b * c) <= -18000000000.0) tmp = t_2; elseif (Float64(b * c) <= -1.52e-305) tmp = t_3; elseif (Float64(b * c) <= 0.0031) tmp = Float64(t_1 + Float64(-4.0 * Float64(x * i))); elseif (Float64(b * c) <= 6.8e+85) tmp = t_3; 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])){:}
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 * (k * -27.0);
t_2 = (b * c) + t_1;
t_3 = t_1 + (-4.0 * (t * a));
tmp = 0.0;
if ((b * c) <= -18000000000.0)
tmp = t_2;
elseif ((b * c) <= -1.52e-305)
tmp = t_3;
elseif ((b * c) <= 0.0031)
tmp = t_1 + (-4.0 * (x * i));
elseif ((b * c) <= 6.8e+85)
tmp = t_3;
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(t$95$1 + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -18000000000.0], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], -1.52e-305], t$95$3, If[LessEqual[N[(b * c), $MachinePrecision], 0.0031], N[(t$95$1 + N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 6.8e+85], t$95$3, 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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := j \cdot \left(k \cdot -27\right)\\
t_2 := b \cdot c + t\_1\\
t_3 := t\_1 + -4 \cdot \left(t \cdot a\right)\\
\mathbf{if}\;b \cdot c \leq -18000000000:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \cdot c \leq -1.52 \cdot 10^{-305}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;b \cdot c \leq 0.0031:\\
\;\;\;\;t\_1 + -4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 6.8 \cdot 10^{+85}:\\
\;\;\;\;t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 b c) < -1.8e10 or 6.8000000000000007e85 < (*.f64 b c) Initial program 82.4%
Simplified85.9%
Taylor expanded in b around inf 68.4%
if -1.8e10 < (*.f64 b c) < -1.52e-305 or 0.00309999999999999989 < (*.f64 b c) < 6.8000000000000007e85Initial program 87.5%
Simplified87.5%
Taylor expanded in a around inf 59.8%
*-commutative59.8%
Simplified59.8%
if -1.52e-305 < (*.f64 b c) < 0.00309999999999999989Initial program 90.6%
Simplified86.8%
Taylor expanded in i around inf 56.6%
Final simplification62.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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)) (* j (* 27.0 k)))))
(if (or (<= t -2.1e-60) (not (<= t 3.6e-239)))
(- (- (* b c) (* t (- (* a 4.0) (* (* x 18.0) (* y z))))) t_1)
(- (+ (* b c) (* (* z t) (* x (* 18.0 y)))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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)) + (j * (27.0 * k));
double tmp;
if ((t <= -2.1e-60) || !(t <= 3.6e-239)) {
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
} else {
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - 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.
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)) + (j * (27.0d0 * k))
if ((t <= (-2.1d-60)) .or. (.not. (t <= 3.6d-239))) then
tmp = ((b * c) - (t * ((a * 4.0d0) - ((x * 18.0d0) * (y * z))))) - t_1
else
tmp = ((b * c) + ((z * t) * (x * (18.0d0 * y)))) - 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;
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)) + (j * (27.0 * k));
double tmp;
if ((t <= -2.1e-60) || !(t <= 3.6e-239)) {
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
} else {
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - 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]) [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)) + (j * (27.0 * k)) tmp = 0 if (t <= -2.1e-60) or not (t <= 3.6e-239): tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1 else: tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - 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]) 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 * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k))) tmp = 0.0 if ((t <= -2.1e-60) || !(t <= 3.6e-239)) tmp = Float64(Float64(Float64(b * c) - Float64(t * Float64(Float64(a * 4.0) - Float64(Float64(x * 18.0) * Float64(y * z))))) - t_1); else tmp = Float64(Float64(Float64(b * c) + Float64(Float64(z * t) * Float64(x * Float64(18.0 * y)))) - 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])){:}
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)) + (j * (27.0 * k));
tmp = 0.0;
if ((t <= -2.1e-60) || ~((t <= 3.6e-239)))
tmp = ((b * c) - (t * ((a * 4.0) - ((x * 18.0) * (y * z))))) - t_1;
else
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - 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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t, -2.1e-60], N[Not[LessEqual[t, 3.6e-239]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(t * N[(N[(a * 4.0), $MachinePrecision] - N[(N[(x * 18.0), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\\
\mathbf{if}\;t \leq -2.1 \cdot 10^{-60} \lor \neg \left(t \leq 3.6 \cdot 10^{-239}\right):\\
\;\;\;\;\left(b \cdot c - t \cdot \left(a \cdot 4 - \left(x \cdot 18\right) \cdot \left(y \cdot z\right)\right)\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot c + \left(z \cdot t\right) \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right) - t\_1\\
\end{array}
\end{array}
if t < -2.09999999999999991e-60 or 3.6000000000000001e-239 < t Initial program 88.6%
Simplified90.8%
if -2.09999999999999991e-60 < t < 3.6000000000000001e-239Initial program 79.8%
Simplified74.8%
associate-*r*79.9%
distribute-rgt-out--79.9%
associate-+l-79.9%
associate-*l*84.8%
fmm-def84.8%
associate-*l*84.8%
*-commutative84.8%
Applied egg-rr84.8%
fmm-undef84.8%
*-commutative84.8%
Simplified84.8%
Taylor expanded in t around 0 82.2%
neg-mul-182.2%
*-commutative82.2%
distribute-rgt-neg-in82.2%
Simplified82.2%
Final simplification88.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (or (<= (* a 4.0) -1e-21) (not (<= (* a 4.0) 1e-111)))
(- (- (* b c) (* 4.0 (+ (* t a) (* x i)))) (* (* j 27.0) k))
(-
(+ (* b c) (* (* z t) (* x (* 18.0 y))))
(+ (* x (* 4.0 i)) (* j (* 27.0 k))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 (((a * 4.0) <= -1e-21) || !((a * 4.0) <= 1e-111)) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
} else {
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (((a * 4.0d0) <= (-1d-21)) .or. (.not. ((a * 4.0d0) <= 1d-111))) then
tmp = ((b * c) - (4.0d0 * ((t * a) + (x * i)))) - ((j * 27.0d0) * k)
else
tmp = ((b * c) + ((z * t) * (x * (18.0d0 * y)))) - ((x * (4.0d0 * i)) + (j * (27.0d0 * k)))
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;
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 (((a * 4.0) <= -1e-21) || !((a * 4.0) <= 1e-111)) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
} else {
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 ((a * 4.0) <= -1e-21) or not ((a * 4.0) <= 1e-111): tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k) else: tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - ((x * (4.0 * i)) + (j * (27.0 * k))) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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(a * 4.0) <= -1e-21) || !(Float64(a * 4.0) <= 1e-111)) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(Float64(t * a) + Float64(x * i)))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(Float64(Float64(b * c) + Float64(Float64(z * t) * Float64(x * Float64(18.0 * y)))) - Float64(Float64(x * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k)))); 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])){:}
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 (((a * 4.0) <= -1e-21) || ~(((a * 4.0) <= 1e-111)))
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
else
tmp = ((b * c) + ((z * t) * (x * (18.0 * y)))) - ((x * (4.0 * i)) + (j * (27.0 * k)));
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. 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[Or[LessEqual[N[(a * 4.0), $MachinePrecision], -1e-21], N[Not[LessEqual[N[(a * 4.0), $MachinePrecision], 1e-111]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $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])\\\\
[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}\;a \cdot 4 \leq -1 \cdot 10^{-21} \lor \neg \left(a \cdot 4 \leq 10^{-111}\right):\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a + x \cdot i\right)\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot c + \left(z \cdot t\right) \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)\\
\end{array}
\end{array}
if (*.f64 a #s(literal 4 binary64)) < -9.99999999999999908e-22 or 1.00000000000000009e-111 < (*.f64 a #s(literal 4 binary64)) Initial program 86.7%
Taylor expanded in y around 0 86.2%
distribute-lft-out86.2%
*-commutative86.2%
Simplified86.2%
if -9.99999999999999908e-22 < (*.f64 a #s(literal 4 binary64)) < 1.00000000000000009e-111Initial program 85.3%
Simplified83.7%
associate-*r*85.3%
distribute-rgt-out--85.3%
associate-+l-85.3%
associate-*l*83.5%
fmm-def83.5%
associate-*l*83.5%
*-commutative83.5%
Applied egg-rr83.5%
fmm-undef83.5%
*-commutative83.5%
Simplified83.5%
Taylor expanded in t around 0 82.7%
neg-mul-182.7%
*-commutative82.7%
distribute-rgt-neg-in82.7%
Simplified82.7%
Final simplification84.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (- (- (* b c) (* 4.0 (* t a))) t_1)))
(if (<= t -1.36e+94)
(* t (- (* a (- 4.0)) (* (* z (* x y)) -18.0)))
(if (<= t -2.8e-54)
t_2
(if (<= t 8.5e-113)
(- (- (* b c) (* 4.0 (* x i))) t_1)
(if (<= t 5.2e+175)
t_2
(* x (+ (* (* 18.0 t) (* y z)) (* i -4.0)))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 = ((b * c) - (4.0 * (t * a))) - t_1;
double tmp;
if (t <= -1.36e+94) {
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
} else if (t <= -2.8e-54) {
tmp = t_2;
} else if (t <= 8.5e-113) {
tmp = ((b * c) - (4.0 * (x * i))) - t_1;
} else if (t <= 5.2e+175) {
tmp = t_2;
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -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.
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 = ((b * c) - (4.0d0 * (t * a))) - t_1
if (t <= (-1.36d+94)) then
tmp = t * ((a * -4.0d0) - ((z * (x * y)) * (-18.0d0)))
else if (t <= (-2.8d-54)) then
tmp = t_2
else if (t <= 8.5d-113) then
tmp = ((b * c) - (4.0d0 * (x * i))) - t_1
else if (t <= 5.2d+175) then
tmp = t_2
else
tmp = x * (((18.0d0 * t) * (y * z)) + (i * (-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;
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 = ((b * c) - (4.0 * (t * a))) - t_1;
double tmp;
if (t <= -1.36e+94) {
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
} else if (t <= -2.8e-54) {
tmp = t_2;
} else if (t <= 8.5e-113) {
tmp = ((b * c) - (4.0 * (x * i))) - t_1;
} else if (t <= 5.2e+175) {
tmp = t_2;
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) [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 = ((b * c) - (4.0 * (t * a))) - t_1 tmp = 0 if t <= -1.36e+94: tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0)) elif t <= -2.8e-54: tmp = t_2 elif t <= 8.5e-113: tmp = ((b * c) - (4.0 * (x * i))) - t_1 elif t <= 5.2e+175: tmp = t_2 else: tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) 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(Float64(b * c) - Float64(4.0 * Float64(t * a))) - t_1) tmp = 0.0 if (t <= -1.36e+94) tmp = Float64(t * Float64(Float64(a * Float64(-4.0)) - Float64(Float64(z * Float64(x * y)) * -18.0))); elseif (t <= -2.8e-54) tmp = t_2; elseif (t <= 8.5e-113) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(x * i))) - t_1); elseif (t <= 5.2e+175) tmp = t_2; else tmp = Float64(x * Float64(Float64(Float64(18.0 * t) * Float64(y * z)) + Float64(i * -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])){:}
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 = ((b * c) - (4.0 * (t * a))) - t_1;
tmp = 0.0;
if (t <= -1.36e+94)
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
elseif (t <= -2.8e-54)
tmp = t_2;
elseif (t <= 8.5e-113)
tmp = ((b * c) - (4.0 * (x * i))) - t_1;
elseif (t <= 5.2e+175)
tmp = t_2;
else
tmp = x * (((18.0 * t) * (y * z)) + (i * -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.
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[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t, -1.36e+94], N[(t * N[(N[(a * (-4.0)), $MachinePrecision] - N[(N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -2.8e-54], t$95$2, If[LessEqual[t, 8.5e-113], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t, 5.2e+175], t$95$2, N[(x * N[(N[(N[(18.0 * t), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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 := \left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - t\_1\\
\mathbf{if}\;t \leq -1.36 \cdot 10^{+94}:\\
\;\;\;\;t \cdot \left(a \cdot \left(-4\right) - \left(z \cdot \left(x \cdot y\right)\right) \cdot -18\right)\\
\mathbf{elif}\;t \leq -2.8 \cdot 10^{-54}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t \leq 8.5 \cdot 10^{-113}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(x \cdot i\right)\right) - t\_1\\
\mathbf{elif}\;t \leq 5.2 \cdot 10^{+175}:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(18 \cdot t\right) \cdot \left(y \cdot z\right) + i \cdot -4\right)\\
\end{array}
\end{array}
if t < -1.36e94Initial program 83.9%
Simplified90.8%
associate-*r*90.8%
distribute-rgt-out--83.9%
associate-+l-83.9%
associate-*l*64.3%
fmm-def64.3%
associate-*l*64.3%
*-commutative64.3%
Applied egg-rr64.3%
fmm-undef64.3%
*-commutative64.3%
Simplified64.3%
Taylor expanded in t around -inf 77.5%
associate-*r*77.5%
neg-mul-177.5%
cancel-sign-sub-inv77.5%
*-commutative77.5%
associate-*r*77.5%
metadata-eval77.5%
*-commutative77.5%
Simplified77.5%
if -1.36e94 < t < -2.8000000000000002e-54 or 8.4999999999999995e-113 < t < 5.2000000000000001e175Initial program 93.4%
Taylor expanded in x around 0 78.9%
if -2.8000000000000002e-54 < t < 8.4999999999999995e-113Initial program 79.5%
Taylor expanded in t around 0 76.5%
if 5.2000000000000001e175 < t Initial program 88.4%
Simplified88.5%
associate-*r*88.5%
distribute-rgt-out--88.5%
associate-+l-88.5%
associate-*l*88.5%
fmm-def88.5%
associate-*l*88.5%
*-commutative88.5%
Applied egg-rr88.5%
fmm-undef88.5%
*-commutative88.5%
Simplified88.5%
Taylor expanded in x around inf 77.6%
associate-*r*77.6%
cancel-sign-sub-inv77.6%
*-commutative77.6%
metadata-eval77.6%
Simplified77.6%
Final simplification77.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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
(+ (* t (+ (* a -4.0) (* 18.0 (* x (* y z))))) (* j (* k -27.0)))))
(if (<= t -7.2e+93)
t_2
(if (<= t -3.8e-55)
(- (- (* b c) (* 4.0 (* t a))) t_1)
(if (<= t 1.75e+44) (- (- (* b c) (* 4.0 (* x i))) t_1) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0));
double tmp;
if (t <= -7.2e+93) {
tmp = t_2;
} else if (t <= -3.8e-55) {
tmp = ((b * c) - (4.0 * (t * a))) - t_1;
} else if (t <= 1.75e+44) {
tmp = ((b * c) - (4.0 * (x * i))) - 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.
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 = (t * ((a * (-4.0d0)) + (18.0d0 * (x * (y * z))))) + (j * (k * (-27.0d0)))
if (t <= (-7.2d+93)) then
tmp = t_2
else if (t <= (-3.8d-55)) then
tmp = ((b * c) - (4.0d0 * (t * a))) - t_1
else if (t <= 1.75d+44) then
tmp = ((b * c) - (4.0d0 * (x * i))) - 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;
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 = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0));
double tmp;
if (t <= -7.2e+93) {
tmp = t_2;
} else if (t <= -3.8e-55) {
tmp = ((b * c) - (4.0 * (t * a))) - t_1;
} else if (t <= 1.75e+44) {
tmp = ((b * c) - (4.0 * (x * i))) - 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]) [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 = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0)) tmp = 0 if t <= -7.2e+93: tmp = t_2 elif t <= -3.8e-55: tmp = ((b * c) - (4.0 * (t * a))) - t_1 elif t <= 1.75e+44: tmp = ((b * c) - (4.0 * (x * i))) - 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]) 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(t * Float64(Float64(a * -4.0) + Float64(18.0 * Float64(x * Float64(y * z))))) + Float64(j * Float64(k * -27.0))) tmp = 0.0 if (t <= -7.2e+93) tmp = t_2; elseif (t <= -3.8e-55) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - t_1); elseif (t <= 1.75e+44) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(x * i))) - 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])){:}
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 = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0));
tmp = 0.0;
if (t <= -7.2e+93)
tmp = t_2;
elseif (t <= -3.8e-55)
tmp = ((b * c) - (4.0 * (t * a))) - t_1;
elseif (t <= 1.75e+44)
tmp = ((b * c) - (4.0 * (x * i))) - 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.
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[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -7.2e+93], t$95$2, If[LessEqual[t, -3.8e-55], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t, 1.75e+44], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(x * i), $MachinePrecision]), $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])\\\\
[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 := t \cdot \left(a \cdot -4 + 18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\right) + j \cdot \left(k \cdot -27\right)\\
\mathbf{if}\;t \leq -7.2 \cdot 10^{+93}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t \leq -3.8 \cdot 10^{-55}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - t\_1\\
\mathbf{elif}\;t \leq 1.75 \cdot 10^{+44}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(x \cdot i\right)\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if t < -7.1999999999999998e93 or 1.75e44 < t Initial program 84.9%
Simplified88.0%
Taylor expanded in t around inf 79.7%
if -7.1999999999999998e93 < t < -3.7999999999999997e-55Initial program 100.0%
Taylor expanded in x around 0 80.3%
if -3.7999999999999997e-55 < t < 1.75e44Initial program 83.1%
Taylor expanded in t around 0 77.3%
Final simplification78.6%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= (* b c) -1.2e+163)
(* b c)
(if (<= (* b c) -6e-308)
(* j (* k -27.0))
(if (<= (* b c) 4.1e-17)
(* -4.0 (* x i))
(if (<= (* b c) 8.2e+97) (* t (* a -4.0)) (* b c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.2e+163) {
tmp = b * c;
} else if ((b * c) <= -6e-308) {
tmp = j * (k * -27.0);
} else if ((b * c) <= 4.1e-17) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 8.2e+97) {
tmp = t * (a * -4.0);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-1.2d+163)) then
tmp = b * c
else if ((b * c) <= (-6d-308)) then
tmp = j * (k * (-27.0d0))
else if ((b * c) <= 4.1d-17) then
tmp = (-4.0d0) * (x * i)
else if ((b * c) <= 8.2d+97) then
tmp = t * (a * (-4.0d0))
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.2e+163) {
tmp = b * c;
} else if ((b * c) <= -6e-308) {
tmp = j * (k * -27.0);
} else if ((b * c) <= 4.1e-17) {
tmp = -4.0 * (x * i);
} else if ((b * c) <= 8.2e+97) {
tmp = t * (a * -4.0);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -1.2e+163: tmp = b * c elif (b * c) <= -6e-308: tmp = j * (k * -27.0) elif (b * c) <= 4.1e-17: tmp = -4.0 * (x * i) elif (b * c) <= 8.2e+97: tmp = t * (a * -4.0) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -1.2e+163) tmp = Float64(b * c); elseif (Float64(b * c) <= -6e-308) tmp = Float64(j * Float64(k * -27.0)); elseif (Float64(b * c) <= 4.1e-17) tmp = Float64(-4.0 * Float64(x * i)); elseif (Float64(b * c) <= 8.2e+97) tmp = Float64(t * Float64(a * -4.0)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -1.2e+163)
tmp = b * c;
elseif ((b * c) <= -6e-308)
tmp = j * (k * -27.0);
elseif ((b * c) <= 4.1e-17)
tmp = -4.0 * (x * i);
elseif ((b * c) <= 8.2e+97)
tmp = t * (a * -4.0);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -1.2e+163], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -6e-308], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 4.1e-17], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 8.2e+97], N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -1.2 \cdot 10^{+163}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -6 \cdot 10^{-308}:\\
\;\;\;\;j \cdot \left(k \cdot -27\right)\\
\mathbf{elif}\;b \cdot c \leq 4.1 \cdot 10^{-17}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 8.2 \cdot 10^{+97}:\\
\;\;\;\;t \cdot \left(a \cdot -4\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.1999999999999999e163 or 8.19999999999999977e97 < (*.f64 b c) Initial program 82.6%
Simplified82.7%
associate-*r*83.7%
distribute-rgt-out--82.6%
associate-+l-82.6%
associate-*l*78.1%
fmm-def78.1%
associate-*l*78.1%
*-commutative78.1%
Applied egg-rr78.1%
fmm-undef78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in b around inf 65.7%
if -1.1999999999999999e163 < (*.f64 b c) < -6.00000000000000044e-308Initial program 83.3%
Simplified87.2%
associate-*r*85.9%
distribute-rgt-out--83.3%
associate-+l-83.3%
associate-*l*82.8%
fmm-def82.8%
associate-*l*82.8%
*-commutative82.8%
Applied egg-rr82.8%
fmm-undef82.8%
*-commutative82.8%
Simplified82.8%
Taylor expanded in x around 0 84.6%
associate-*r*84.6%
associate-*r*83.3%
Simplified83.3%
Taylor expanded in j around inf 31.8%
*-commutative31.8%
associate-*r*31.8%
Simplified31.8%
if -6.00000000000000044e-308 < (*.f64 b c) < 4.1000000000000001e-17Initial program 90.4%
Simplified86.5%
associate-*r*90.4%
distribute-rgt-out--90.4%
associate-+l-90.4%
associate-*l*87.6%
fmm-def87.6%
associate-*l*87.6%
*-commutative87.6%
Applied egg-rr87.6%
fmm-undef87.6%
*-commutative87.6%
Simplified87.6%
Taylor expanded in i around inf 35.5%
*-commutative35.5%
Simplified35.5%
if 4.1000000000000001e-17 < (*.f64 b c) < 8.19999999999999977e97Initial program 95.5%
Simplified95.4%
associate-*r*95.5%
distribute-rgt-out--95.5%
associate-+l-95.5%
associate-*l*82.2%
fmm-def82.2%
associate-*l*82.2%
*-commutative82.2%
Applied egg-rr82.2%
fmm-undef82.2%
*-commutative82.2%
Simplified82.2%
Taylor expanded in x around 0 95.5%
associate-*r*95.6%
associate-*r*95.5%
Simplified95.5%
Taylor expanded in a around inf 43.0%
metadata-eval43.0%
distribute-lft-neg-in43.0%
*-commutative43.0%
*-commutative43.0%
associate-*l*43.0%
*-commutative43.0%
distribute-rgt-neg-in43.0%
distribute-lft-neg-in43.0%
metadata-eval43.0%
*-commutative43.0%
Simplified43.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= (* b c) -7.2e-14) (not (<= (* b c) 4.6e+101))) (- (- (* b c) (* 4.0 (* t a))) (* (* j 27.0) k)) (- (* a (* t -4.0)) (+ (* x (* 4.0 i)) (* j (* 27.0 k))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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) <= -7.2e-14) || !((b * c) <= 4.6e+101)) {
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = (a * (t * -4.0)) - ((x * (4.0 * i)) + (j * (27.0 * k)));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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) <= (-7.2d-14)) .or. (.not. ((b * c) <= 4.6d+101))) then
tmp = ((b * c) - (4.0d0 * (t * a))) - ((j * 27.0d0) * k)
else
tmp = (a * (t * (-4.0d0))) - ((x * (4.0d0 * i)) + (j * (27.0d0 * k)))
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;
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) <= -7.2e-14) || !((b * c) <= 4.6e+101)) {
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = (a * (t * -4.0)) - ((x * (4.0 * i)) + (j * (27.0 * k)));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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) <= -7.2e-14) or not ((b * c) <= 4.6e+101): tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k) else: tmp = (a * (t * -4.0)) - ((x * (4.0 * i)) + (j * (27.0 * k))) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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) <= -7.2e-14) || !(Float64(b * c) <= 4.6e+101)) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(Float64(a * Float64(t * -4.0)) - Float64(Float64(x * Float64(4.0 * i)) + Float64(j * Float64(27.0 * k)))); 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])){:}
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) <= -7.2e-14) || ~(((b * c) <= 4.6e+101)))
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
else
tmp = (a * (t * -4.0)) - ((x * (4.0 * i)) + (j * (27.0 * k)));
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. 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[Or[LessEqual[N[(b * c), $MachinePrecision], -7.2e-14], N[Not[LessEqual[N[(b * c), $MachinePrecision], 4.6e+101]], $MachinePrecision]], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(t * -4.0), $MachinePrecision]), $MachinePrecision] - N[(N[(x * N[(4.0 * i), $MachinePrecision]), $MachinePrecision] + N[(j * N[(27.0 * k), $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])\\\\
[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 -7.2 \cdot 10^{-14} \lor \neg \left(b \cdot c \leq 4.6 \cdot 10^{+101}\right):\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(t \cdot -4\right) - \left(x \cdot \left(4 \cdot i\right) + j \cdot \left(27 \cdot k\right)\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -7.1999999999999996e-14 or 4.6000000000000003e101 < (*.f64 b c) Initial program 83.7%
Taylor expanded in x around 0 81.3%
if -7.1999999999999996e-14 < (*.f64 b c) < 4.6000000000000003e101Initial program 88.1%
Simplified86.8%
associate-*r*88.8%
distribute-rgt-out--88.1%
associate-+l-88.1%
associate-*l*83.7%
fmm-def83.7%
associate-*l*83.6%
*-commutative83.6%
Applied egg-rr83.6%
fmm-undef83.6%
*-commutative83.6%
Simplified83.6%
Taylor expanded in a around inf 83.6%
+-commutative83.6%
mul-1-neg83.6%
unsub-neg83.6%
*-commutative83.6%
associate-/l*80.9%
Simplified80.9%
Taylor expanded in a around inf 71.0%
*-commutative71.0%
associate-*r*71.0%
Simplified71.0%
Final simplification75.6%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* j (* k -27.0))) (t_2 (+ (* b c) t_1)))
(if (<= (* b c) -1.5e-22)
t_2
(if (<= (* b c) 1.7e+15)
(+ t_1 (* -4.0 (* x i)))
(if (<= (* b c) 6.2e+43) (* t (* a -4.0)) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = j * (k * -27.0);
double t_2 = (b * c) + t_1;
double tmp;
if ((b * c) <= -1.5e-22) {
tmp = t_2;
} else if ((b * c) <= 1.7e+15) {
tmp = t_1 + (-4.0 * (x * i));
} else if ((b * c) <= 6.2e+43) {
tmp = t * (a * -4.0);
} 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.
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 * (k * (-27.0d0))
t_2 = (b * c) + t_1
if ((b * c) <= (-1.5d-22)) then
tmp = t_2
else if ((b * c) <= 1.7d+15) then
tmp = t_1 + ((-4.0d0) * (x * i))
else if ((b * c) <= 6.2d+43) then
tmp = t * (a * (-4.0d0))
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;
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 * (k * -27.0);
double t_2 = (b * c) + t_1;
double tmp;
if ((b * c) <= -1.5e-22) {
tmp = t_2;
} else if ((b * c) <= 1.7e+15) {
tmp = t_1 + (-4.0 * (x * i));
} else if ((b * c) <= 6.2e+43) {
tmp = t * (a * -4.0);
} 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]) [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 * (k * -27.0) t_2 = (b * c) + t_1 tmp = 0 if (b * c) <= -1.5e-22: tmp = t_2 elif (b * c) <= 1.7e+15: tmp = t_1 + (-4.0 * (x * i)) elif (b * c) <= 6.2e+43: tmp = t * (a * -4.0) 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(j * Float64(k * -27.0)) t_2 = Float64(Float64(b * c) + t_1) tmp = 0.0 if (Float64(b * c) <= -1.5e-22) tmp = t_2; elseif (Float64(b * c) <= 1.7e+15) tmp = Float64(t_1 + Float64(-4.0 * Float64(x * i))); elseif (Float64(b * c) <= 6.2e+43) tmp = Float64(t * Float64(a * -4.0)); 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])){:}
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 * (k * -27.0);
t_2 = (b * c) + t_1;
tmp = 0.0;
if ((b * c) <= -1.5e-22)
tmp = t_2;
elseif ((b * c) <= 1.7e+15)
tmp = t_1 + (-4.0 * (x * i));
elseif ((b * c) <= 6.2e+43)
tmp = t * (a * -4.0);
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.5e-22], t$95$2, If[LessEqual[N[(b * c), $MachinePrecision], 1.7e+15], N[(t$95$1 + N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 6.2e+43], N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := j \cdot \left(k \cdot -27\right)\\
t_2 := b \cdot c + t\_1\\
\mathbf{if}\;b \cdot c \leq -1.5 \cdot 10^{-22}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;b \cdot c \leq 1.7 \cdot 10^{+15}:\\
\;\;\;\;t\_1 + -4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;b \cdot c \leq 6.2 \cdot 10^{+43}:\\
\;\;\;\;t \cdot \left(a \cdot -4\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 b c) < -1.5e-22 or 6.2000000000000003e43 < (*.f64 b c) Initial program 84.0%
Simplified86.3%
Taylor expanded in b around inf 66.0%
if -1.5e-22 < (*.f64 b c) < 1.7e15Initial program 88.3%
Simplified86.8%
Taylor expanded in i around inf 52.8%
if 1.7e15 < (*.f64 b c) < 6.2000000000000003e43Initial program 88.1%
Simplified87.9%
associate-*r*88.1%
distribute-rgt-out--88.1%
associate-+l-88.1%
associate-*l*75.6%
fmm-def75.6%
associate-*l*75.6%
*-commutative75.6%
Applied egg-rr75.6%
fmm-undef75.6%
*-commutative75.6%
Simplified75.6%
Taylor expanded in x around 0 88.1%
associate-*r*88.1%
associate-*r*87.9%
Simplified87.9%
Taylor expanded in a around inf 64.3%
metadata-eval64.3%
distribute-lft-neg-in64.3%
*-commutative64.3%
*-commutative64.3%
associate-*l*64.3%
*-commutative64.3%
distribute-rgt-neg-in64.3%
distribute-lft-neg-in64.3%
metadata-eval64.3%
*-commutative64.3%
Simplified64.3%
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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* j 27.0) k)))
(if (<= t -9.8e+178)
(- (* t (* x (+ (* z (* 18.0 y)) (* -4.0 (/ a x))))) t_1)
(if (<= t 2.95e+106)
(- (- (* b c) (* 4.0 (+ (* t a) (* x i)))) t_1)
(+ (* t (+ (* a -4.0) (* 18.0 (* x (* y z))))) (* j (* k -27.0)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double tmp;
if (t <= -9.8e+178) {
tmp = (t * (x * ((z * (18.0 * y)) + (-4.0 * (a / x))))) - t_1;
} else if (t <= 2.95e+106) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - t_1;
} else {
tmp = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.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.
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 = (j * 27.0d0) * k
if (t <= (-9.8d+178)) then
tmp = (t * (x * ((z * (18.0d0 * y)) + ((-4.0d0) * (a / x))))) - t_1
else if (t <= 2.95d+106) then
tmp = ((b * c) - (4.0d0 * ((t * a) + (x * i)))) - t_1
else
tmp = (t * ((a * (-4.0d0)) + (18.0d0 * (x * (y * z))))) + (j * (k * (-27.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;
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 tmp;
if (t <= -9.8e+178) {
tmp = (t * (x * ((z * (18.0 * y)) + (-4.0 * (a / x))))) - t_1;
} else if (t <= 2.95e+106) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - t_1;
} else {
tmp = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 tmp = 0 if t <= -9.8e+178: tmp = (t * (x * ((z * (18.0 * y)) + (-4.0 * (a / x))))) - t_1 elif t <= 2.95e+106: tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - t_1 else: tmp = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (t <= -9.8e+178) tmp = Float64(Float64(t * Float64(x * Float64(Float64(z * Float64(18.0 * y)) + Float64(-4.0 * Float64(a / x))))) - t_1); elseif (t <= 2.95e+106) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(Float64(t * a) + Float64(x * i)))) - t_1); else tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(18.0 * Float64(x * Float64(y * z))))) + Float64(j * Float64(k * -27.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])){:}
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;
tmp = 0.0;
if (t <= -9.8e+178)
tmp = (t * (x * ((z * (18.0 * y)) + (-4.0 * (a / x))))) - t_1;
elseif (t <= 2.95e+106)
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - t_1;
else
tmp = (t * ((a * -4.0) + (18.0 * (x * (y * z))))) + (j * (k * -27.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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t, -9.8e+178], N[(N[(t * N[(x * N[(N[(z * N[(18.0 * y), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(a / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t, 2.95e+106], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t \leq -9.8 \cdot 10^{+178}:\\
\;\;\;\;t \cdot \left(x \cdot \left(z \cdot \left(18 \cdot y\right) + -4 \cdot \frac{a}{x}\right)\right) - t\_1\\
\mathbf{elif}\;t \leq 2.95 \cdot 10^{+106}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a + x \cdot i\right)\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + 18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\right) + j \cdot \left(k \cdot -27\right)\\
\end{array}
\end{array}
if t < -9.8000000000000003e178Initial program 78.4%
Taylor expanded in x around inf 62.2%
Taylor expanded in t around inf 89.2%
cancel-sign-sub-inv89.2%
metadata-eval89.2%
associate-*r*89.2%
Simplified89.2%
if -9.8000000000000003e178 < t < 2.95000000000000014e106Initial program 86.8%
Taylor expanded in y around 0 84.3%
distribute-lft-out84.3%
*-commutative84.3%
Simplified84.3%
if 2.95000000000000014e106 < t Initial program 88.2%
Simplified88.2%
Taylor expanded in t around inf 80.3%
Final simplification84.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (* 18.0 (* x (* y z)))))
(if (<= t -1.2e+180)
(* t (- t_1 (* a 4.0)))
(if (<= t 1.12e+107)
(- (- (* b c) (* 4.0 (+ (* t a) (* x i)))) (* (* j 27.0) k))
(+ (* t (+ (* a -4.0) t_1)) (* j (* k -27.0)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 = 18.0 * (x * (y * z));
double tmp;
if (t <= -1.2e+180) {
tmp = t * (t_1 - (a * 4.0));
} else if (t <= 1.12e+107) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
} else {
tmp = (t * ((a * -4.0) + t_1)) + (j * (k * -27.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.
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 = 18.0d0 * (x * (y * z))
if (t <= (-1.2d+180)) then
tmp = t * (t_1 - (a * 4.0d0))
else if (t <= 1.12d+107) then
tmp = ((b * c) - (4.0d0 * ((t * a) + (x * i)))) - ((j * 27.0d0) * k)
else
tmp = (t * ((a * (-4.0d0)) + t_1)) + (j * (k * (-27.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;
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 = 18.0 * (x * (y * z));
double tmp;
if (t <= -1.2e+180) {
tmp = t * (t_1 - (a * 4.0));
} else if (t <= 1.12e+107) {
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
} else {
tmp = (t * ((a * -4.0) + t_1)) + (j * (k * -27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 = 18.0 * (x * (y * z)) tmp = 0 if t <= -1.2e+180: tmp = t * (t_1 - (a * 4.0)) elif t <= 1.12e+107: tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k) else: tmp = (t * ((a * -4.0) + t_1)) + (j * (k * -27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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(18.0 * Float64(x * Float64(y * z))) tmp = 0.0 if (t <= -1.2e+180) tmp = Float64(t * Float64(t_1 - Float64(a * 4.0))); elseif (t <= 1.12e+107) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(Float64(t * a) + Float64(x * i)))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + t_1)) + Float64(j * Float64(k * -27.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])){:}
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 = 18.0 * (x * (y * z));
tmp = 0.0;
if (t <= -1.2e+180)
tmp = t * (t_1 - (a * 4.0));
elseif (t <= 1.12e+107)
tmp = ((b * c) - (4.0 * ((t * a) + (x * i)))) - ((j * 27.0) * k);
else
tmp = (t * ((a * -4.0) + t_1)) + (j * (k * -27.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.
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[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.2e+180], N[(t * N[(t$95$1 - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.12e+107], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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 := 18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\\
\mathbf{if}\;t \leq -1.2 \cdot 10^{+180}:\\
\;\;\;\;t \cdot \left(t\_1 - a \cdot 4\right)\\
\mathbf{elif}\;t \leq 1.12 \cdot 10^{+107}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a + x \cdot i\right)\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + t\_1\right) + j \cdot \left(k \cdot -27\right)\\
\end{array}
\end{array}
if t < -1.1999999999999999e180Initial program 78.4%
Simplified89.2%
associate-*r*89.1%
distribute-rgt-out--78.4%
associate-+l-78.4%
associate-*l*51.2%
fmm-def51.2%
associate-*l*51.2%
*-commutative51.2%
Applied egg-rr51.2%
fmm-undef51.2%
*-commutative51.2%
Simplified51.2%
Taylor expanded in t around inf 89.2%
if -1.1999999999999999e180 < t < 1.11999999999999997e107Initial program 86.8%
Taylor expanded in y around 0 84.3%
distribute-lft-out84.3%
*-commutative84.3%
Simplified84.3%
if 1.11999999999999997e107 < t Initial program 88.2%
Simplified88.2%
Taylor expanded in t around inf 80.3%
Final simplification84.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= (* b c) -1.2e+163)
(* b c)
(if (<= (* b c) -1.15e-307)
(* j (* k -27.0))
(if (<= (* b c) 8.2e+101) (* -4.0 (* x i)) (* b c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.2e+163) {
tmp = b * c;
} else if ((b * c) <= -1.15e-307) {
tmp = j * (k * -27.0);
} else if ((b * c) <= 8.2e+101) {
tmp = -4.0 * (x * i);
} 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.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-1.2d+163)) then
tmp = b * c
else if ((b * c) <= (-1.15d-307)) then
tmp = j * (k * (-27.0d0))
else if ((b * c) <= 8.2d+101) then
tmp = (-4.0d0) * (x * i)
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;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.2e+163) {
tmp = b * c;
} else if ((b * c) <= -1.15e-307) {
tmp = j * (k * -27.0);
} else if ((b * c) <= 8.2e+101) {
tmp = -4.0 * (x * i);
} 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]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -1.2e+163: tmp = b * c elif (b * c) <= -1.15e-307: tmp = j * (k * -27.0) elif (b * c) <= 8.2e+101: tmp = -4.0 * (x * i) 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]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -1.2e+163) tmp = Float64(b * c); elseif (Float64(b * c) <= -1.15e-307) tmp = Float64(j * Float64(k * -27.0)); elseif (Float64(b * c) <= 8.2e+101) tmp = Float64(-4.0 * Float64(x * i)); 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])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -1.2e+163)
tmp = b * c;
elseif ((b * c) <= -1.15e-307)
tmp = j * (k * -27.0);
elseif ((b * c) <= 8.2e+101)
tmp = -4.0 * (x * i);
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. NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -1.2e+163], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.15e-307], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 8.2e+101], N[(-4.0 * N[(x * i), $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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -1.2 \cdot 10^{+163}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -1.15 \cdot 10^{-307}:\\
\;\;\;\;j \cdot \left(k \cdot -27\right)\\
\mathbf{elif}\;b \cdot c \leq 8.2 \cdot 10^{+101}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.1999999999999999e163 or 8.1999999999999999e101 < (*.f64 b c) Initial program 83.6%
Simplified82.5%
associate-*r*84.7%
distribute-rgt-out--83.5%
associate-+l-83.5%
associate-*l*79.1%
fmm-def79.1%
associate-*l*79.1%
*-commutative79.1%
Applied egg-rr79.1%
fmm-undef79.1%
*-commutative79.1%
Simplified79.1%
Taylor expanded in b around inf 66.4%
if -1.1999999999999999e163 < (*.f64 b c) < -1.1499999999999999e-307Initial program 83.3%
Simplified87.2%
associate-*r*85.9%
distribute-rgt-out--83.3%
associate-+l-83.3%
associate-*l*82.8%
fmm-def82.8%
associate-*l*82.8%
*-commutative82.8%
Applied egg-rr82.8%
fmm-undef82.8%
*-commutative82.8%
Simplified82.8%
Taylor expanded in x around 0 84.6%
associate-*r*84.6%
associate-*r*83.3%
Simplified83.3%
Taylor expanded in j around inf 31.8%
*-commutative31.8%
associate-*r*31.8%
Simplified31.8%
if -1.1499999999999999e-307 < (*.f64 b c) < 8.1999999999999999e101Initial program 90.7%
Simplified88.7%
associate-*r*90.6%
distribute-rgt-out--90.6%
associate-+l-90.6%
associate-*l*85.5%
fmm-def85.5%
associate-*l*85.4%
*-commutative85.4%
Applied egg-rr85.4%
fmm-undef85.4%
*-commutative85.4%
Simplified85.4%
Taylor expanded in i around inf 31.5%
*-commutative31.5%
Simplified31.5%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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) -7.2e+162)
(* b c)
(if (<= (* b c) -8.5e-309)
(* -27.0 (* j k))
(if (<= (* b c) 4.4e+98) (* -4.0 (* x i)) (* b c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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) <= -7.2e+162) {
tmp = b * c;
} else if ((b * c) <= -8.5e-309) {
tmp = -27.0 * (j * k);
} else if ((b * c) <= 4.4e+98) {
tmp = -4.0 * (x * i);
} 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.
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) <= (-7.2d+162)) then
tmp = b * c
else if ((b * c) <= (-8.5d-309)) then
tmp = (-27.0d0) * (j * k)
else if ((b * c) <= 4.4d+98) then
tmp = (-4.0d0) * (x * i)
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;
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) <= -7.2e+162) {
tmp = b * c;
} else if ((b * c) <= -8.5e-309) {
tmp = -27.0 * (j * k);
} else if ((b * c) <= 4.4e+98) {
tmp = -4.0 * (x * i);
} 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]) [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) <= -7.2e+162: tmp = b * c elif (b * c) <= -8.5e-309: tmp = -27.0 * (j * k) elif (b * c) <= 4.4e+98: tmp = -4.0 * (x * i) 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]) 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) <= -7.2e+162) tmp = Float64(b * c); elseif (Float64(b * c) <= -8.5e-309) tmp = Float64(-27.0 * Float64(j * k)); elseif (Float64(b * c) <= 4.4e+98) tmp = Float64(-4.0 * Float64(x * i)); 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])){:}
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) <= -7.2e+162)
tmp = b * c;
elseif ((b * c) <= -8.5e-309)
tmp = -27.0 * (j * k);
elseif ((b * c) <= 4.4e+98)
tmp = -4.0 * (x * i);
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. 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], -7.2e+162], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -8.5e-309], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 4.4e+98], N[(-4.0 * N[(x * i), $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])\\\\
[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 -7.2 \cdot 10^{+162}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -8.5 \cdot 10^{-309}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;b \cdot c \leq 4.4 \cdot 10^{+98}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -7.19999999999999987e162 or 4.40000000000000017e98 < (*.f64 b c) Initial program 83.6%
Simplified82.5%
associate-*r*84.7%
distribute-rgt-out--83.5%
associate-+l-83.5%
associate-*l*79.1%
fmm-def79.1%
associate-*l*79.1%
*-commutative79.1%
Applied egg-rr79.1%
fmm-undef79.1%
*-commutative79.1%
Simplified79.1%
Taylor expanded in b around inf 66.4%
if -7.19999999999999987e162 < (*.f64 b c) < -8.4999999999999987e-309Initial program 83.3%
Simplified87.2%
Taylor expanded in j around inf 31.8%
if -8.4999999999999987e-309 < (*.f64 b c) < 4.40000000000000017e98Initial program 90.7%
Simplified88.7%
associate-*r*90.6%
distribute-rgt-out--90.6%
associate-+l-90.6%
associate-*l*85.5%
fmm-def85.5%
associate-*l*85.4%
*-commutative85.4%
Applied egg-rr85.4%
fmm-undef85.4%
*-commutative85.4%
Simplified85.4%
Taylor expanded in i around inf 31.5%
*-commutative31.5%
Simplified31.5%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (<= x -6.6e+132)
(* x (+ (* (* 18.0 t) (* y z)) (* i -4.0)))
(if (<= x 1.4e+79)
(- (- (* b c) (* 4.0 (* t a))) (* (* j 27.0) k))
(* x (- (* 18.0 (* t (* y z))) (* 4.0 i))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 (x <= -6.6e+132) {
tmp = x * (((18.0 * t) * (y * z)) + (i * -4.0));
} else if (x <= 1.4e+79) {
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (x <= (-6.6d+132)) then
tmp = x * (((18.0d0 * t) * (y * z)) + (i * (-4.0d0)))
else if (x <= 1.4d+79) then
tmp = ((b * c) - (4.0d0 * (t * a))) - ((j * 27.0d0) * k)
else
tmp = x * ((18.0d0 * (t * (y * z))) - (4.0d0 * i))
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;
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 (x <= -6.6e+132) {
tmp = x * (((18.0 * t) * (y * z)) + (i * -4.0));
} else if (x <= 1.4e+79) {
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 x <= -6.6e+132: tmp = x * (((18.0 * t) * (y * z)) + (i * -4.0)) elif x <= 1.4e+79: tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k) else: tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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 (x <= -6.6e+132) tmp = Float64(x * Float64(Float64(Float64(18.0 * t) * Float64(y * z)) + Float64(i * -4.0))); elseif (x <= 1.4e+79) tmp = Float64(Float64(Float64(b * c) - Float64(4.0 * Float64(t * a))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(x * Float64(Float64(18.0 * Float64(t * Float64(y * z))) - Float64(4.0 * i))); 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])){:}
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 (x <= -6.6e+132)
tmp = x * (((18.0 * t) * (y * z)) + (i * -4.0));
elseif (x <= 1.4e+79)
tmp = ((b * c) - (4.0 * (t * a))) - ((j * 27.0) * k);
else
tmp = x * ((18.0 * (t * (y * z))) - (4.0 * i));
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. 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[x, -6.6e+132], N[(x * N[(N[(N[(18.0 * t), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.4e+79], N[(N[(N[(b * c), $MachinePrecision] - N[(4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * i), $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])\\\\
[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}\;x \leq -6.6 \cdot 10^{+132}:\\
\;\;\;\;x \cdot \left(\left(18 \cdot t\right) \cdot \left(y \cdot z\right) + i \cdot -4\right)\\
\mathbf{elif}\;x \leq 1.4 \cdot 10^{+79}:\\
\;\;\;\;\left(b \cdot c - 4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right) - 4 \cdot i\right)\\
\end{array}
\end{array}
if x < -6.6000000000000006e132Initial program 65.6%
Simplified73.4%
associate-*r*65.6%
distribute-rgt-out--65.6%
associate-+l-65.6%
associate-*l*65.1%
fmm-def65.1%
associate-*l*65.1%
*-commutative65.1%
Applied egg-rr65.1%
fmm-undef65.1%
*-commutative65.1%
Simplified65.1%
Taylor expanded in x around inf 74.2%
associate-*r*74.2%
cancel-sign-sub-inv74.2%
*-commutative74.2%
metadata-eval74.2%
Simplified74.2%
if -6.6000000000000006e132 < x < 1.4000000000000001e79Initial program 97.0%
Taylor expanded in x around 0 75.5%
if 1.4000000000000001e79 < x Initial program 65.8%
Simplified81.0%
Taylor expanded in x around inf 64.5%
Final simplification73.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= t -4.8e-89) (not (<= t 7.2e+42))) (* t (- (* a (- 4.0)) (* (* z (* x y)) -18.0))) (+ (* b c) (* j (* k -27.0)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 ((t <= -4.8e-89) || !(t <= 7.2e+42)) {
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
} else {
tmp = (b * c) + (j * (k * -27.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.
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 ((t <= (-4.8d-89)) .or. (.not. (t <= 7.2d+42))) then
tmp = t * ((a * -4.0d0) - ((z * (x * y)) * (-18.0d0)))
else
tmp = (b * c) + (j * (k * (-27.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;
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 ((t <= -4.8e-89) || !(t <= 7.2e+42)) {
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
} else {
tmp = (b * c) + (j * (k * -27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 (t <= -4.8e-89) or not (t <= 7.2e+42): tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0)) else: tmp = (b * c) + (j * (k * -27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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 ((t <= -4.8e-89) || !(t <= 7.2e+42)) tmp = Float64(t * Float64(Float64(a * Float64(-4.0)) - Float64(Float64(z * Float64(x * y)) * -18.0))); else tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.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])){:}
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 ((t <= -4.8e-89) || ~((t <= 7.2e+42)))
tmp = t * ((a * -4.0) - ((z * (x * y)) * -18.0));
else
tmp = (b * c) + (j * (k * -27.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. 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[Or[LessEqual[t, -4.8e-89], N[Not[LessEqual[t, 7.2e+42]], $MachinePrecision]], N[(t * N[(N[(a * (-4.0)), $MachinePrecision] - N[(N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision] * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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}\;t \leq -4.8 \cdot 10^{-89} \lor \neg \left(t \leq 7.2 \cdot 10^{+42}\right):\\
\;\;\;\;t \cdot \left(a \cdot \left(-4\right) - \left(z \cdot \left(x \cdot y\right)\right) \cdot -18\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\
\end{array}
\end{array}
if t < -4.80000000000000032e-89 or 7.2000000000000002e42 < t Initial program 88.2%
Simplified87.0%
associate-*r*90.3%
distribute-rgt-out--88.2%
associate-+l-88.2%
associate-*l*78.8%
fmm-def78.8%
associate-*l*78.8%
*-commutative78.8%
Applied egg-rr78.8%
fmm-undef78.8%
*-commutative78.8%
Simplified78.8%
Taylor expanded in t around -inf 59.4%
associate-*r*59.4%
neg-mul-159.4%
cancel-sign-sub-inv59.4%
*-commutative59.4%
associate-*r*62.7%
metadata-eval62.7%
*-commutative62.7%
Simplified62.7%
if -4.80000000000000032e-89 < t < 7.2000000000000002e42Initial program 83.4%
Simplified85.2%
Taylor expanded in b around inf 63.8%
Final simplification63.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= t -2.3e+94) (not (<= t 7.6e+155))) (* t (- (* 18.0 (* x (* y z))) (* a 4.0))) (+ (* b c) (* j (* k -27.0)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 ((t <= -2.3e+94) || !(t <= 7.6e+155)) {
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
} else {
tmp = (b * c) + (j * (k * -27.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.
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 ((t <= (-2.3d+94)) .or. (.not. (t <= 7.6d+155))) then
tmp = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
else
tmp = (b * c) + (j * (k * (-27.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;
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 ((t <= -2.3e+94) || !(t <= 7.6e+155)) {
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
} else {
tmp = (b * c) + (j * (k * -27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 (t <= -2.3e+94) or not (t <= 7.6e+155): tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0)) else: tmp = (b * c) + (j * (k * -27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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 ((t <= -2.3e+94) || !(t <= 7.6e+155)) tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0))); else tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.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])){:}
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 ((t <= -2.3e+94) || ~((t <= 7.6e+155)))
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
else
tmp = (b * c) + (j * (k * -27.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. 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[Or[LessEqual[t, -2.3e+94], N[Not[LessEqual[t, 7.6e+155]], $MachinePrecision]], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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}\;t \leq -2.3 \cdot 10^{+94} \lor \neg \left(t \leq 7.6 \cdot 10^{+155}\right):\\
\;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\
\end{array}
\end{array}
if t < -2.3e94 or 7.6000000000000001e155 < t Initial program 85.8%
Simplified90.1%
associate-*r*90.1%
distribute-rgt-out--85.8%
associate-+l-85.8%
associate-*l*73.7%
fmm-def73.7%
associate-*l*73.7%
*-commutative73.7%
Applied egg-rr73.7%
fmm-undef73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in t around inf 76.5%
if -2.3e94 < t < 7.6000000000000001e155Initial program 86.2%
Simplified84.7%
Taylor expanded in b around inf 57.0%
Final simplification62.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= (* b c) -3.2e+104) (not (<= (* b c) 1.95e+109))) (* b c) (* z (* 18.0 (* t (* x y))))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (((b * c) <= -3.2e+104) || !((b * c) <= 1.95e+109)) {
tmp = b * c;
} else {
tmp = z * (18.0 * (t * (x * y)));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if (((b * c) <= (-3.2d+104)) .or. (.not. ((b * c) <= 1.95d+109))) then
tmp = b * c
else
tmp = z * (18.0d0 * (t * (x * y)))
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;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (((b * c) <= -3.2e+104) || !((b * c) <= 1.95e+109)) {
tmp = b * c;
} else {
tmp = z * (18.0 * (t * (x * y)));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if ((b * c) <= -3.2e+104) or not ((b * c) <= 1.95e+109): tmp = b * c else: tmp = z * (18.0 * (t * (x * y))) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if ((Float64(b * c) <= -3.2e+104) || !(Float64(b * c) <= 1.95e+109)) tmp = Float64(b * c); else tmp = Float64(z * Float64(18.0 * Float64(t * Float64(x * y)))); 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])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if (((b * c) <= -3.2e+104) || ~(((b * c) <= 1.95e+109)))
tmp = b * c;
else
tmp = z * (18.0 * (t * (x * y)));
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. 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[Or[LessEqual[N[(b * c), $MachinePrecision], -3.2e+104], N[Not[LessEqual[N[(b * c), $MachinePrecision], 1.95e+109]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(z * N[(18.0 * N[(t * N[(x * y), $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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -3.2 \cdot 10^{+104} \lor \neg \left(b \cdot c \leq 1.95 \cdot 10^{+109}\right):\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -3.2e104 or 1.95000000000000008e109 < (*.f64 b c) Initial program 83.7%
Simplified84.8%
associate-*r*84.7%
distribute-rgt-out--83.6%
associate-+l-83.6%
associate-*l*79.5%
fmm-def79.5%
associate-*l*79.5%
*-commutative79.5%
Applied egg-rr79.5%
fmm-undef79.5%
*-commutative79.5%
Simplified79.5%
Taylor expanded in b around inf 63.7%
if -3.2e104 < (*.f64 b c) < 1.95000000000000008e109Initial program 87.5%
Simplified87.0%
associate-*r*88.7%
distribute-rgt-out--87.5%
associate-+l-87.5%
associate-*l*84.2%
fmm-def84.2%
associate-*l*84.2%
*-commutative84.2%
Applied egg-rr84.2%
fmm-undef84.2%
*-commutative84.2%
Simplified84.2%
Taylor expanded in t around inf 45.5%
Taylor expanded in z around inf 49.2%
Taylor expanded in a around 0 33.6%
Final simplification44.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 (<= t -2.7e+93)
(* t (- (* 18.0 (* x (* y z))) (* a 4.0)))
(if (<= t 7.5e+172)
(+ (* b c) (* j (* k -27.0)))
(* x (+ (* (* 18.0 t) (* y z)) (* i -4.0))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 (t <= -2.7e+93) {
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
} else if (t <= 7.5e+172) {
tmp = (b * c) + (j * (k * -27.0));
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -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.
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 (t <= (-2.7d+93)) then
tmp = t * ((18.0d0 * (x * (y * z))) - (a * 4.0d0))
else if (t <= 7.5d+172) then
tmp = (b * c) + (j * (k * (-27.0d0)))
else
tmp = x * (((18.0d0 * t) * (y * z)) + (i * (-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;
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 (t <= -2.7e+93) {
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
} else if (t <= 7.5e+172) {
tmp = (b * c) + (j * (k * -27.0));
} else {
tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) [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 t <= -2.7e+93: tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0)) elif t <= 7.5e+172: tmp = (b * c) + (j * (k * -27.0)) else: tmp = x * (((18.0 * t) * (y * z)) + (i * -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]) 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 (t <= -2.7e+93) tmp = Float64(t * Float64(Float64(18.0 * Float64(x * Float64(y * z))) - Float64(a * 4.0))); elseif (t <= 7.5e+172) tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.0))); else tmp = Float64(x * Float64(Float64(Float64(18.0 * t) * Float64(y * z)) + Float64(i * -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])){:}
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 (t <= -2.7e+93)
tmp = t * ((18.0 * (x * (y * z))) - (a * 4.0));
elseif (t <= 7.5e+172)
tmp = (b * c) + (j * (k * -27.0));
else
tmp = x * (((18.0 * t) * (y * z)) + (i * -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. 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[t, -2.7e+93], N[(t * N[(N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7.5e+172], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(N[(18.0 * t), $MachinePrecision] * N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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}\;t \leq -2.7 \cdot 10^{+93}:\\
\;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right) - a \cdot 4\right)\\
\mathbf{elif}\;t \leq 7.5 \cdot 10^{+172}:\\
\;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(18 \cdot t\right) \cdot \left(y \cdot z\right) + i \cdot -4\right)\\
\end{array}
\end{array}
if t < -2.6999999999999999e93Initial program 83.9%
Simplified90.8%
associate-*r*90.8%
distribute-rgt-out--83.9%
associate-+l-83.9%
associate-*l*64.3%
fmm-def64.3%
associate-*l*64.3%
*-commutative64.3%
Applied egg-rr64.3%
fmm-undef64.3%
*-commutative64.3%
Simplified64.3%
Taylor expanded in t around inf 77.5%
if -2.6999999999999999e93 < t < 7.4999999999999994e172Initial program 86.3%
Simplified84.8%
Taylor expanded in b around inf 56.8%
if 7.4999999999999994e172 < t Initial program 88.4%
Simplified88.5%
associate-*r*88.5%
distribute-rgt-out--88.5%
associate-+l-88.5%
associate-*l*88.5%
fmm-def88.5%
associate-*l*88.5%
*-commutative88.5%
Applied egg-rr88.5%
fmm-undef88.5%
*-commutative88.5%
Simplified88.5%
Taylor expanded in x around inf 77.6%
associate-*r*77.6%
cancel-sign-sub-inv77.6%
*-commutative77.6%
metadata-eval77.6%
Simplified77.6%
Final simplification62.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= t -1.35e+95) (not (<= t 5.6e+171))) (* z (* 18.0 (* t (* x y)))) (+ (* b c) (* j (* k -27.0)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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 ((t <= -1.35e+95) || !(t <= 5.6e+171)) {
tmp = z * (18.0 * (t * (x * y)));
} else {
tmp = (b * c) + (j * (k * -27.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.
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 ((t <= (-1.35d+95)) .or. (.not. (t <= 5.6d+171))) then
tmp = z * (18.0d0 * (t * (x * y)))
else
tmp = (b * c) + (j * (k * (-27.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;
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 ((t <= -1.35e+95) || !(t <= 5.6e+171)) {
tmp = z * (18.0 * (t * (x * y)));
} else {
tmp = (b * c) + (j * (k * -27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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 (t <= -1.35e+95) or not (t <= 5.6e+171): tmp = z * (18.0 * (t * (x * y))) else: tmp = (b * c) + (j * (k * -27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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 ((t <= -1.35e+95) || !(t <= 5.6e+171)) tmp = Float64(z * Float64(18.0 * Float64(t * Float64(x * y)))); else tmp = Float64(Float64(b * c) + Float64(j * Float64(k * -27.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])){:}
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 ((t <= -1.35e+95) || ~((t <= 5.6e+171)))
tmp = z * (18.0 * (t * (x * y)));
else
tmp = (b * c) + (j * (k * -27.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. 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[Or[LessEqual[t, -1.35e+95], N[Not[LessEqual[t, 5.6e+171]], $MachinePrecision]], N[(z * N[(18.0 * N[(t * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] + N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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}\;t \leq -1.35 \cdot 10^{+95} \lor \neg \left(t \leq 5.6 \cdot 10^{+171}\right):\\
\;\;\;\;z \cdot \left(18 \cdot \left(t \cdot \left(x \cdot y\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c + j \cdot \left(k \cdot -27\right)\\
\end{array}
\end{array}
if t < -1.35e95 or 5.60000000000000009e171 < t Initial program 85.6%
Simplified89.9%
associate-*r*89.9%
distribute-rgt-out--85.6%
associate-+l-85.6%
associate-*l*73.3%
fmm-def73.3%
associate-*l*73.3%
*-commutative73.3%
Applied egg-rr73.3%
fmm-undef73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in t around inf 76.1%
Taylor expanded in z around inf 69.1%
Taylor expanded in a around 0 56.4%
if -1.35e95 < t < 5.60000000000000009e171Initial program 86.3%
Simplified84.8%
Taylor expanded in b around inf 56.8%
Final simplification56.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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 (or (<= (* b c) -2.1e+162) (not (<= (* b c) 6.8e+115))) (* b c) (* -27.0 (* j k))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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) <= -2.1e+162) || !((b * c) <= 6.8e+115)) {
tmp = b * c;
} else {
tmp = -27.0 * (j * k);
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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) <= (-2.1d+162)) .or. (.not. ((b * c) <= 6.8d+115))) then
tmp = b * c
else
tmp = (-27.0d0) * (j * k)
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;
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) <= -2.1e+162) || !((b * c) <= 6.8e+115)) {
tmp = b * c;
} else {
tmp = -27.0 * (j * k);
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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) <= -2.1e+162) or not ((b * c) <= 6.8e+115): tmp = b * c else: tmp = -27.0 * (j * k) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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) <= -2.1e+162) || !(Float64(b * c) <= 6.8e+115)) tmp = Float64(b * c); else tmp = Float64(-27.0 * Float64(j * k)); 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])){:}
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) <= -2.1e+162) || ~(((b * c) <= 6.8e+115)))
tmp = b * c;
else
tmp = -27.0 * (j * k);
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. 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[Or[LessEqual[N[(b * c), $MachinePrecision], -2.1e+162], N[Not[LessEqual[N[(b * c), $MachinePrecision], 6.8e+115]], $MachinePrecision]], N[(b * c), $MachinePrecision], N[(-27.0 * N[(j * k), $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])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -2.1 \cdot 10^{+162} \lor \neg \left(b \cdot c \leq 6.8 \cdot 10^{+115}\right):\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -2.1e162 or 6.8000000000000001e115 < (*.f64 b c) Initial program 83.9%
Simplified84.0%
associate-*r*85.2%
distribute-rgt-out--83.9%
associate-+l-83.9%
associate-*l*80.5%
fmm-def80.5%
associate-*l*80.5%
*-commutative80.5%
Applied egg-rr80.5%
fmm-undef80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in b around inf 68.9%
if -2.1e162 < (*.f64 b c) < 6.8000000000000001e115Initial program 87.1%
Simplified87.8%
Taylor expanded in j around inf 28.2%
Final simplification41.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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);
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.
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;
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]) [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]) 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])){:}
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. 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])\\\\
[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 86.1%
Simplified86.2%
associate-*r*87.3%
distribute-rgt-out--86.1%
associate-+l-86.1%
associate-*l*82.6%
fmm-def82.6%
associate-*l*82.5%
*-commutative82.5%
Applied egg-rr82.5%
fmm-undef82.5%
*-commutative82.5%
Simplified82.5%
Taylor expanded in b around inf 28.0%
(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 2024179
(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)))