
(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 24 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))
(t_2 (* (* j 27.0) k))
(t_3
(-
(- (+ (- (* (* (* (* x 18.0) y) z) t) (* t (* a 4.0))) (* b c)) t_1)
t_2)))
(if (<= t_3 5e+274)
t_3
(if (<= t_3 INFINITY)
(-
(- (- (+ (* b c) (* (* x 18.0) (* y (* z t)))) (* a (* t 4.0))) t_1)
t_2)
(* x (+ (* i -4.0) (* z (* y (* 18.0 t)))))))))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;
double t_2 = (j * 27.0) * k;
double t_3 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - t_1) - t_2;
double tmp;
if (t_3 <= 5e+274) {
tmp = t_3;
} else if (t_3 <= ((double) INFINITY)) {
tmp = ((((b * c) + ((x * 18.0) * (y * (z * t)))) - (a * (t * 4.0))) - t_1) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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;
double t_2 = (j * 27.0) * k;
double t_3 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - t_1) - t_2;
double tmp;
if (t_3 <= 5e+274) {
tmp = t_3;
} else if (t_3 <= Double.POSITIVE_INFINITY) {
tmp = ((((b * c) + ((x * 18.0) * (y * (z * t)))) - (a * (t * 4.0))) - t_1) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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 t_2 = (j * 27.0) * k t_3 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - t_1) - t_2 tmp = 0 if t_3 <= 5e+274: tmp = t_3 elif t_3 <= math.inf: tmp = ((((b * c) + ((x * 18.0) * (y * (z * t)))) - (a * (t * 4.0))) - t_1) - t_2 else: tmp = x * ((i * -4.0) + (z * (y * (18.0 * t)))) 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 * 4.0) * i) t_2 = Float64(Float64(j * 27.0) * k) t_3 = Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - t_1) - t_2) tmp = 0.0 if (t_3 <= 5e+274) tmp = t_3; elseif (t_3 <= Inf) tmp = Float64(Float64(Float64(Float64(Float64(b * c) + Float64(Float64(x * 18.0) * Float64(y * Float64(z * t)))) - Float64(a * Float64(t * 4.0))) - t_1) - t_2); else tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
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;
t_2 = (j * 27.0) * k;
t_3 = (((((((x * 18.0) * y) * z) * t) - (t * (a * 4.0))) + (b * c)) - t_1) - t_2;
tmp = 0.0;
if (t_3 <= 5e+274)
tmp = t_3;
elseif (t_3 <= Inf)
tmp = ((((b * c) + ((x * 18.0) * (y * (z * t)))) - (a * (t * 4.0))) - t_1) - t_2;
else
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]}, If[LessEqual[t$95$3, 5e+274], t$95$3, If[LessEqual[t$95$3, Infinity], N[(N[(N[(N[(N[(b * c), $MachinePrecision] + N[(N[(x * 18.0), $MachinePrecision] * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 4\right) \cdot i\\
t_2 := \left(j \cdot 27\right) \cdot k\\
t_3 := \left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - t\_1\right) - t\_2\\
\mathbf{if}\;t\_3 \leq 5 \cdot 10^{+274}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_3 \leq \infty:\\
\;\;\;\;\left(\left(\left(b \cdot c + \left(x \cdot 18\right) \cdot \left(y \cdot \left(z \cdot t\right)\right)\right) - a \cdot \left(t \cdot 4\right)\right) - t\_1\right) - t\_2\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) < 4.9999999999999998e274Initial program 96.3%
if 4.9999999999999998e274 < (-.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 91.4%
+-commutativeN/A
associate-+r-N/A
--lowering--.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64100.0%
Applied egg-rr100.0%
if +inf.0 < (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) Initial program 0.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified24.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.3%
Simplified69.3%
Final simplification94.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 (* (* x 4.0) i)) (t_2 (* (* j 27.0) k)) (t_3 (* t (* a 4.0))))
(if (<=
(- (- (+ (- (* (* (* (* x 18.0) y) z) t) t_3) (* b c)) t_1) t_2)
INFINITY)
(- (- (+ (* b c) (- (* z (* t (* x (* 18.0 y)))) t_3)) t_1) t_2)
(* x (+ (* i -4.0) (* z (* y (* 18.0 t))))))))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;
double t_2 = (j * 27.0) * k;
double t_3 = t * (a * 4.0);
double tmp;
if (((((((((x * 18.0) * y) * z) * t) - t_3) + (b * c)) - t_1) - t_2) <= ((double) INFINITY)) {
tmp = (((b * c) + ((z * (t * (x * (18.0 * y)))) - t_3)) - t_1) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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;
double t_2 = (j * 27.0) * k;
double t_3 = t * (a * 4.0);
double tmp;
if (((((((((x * 18.0) * y) * z) * t) - t_3) + (b * c)) - t_1) - t_2) <= Double.POSITIVE_INFINITY) {
tmp = (((b * c) + ((z * (t * (x * (18.0 * y)))) - t_3)) - t_1) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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 t_2 = (j * 27.0) * k t_3 = t * (a * 4.0) tmp = 0 if ((((((((x * 18.0) * y) * z) * t) - t_3) + (b * c)) - t_1) - t_2) <= math.inf: tmp = (((b * c) + ((z * (t * (x * (18.0 * y)))) - t_3)) - t_1) - t_2 else: tmp = x * ((i * -4.0) + (z * (y * (18.0 * t)))) 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 * 4.0) * i) t_2 = Float64(Float64(j * 27.0) * k) t_3 = Float64(t * Float64(a * 4.0)) tmp = 0.0 if (Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - t_3) + Float64(b * c)) - t_1) - t_2) <= Inf) tmp = Float64(Float64(Float64(Float64(b * c) + Float64(Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) - t_3)) - t_1) - t_2); else tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
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;
t_2 = (j * 27.0) * k;
t_3 = t * (a * 4.0);
tmp = 0.0;
if (((((((((x * 18.0) * y) * z) * t) - t_3) + (b * c)) - t_1) - t_2) <= Inf)
tmp = (((b * c) + ((z * (t * (x * (18.0 * y)))) - t_3)) - t_1) - t_2;
else
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$3 = N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - t$95$3), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], Infinity], N[(N[(N[(N[(b * c), $MachinePrecision] + N[(N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 4\right) \cdot i\\
t_2 := \left(j \cdot 27\right) \cdot k\\
t_3 := t \cdot \left(a \cdot 4\right)\\
\mathbf{if}\;\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - t\_3\right) + b \cdot c\right) - t\_1\right) - t\_2 \leq \infty:\\
\;\;\;\;\left(\left(b \cdot c + \left(z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right) - t\_3\right)\right) - t\_1\right) - t\_2\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) < +inf.0Initial program 94.8%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6495.3%
Applied egg-rr95.3%
if +inf.0 < (-.f64 (-.f64 (+.f64 (-.f64 (*.f64 (*.f64 (*.f64 (*.f64 x #s(literal 18 binary64)) y) z) t) (*.f64 (*.f64 a #s(literal 4 binary64)) t)) (*.f64 b c)) (*.f64 (*.f64 x #s(literal 4 binary64)) i)) (*.f64 (*.f64 j #s(literal 27 binary64)) k)) Initial program 0.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified24.1%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.3%
Simplified69.3%
Final simplification92.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 (* -27.0 (* j k)))
(t_2 (+ (* t (+ (* (* (* x 18.0) y) z) (* a -4.0))) (+ (* b c) t_1)))
(t_3 (* (* j 27.0) k)))
(if (<= t_3 (- INFINITY))
t_1
(if (<= t_3 -2e+32)
t_2
(if (<= t_3 2e+174)
(+
(* x (+ (* i -4.0) (* z (* y (* 18.0 t)))))
(+ (* b c) (* -4.0 (* t a))))
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 = -27.0 * (j * k);
double t_2 = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + t_1);
double t_3 = (j * 27.0) * k;
double tmp;
if (t_3 <= -((double) INFINITY)) {
tmp = t_1;
} else if (t_3 <= -2e+32) {
tmp = t_2;
} else if (t_3 <= 2e+174) {
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + ((b * c) + (-4.0 * (t * a)));
} else {
tmp = t_2;
}
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 = -27.0 * (j * k);
double t_2 = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + t_1);
double t_3 = (j * 27.0) * k;
double tmp;
if (t_3 <= -Double.POSITIVE_INFINITY) {
tmp = t_1;
} else if (t_3 <= -2e+32) {
tmp = t_2;
} else if (t_3 <= 2e+174) {
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + ((b * c) + (-4.0 * (t * a)));
} 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 = -27.0 * (j * k) t_2 = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + t_1) t_3 = (j * 27.0) * k tmp = 0 if t_3 <= -math.inf: tmp = t_1 elif t_3 <= -2e+32: tmp = t_2 elif t_3 <= 2e+174: tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + ((b * c) + (-4.0 * (t * a))) 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(-27.0 * Float64(j * k)) t_2 = Float64(Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) + Float64(Float64(b * c) + t_1)) t_3 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (t_3 <= Float64(-Inf)) tmp = t_1; elseif (t_3 <= -2e+32) tmp = t_2; elseif (t_3 <= 2e+174) tmp = Float64(Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) + Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a)))); 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 = -27.0 * (j * k);
t_2 = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + t_1);
t_3 = (j * 27.0) * k;
tmp = 0.0;
if (t_3 <= -Inf)
tmp = t_1;
elseif (t_3 <= -2e+32)
tmp = t_2;
elseif (t_3 <= 2e+174)
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + ((b * c) + (-4.0 * (t * a)));
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[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t$95$3, (-Infinity)], t$95$1, If[LessEqual[t$95$3, -2e+32], t$95$2, If[LessEqual[t$95$3, 2e+174], N[(N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $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 := -27 \cdot \left(j \cdot k\right)\\
t_2 := t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right) + \left(b \cdot c + t\_1\right)\\
t_3 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t\_3 \leq -\infty:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_3 \leq -2 \cdot 10^{+32}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+174}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right) + \left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -inf.0Initial program 78.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified78.3%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6495.7%
Simplified95.7%
if -inf.0 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -2.00000000000000011e32 or 2.00000000000000014e174 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 81.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified87.4%
Taylor expanded in b around inf
*-lowering-*.f6481.5%
Simplified81.5%
if -2.00000000000000011e32 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2.00000000000000014e174Initial program 86.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified87.8%
Taylor expanded in j around 0
Simplified88.3%
Final simplification87.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 (* -4.0 (* t a)))
(t_2 (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))))
(t_3 (* (* j 27.0) k)))
(if (<= t_3 -1e+98)
(- (+ t_2 t_1) (* j (* 27.0 k)))
(if (<= t_3 2e+174)
(+ t_2 (+ (* b c) t_1))
(+
(* t (+ (* (* (* x 18.0) y) z) (* a -4.0)))
(+ (* 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 t_1 = -4.0 * (t * a);
double t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
double t_3 = (j * 27.0) * k;
double tmp;
if (t_3 <= -1e+98) {
tmp = (t_2 + t_1) - (j * (27.0 * k));
} else if (t_3 <= 2e+174) {
tmp = t_2 + ((b * c) + t_1);
} else {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (-4.0d0) * (t * a)
t_2 = x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))
t_3 = (j * 27.0d0) * k
if (t_3 <= (-1d+98)) then
tmp = (t_2 + t_1) - (j * (27.0d0 * k))
else if (t_3 <= 2d+174) then
tmp = t_2 + ((b * c) + t_1)
else
tmp = (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))) + ((b * c) + ((-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 t_1 = -4.0 * (t * a);
double t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
double t_3 = (j * 27.0) * k;
double tmp;
if (t_3 <= -1e+98) {
tmp = (t_2 + t_1) - (j * (27.0 * k));
} else if (t_3 <= 2e+174) {
tmp = t_2 + ((b * c) + t_1);
} else {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-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): t_1 = -4.0 * (t * a) t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t)))) t_3 = (j * 27.0) * k tmp = 0 if t_3 <= -1e+98: tmp = (t_2 + t_1) - (j * (27.0 * k)) elif t_3 <= 2e+174: tmp = t_2 + ((b * c) + t_1) else: tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-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) t_1 = Float64(-4.0 * Float64(t * a)) t_2 = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) t_3 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (t_3 <= -1e+98) tmp = Float64(Float64(t_2 + t_1) - Float64(j * Float64(27.0 * k))); elseif (t_3 <= 2e+174) tmp = Float64(t_2 + Float64(Float64(b * c) + t_1)); else tmp = Float64(Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) + Float64(Float64(b * c) + 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)
t_1 = -4.0 * (t * a);
t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
t_3 = (j * 27.0) * k;
tmp = 0.0;
if (t_3 <= -1e+98)
tmp = (t_2 + t_1) - (j * (27.0 * k));
elseif (t_3 <= 2e+174)
tmp = t_2 + ((b * c) + t_1);
else
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-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_] := Block[{t$95$1 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+98], N[(N[(t$95$2 + t$95$1), $MachinePrecision] - N[(j * N[(27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2e+174], N[(t$95$2 + N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(-27.0 * N[(j * 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}
t_1 := -4 \cdot \left(t \cdot a\right)\\
t_2 := x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
t_3 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+98}:\\
\;\;\;\;\left(t\_2 + t\_1\right) - j \cdot \left(27 \cdot k\right)\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+174}:\\
\;\;\;\;t\_2 + \left(b \cdot c + t\_1\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right) + \left(b \cdot c + -27 \cdot \left(j \cdot k\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -9.99999999999999998e97Initial program 79.2%
Taylor expanded in b around 0
Simplified86.1%
if -9.99999999999999998e97 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2.00000000000000014e174Initial program 85.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified88.1%
Taylor expanded in j around 0
Simplified87.6%
if 2.00000000000000014e174 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 80.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.6%
Taylor expanded in b around inf
*-lowering-*.f6486.6%
Simplified86.6%
Final simplification87.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 (<= x -9e+205)
(* x (- (- 0.0 (* 4.0 i)) (* (* y z) (* t -18.0))))
(if (<= x 4.3e+133)
(+
(* t (+ (* (* (* x 18.0) y) z) (* a -4.0)))
(+ (* -27.0 (* j k)) (+ (* b c) (* x (* i -4.0)))))
(-
(+ (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))) (* -4.0 (* t a)))
(* 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 (x <= -9e+205) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 4.3e+133) {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 (x <= (-9d+205)) then
tmp = x * ((0.0d0 - (4.0d0 * i)) - ((y * z) * (t * (-18.0d0))))
else if (x <= 4.3d+133) then
tmp = (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))) + (((-27.0d0) * (j * k)) + ((b * c) + (x * (i * (-4.0d0)))))
else
tmp = ((x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))) + ((-4.0d0) * (t * a))) - (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 (x <= -9e+205) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 4.3e+133) {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 x <= -9e+205: tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0))) elif x <= 4.3e+133: tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) else: tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 (x <= -9e+205) tmp = Float64(x * Float64(Float64(0.0 - Float64(4.0 * i)) - Float64(Float64(y * z) * Float64(t * -18.0)))); elseif (x <= 4.3e+133) tmp = Float64(Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) + Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(b * c) + Float64(x * Float64(i * -4.0))))); else tmp = Float64(Float64(Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) + Float64(-4.0 * Float64(t * a))) - 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 (x <= -9e+205)
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
elseif (x <= 4.3e+133)
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
else
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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[LessEqual[x, -9e+205], N[(x * N[(N[(0.0 - N[(4.0 * i), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(t * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.3e+133], N[(N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(j * N[(27.0 * k), $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 -9 \cdot 10^{+205}:\\
\;\;\;\;x \cdot \left(\left(0 - 4 \cdot i\right) - \left(y \cdot z\right) \cdot \left(t \cdot -18\right)\right)\\
\mathbf{elif}\;x \leq 4.3 \cdot 10^{+133}:\\
\;\;\;\;t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right) + \left(-27 \cdot \left(j \cdot k\right) + \left(b \cdot c + x \cdot \left(i \cdot -4\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right) + -4 \cdot \left(t \cdot a\right)\right) - j \cdot \left(27 \cdot k\right)\\
\end{array}
\end{array}
if x < -9.00000000000000071e205Initial program 53.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified59.3%
Taylor expanded in x around -inf
mul-1-negN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6494.3%
Simplified94.3%
if -9.00000000000000071e205 < x < 4.29999999999999994e133Initial program 89.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified92.1%
if 4.29999999999999994e133 < x Initial program 71.5%
Taylor expanded in b around 0
Simplified93.7%
Final simplification92.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 (<= x -1.45e+214)
(* x (- (- 0.0 (* 4.0 i)) (* (* y z) (* t -18.0))))
(if (<= x 6.2e+173)
(+
(+ (* -27.0 (* j k)) (+ (* b c) (* x (* i -4.0))))
(* t (+ (* a -4.0) (* (* 18.0 y) (* x z)))))
(-
(+ (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))) (* -4.0 (* t a)))
(* 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 (x <= -1.45e+214) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 6.2e+173) {
tmp = ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) + (t * ((a * -4.0) + ((18.0 * y) * (x * z))));
} else {
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 (x <= (-1.45d+214)) then
tmp = x * ((0.0d0 - (4.0d0 * i)) - ((y * z) * (t * (-18.0d0))))
else if (x <= 6.2d+173) then
tmp = (((-27.0d0) * (j * k)) + ((b * c) + (x * (i * (-4.0d0))))) + (t * ((a * (-4.0d0)) + ((18.0d0 * y) * (x * z))))
else
tmp = ((x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))) + ((-4.0d0) * (t * a))) - (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 (x <= -1.45e+214) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 6.2e+173) {
tmp = ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) + (t * ((a * -4.0) + ((18.0 * y) * (x * z))));
} else {
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 x <= -1.45e+214: tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0))) elif x <= 6.2e+173: tmp = ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) + (t * ((a * -4.0) + ((18.0 * y) * (x * z)))) else: tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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 (x <= -1.45e+214) tmp = Float64(x * Float64(Float64(0.0 - Float64(4.0 * i)) - Float64(Float64(y * z) * Float64(t * -18.0)))); elseif (x <= 6.2e+173) tmp = Float64(Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(b * c) + Float64(x * Float64(i * -4.0)))) + Float64(t * Float64(Float64(a * -4.0) + Float64(Float64(18.0 * y) * Float64(x * z))))); else tmp = Float64(Float64(Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) + Float64(-4.0 * Float64(t * a))) - 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 (x <= -1.45e+214)
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
elseif (x <= 6.2e+173)
tmp = ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) + (t * ((a * -4.0) + ((18.0 * y) * (x * z))));
else
tmp = ((x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a))) - (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[LessEqual[x, -1.45e+214], N[(x * N[(N[(0.0 - N[(4.0 * i), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(t * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 6.2e+173], N[(N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(N[(18.0 * y), $MachinePrecision] * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(j * N[(27.0 * k), $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 -1.45 \cdot 10^{+214}:\\
\;\;\;\;x \cdot \left(\left(0 - 4 \cdot i\right) - \left(y \cdot z\right) \cdot \left(t \cdot -18\right)\right)\\
\mathbf{elif}\;x \leq 6.2 \cdot 10^{+173}:\\
\;\;\;\;\left(-27 \cdot \left(j \cdot k\right) + \left(b \cdot c + x \cdot \left(i \cdot -4\right)\right)\right) + t \cdot \left(a \cdot -4 + \left(18 \cdot y\right) \cdot \left(x \cdot z\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right) + -4 \cdot \left(t \cdot a\right)\right) - j \cdot \left(27 \cdot k\right)\\
\end{array}
\end{array}
if x < -1.45e214Initial program 53.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified59.3%
Taylor expanded in x around -inf
mul-1-negN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6494.3%
Simplified94.3%
if -1.45e214 < x < 6.2e173Initial program 88.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified91.6%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.2%
Applied egg-rr90.2%
if 6.2e173 < x Initial program 67.0%
Taylor expanded in b around 0
Simplified98.1%
Final simplification91.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -4.0 (+ (* t a) (* x i)))) (t_2 (* z (* t (* x (* 18.0 y))))))
(if (<= y -3.7e+115)
t_2
(if (<= y -1.06e+57)
(+ (* b c) (* -4.0 (* t a)))
(if (<= y -2e-111)
t_1
(if (<= y 4.2e-126)
(- (* b c) (* (* j 27.0) k))
(if (<= y 4.7e+30) 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 = -4.0 * ((t * a) + (x * i));
double t_2 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -3.7e+115) {
tmp = t_2;
} else if (y <= -1.06e+57) {
tmp = (b * c) + (-4.0 * (t * a));
} else if (y <= -2e-111) {
tmp = t_1;
} else if (y <= 4.2e-126) {
tmp = (b * c) - ((j * 27.0) * k);
} else if (y <= 4.7e+30) {
tmp = 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 = (-4.0d0) * ((t * a) + (x * i))
t_2 = z * (t * (x * (18.0d0 * y)))
if (y <= (-3.7d+115)) then
tmp = t_2
else if (y <= (-1.06d+57)) then
tmp = (b * c) + ((-4.0d0) * (t * a))
else if (y <= (-2d-111)) then
tmp = t_1
else if (y <= 4.2d-126) then
tmp = (b * c) - ((j * 27.0d0) * k)
else if (y <= 4.7d+30) then
tmp = 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 = -4.0 * ((t * a) + (x * i));
double t_2 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -3.7e+115) {
tmp = t_2;
} else if (y <= -1.06e+57) {
tmp = (b * c) + (-4.0 * (t * a));
} else if (y <= -2e-111) {
tmp = t_1;
} else if (y <= 4.2e-126) {
tmp = (b * c) - ((j * 27.0) * k);
} else if (y <= 4.7e+30) {
tmp = 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 = -4.0 * ((t * a) + (x * i)) t_2 = z * (t * (x * (18.0 * y))) tmp = 0 if y <= -3.7e+115: tmp = t_2 elif y <= -1.06e+57: tmp = (b * c) + (-4.0 * (t * a)) elif y <= -2e-111: tmp = t_1 elif y <= 4.2e-126: tmp = (b * c) - ((j * 27.0) * k) elif y <= 4.7e+30: tmp = 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(-4.0 * Float64(Float64(t * a) + Float64(x * i))) t_2 = Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) tmp = 0.0 if (y <= -3.7e+115) tmp = t_2; elseif (y <= -1.06e+57) tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))); elseif (y <= -2e-111) tmp = t_1; elseif (y <= 4.2e-126) tmp = Float64(Float64(b * c) - Float64(Float64(j * 27.0) * k)); elseif (y <= 4.7e+30) tmp = 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 = -4.0 * ((t * a) + (x * i));
t_2 = z * (t * (x * (18.0 * y)));
tmp = 0.0;
if (y <= -3.7e+115)
tmp = t_2;
elseif (y <= -1.06e+57)
tmp = (b * c) + (-4.0 * (t * a));
elseif (y <= -2e-111)
tmp = t_1;
elseif (y <= 4.2e-126)
tmp = (b * c) - ((j * 27.0) * k);
elseif (y <= 4.7e+30)
tmp = 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[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.7e+115], t$95$2, If[LessEqual[y, -1.06e+57], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2e-111], t$95$1, If[LessEqual[y, 4.2e-126], N[(N[(b * c), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.7e+30], t$95$1, 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 := -4 \cdot \left(t \cdot a + x \cdot i\right)\\
t_2 := z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right)\\
\mathbf{if}\;y \leq -3.7 \cdot 10^{+115}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;y \leq -1.06 \cdot 10^{+57}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\mathbf{elif}\;y \leq -2 \cdot 10^{-111}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 4.2 \cdot 10^{-126}:\\
\;\;\;\;b \cdot c - \left(j \cdot 27\right) \cdot k\\
\mathbf{elif}\;y \leq 4.7 \cdot 10^{+30}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if y < -3.70000000000000006e115 or 4.6999999999999999e30 < y Initial program 74.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.0%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.9%
Simplified51.9%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6451.1%
Applied egg-rr51.1%
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.6%
Applied egg-rr56.6%
if -3.70000000000000006e115 < y < -1.06e57Initial program 75.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified75.0%
Taylor expanded in j around 0
Simplified75.2%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.4%
Simplified64.4%
if -1.06e57 < y < -2.00000000000000018e-111 or 4.1999999999999997e-126 < y < 4.6999999999999999e30Initial program 87.7%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.1%
Simplified59.1%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6443.6%
Simplified43.6%
if -2.00000000000000018e-111 < y < 4.1999999999999997e-126Initial program 96.3%
Taylor expanded in b around inf
*-lowering-*.f6456.3%
Simplified56.3%
Final simplification54.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -4.0 (* t a))) (t_2 (* (* j 27.0) k)))
(if (<= x -1.25e-73)
(* x (- (- 0.0 (* 4.0 i)) (* (* y z) (* t -18.0))))
(if (<= x -2e-304)
(- t_1 t_2)
(if (<= x 6.8e-245)
(+ (* b c) t_1)
(if (<= x 9.5e-23)
(- (* b c) t_2)
(* x (+ (* i -4.0) (* z (* y (* 18.0 t)))))))))))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 = -4.0 * (t * a);
double t_2 = (j * 27.0) * k;
double tmp;
if (x <= -1.25e-73) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= -2e-304) {
tmp = t_1 - t_2;
} else if (x <= 6.8e-245) {
tmp = (b * c) + t_1;
} else if (x <= 9.5e-23) {
tmp = (b * c) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * (t * a)
t_2 = (j * 27.0d0) * k
if (x <= (-1.25d-73)) then
tmp = x * ((0.0d0 - (4.0d0 * i)) - ((y * z) * (t * (-18.0d0))))
else if (x <= (-2d-304)) then
tmp = t_1 - t_2
else if (x <= 6.8d-245) then
tmp = (b * c) + t_1
else if (x <= 9.5d-23) then
tmp = (b * c) - t_2
else
tmp = x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -4.0 * (t * a);
double t_2 = (j * 27.0) * k;
double tmp;
if (x <= -1.25e-73) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= -2e-304) {
tmp = t_1 - t_2;
} else if (x <= 6.8e-245) {
tmp = (b * c) + t_1;
} else if (x <= 9.5e-23) {
tmp = (b * c) - t_2;
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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 = -4.0 * (t * a) t_2 = (j * 27.0) * k tmp = 0 if x <= -1.25e-73: tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0))) elif x <= -2e-304: tmp = t_1 - t_2 elif x <= 6.8e-245: tmp = (b * c) + t_1 elif x <= 9.5e-23: tmp = (b * c) - t_2 else: tmp = x * ((i * -4.0) + (z * (y * (18.0 * t)))) 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(-4.0 * Float64(t * a)) t_2 = Float64(Float64(j * 27.0) * k) tmp = 0.0 if (x <= -1.25e-73) tmp = Float64(x * Float64(Float64(0.0 - Float64(4.0 * i)) - Float64(Float64(y * z) * Float64(t * -18.0)))); elseif (x <= -2e-304) tmp = Float64(t_1 - t_2); elseif (x <= 6.8e-245) tmp = Float64(Float64(b * c) + t_1); elseif (x <= 9.5e-23) tmp = Float64(Float64(b * c) - t_2); else tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -4.0 * (t * a);
t_2 = (j * 27.0) * k;
tmp = 0.0;
if (x <= -1.25e-73)
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
elseif (x <= -2e-304)
tmp = t_1 - t_2;
elseif (x <= 6.8e-245)
tmp = (b * c) + t_1;
elseif (x <= 9.5e-23)
tmp = (b * c) - t_2;
else
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, If[LessEqual[x, -1.25e-73], N[(x * N[(N[(0.0 - N[(4.0 * i), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(t * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -2e-304], N[(t$95$1 - t$95$2), $MachinePrecision], If[LessEqual[x, 6.8e-245], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[x, 9.5e-23], N[(N[(b * c), $MachinePrecision] - t$95$2), $MachinePrecision], N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a\right)\\
t_2 := \left(j \cdot 27\right) \cdot k\\
\mathbf{if}\;x \leq -1.25 \cdot 10^{-73}:\\
\;\;\;\;x \cdot \left(\left(0 - 4 \cdot i\right) - \left(y \cdot z\right) \cdot \left(t \cdot -18\right)\right)\\
\mathbf{elif}\;x \leq -2 \cdot 10^{-304}:\\
\;\;\;\;t\_1 - t\_2\\
\mathbf{elif}\;x \leq 6.8 \cdot 10^{-245}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{elif}\;x \leq 9.5 \cdot 10^{-23}:\\
\;\;\;\;b \cdot c - t\_2\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if x < -1.25e-73Initial program 81.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified83.7%
Taylor expanded in x around -inf
mul-1-negN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6466.7%
Simplified66.7%
if -1.25e-73 < x < -1.99999999999999994e-304Initial program 89.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6461.2%
Simplified61.2%
if -1.99999999999999994e-304 < x < 6.7999999999999999e-245Initial program 100.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified100.0%
Taylor expanded in j around 0
Simplified81.7%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6487.7%
Simplified87.7%
if 6.7999999999999999e-245 < x < 9.50000000000000058e-23Initial program 90.6%
Taylor expanded in b around inf
*-lowering-*.f6463.8%
Simplified63.8%
if 9.50000000000000058e-23 < x Initial program 75.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified79.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.3%
Simplified72.3%
Final simplification67.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))
(t_2 (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))))
(t_3 (* -4.0 (* t a))))
(if (<= x -1.25e-76)
t_2
(if (<= x -6.2e-305)
(- t_3 t_1)
(if (<= x 5.1e-253)
(+ (* b c) t_3)
(if (<= x 5.8e-25) (- (* b c) t_1) t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
double t_3 = -4.0 * (t * a);
double tmp;
if (x <= -1.25e-76) {
tmp = t_2;
} else if (x <= -6.2e-305) {
tmp = t_3 - t_1;
} else if (x <= 5.1e-253) {
tmp = (b * c) + t_3;
} else if (x <= 5.8e-25) {
tmp = (b * c) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 * 27.0d0) * k
t_2 = x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))
t_3 = (-4.0d0) * (t * a)
if (x <= (-1.25d-76)) then
tmp = t_2
else if (x <= (-6.2d-305)) then
tmp = t_3 - t_1
else if (x <= 5.1d-253) then
tmp = (b * c) + t_3
else if (x <= 5.8d-25) then
tmp = (b * c) - t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (j * 27.0) * k;
double t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
double t_3 = -4.0 * (t * a);
double tmp;
if (x <= -1.25e-76) {
tmp = t_2;
} else if (x <= -6.2e-305) {
tmp = t_3 - t_1;
} else if (x <= 5.1e-253) {
tmp = (b * c) + t_3;
} else if (x <= 5.8e-25) {
tmp = (b * c) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (j * 27.0) * k t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t)))) t_3 = -4.0 * (t * a) tmp = 0 if x <= -1.25e-76: tmp = t_2 elif x <= -6.2e-305: tmp = t_3 - t_1 elif x <= 5.1e-253: tmp = (b * c) + t_3 elif x <= 5.8e-25: tmp = (b * c) - t_1 else: tmp = t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(j * 27.0) * k) t_2 = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) t_3 = Float64(-4.0 * Float64(t * a)) tmp = 0.0 if (x <= -1.25e-76) tmp = t_2; elseif (x <= -6.2e-305) tmp = Float64(t_3 - t_1); elseif (x <= 5.1e-253) tmp = Float64(Float64(b * c) + t_3); elseif (x <= 5.8e-25) tmp = Float64(Float64(b * c) - t_1); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = (j * 27.0) * k;
t_2 = x * ((i * -4.0) + (z * (y * (18.0 * t))));
t_3 = -4.0 * (t * a);
tmp = 0.0;
if (x <= -1.25e-76)
tmp = t_2;
elseif (x <= -6.2e-305)
tmp = t_3 - t_1;
elseif (x <= 5.1e-253)
tmp = (b * c) + t_3;
elseif (x <= 5.8e-25)
tmp = (b * c) - t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.25e-76], t$95$2, If[LessEqual[x, -6.2e-305], N[(t$95$3 - t$95$1), $MachinePrecision], If[LessEqual[x, 5.1e-253], N[(N[(b * c), $MachinePrecision] + t$95$3), $MachinePrecision], If[LessEqual[x, 5.8e-25], N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision], t$95$2]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(j \cdot 27\right) \cdot k\\
t_2 := x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
t_3 := -4 \cdot \left(t \cdot a\right)\\
\mathbf{if}\;x \leq -1.25 \cdot 10^{-76}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq -6.2 \cdot 10^{-305}:\\
\;\;\;\;t\_3 - t\_1\\
\mathbf{elif}\;x \leq 5.1 \cdot 10^{-253}:\\
\;\;\;\;b \cdot c + t\_3\\
\mathbf{elif}\;x \leq 5.8 \cdot 10^{-25}:\\
\;\;\;\;b \cdot c - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -1.2499999999999999e-76 or 5.8000000000000001e-25 < x Initial program 78.5%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified81.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.9%
Simplified69.9%
if -1.2499999999999999e-76 < x < -6.1999999999999997e-305Initial program 89.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6461.2%
Simplified61.2%
if -6.1999999999999997e-305 < x < 5.10000000000000008e-253Initial program 100.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified100.0%
Taylor expanded in j around 0
Simplified81.7%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6487.7%
Simplified87.7%
if 5.10000000000000008e-253 < x < 5.8000000000000001e-25Initial program 90.6%
Taylor expanded in b around inf
*-lowering-*.f6463.8%
Simplified63.8%
Final simplification68.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 (<= x -1.7e+116)
(* x (- (- 0.0 (* 4.0 i)) (* (* y z) (* t -18.0))))
(if (<= x 8e+134)
(+
(* t (+ (* (* (* x 18.0) y) z) (* a -4.0)))
(+ (* b c) (* -27.0 (* j k))))
(+ (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))) (* -4.0 (* t a))))))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 <= -1.7e+116) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 8e+134) {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-27.0 * (j * k)));
} else {
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a));
}
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 <= (-1.7d+116)) then
tmp = x * ((0.0d0 - (4.0d0 * i)) - ((y * z) * (t * (-18.0d0))))
else if (x <= 8d+134) then
tmp = (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))) + ((b * c) + ((-27.0d0) * (j * k)))
else
tmp = (x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))) + ((-4.0d0) * (t * a))
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 <= -1.7e+116) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 8e+134) {
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-27.0 * (j * k)));
} else {
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a));
}
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 <= -1.7e+116: tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0))) elif x <= 8e+134: tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-27.0 * (j * k))) else: tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a)) 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 <= -1.7e+116) tmp = Float64(x * Float64(Float64(0.0 - Float64(4.0 * i)) - Float64(Float64(y * z) * Float64(t * -18.0)))); elseif (x <= 8e+134) tmp = Float64(Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) + Float64(Float64(b * c) + Float64(-27.0 * Float64(j * k)))); else tmp = Float64(Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) + Float64(-4.0 * Float64(t * a))); 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 <= -1.7e+116)
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
elseif (x <= 8e+134)
tmp = (t * ((((x * 18.0) * y) * z) + (a * -4.0))) + ((b * c) + (-27.0 * (j * k)));
else
tmp = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + (-4.0 * (t * a));
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, -1.7e+116], N[(x * N[(N[(0.0 - N[(4.0 * i), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(t * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8e+134], N[(N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-4.0 * N[(t * a), $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 -1.7 \cdot 10^{+116}:\\
\;\;\;\;x \cdot \left(\left(0 - 4 \cdot i\right) - \left(y \cdot z\right) \cdot \left(t \cdot -18\right)\right)\\
\mathbf{elif}\;x \leq 8 \cdot 10^{+134}:\\
\;\;\;\;t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right) + \left(b \cdot c + -27 \cdot \left(j \cdot k\right)\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right) + -4 \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if x < -1.70000000000000011e116Initial program 68.6%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified73.5%
Taylor expanded in x around -inf
mul-1-negN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6480.8%
Simplified80.8%
if -1.70000000000000011e116 < x < 7.99999999999999937e134Initial program 90.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified93.2%
Taylor expanded in b around inf
*-lowering-*.f6483.8%
Simplified83.8%
if 7.99999999999999937e134 < x Initial program 70.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified70.7%
Taylor expanded in j around 0
Simplified85.8%
Taylor expanded in b around 0
*-lowering-*.f64N/A
*-lowering-*.f6483.3%
Simplified83.3%
Final simplification83.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 (* z (* t (* x (* 18.0 y))))))
(if (<= y -1.5e+118)
t_1
(if (<= y 1.9e-287)
(+ (* b c) (* -4.0 (* t a)))
(if (<= y 3.7e-174)
(* j (* k -27.0))
(if (<= y 9.5e+29) (* -4.0 (+ (* t a) (* x i))) 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 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -1.5e+118) {
tmp = t_1;
} else if (y <= 1.9e-287) {
tmp = (b * c) + (-4.0 * (t * a));
} else if (y <= 3.7e-174) {
tmp = j * (k * -27.0);
} else if (y <= 9.5e+29) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = z * (t * (x * (18.0d0 * y)))
if (y <= (-1.5d+118)) then
tmp = t_1
else if (y <= 1.9d-287) then
tmp = (b * c) + ((-4.0d0) * (t * a))
else if (y <= 3.7d-174) then
tmp = j * (k * (-27.0d0))
else if (y <= 9.5d+29) then
tmp = (-4.0d0) * ((t * a) + (x * i))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -1.5e+118) {
tmp = t_1;
} else if (y <= 1.9e-287) {
tmp = (b * c) + (-4.0 * (t * a));
} else if (y <= 3.7e-174) {
tmp = j * (k * -27.0);
} else if (y <= 9.5e+29) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = z * (t * (x * (18.0 * y))) tmp = 0 if y <= -1.5e+118: tmp = t_1 elif y <= 1.9e-287: tmp = (b * c) + (-4.0 * (t * a)) elif y <= 3.7e-174: tmp = j * (k * -27.0) elif y <= 9.5e+29: tmp = -4.0 * ((t * a) + (x * i)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) tmp = 0.0 if (y <= -1.5e+118) tmp = t_1; elseif (y <= 1.9e-287) tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))); elseif (y <= 3.7e-174) tmp = Float64(j * Float64(k * -27.0)); elseif (y <= 9.5e+29) tmp = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = z * (t * (x * (18.0 * y)));
tmp = 0.0;
if (y <= -1.5e+118)
tmp = t_1;
elseif (y <= 1.9e-287)
tmp = (b * c) + (-4.0 * (t * a));
elseif (y <= 3.7e-174)
tmp = j * (k * -27.0);
elseif (y <= 9.5e+29)
tmp = -4.0 * ((t * a) + (x * i));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.5e+118], t$95$1, If[LessEqual[y, 1.9e-287], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.7e-174], N[(j * N[(k * -27.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 9.5e+29], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right)\\
\mathbf{if}\;y \leq -1.5 \cdot 10^{+118}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 1.9 \cdot 10^{-287}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{-174}:\\
\;\;\;\;j \cdot \left(k \cdot -27\right)\\
\mathbf{elif}\;y \leq 9.5 \cdot 10^{+29}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if y < -1.5e118 or 9.5000000000000003e29 < y Initial program 74.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.0%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.9%
Simplified51.9%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6451.1%
Applied egg-rr51.1%
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.6%
Applied egg-rr56.6%
if -1.5e118 < y < 1.89999999999999991e-287Initial program 90.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified91.9%
Taylor expanded in j around 0
Simplified73.4%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.6%
Simplified46.6%
if 1.89999999999999991e-287 < y < 3.7000000000000001e-174Initial program 100.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified100.0%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6446.1%
Simplified46.1%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.0%
Applied egg-rr46.0%
if 3.7000000000000001e-174 < y < 9.5000000000000003e29Initial program 83.0%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6455.2%
Simplified55.2%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6444.1%
Simplified44.1%
Final simplification50.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
(let* ((t_1 (* -4.0 (* t a)))
(t_2 (+ (* x (+ (* i -4.0) (* z (* y (* 18.0 t))))) t_1)))
(if (<= x -7.2e-83)
t_2
(if (<= x 9.8e-23) (- (+ (* b c) t_1) (* (* j 27.0) k)) t_2))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -4.0 * (t * a);
double t_2 = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + t_1;
double tmp;
if (x <= -7.2e-83) {
tmp = t_2;
} else if (x <= 9.8e-23) {
tmp = ((b * c) + t_1) - ((j * 27.0) * k);
} 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 = (-4.0d0) * (t * a)
t_2 = (x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))) + t_1
if (x <= (-7.2d-83)) then
tmp = t_2
else if (x <= 9.8d-23) then
tmp = ((b * c) + t_1) - ((j * 27.0d0) * k)
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 = -4.0 * (t * a);
double t_2 = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + t_1;
double tmp;
if (x <= -7.2e-83) {
tmp = t_2;
} else if (x <= 9.8e-23) {
tmp = ((b * c) + t_1) - ((j * 27.0) * k);
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * (t * a) t_2 = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + t_1 tmp = 0 if x <= -7.2e-83: tmp = t_2 elif x <= 9.8e-23: tmp = ((b * c) + t_1) - ((j * 27.0) * k) else: tmp = t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-4.0 * Float64(t * a)) t_2 = Float64(Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))) + t_1) tmp = 0.0 if (x <= -7.2e-83) tmp = t_2; elseif (x <= 9.8e-23) tmp = Float64(Float64(Float64(b * c) + t_1) - Float64(Float64(j * 27.0) * k)); 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 = -4.0 * (t * a);
t_2 = (x * ((i * -4.0) + (z * (y * (18.0 * t))))) + t_1;
tmp = 0.0;
if (x <= -7.2e-83)
tmp = t_2;
elseif (x <= 9.8e-23)
tmp = ((b * c) + t_1) - ((j * 27.0) * k);
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[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[x, -7.2e-83], t$95$2, If[LessEqual[x, 9.8e-23], N[(N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a\right)\\
t_2 := x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right) + t\_1\\
\mathbf{if}\;x \leq -7.2 \cdot 10^{-83}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq 9.8 \cdot 10^{-23}:\\
\;\;\;\;\left(b \cdot c + t\_1\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -7.20000000000000025e-83 or 9.7999999999999996e-23 < x Initial program 78.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified81.5%
Taylor expanded in j around 0
Simplified81.3%
Taylor expanded in b around 0
*-lowering-*.f64N/A
*-lowering-*.f6472.9%
Simplified72.9%
if -7.20000000000000025e-83 < x < 9.7999999999999996e-23Initial program 92.4%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6479.0%
Simplified79.0%
Final simplification75.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 (<= (* b c) -6.5e+161)
(* b c)
(if (<= (* b c) -1.8e-61)
(* -4.0 (* t a))
(if (<= (* b c) 1.15e-79) (* -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) <= -6.5e+161) {
tmp = b * c;
} else if ((b * c) <= -1.8e-61) {
tmp = -4.0 * (t * a);
} else if ((b * c) <= 1.15e-79) {
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) <= (-6.5d+161)) then
tmp = b * c
else if ((b * c) <= (-1.8d-61)) then
tmp = (-4.0d0) * (t * a)
else if ((b * c) <= 1.15d-79) 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) <= -6.5e+161) {
tmp = b * c;
} else if ((b * c) <= -1.8e-61) {
tmp = -4.0 * (t * a);
} else if ((b * c) <= 1.15e-79) {
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) <= -6.5e+161: tmp = b * c elif (b * c) <= -1.8e-61: tmp = -4.0 * (t * a) elif (b * c) <= 1.15e-79: 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) <= -6.5e+161) tmp = Float64(b * c); elseif (Float64(b * c) <= -1.8e-61) tmp = Float64(-4.0 * Float64(t * a)); elseif (Float64(b * c) <= 1.15e-79) 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) <= -6.5e+161)
tmp = b * c;
elseif ((b * c) <= -1.8e-61)
tmp = -4.0 * (t * a);
elseif ((b * c) <= 1.15e-79)
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], -6.5e+161], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -1.8e-61], N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.15e-79], 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 -6.5 \cdot 10^{+161}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -1.8 \cdot 10^{-61}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right)\\
\mathbf{elif}\;b \cdot c \leq 1.15 \cdot 10^{-79}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -6.5e161 or 1.15000000000000006e-79 < (*.f64 b c) Initial program 84.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified87.0%
Taylor expanded in b around inf
*-lowering-*.f6451.5%
Simplified51.5%
if -6.5e161 < (*.f64 b c) < -1.80000000000000007e-61Initial program 89.9%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified89.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6430.4%
Simplified30.4%
if -1.80000000000000007e-61 < (*.f64 b c) < 1.15000000000000006e-79Initial program 81.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.1%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6433.0%
Simplified33.0%
Final simplification40.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 (<= (* b c) -1.65e+193)
(* b c)
(if (<= (* b c) -2.8e-56)
(* -27.0 (* j k))
(if (<= (* b c) 2.9e-80) (* -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.65e+193) {
tmp = b * c;
} else if ((b * c) <= -2.8e-56) {
tmp = -27.0 * (j * k);
} else if ((b * c) <= 2.9e-80) {
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.65d+193)) then
tmp = b * c
else if ((b * c) <= (-2.8d-56)) then
tmp = (-27.0d0) * (j * k)
else if ((b * c) <= 2.9d-80) 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.65e+193) {
tmp = b * c;
} else if ((b * c) <= -2.8e-56) {
tmp = -27.0 * (j * k);
} else if ((b * c) <= 2.9e-80) {
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.65e+193: tmp = b * c elif (b * c) <= -2.8e-56: tmp = -27.0 * (j * k) elif (b * c) <= 2.9e-80: 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.65e+193) tmp = Float64(b * c); elseif (Float64(b * c) <= -2.8e-56) tmp = Float64(-27.0 * Float64(j * k)); elseif (Float64(b * c) <= 2.9e-80) 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.65e+193)
tmp = b * c;
elseif ((b * c) <= -2.8e-56)
tmp = -27.0 * (j * k);
elseif ((b * c) <= 2.9e-80)
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.65e+193], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -2.8e-56], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 2.9e-80], 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.65 \cdot 10^{+193}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -2.8 \cdot 10^{-56}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;b \cdot c \leq 2.9 \cdot 10^{-80}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.65e193 or 2.89999999999999998e-80 < (*.f64 b c) Initial program 83.8%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.7%
Taylor expanded in b around inf
*-lowering-*.f6452.0%
Simplified52.0%
if -1.65e193 < (*.f64 b c) < -2.79999999999999993e-56Initial program 90.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified90.3%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6427.4%
Simplified27.4%
if -2.79999999999999993e-56 < (*.f64 b c) < 2.89999999999999998e-80Initial program 81.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.2%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6432.7%
Simplified32.7%
Final simplification39.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 (<= x -2.05e+76)
(* x (- (- 0.0 (* 4.0 i)) (* (* y z) (* t -18.0))))
(if (<= x 9.8e-23)
(- (+ (* b c) (* -4.0 (* t a))) (* (* j 27.0) k))
(* x (+ (* i -4.0) (* z (* y (* 18.0 t))))))))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 <= -2.05e+76) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 9.8e-23) {
tmp = ((b * c) + (-4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 <= (-2.05d+76)) then
tmp = x * ((0.0d0 - (4.0d0 * i)) - ((y * z) * (t * (-18.0d0))))
else if (x <= 9.8d-23) then
tmp = ((b * c) + ((-4.0d0) * (t * a))) - ((j * 27.0d0) * k)
else
tmp = x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 <= -2.05e+76) {
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
} else if (x <= 9.8e-23) {
tmp = ((b * c) + (-4.0 * (t * a))) - ((j * 27.0) * k);
} else {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
}
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 <= -2.05e+76: tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0))) elif x <= 9.8e-23: tmp = ((b * c) + (-4.0 * (t * a))) - ((j * 27.0) * k) else: tmp = x * ((i * -4.0) + (z * (y * (18.0 * t)))) 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 <= -2.05e+76) tmp = Float64(x * Float64(Float64(0.0 - Float64(4.0 * i)) - Float64(Float64(y * z) * Float64(t * -18.0)))); elseif (x <= 9.8e-23) tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
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 <= -2.05e+76)
tmp = x * ((0.0 - (4.0 * i)) - ((y * z) * (t * -18.0)));
elseif (x <= 9.8e-23)
tmp = ((b * c) + (-4.0 * (t * a))) - ((j * 27.0) * k);
else
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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, -2.05e+76], N[(x * N[(N[(0.0 - N[(4.0 * i), $MachinePrecision]), $MachinePrecision] - N[(N[(y * z), $MachinePrecision] * N[(t * -18.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 9.8e-23], 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[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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 -2.05 \cdot 10^{+76}:\\
\;\;\;\;x \cdot \left(\left(0 - 4 \cdot i\right) - \left(y \cdot z\right) \cdot \left(t \cdot -18\right)\right)\\
\mathbf{elif}\;x \leq 9.8 \cdot 10^{-23}:\\
\;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if x < -2.0499999999999999e76Initial program 71.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified75.9%
Taylor expanded in x around -inf
mul-1-negN/A
metadata-evalN/A
cancel-sign-sub-invN/A
*-commutativeN/A
distribute-rgt-neg-inN/A
mul-1-negN/A
*-lowering-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
mul-1-negN/A
neg-lowering-neg.f6480.4%
Simplified80.4%
if -2.0499999999999999e76 < x < 9.7999999999999996e-23Initial program 92.2%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6472.8%
Simplified72.8%
if 9.7999999999999996e-23 < x Initial program 75.4%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified79.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.3%
Simplified72.3%
Final simplification74.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 (<= y -1.52e+116)
(* x (+ (* i -4.0) (* z (* y (* 18.0 t)))))
(if (<= y 1.28e-17)
(- (* -4.0 (+ (* t a) (* x i))) (* (* j 27.0) k))
(* t (+ (* a -4.0) (* x (* 18.0 (* y z))))))))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 (y <= -1.52e+116) {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
} else if (y <= 1.28e-17) {
tmp = (-4.0 * ((t * a) + (x * i))) - ((j * 27.0) * k);
} else {
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
}
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 (y <= (-1.52d+116)) then
tmp = x * ((i * (-4.0d0)) + (z * (y * (18.0d0 * t))))
else if (y <= 1.28d-17) then
tmp = ((-4.0d0) * ((t * a) + (x * i))) - ((j * 27.0d0) * k)
else
tmp = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
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 (y <= -1.52e+116) {
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
} else if (y <= 1.28e-17) {
tmp = (-4.0 * ((t * a) + (x * i))) - ((j * 27.0) * k);
} else {
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
}
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 y <= -1.52e+116: tmp = x * ((i * -4.0) + (z * (y * (18.0 * t)))) elif y <= 1.28e-17: tmp = (-4.0 * ((t * a) + (x * i))) - ((j * 27.0) * k) else: tmp = t * ((a * -4.0) + (x * (18.0 * (y * z)))) 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 (y <= -1.52e+116) tmp = Float64(x * Float64(Float64(i * -4.0) + Float64(z * Float64(y * Float64(18.0 * t))))); elseif (y <= 1.28e-17) tmp = Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) - Float64(Float64(j * 27.0) * k)); else tmp = Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))); 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 (y <= -1.52e+116)
tmp = x * ((i * -4.0) + (z * (y * (18.0 * t))));
elseif (y <= 1.28e-17)
tmp = (-4.0 * ((t * a) + (x * i))) - ((j * 27.0) * k);
else
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
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[y, -1.52e+116], N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.28e-17], N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -1.52 \cdot 10^{+116}:\\
\;\;\;\;x \cdot \left(i \cdot -4 + z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\mathbf{elif}\;y \leq 1.28 \cdot 10^{-17}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right) - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\end{array}
\end{array}
if y < -1.52e116Initial program 80.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified82.9%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.7%
Simplified64.7%
if -1.52e116 < y < 1.28e-17Initial program 91.1%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6458.5%
Simplified58.5%
Taylor expanded in t around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6458.5%
Simplified58.5%
if 1.28e-17 < y Initial program 70.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified78.0%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6457.0%
Simplified57.0%
Final simplification59.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) (* x (* 18.0 (* y z)))))))
(if (<= t -3.9e-61)
t_1
(if (<= t 1.02e+93) (- (* b c) (* (* j 27.0) k)) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -3.9e-61) {
tmp = t_1;
} else if (t <= 1.02e+93) {
tmp = (b * c) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
if (t <= (-3.9d-61)) then
tmp = t_1
else if (t <= 1.02d+93) then
tmp = (b * c) - ((j * 27.0d0) * k)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -3.9e-61) {
tmp = t_1;
} else if (t <= 1.02e+93) {
tmp = (b * c) - ((j * 27.0) * k);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z)))) tmp = 0 if t <= -3.9e-61: tmp = t_1 elif t <= 1.02e+93: tmp = (b * c) - ((j * 27.0) * k) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) tmp = 0.0 if (t <= -3.9e-61) tmp = t_1; elseif (t <= 1.02e+93) tmp = Float64(Float64(b * c) - Float64(Float64(j * 27.0) * k)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
tmp = 0.0;
if (t <= -3.9e-61)
tmp = t_1;
elseif (t <= 1.02e+93)
tmp = (b * c) - ((j * 27.0) * k);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.9e-61], t$95$1, If[LessEqual[t, 1.02e+93], N[(N[(b * c), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;t \leq -3.9 \cdot 10^{-61}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 1.02 \cdot 10^{+93}:\\
\;\;\;\;b \cdot c - \left(j \cdot 27\right) \cdot k\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -3.90000000000000033e-61 or 1.0200000000000001e93 < t Initial program 82.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified88.6%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.6%
Simplified70.6%
if -3.90000000000000033e-61 < t < 1.0200000000000001e93Initial program 85.6%
Taylor expanded in b around inf
*-lowering-*.f6452.5%
Simplified52.5%
Final simplification60.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 (<= (* b c) -2.1e+209) (* b c) (if (<= (* b c) 1.4e+153) (* -4.0 (+ (* t a) (* 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) <= -2.1e+209) {
tmp = b * c;
} else if ((b * c) <= 1.4e+153) {
tmp = -4.0 * ((t * a) + (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) <= (-2.1d+209)) then
tmp = b * c
else if ((b * c) <= 1.4d+153) then
tmp = (-4.0d0) * ((t * a) + (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) <= -2.1e+209) {
tmp = b * c;
} else if ((b * c) <= 1.4e+153) {
tmp = -4.0 * ((t * a) + (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) <= -2.1e+209: tmp = b * c elif (b * c) <= 1.4e+153: tmp = -4.0 * ((t * a) + (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) <= -2.1e+209) tmp = Float64(b * c); elseif (Float64(b * c) <= 1.4e+153) tmp = Float64(-4.0 * Float64(Float64(t * a) + 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) <= -2.1e+209)
tmp = b * c;
elseif ((b * c) <= 1.4e+153)
tmp = -4.0 * ((t * a) + (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], -2.1e+209], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.4e+153], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $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 -2.1 \cdot 10^{+209}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq 1.4 \cdot 10^{+153}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -2.1e209 or 1.39999999999999993e153 < (*.f64 b c) Initial program 82.8%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified85.7%
Taylor expanded in b around inf
*-lowering-*.f6467.0%
Simplified67.0%
if -2.1e209 < (*.f64 b c) < 1.39999999999999993e153Initial program 84.6%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.6%
Simplified62.6%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6442.6%
Simplified42.6%
Final simplification49.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 (* z (* t (* x (* 18.0 y))))))
(if (<= y -5.8e+116)
t_1
(if (<= y 7.3e+30) (* -4.0 (+ (* t a) (* x i))) 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 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -5.8e+116) {
tmp = t_1;
} else if (y <= 7.3e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = z * (t * (x * (18.0d0 * y)))
if (y <= (-5.8d+116)) then
tmp = t_1
else if (y <= 7.3d+30) then
tmp = (-4.0d0) * ((t * a) + (x * i))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = z * (t * (x * (18.0 * y)));
double tmp;
if (y <= -5.8e+116) {
tmp = t_1;
} else if (y <= 7.3e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = z * (t * (x * (18.0 * y))) tmp = 0 if y <= -5.8e+116: tmp = t_1 elif y <= 7.3e+30: tmp = -4.0 * ((t * a) + (x * i)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) tmp = 0.0 if (y <= -5.8e+116) tmp = t_1; elseif (y <= 7.3e+30) tmp = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = z * (t * (x * (18.0 * y)));
tmp = 0.0;
if (y <= -5.8e+116)
tmp = t_1;
elseif (y <= 7.3e+30)
tmp = -4.0 * ((t * a) + (x * i));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -5.8e+116], t$95$1, If[LessEqual[y, 7.3e+30], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right)\\
\mathbf{if}\;y \leq -5.8 \cdot 10^{+116}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 7.3 \cdot 10^{+30}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if y < -5.8000000000000003e116 or 7.2999999999999998e30 < y Initial program 74.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.0%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.9%
Simplified51.9%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6451.1%
Applied egg-rr51.1%
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6456.6%
Applied egg-rr56.6%
if -5.8000000000000003e116 < y < 7.2999999999999998e30Initial program 90.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.3%
Simplified59.3%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6438.6%
Simplified38.6%
Final simplification45.6%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= y -3.1e+116)
(* z (* x (* 18.0 (* y t))))
(if (<= y 4.8e+30)
(* -4.0 (+ (* t a) (* x i)))
(* x (* 18.0 (* t (* y z)))))))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 (y <= -3.1e+116) {
tmp = z * (x * (18.0 * (y * t)));
} else if (y <= 4.8e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = x * (18.0 * (t * (y * z)));
}
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 (y <= (-3.1d+116)) then
tmp = z * (x * (18.0d0 * (y * t)))
else if (y <= 4.8d+30) then
tmp = (-4.0d0) * ((t * a) + (x * i))
else
tmp = x * (18.0d0 * (t * (y * z)))
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 (y <= -3.1e+116) {
tmp = z * (x * (18.0 * (y * t)));
} else if (y <= 4.8e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = x * (18.0 * (t * (y * z)));
}
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 y <= -3.1e+116: tmp = z * (x * (18.0 * (y * t))) elif y <= 4.8e+30: tmp = -4.0 * ((t * a) + (x * i)) else: tmp = x * (18.0 * (t * (y * z))) 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 (y <= -3.1e+116) tmp = Float64(z * Float64(x * Float64(18.0 * Float64(y * t)))); elseif (y <= 4.8e+30) tmp = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))); else tmp = Float64(x * Float64(18.0 * Float64(t * Float64(y * z)))); 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 (y <= -3.1e+116)
tmp = z * (x * (18.0 * (y * t)));
elseif (y <= 4.8e+30)
tmp = -4.0 * ((t * a) + (x * i));
else
tmp = x * (18.0 * (t * (y * z)));
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[y, -3.1e+116], N[(z * N[(x * N[(18.0 * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.8e+30], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(18.0 * N[(t * N[(y * z), $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}\;y \leq -3.1 \cdot 10^{+116}:\\
\;\;\;\;z \cdot \left(x \cdot \left(18 \cdot \left(y \cdot t\right)\right)\right)\\
\mathbf{elif}\;y \leq 4.8 \cdot 10^{+30}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\\
\end{array}
\end{array}
if y < -3.09999999999999996e116Initial program 80.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified82.9%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.0%
Simplified54.0%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6451.7%
Applied egg-rr51.7%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.7%
Applied egg-rr51.7%
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*l*N/A
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6458.0%
Applied egg-rr58.0%
if -3.09999999999999996e116 < y < 4.7999999999999999e30Initial program 90.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.3%
Simplified59.3%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6438.6%
Simplified38.6%
if 4.7999999999999999e30 < y Initial program 68.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified77.6%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.2%
Simplified50.2%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6450.5%
Applied egg-rr50.5%
Final simplification44.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 (<= y -2.9e+118)
(* x (* z (* y (* 18.0 t))))
(if (<= y 1.45e+30)
(* -4.0 (+ (* t a) (* x i)))
(* x (* 18.0 (* t (* y z)))))))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 (y <= -2.9e+118) {
tmp = x * (z * (y * (18.0 * t)));
} else if (y <= 1.45e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = x * (18.0 * (t * (y * z)));
}
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 (y <= (-2.9d+118)) then
tmp = x * (z * (y * (18.0d0 * t)))
else if (y <= 1.45d+30) then
tmp = (-4.0d0) * ((t * a) + (x * i))
else
tmp = x * (18.0d0 * (t * (y * z)))
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 (y <= -2.9e+118) {
tmp = x * (z * (y * (18.0 * t)));
} else if (y <= 1.45e+30) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = x * (18.0 * (t * (y * z)));
}
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 y <= -2.9e+118: tmp = x * (z * (y * (18.0 * t))) elif y <= 1.45e+30: tmp = -4.0 * ((t * a) + (x * i)) else: tmp = x * (18.0 * (t * (y * z))) 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 (y <= -2.9e+118) tmp = Float64(x * Float64(z * Float64(y * Float64(18.0 * t)))); elseif (y <= 1.45e+30) tmp = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))); else tmp = Float64(x * Float64(18.0 * Float64(t * Float64(y * z)))); 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 (y <= -2.9e+118)
tmp = x * (z * (y * (18.0 * t)));
elseif (y <= 1.45e+30)
tmp = -4.0 * ((t * a) + (x * i));
else
tmp = x * (18.0 * (t * (y * z)));
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[y, -2.9e+118], N[(x * N[(z * N[(y * N[(18.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.45e+30], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(18.0 * N[(t * N[(y * z), $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}\;y \leq -2.9 \cdot 10^{+118}:\\
\;\;\;\;x \cdot \left(z \cdot \left(y \cdot \left(18 \cdot t\right)\right)\right)\\
\mathbf{elif}\;y \leq 1.45 \cdot 10^{+30}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(18 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\\
\end{array}
\end{array}
if y < -2.90000000000000016e118Initial program 80.7%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified82.9%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.0%
Simplified54.0%
if -2.90000000000000016e118 < y < 1.4499999999999999e30Initial program 90.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.3%
Simplified59.3%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6438.6%
Simplified38.6%
if 1.4499999999999999e30 < y Initial program 68.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified77.6%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.2%
Simplified50.2%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6450.5%
Applied egg-rr50.5%
Final simplification43.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 (* x (* 18.0 (* t (* y z))))))
(if (<= y -9e+116)
t_1
(if (<= y 2.95e+29) (* -4.0 (+ (* t a) (* x i))) 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 * (18.0 * (t * (y * z)));
double tmp;
if (y <= -9e+116) {
tmp = t_1;
} else if (y <= 2.95e+29) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 * (18.0d0 * (t * (y * z)))
if (y <= (-9d+116)) then
tmp = t_1
else if (y <= 2.95d+29) then
tmp = (-4.0d0) * ((t * a) + (x * i))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * (18.0 * (t * (y * z)));
double tmp;
if (y <= -9e+116) {
tmp = t_1;
} else if (y <= 2.95e+29) {
tmp = -4.0 * ((t * a) + (x * i));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = x * (18.0 * (t * (y * z))) tmp = 0 if y <= -9e+116: tmp = t_1 elif y <= 2.95e+29: tmp = -4.0 * ((t * a) + (x * i)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(x * Float64(18.0 * Float64(t * Float64(y * z)))) tmp = 0.0 if (y <= -9e+116) tmp = t_1; elseif (y <= 2.95e+29) tmp = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = x * (18.0 * (t * (y * z)));
tmp = 0.0;
if (y <= -9e+116)
tmp = t_1;
elseif (y <= 2.95e+29)
tmp = -4.0 * ((t * a) + (x * i));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(18.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9e+116], t$95$1, If[LessEqual[y, 2.95e+29], N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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(18 \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;y \leq -9 \cdot 10^{+116}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq 2.95 \cdot 10^{+29}:\\
\;\;\;\;-4 \cdot \left(t \cdot a + x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if y < -9.00000000000000032e116 or 2.9499999999999999e29 < y Initial program 74.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified80.0%
Taylor expanded in y around inf
*-commutativeN/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6451.9%
Simplified51.9%
associate-*l*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6451.1%
Applied egg-rr51.1%
if -9.00000000000000032e116 < y < 2.9499999999999999e29Initial program 90.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.3%
Simplified59.3%
Taylor expanded in j around 0
cancel-sign-sub-invN/A
metadata-evalN/A
distribute-lft-outN/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6438.6%
Simplified38.6%
Final simplification43.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) -1.7e+193) (* b c) (if (<= (* b c) 3.7e+84) (* -27.0 (* j k)) (* b c))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
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.7e+193) {
tmp = b * c;
} else if ((b * c) <= 3.7e+84) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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.7d+193)) then
tmp = b * c
else if ((b * c) <= 3.7d+84) then
tmp = (-27.0d0) * (j * k)
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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.7e+193) {
tmp = b * c;
} else if ((b * c) <= 3.7e+84) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) [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.7e+193: tmp = b * c elif (b * c) <= 3.7e+84: tmp = -27.0 * (j * k) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) 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.7e+193) tmp = Float64(b * c); elseif (Float64(b * c) <= 3.7e+84) tmp = Float64(-27.0 * Float64(j * k)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
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.7e+193)
tmp = b * c;
elseif ((b * c) <= 3.7e+84)
tmp = -27.0 * (j * k);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. 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.7e+193], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 3.7e+84], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\\\
[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.7 \cdot 10^{+193}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq 3.7 \cdot 10^{+84}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.69999999999999993e193 or 3.7e84 < (*.f64 b c) Initial program 84.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.7%
Taylor expanded in b around inf
*-lowering-*.f6460.5%
Simplified60.5%
if -1.69999999999999993e193 < (*.f64 b c) < 3.7e84Initial program 84.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.9%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6426.1%
Simplified26.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 84.1%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified86.8%
Taylor expanded in b around inf
*-lowering-*.f6424.5%
Simplified24.5%
(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 2024150
(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)))