
(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 32 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i j k) :precision binary64 (- (- (+ (- (* (* (* (* x 18.0) y) z) t) (* (* a 4.0) t)) (* b c)) (* (* x 4.0) i)) (* (* j 27.0) k)))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
code = (((((((x * 18.0d0) * y) * z) * t) - ((a * 4.0d0) * t)) + (b * c)) - ((x * 4.0d0) * i)) - ((j * 27.0d0) * k)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k);
}
def code(x, y, z, t, a, b, c, i, j, k): return (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k)
function code(x, y, z, t, a, b, c, i, j, k) return Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t) - Float64(Float64(a * 4.0) * t)) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) - Float64(Float64(j * 27.0) * k)) end
function tmp = code(x, y, z, t, a, b, c, i, j, k) tmp = (((((((x * 18.0) * y) * z) * t) - ((a * 4.0) * t)) + (b * c)) - ((x * 4.0) * i)) - ((j * 27.0) * k); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(N[(N[(N[(N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(N[(j * 27.0), $MachinePrecision] * k), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t - \left(a \cdot 4\right) \cdot t\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i\right) - \left(j \cdot 27\right) \cdot k
\end{array}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* (* x 18.0) y) z)))
(if (<=
(- (+ (- (* t_1 t) (* t (* a 4.0))) (* b c)) (* (* x 4.0) i))
2e+305)
(+
(* t (+ t_1 (* a -4.0)))
(+ (* -27.0 (* j k)) (+ (* b c) (* x (* i -4.0)))))
(-
(* b (+ c (* x (+ (/ (* i -4.0) b) (/ (* t (* 18.0 (* y z))) b)))))
(* k (* j 27.0))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = ((x * 18.0) * y) * z;
double tmp;
if (((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) <= 2e+305) {
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * (18.0 * (y * z))) / b))))) - (k * (j * 27.0));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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) * y) * z
if (((((t_1 * t) - (t * (a * 4.0d0))) + (b * c)) - ((x * 4.0d0) * i)) <= 2d+305) then
tmp = (t * (t_1 + (a * (-4.0d0)))) + (((-27.0d0) * (j * k)) + ((b * c) + (x * (i * (-4.0d0)))))
else
tmp = (b * (c + (x * (((i * (-4.0d0)) / b) + ((t * (18.0d0 * (y * z))) / b))))) - (k * (j * 27.0d0))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = ((x * 18.0) * y) * z;
double tmp;
if (((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) <= 2e+305) {
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
} else {
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * (18.0 * (y * z))) / b))))) - (k * (j * 27.0));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = ((x * 18.0) * y) * z tmp = 0 if ((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) <= 2e+305: tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0)))) else: tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * (18.0 * (y * z))) / b))))) - (k * (j * 27.0)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(Float64(x * 18.0) * y) * z) tmp = 0.0 if (Float64(Float64(Float64(Float64(t_1 * t) - Float64(t * Float64(a * 4.0))) + Float64(b * c)) - Float64(Float64(x * 4.0) * i)) <= 2e+305) tmp = Float64(Float64(t * Float64(t_1 + Float64(a * -4.0))) + Float64(Float64(-27.0 * Float64(j * k)) + Float64(Float64(b * c) + Float64(x * Float64(i * -4.0))))); else tmp = Float64(Float64(b * Float64(c + Float64(x * Float64(Float64(Float64(i * -4.0) / b) + Float64(Float64(t * Float64(18.0 * Float64(y * z))) / b))))) - Float64(k * Float64(j * 27.0))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = ((x * 18.0) * y) * z;
tmp = 0.0;
if (((((t_1 * t) - (t * (a * 4.0))) + (b * c)) - ((x * 4.0) * i)) <= 2e+305)
tmp = (t * (t_1 + (a * -4.0))) + ((-27.0 * (j * k)) + ((b * c) + (x * (i * -4.0))));
else
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * (18.0 * (y * z))) / b))))) - (k * (j * 27.0));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(t$95$1 * t), $MachinePrecision] - N[(t * N[(a * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * c), $MachinePrecision]), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision], 2e+305], N[(N[(t * N[(t$95$1 + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision] + N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * N[(c + N[(x * N[(N[(N[(i * -4.0), $MachinePrecision] / b), $MachinePrecision] + N[(N[(t * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(\left(x \cdot 18\right) \cdot y\right) \cdot z\\
\mathbf{if}\;\left(\left(t\_1 \cdot t - t \cdot \left(a \cdot 4\right)\right) + b \cdot c\right) - \left(x \cdot 4\right) \cdot i \leq 2 \cdot 10^{+305}:\\
\;\;\;\;t \cdot \left(t\_1 + a \cdot -4\right) + \left(-27 \cdot \left(j \cdot k\right) + \left(b \cdot c + x \cdot \left(i \cdot -4\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(c + x \cdot \left(\frac{i \cdot -4}{b} + \frac{t \cdot \left(18 \cdot \left(y \cdot z\right)\right)}{b}\right)\right) - k \cdot \left(j \cdot 27\right)\\
\end{array}
\end{array}
if (-.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)) < 1.9999999999999999e305Initial program 97.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
Simplified97.7%
if 1.9999999999999999e305 < (-.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)) Initial program 61.0%
Taylor expanded in b around inf
Simplified78.0%
Taylor expanded in a around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l/N/A
associate-*r/N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
Simplified81.9%
Final simplification93.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (+ (* (* (* x 18.0) y) z) (* a -4.0))))
(t_2 (* k (* j 27.0))))
(if (<= t_2 -1e+20)
(+ t_1 (* -27.0 (* j k)))
(if (<= t_2 5e-158)
(* b (+ c (/ (* -4.0 (+ (* t a) (* x i))) b)))
(if (<= t_2 5e-51)
(+ (* b c) t_1)
(- (- (* b c) (* (* x 4.0) i)) t_2))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0));
double t_2 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 + (-27.0 * (j * k));
} else if (t_2 <= 5e-158) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else if (t_2 <= 5e-51) {
tmp = (b * c) + t_1;
} else {
tmp = ((b * c) - ((x * 4.0) * i)) - t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))
t_2 = k * (j * 27.0d0)
if (t_2 <= (-1d+20)) then
tmp = t_1 + ((-27.0d0) * (j * k))
else if (t_2 <= 5d-158) then
tmp = b * (c + (((-4.0d0) * ((t * a) + (x * i))) / b))
else if (t_2 <= 5d-51) then
tmp = (b * c) + t_1
else
tmp = ((b * c) - ((x * 4.0d0) * i)) - t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0));
double t_2 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 + (-27.0 * (j * k));
} else if (t_2 <= 5e-158) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else if (t_2 <= 5e-51) {
tmp = (b * c) + t_1;
} else {
tmp = ((b * c) - ((x * 4.0) * i)) - t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0)) t_2 = k * (j * 27.0) tmp = 0 if t_2 <= -1e+20: tmp = t_1 + (-27.0 * (j * k)) elif t_2 <= 5e-158: tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b)) elif t_2 <= 5e-51: tmp = (b * c) + t_1 else: tmp = ((b * c) - ((x * 4.0) * i)) - t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) t_2 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_2 <= -1e+20) tmp = Float64(t_1 + Float64(-27.0 * Float64(j * k))); elseif (t_2 <= 5e-158) tmp = Float64(b * Float64(c + Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) / b))); elseif (t_2 <= 5e-51) tmp = Float64(Float64(b * c) + t_1); else tmp = Float64(Float64(Float64(b * c) - Float64(Float64(x * 4.0) * i)) - t_2); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0));
t_2 = k * (j * 27.0);
tmp = 0.0;
if (t_2 <= -1e+20)
tmp = t_1 + (-27.0 * (j * k));
elseif (t_2 <= 5e-158)
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
elseif (t_2 <= 5e-51)
tmp = (b * c) + t_1;
else
tmp = ((b * c) - ((x * 4.0) * i)) - t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+20], N[(t$95$1 + N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e-158], N[(b * N[(c + N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e-51], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
t_2 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+20}:\\
\;\;\;\;t\_1 + -27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{-158}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right)}{b}\right)\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{-51}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(b \cdot c - \left(x \cdot 4\right) \cdot i\right) - t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -1e20Initial program 86.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
Simplified88.4%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6485.8%
Simplified85.8%
if -1e20 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 4.99999999999999972e-158Initial program 91.1%
Taylor expanded in b around inf
Simplified86.9%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6476.5%
Simplified76.5%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.5%
Simplified76.5%
if 4.99999999999999972e-158 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 5.00000000000000004e-51Initial program 88.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.9%
Taylor expanded in b around inf
*-lowering-*.f6481.7%
Simplified81.7%
if 5.00000000000000004e-51 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 79.1%
Taylor expanded in t around 0
*-lowering-*.f6473.3%
Simplified73.3%
Final simplification78.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* 18.0 (* y z))))
(if (<= (* b c) -1000.0)
(-
(* b (+ c (* x (+ (/ (* i -4.0) b) (/ (* t t_1) b)))))
(* k (* j 27.0)))
(if (<= (* b c) 5e+130)
(- (* t (+ (* a -4.0) (* x t_1))) (+ (* (* x 4.0) i) (* j (* k 27.0))))
(* b (+ c (/ (+ (* -4.0 (+ (* t a) (* x i))) (* j (* -27.0 k))) b)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = 18.0 * (y * z);
double tmp;
if ((b * c) <= -1000.0) {
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * t_1) / b))))) - (k * (j * 27.0));
} else if ((b * c) <= 5e+130) {
tmp = (t * ((a * -4.0) + (x * t_1))) - (((x * 4.0) * i) + (j * (k * 27.0)));
} else {
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = 18.0d0 * (y * z)
if ((b * c) <= (-1000.0d0)) then
tmp = (b * (c + (x * (((i * (-4.0d0)) / b) + ((t * t_1) / b))))) - (k * (j * 27.0d0))
else if ((b * c) <= 5d+130) then
tmp = (t * ((a * (-4.0d0)) + (x * t_1))) - (((x * 4.0d0) * i) + (j * (k * 27.0d0)))
else
tmp = b * (c + ((((-4.0d0) * ((t * a) + (x * i))) + (j * ((-27.0d0) * k))) / b))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = 18.0 * (y * z);
double tmp;
if ((b * c) <= -1000.0) {
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * t_1) / b))))) - (k * (j * 27.0));
} else if ((b * c) <= 5e+130) {
tmp = (t * ((a * -4.0) + (x * t_1))) - (((x * 4.0) * i) + (j * (k * 27.0)));
} else {
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = 18.0 * (y * z) tmp = 0 if (b * c) <= -1000.0: tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * t_1) / b))))) - (k * (j * 27.0)) elif (b * c) <= 5e+130: tmp = (t * ((a * -4.0) + (x * t_1))) - (((x * 4.0) * i) + (j * (k * 27.0))) else: tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(18.0 * Float64(y * z)) tmp = 0.0 if (Float64(b * c) <= -1000.0) tmp = Float64(Float64(b * Float64(c + Float64(x * Float64(Float64(Float64(i * -4.0) / b) + Float64(Float64(t * t_1) / b))))) - Float64(k * Float64(j * 27.0))); elseif (Float64(b * c) <= 5e+130) tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(x * t_1))) - Float64(Float64(Float64(x * 4.0) * i) + Float64(j * Float64(k * 27.0)))); else tmp = Float64(b * Float64(c + Float64(Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) + Float64(j * Float64(-27.0 * k))) / b))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = 18.0 * (y * z);
tmp = 0.0;
if ((b * c) <= -1000.0)
tmp = (b * (c + (x * (((i * -4.0) / b) + ((t * t_1) / b))))) - (k * (j * 27.0));
elseif ((b * c) <= 5e+130)
tmp = (t * ((a * -4.0) + (x * t_1))) - (((x * 4.0) * i) + (j * (k * 27.0)));
else
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1000.0], N[(N[(b * N[(c + N[(x * N[(N[(N[(i * -4.0), $MachinePrecision] / b), $MachinePrecision] + N[(N[(t * t$95$1), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 5e+130], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision] + N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(b * N[(c + N[(N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(-27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := 18 \cdot \left(y \cdot z\right)\\
\mathbf{if}\;b \cdot c \leq -1000:\\
\;\;\;\;b \cdot \left(c + x \cdot \left(\frac{i \cdot -4}{b} + \frac{t \cdot t\_1}{b}\right)\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+130}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + x \cdot t\_1\right) - \left(\left(x \cdot 4\right) \cdot i + j \cdot \left(k \cdot 27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right) + j \cdot \left(-27 \cdot k\right)}{b}\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -1e3Initial program 85.4%
Taylor expanded in b around inf
Simplified87.2%
Taylor expanded in a around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
associate-*l/N/A
associate-*r/N/A
distribute-rgt-inN/A
*-lowering-*.f64N/A
Simplified85.8%
if -1e3 < (*.f64 b c) < 4.9999999999999996e130Initial program 90.0%
Taylor expanded in b around 0
associate--r+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate--l+N/A
Simplified86.4%
if 4.9999999999999996e130 < (*.f64 b c) Initial program 78.2%
Taylor expanded in b around inf
Simplified87.1%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6487.3%
Simplified87.3%
Taylor expanded in b around inf
*-lowering-*.f64N/A
associate--l+N/A
associate-*r/N/A
associate-*r/N/A
div-subN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
Simplified89.4%
Final simplification86.8%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1
(* b (+ c (/ (+ (* -4.0 (+ (* t a) (* x i))) (* j (* -27.0 k))) b)))))
(if (<= (* b c) -2e+22)
t_1
(if (<= (* b c) 5e+130)
(-
(* t (+ (* a -4.0) (* x (* 18.0 (* y z)))))
(+ (* (* x 4.0) i) (* j (* k 27.0))))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
double tmp;
if ((b * c) <= -2e+22) {
tmp = t_1;
} else if ((b * c) <= 5e+130) {
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (((x * 4.0) * i) + (j * (k * 27.0)));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = b * (c + ((((-4.0d0) * ((t * a) + (x * i))) + (j * ((-27.0d0) * k))) / b))
if ((b * c) <= (-2d+22)) then
tmp = t_1
else if ((b * c) <= 5d+130) then
tmp = (t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))) - (((x * 4.0d0) * i) + (j * (k * 27.0d0)))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
double tmp;
if ((b * c) <= -2e+22) {
tmp = t_1;
} else if ((b * c) <= 5e+130) {
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (((x * 4.0) * i) + (j * (k * 27.0)));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b)) tmp = 0 if (b * c) <= -2e+22: tmp = t_1 elif (b * c) <= 5e+130: tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (((x * 4.0) * i) + (j * (k * 27.0))) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(b * Float64(c + Float64(Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) + Float64(j * Float64(-27.0 * k))) / b))) tmp = 0.0 if (Float64(b * c) <= -2e+22) tmp = t_1; elseif (Float64(b * c) <= 5e+130) tmp = Float64(Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) - Float64(Float64(Float64(x * 4.0) * i) + Float64(j * Float64(k * 27.0)))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
tmp = 0.0;
if ((b * c) <= -2e+22)
tmp = t_1;
elseif ((b * c) <= 5e+130)
tmp = (t * ((a * -4.0) + (x * (18.0 * (y * z))))) - (((x * 4.0) * i) + (j * (k * 27.0)));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(b * N[(c + N[(N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(-27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -2e+22], t$95$1, If[LessEqual[N[(b * c), $MachinePrecision], 5e+130], N[(N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision] + N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right) + j \cdot \left(-27 \cdot k\right)}{b}\right)\\
\mathbf{if}\;b \cdot c \leq -2 \cdot 10^{+22}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \cdot c \leq 5 \cdot 10^{+130}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right) - \left(\left(x \cdot 4\right) \cdot i + j \cdot \left(k \cdot 27\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 b c) < -2e22 or 4.9999999999999996e130 < (*.f64 b c) Initial program 82.5%
Taylor expanded in b around inf
Simplified88.4%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6485.8%
Simplified85.8%
Taylor expanded in b around inf
*-lowering-*.f64N/A
associate--l+N/A
associate-*r/N/A
associate-*r/N/A
div-subN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
Simplified86.8%
if -2e22 < (*.f64 b c) < 4.9999999999999996e130Initial program 89.7%
Taylor expanded in b around 0
associate--r+N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
associate-*r*N/A
associate--l+N/A
Simplified85.6%
Final simplification86.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -27.0 (* j k))))
(if (<= (* k (* j 27.0)) 5e+296)
(+
(+ t_1 (+ (* b c) (* x (* i -4.0))))
(* t (+ (* z (* x (* 18.0 y))) (* a -4.0))))
t_1)))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if ((k * (j * 27.0)) <= 5e+296) {
tmp = (t_1 + ((b * c) + (x * (i * -4.0)))) + (t * ((z * (x * (18.0 * y))) + (a * -4.0)));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (-27.0d0) * (j * k)
if ((k * (j * 27.0d0)) <= 5d+296) then
tmp = (t_1 + ((b * c) + (x * (i * (-4.0d0))))) + (t * ((z * (x * (18.0d0 * y))) + (a * (-4.0d0))))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if ((k * (j * 27.0)) <= 5e+296) {
tmp = (t_1 + ((b * c) + (x * (i * -4.0)))) + (t * ((z * (x * (18.0 * y))) + (a * -4.0)));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -27.0 * (j * k) tmp = 0 if (k * (j * 27.0)) <= 5e+296: tmp = (t_1 + ((b * c) + (x * (i * -4.0)))) + (t * ((z * (x * (18.0 * y))) + (a * -4.0))) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-27.0 * Float64(j * k)) tmp = 0.0 if (Float64(k * Float64(j * 27.0)) <= 5e+296) tmp = Float64(Float64(t_1 + Float64(Float64(b * c) + Float64(x * Float64(i * -4.0)))) + Float64(t * Float64(Float64(z * Float64(x * Float64(18.0 * y))) + Float64(a * -4.0)))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -27.0 * (j * k);
tmp = 0.0;
if ((k * (j * 27.0)) <= 5e+296)
tmp = (t_1 + ((b * c) + (x * (i * -4.0)))) + (t * ((z * (x * (18.0 * y))) + (a * -4.0)));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision], 5e+296], N[(N[(t$95$1 + N[(N[(b * c), $MachinePrecision] + N[(x * N[(i * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t * N[(N[(z * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;k \cdot \left(j \cdot 27\right) \leq 5 \cdot 10^{+296}:\\
\;\;\;\;\left(t\_1 + \left(b \cdot c + x \cdot \left(i \cdot -4\right)\right)\right) + t \cdot \left(z \cdot \left(x \cdot \left(18 \cdot y\right)\right) + a \cdot -4\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 5.0000000000000001e296Initial program 88.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
Simplified90.5%
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.1%
Applied egg-rr90.1%
if 5.0000000000000001e296 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 60.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
Simplified60.0%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
Final simplification90.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))))
(if (<= t_1 -1e+20)
(- (* z (* t (* x (* 18.0 y)))) t_1)
(if (<= t_1 2e+100)
(* b (+ c (/ (* -4.0 (+ (* t a) (* x i))) b)))
(- (* y (* z (* (* x 18.0) t))) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -1e+20) {
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
} else if (t_1 <= 2e+100) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = (y * (z * ((x * 18.0) * t))) - t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = k * (j * 27.0d0)
if (t_1 <= (-1d+20)) then
tmp = (z * (t * (x * (18.0d0 * y)))) - t_1
else if (t_1 <= 2d+100) then
tmp = b * (c + (((-4.0d0) * ((t * a) + (x * i))) / b))
else
tmp = (y * (z * ((x * 18.0d0) * t))) - t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -1e+20) {
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
} else if (t_1 <= 2e+100) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = (y * (z * ((x * 18.0) * t))) - t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) tmp = 0 if t_1 <= -1e+20: tmp = (z * (t * (x * (18.0 * y)))) - t_1 elif t_1 <= 2e+100: tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b)) else: tmp = (y * (z * ((x * 18.0) * t))) - t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_1 <= -1e+20) tmp = Float64(Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) - t_1); elseif (t_1 <= 2e+100) tmp = Float64(b * Float64(c + Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) / b))); else tmp = Float64(Float64(y * Float64(z * Float64(Float64(x * 18.0) * t))) - t_1); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
tmp = 0.0;
if (t_1 <= -1e+20)
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
elseif (t_1 <= 2e+100)
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
else
tmp = (y * (z * ((x * 18.0) * t))) - t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+20], N[(N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t$95$1, 2e+100], N[(b * N[(c + N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * N[(z * N[(N[(x * 18.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+20}:\\
\;\;\;\;z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right) - t\_1\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+100}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right)}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(z \cdot \left(\left(x \cdot 18\right) \cdot t\right)\right) - t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -1e20Initial program 86.4%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.7%
Simplified72.7%
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.7%
Applied egg-rr74.7%
if -1e20 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2.00000000000000003e100Initial program 89.8%
Taylor expanded in b around inf
Simplified81.4%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.3%
Simplified71.3%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6470.1%
Simplified70.1%
if 2.00000000000000003e100 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 74.9%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.3%
Simplified75.3%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6478.0%
Applied egg-rr78.0%
Final simplification72.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))))
(if (<= t_1 -1e+20)
(- (* z (* t (* x (* 18.0 y)))) t_1)
(if (<= t_1 5e+138)
(* b (+ c (/ (* -4.0 (+ (* t a) (* x i))) b)))
(- (* -4.0 (* t a)) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -1e+20) {
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
} else if (t_1 <= 5e+138) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = (-4.0 * (t * a)) - t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = k * (j * 27.0d0)
if (t_1 <= (-1d+20)) then
tmp = (z * (t * (x * (18.0d0 * y)))) - t_1
else if (t_1 <= 5d+138) then
tmp = b * (c + (((-4.0d0) * ((t * a) + (x * i))) / b))
else
tmp = ((-4.0d0) * (t * a)) - t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -1e+20) {
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
} else if (t_1 <= 5e+138) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = (-4.0 * (t * a)) - t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) tmp = 0 if t_1 <= -1e+20: tmp = (z * (t * (x * (18.0 * y)))) - t_1 elif t_1 <= 5e+138: tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b)) else: tmp = (-4.0 * (t * a)) - t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_1 <= -1e+20) tmp = Float64(Float64(z * Float64(t * Float64(x * Float64(18.0 * y)))) - t_1); elseif (t_1 <= 5e+138) tmp = Float64(b * Float64(c + Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) / b))); else tmp = Float64(Float64(-4.0 * Float64(t * a)) - t_1); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
tmp = 0.0;
if (t_1 <= -1e+20)
tmp = (z * (t * (x * (18.0 * y)))) - t_1;
elseif (t_1 <= 5e+138)
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
else
tmp = (-4.0 * (t * a)) - t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+20], N[(N[(z * N[(t * N[(x * N[(18.0 * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[t$95$1, 5e+138], N[(b * N[(c + N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+20}:\\
\;\;\;\;z \cdot \left(t \cdot \left(x \cdot \left(18 \cdot y\right)\right)\right) - t\_1\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+138}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right)}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right) - t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -1e20Initial program 86.4%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6472.7%
Simplified72.7%
associate-*r*N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.7%
Applied egg-rr74.7%
if -1e20 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 5.00000000000000016e138Initial program 89.5%
Taylor expanded in b around inf
Simplified81.9%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.6%
Simplified71.6%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.9%
Simplified69.9%
if 5.00000000000000016e138 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 74.2%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6479.6%
Simplified79.6%
Final simplification72.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -4.0 (+ (* t a) (* x i)))) (t_2 (* k (* j 27.0))))
(if (<= t_2 -1e+28)
(- t_1 t_2)
(if (<= t_2 5e+138) (* b (+ c (/ t_1 b))) (- (* -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);
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 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+28) {
tmp = t_1 - t_2;
} else if (t_2 <= 5e+138) {
tmp = b * (c + (t_1 / b));
} else {
tmp = (-4.0 * (t * a)) - t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * ((t * a) + (x * i))
t_2 = k * (j * 27.0d0)
if (t_2 <= (-1d+28)) then
tmp = t_1 - t_2
else if (t_2 <= 5d+138) then
tmp = b * (c + (t_1 / b))
else
tmp = ((-4.0d0) * (t * a)) - t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -4.0 * ((t * a) + (x * i));
double t_2 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+28) {
tmp = t_1 - t_2;
} else if (t_2 <= 5e+138) {
tmp = b * (c + (t_1 / b));
} else {
tmp = (-4.0 * (t * a)) - t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * ((t * a) + (x * i)) t_2 = k * (j * 27.0) tmp = 0 if t_2 <= -1e+28: tmp = t_1 - t_2 elif t_2 <= 5e+138: tmp = b * (c + (t_1 / b)) else: tmp = (-4.0 * (t * a)) - t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) t_2 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_2 <= -1e+28) tmp = Float64(t_1 - t_2); elseif (t_2 <= 5e+138) tmp = Float64(b * Float64(c + Float64(t_1 / b))); else tmp = Float64(Float64(-4.0 * Float64(t * a)) - t_2); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -4.0 * ((t * a) + (x * i));
t_2 = k * (j * 27.0);
tmp = 0.0;
if (t_2 <= -1e+28)
tmp = t_1 - t_2;
elseif (t_2 <= 5e+138)
tmp = b * (c + (t_1 / b));
else
tmp = (-4.0 * (t * a)) - t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+28], N[(t$95$1 - t$95$2), $MachinePrecision], If[LessEqual[t$95$2, 5e+138], N[(b * N[(c + N[(t$95$1 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a + x \cdot i\right)\\
t_2 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+28}:\\
\;\;\;\;t\_1 - t\_2\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+138}:\\
\;\;\;\;b \cdot \left(c + \frac{t\_1}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot a\right) - t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -9.99999999999999958e27Initial program 88.1%
Taylor expanded in b around inf
Simplified82.7%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6480.8%
Simplified80.8%
Taylor expanded in b around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.0%
Simplified76.0%
if -9.99999999999999958e27 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 5.00000000000000016e138Initial program 88.9%
Taylor expanded in b around inf
Simplified82.0%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.1%
Simplified71.1%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.5%
Simplified69.5%
if 5.00000000000000016e138 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 74.2%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6479.6%
Simplified79.6%
Final simplification72.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))) (t_2 (- (* -4.0 (* t a)) t_1)))
(if (<= t_1 -1e+28)
t_2
(if (<= t_1 5e+138) (* b (+ c (/ (* -4.0 (+ (* t a) (* x i))) b))) t_2))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double t_2 = (-4.0 * (t * a)) - t_1;
double tmp;
if (t_1 <= -1e+28) {
tmp = t_2;
} else if (t_1 <= 5e+138) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = k * (j * 27.0d0)
t_2 = ((-4.0d0) * (t * a)) - t_1
if (t_1 <= (-1d+28)) then
tmp = t_2
else if (t_1 <= 5d+138) then
tmp = b * (c + (((-4.0d0) * ((t * a) + (x * i))) / b))
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double t_2 = (-4.0 * (t * a)) - t_1;
double tmp;
if (t_1 <= -1e+28) {
tmp = t_2;
} else if (t_1 <= 5e+138) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) t_2 = (-4.0 * (t * a)) - t_1 tmp = 0 if t_1 <= -1e+28: tmp = t_2 elif t_1 <= 5e+138: tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b)) else: tmp = t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) t_2 = Float64(Float64(-4.0 * Float64(t * a)) - t_1) tmp = 0.0 if (t_1 <= -1e+28) tmp = t_2; elseif (t_1 <= 5e+138) tmp = Float64(b * Float64(c + Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) / b))); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
t_2 = (-4.0 * (t * a)) - t_1;
tmp = 0.0;
if (t_1 <= -1e+28)
tmp = t_2;
elseif (t_1 <= 5e+138)
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+28], t$95$2, If[LessEqual[t$95$1, 5e+138], N[(b * N[(c + N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $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])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
t_2 := -4 \cdot \left(t \cdot a\right) - t\_1\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{+28}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+138}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right)}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -9.99999999999999958e27 or 5.00000000000000016e138 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 82.4%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.2%
Simplified75.2%
if -9.99999999999999958e27 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 5.00000000000000016e138Initial program 88.9%
Taylor expanded in b around inf
Simplified82.0%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6471.1%
Simplified71.1%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.5%
Simplified69.5%
Final simplification71.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (+ (* (* (* x 18.0) y) z) (* a -4.0)))))
(if (<= y -1.35e+162)
(+ (* b c) t_1)
(if (<= y 5e-34)
(- (* b (+ c (* -4.0 (/ (+ (* t a) (* x i)) b)))) (* k (* j 27.0)))
(+ t_1 (* -27.0 (* 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 * ((((x * 18.0) * y) * z) + (a * -4.0));
double tmp;
if (y <= -1.35e+162) {
tmp = (b * c) + t_1;
} else if (y <= 5e-34) {
tmp = (b * (c + (-4.0 * (((t * a) + (x * i)) / b)))) - (k * (j * 27.0));
} else {
tmp = t_1 + (-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.
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 * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))
if (y <= (-1.35d+162)) then
tmp = (b * c) + t_1
else if (y <= 5d-34) then
tmp = (b * (c + ((-4.0d0) * (((t * a) + (x * i)) / b)))) - (k * (j * 27.0d0))
else
tmp = t_1 + ((-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;
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 * ((((x * 18.0) * y) * z) + (a * -4.0));
double tmp;
if (y <= -1.35e+162) {
tmp = (b * c) + t_1;
} else if (y <= 5e-34) {
tmp = (b * (c + (-4.0 * (((t * a) + (x * i)) / b)))) - (k * (j * 27.0));
} else {
tmp = t_1 + (-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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0)) tmp = 0 if y <= -1.35e+162: tmp = (b * c) + t_1 elif y <= 5e-34: tmp = (b * (c + (-4.0 * (((t * a) + (x * i)) / b)))) - (k * (j * 27.0)) else: tmp = t_1 + (-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]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) tmp = 0.0 if (y <= -1.35e+162) tmp = Float64(Float64(b * c) + t_1); elseif (y <= 5e-34) tmp = Float64(Float64(b * Float64(c + Float64(-4.0 * Float64(Float64(Float64(t * a) + Float64(x * i)) / b)))) - Float64(k * Float64(j * 27.0))); else tmp = Float64(t_1 + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0));
tmp = 0.0;
if (y <= -1.35e+162)
tmp = (b * c) + t_1;
elseif (y <= 5e-34)
tmp = (b * (c + (-4.0 * (((t * a) + (x * i)) / b)))) - (k * (j * 27.0));
else
tmp = t_1 + (-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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.35e+162], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[y, 5e-34], N[(N[(b * N[(c + N[(-4.0 * N[(N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + N[(-27.0 * N[(j * 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])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
\mathbf{if}\;y \leq -1.35 \cdot 10^{+162}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{elif}\;y \leq 5 \cdot 10^{-34}:\\
\;\;\;\;b \cdot \left(c + -4 \cdot \frac{t \cdot a + x \cdot i}{b}\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 + -27 \cdot \left(j \cdot k\right)\\
\end{array}
\end{array}
if y < -1.3500000000000001e162Initial program 91.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified94.0%
Taylor expanded in b around inf
*-lowering-*.f6480.6%
Simplified80.6%
if -1.3500000000000001e162 < y < 5.0000000000000003e-34Initial program 90.0%
Taylor expanded in b around inf
Simplified84.0%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6481.0%
Simplified81.0%
if 5.0000000000000003e-34 < y Initial program 77.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
Simplified79.2%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.9%
Simplified58.9%
Final simplification74.8%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (+ (* (* (* x 18.0) y) z) (* a -4.0)))))
(if (<= y -2.65e+135)
(+ (* b c) t_1)
(if (<= y 8.8e-35)
(* b (+ c (/ (+ (* -4.0 (+ (* t a) (* x i))) (* j (* -27.0 k))) b)))
(+ t_1 (* -27.0 (* 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 * ((((x * 18.0) * y) * z) + (a * -4.0));
double tmp;
if (y <= -2.65e+135) {
tmp = (b * c) + t_1;
} else if (y <= 8.8e-35) {
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
} else {
tmp = t_1 + (-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.
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 * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0)))
if (y <= (-2.65d+135)) then
tmp = (b * c) + t_1
else if (y <= 8.8d-35) then
tmp = b * (c + ((((-4.0d0) * ((t * a) + (x * i))) + (j * ((-27.0d0) * k))) / b))
else
tmp = t_1 + ((-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;
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 * ((((x * 18.0) * y) * z) + (a * -4.0));
double tmp;
if (y <= -2.65e+135) {
tmp = (b * c) + t_1;
} else if (y <= 8.8e-35) {
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
} else {
tmp = t_1 + (-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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0)) tmp = 0 if y <= -2.65e+135: tmp = (b * c) + t_1 elif y <= 8.8e-35: tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b)) else: tmp = t_1 + (-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]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0))) tmp = 0.0 if (y <= -2.65e+135) tmp = Float64(Float64(b * c) + t_1); elseif (y <= 8.8e-35) tmp = Float64(b * Float64(c + Float64(Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) + Float64(j * Float64(-27.0 * k))) / b))); else tmp = Float64(t_1 + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * ((((x * 18.0) * y) * z) + (a * -4.0));
tmp = 0.0;
if (y <= -2.65e+135)
tmp = (b * c) + t_1;
elseif (y <= 8.8e-35)
tmp = b * (c + (((-4.0 * ((t * a) + (x * i))) + (j * (-27.0 * k))) / b));
else
tmp = t_1 + (-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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.65e+135], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[y, 8.8e-35], N[(b * N[(c + N[(N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(-27.0 * k), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + N[(-27.0 * N[(j * 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])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
\mathbf{if}\;y \leq -2.65 \cdot 10^{+135}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{elif}\;y \leq 8.8 \cdot 10^{-35}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right) + j \cdot \left(-27 \cdot k\right)}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1 + -27 \cdot \left(j \cdot k\right)\\
\end{array}
\end{array}
if y < -2.65000000000000008e135Initial program 90.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.6%
Taylor expanded in b around inf
*-lowering-*.f6478.8%
Simplified78.8%
if -2.65000000000000008e135 < y < 8.79999999999999975e-35Initial program 90.2%
Taylor expanded in b around inf
Simplified84.5%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6481.4%
Simplified81.4%
Taylor expanded in b around inf
*-lowering-*.f64N/A
associate--l+N/A
associate-*r/N/A
associate-*r/N/A
div-subN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
Simplified78.9%
if 8.79999999999999975e-35 < y Initial program 78.0%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified79.4%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.1%
Simplified58.1%
Final simplification73.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -4.0 (* t a))) (t_2 (* k (* j 27.0))))
(if (<= t_2 -1e+20)
(- t_1 t_2)
(if (<= t_2 3e-123)
(+ (* b c) t_1)
(* i (+ (* x -4.0) (/ (* j (* -27.0 k)) i)))))))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 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 - t_2;
} else if (t_2 <= 3e-123) {
tmp = (b * c) + t_1;
} else {
tmp = i * ((x * -4.0) + ((j * (-27.0 * k)) / i));
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = k * (j * 27.0d0)
if (t_2 <= (-1d+20)) then
tmp = t_1 - t_2
else if (t_2 <= 3d-123) then
tmp = (b * c) + t_1
else
tmp = i * ((x * (-4.0d0)) + ((j * ((-27.0d0) * k)) / i))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 - t_2;
} else if (t_2 <= 3e-123) {
tmp = (b * c) + t_1;
} else {
tmp = i * ((x * -4.0) + ((j * (-27.0 * k)) / i));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * (t * a) t_2 = k * (j * 27.0) tmp = 0 if t_2 <= -1e+20: tmp = t_1 - t_2 elif t_2 <= 3e-123: tmp = (b * c) + t_1 else: tmp = i * ((x * -4.0) + ((j * (-27.0 * k)) / i)) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-4.0 * Float64(t * a)) t_2 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_2 <= -1e+20) tmp = Float64(t_1 - t_2); elseif (t_2 <= 3e-123) tmp = Float64(Float64(b * c) + t_1); else tmp = Float64(i * Float64(Float64(x * -4.0) + Float64(Float64(j * Float64(-27.0 * k)) / i))); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -4.0 * (t * a);
t_2 = k * (j * 27.0);
tmp = 0.0;
if (t_2 <= -1e+20)
tmp = t_1 - t_2;
elseif (t_2 <= 3e-123)
tmp = (b * c) + t_1;
else
tmp = i * ((x * -4.0) + ((j * (-27.0 * k)) / i));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+20], N[(t$95$1 - t$95$2), $MachinePrecision], If[LessEqual[t$95$2, 3e-123], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], N[(i * N[(N[(x * -4.0), $MachinePrecision] + N[(N[(j * N[(-27.0 * k), $MachinePrecision]), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a\right)\\
t_2 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+20}:\\
\;\;\;\;t\_1 - t\_2\\
\mathbf{elif}\;t\_2 \leq 3 \cdot 10^{-123}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(x \cdot -4 + \frac{j \cdot \left(-27 \cdot k\right)}{i}\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -1e20Initial program 86.4%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.9%
Simplified70.9%
if -1e20 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2.99999999999999984e-123Initial program 90.1%
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-*.f6456.0%
Simplified56.0%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.9%
Simplified55.9%
if 2.99999999999999984e-123 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 82.3%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6455.8%
Simplified55.8%
Taylor expanded in i around inf
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6457.0%
Simplified57.0%
Final simplification59.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0)))
(t_2 (* x (+ (* i -4.0) (* 18.0 (* z (* y t)))))))
(if (<= x -8.5e-28)
t_2
(if (<= x 3.5e-190)
(- (+ (* b c) (* -4.0 (* t a))) t_1)
(if (<= x 5.8e+226) (- (- (* b c) (* (* x 4.0) i)) t_1) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -8.5e-28) {
tmp = t_2;
} else if (x <= 3.5e-190) {
tmp = ((b * c) + (-4.0 * (t * a))) - t_1;
} else if (x <= 5.8e+226) {
tmp = ((b * c) - ((x * 4.0) * i)) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
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 = k * (j * 27.0d0)
t_2 = x * ((i * (-4.0d0)) + (18.0d0 * (z * (y * t))))
if (x <= (-8.5d-28)) then
tmp = t_2
else if (x <= 3.5d-190) then
tmp = ((b * c) + ((-4.0d0) * (t * a))) - t_1
else if (x <= 5.8d+226) then
tmp = ((b * c) - ((x * 4.0d0) * i)) - t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
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 = k * (j * 27.0);
double t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -8.5e-28) {
tmp = t_2;
} else if (x <= 3.5e-190) {
tmp = ((b * c) + (-4.0 * (t * a))) - t_1;
} else if (x <= 5.8e+226) {
tmp = ((b * c) - ((x * 4.0) * i)) - t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t)))) tmp = 0 if x <= -8.5e-28: tmp = t_2 elif x <= 3.5e-190: tmp = ((b * c) + (-4.0 * (t * a))) - t_1 elif x <= 5.8e+226: tmp = ((b * c) - ((x * 4.0) * i)) - t_1 else: tmp = t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) t_2 = Float64(x * Float64(Float64(i * -4.0) + Float64(18.0 * Float64(z * Float64(y * t))))) tmp = 0.0 if (x <= -8.5e-28) tmp = t_2; elseif (x <= 3.5e-190) tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - t_1); elseif (x <= 5.8e+226) tmp = Float64(Float64(Float64(b * c) - Float64(Float64(x * 4.0) * i)) - t_1); else tmp = t_2; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
t_2 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
tmp = 0.0;
if (x <= -8.5e-28)
tmp = t_2;
elseif (x <= 3.5e-190)
tmp = ((b * c) + (-4.0 * (t * a))) - t_1;
elseif (x <= 5.8e+226)
tmp = ((b * c) - ((x * 4.0) * i)) - t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(18.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e-28], t$95$2, If[LessEqual[x, 3.5e-190], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[x, 5.8e+226], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
t_2 := x \cdot \left(i \cdot -4 + 18 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right)\\
\mathbf{if}\;x \leq -8.5 \cdot 10^{-28}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;x \leq 3.5 \cdot 10^{-190}:\\
\;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - t\_1\\
\mathbf{elif}\;x \leq 5.8 \cdot 10^{+226}:\\
\;\;\;\;\left(b \cdot c - \left(x \cdot 4\right) \cdot i\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if x < -8.49999999999999925e-28 or 5.79999999999999949e226 < x Initial program 74.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.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.9%
Simplified74.9%
if -8.49999999999999925e-28 < x < 3.4999999999999999e-190Initial program 97.6%
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-*.f6484.4%
Simplified84.4%
if 3.4999999999999999e-190 < x < 5.79999999999999949e226Initial program 88.6%
Taylor expanded in t around 0
*-lowering-*.f6472.5%
Simplified72.5%
Final simplification77.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* x (+ (* i -4.0) (* 18.0 (* z (* y t)))))))
(if (<= x -8.5e-28)
t_1
(if (<= x 4.8e+75)
(- (+ (* b c) (* -4.0 (* t a))) (* k (* j 27.0)))
(if (<= x 4.5e+228)
(* b (+ c (/ (* -4.0 (+ (* t a) (* x i))) b)))
t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -8.5e-28) {
tmp = t_1;
} else if (x <= 4.8e+75) {
tmp = ((b * c) + (-4.0 * (t * a))) - (k * (j * 27.0));
} else if (x <= 4.5e+228) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = x * ((i * (-4.0d0)) + (18.0d0 * (z * (y * t))))
if (x <= (-8.5d-28)) then
tmp = t_1
else if (x <= 4.8d+75) then
tmp = ((b * c) + ((-4.0d0) * (t * a))) - (k * (j * 27.0d0))
else if (x <= 4.5d+228) then
tmp = b * (c + (((-4.0d0) * ((t * a) + (x * i))) / b))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -8.5e-28) {
tmp = t_1;
} else if (x <= 4.8e+75) {
tmp = ((b * c) + (-4.0 * (t * a))) - (k * (j * 27.0));
} else if (x <= 4.5e+228) {
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t)))) tmp = 0 if x <= -8.5e-28: tmp = t_1 elif x <= 4.8e+75: tmp = ((b * c) + (-4.0 * (t * a))) - (k * (j * 27.0)) elif x <= 4.5e+228: tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(x * Float64(Float64(i * -4.0) + Float64(18.0 * Float64(z * Float64(y * t))))) tmp = 0.0 if (x <= -8.5e-28) tmp = t_1; elseif (x <= 4.8e+75) tmp = Float64(Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))) - Float64(k * Float64(j * 27.0))); elseif (x <= 4.5e+228) tmp = Float64(b * Float64(c + Float64(Float64(-4.0 * Float64(Float64(t * a) + Float64(x * i))) / b))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
tmp = 0.0;
if (x <= -8.5e-28)
tmp = t_1;
elseif (x <= 4.8e+75)
tmp = ((b * c) + (-4.0 * (t * a))) - (k * (j * 27.0));
elseif (x <= 4.5e+228)
tmp = b * (c + ((-4.0 * ((t * a) + (x * i))) / b));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(18.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e-28], t$95$1, If[LessEqual[x, 4.8e+75], N[(N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.5e+228], N[(b * N[(c + N[(N[(-4.0 * N[(N[(t * a), $MachinePrecision] + N[(x * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(i \cdot -4 + 18 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right)\\
\mathbf{if}\;x \leq -8.5 \cdot 10^{-28}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 4.8 \cdot 10^{+75}:\\
\;\;\;\;\left(b \cdot c + -4 \cdot \left(t \cdot a\right)\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{elif}\;x \leq 4.5 \cdot 10^{+228}:\\
\;\;\;\;b \cdot \left(c + \frac{-4 \cdot \left(t \cdot a + x \cdot i\right)}{b}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -8.49999999999999925e-28 or 4.49999999999999983e228 < x Initial program 74.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.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6474.9%
Simplified74.9%
if -8.49999999999999925e-28 < x < 4.8e75Initial program 96.3%
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-*.f6478.2%
Simplified78.2%
if 4.8e75 < x < 4.49999999999999983e228Initial program 78.5%
Taylor expanded in b around inf
Simplified82.6%
Taylor expanded in y around 0
distribute-lft-outN/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6475.6%
Simplified75.6%
Taylor expanded in j around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6465.6%
Simplified65.6%
Final simplification75.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= y -3.6e+130)
(* z (* (* 18.0 t) (* x y)))
(if (<= y -5.6e+70)
(* -27.0 (* j k))
(if (<= y -1.9e-184)
(* b c)
(if (<= y 3.15e-167) (* -4.0 (* x i)) (* (* (* (* x 18.0) y) z) t))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (y <= -3.6e+130) {
tmp = z * ((18.0 * t) * (x * y));
} else if (y <= -5.6e+70) {
tmp = -27.0 * (j * k);
} else if (y <= -1.9e-184) {
tmp = b * c;
} else if (y <= 3.15e-167) {
tmp = -4.0 * (x * i);
} else {
tmp = (((x * 18.0) * y) * z) * t;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if (y <= (-3.6d+130)) then
tmp = z * ((18.0d0 * t) * (x * y))
else if (y <= (-5.6d+70)) then
tmp = (-27.0d0) * (j * k)
else if (y <= (-1.9d-184)) then
tmp = b * c
else if (y <= 3.15d-167) then
tmp = (-4.0d0) * (x * i)
else
tmp = (((x * 18.0d0) * y) * z) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (y <= -3.6e+130) {
tmp = z * ((18.0 * t) * (x * y));
} else if (y <= -5.6e+70) {
tmp = -27.0 * (j * k);
} else if (y <= -1.9e-184) {
tmp = b * c;
} else if (y <= 3.15e-167) {
tmp = -4.0 * (x * i);
} else {
tmp = (((x * 18.0) * y) * z) * t;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if y <= -3.6e+130: tmp = z * ((18.0 * t) * (x * y)) elif y <= -5.6e+70: tmp = -27.0 * (j * k) elif y <= -1.9e-184: tmp = b * c elif y <= 3.15e-167: tmp = -4.0 * (x * i) else: tmp = (((x * 18.0) * y) * z) * t return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (y <= -3.6e+130) tmp = Float64(z * Float64(Float64(18.0 * t) * Float64(x * y))); elseif (y <= -5.6e+70) tmp = Float64(-27.0 * Float64(j * k)); elseif (y <= -1.9e-184) tmp = Float64(b * c); elseif (y <= 3.15e-167) tmp = Float64(-4.0 * Float64(x * i)); else tmp = Float64(Float64(Float64(Float64(x * 18.0) * y) * z) * t); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if (y <= -3.6e+130)
tmp = z * ((18.0 * t) * (x * y));
elseif (y <= -5.6e+70)
tmp = -27.0 * (j * k);
elseif (y <= -1.9e-184)
tmp = b * c;
elseif (y <= 3.15e-167)
tmp = -4.0 * (x * i);
else
tmp = (((x * 18.0) * y) * z) * t;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[y, -3.6e+130], N[(z * N[(N[(18.0 * t), $MachinePrecision] * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -5.6e+70], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.9e-184], N[(b * c), $MachinePrecision], If[LessEqual[y, 3.15e-167], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3.6 \cdot 10^{+130}:\\
\;\;\;\;z \cdot \left(\left(18 \cdot t\right) \cdot \left(x \cdot y\right)\right)\\
\mathbf{elif}\;y \leq -5.6 \cdot 10^{+70}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;y \leq -1.9 \cdot 10^{-184}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;y \leq 3.15 \cdot 10^{-167}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z\right) \cdot t\\
\end{array}
\end{array}
if y < -3.6000000000000001e130Initial program 88.5%
Taylor expanded in b around inf
Simplified77.6%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6448.0%
Simplified48.0%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.4%
Applied egg-rr50.4%
if -3.6000000000000001e130 < y < -5.59999999999999979e70Initial program 93.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
Simplified93.9%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6457.7%
Simplified57.7%
if -5.59999999999999979e70 < y < -1.90000000000000008e-184Initial program 85.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
Simplified89.3%
Taylor expanded in b around inf
*-lowering-*.f6438.4%
Simplified38.4%
if -1.90000000000000008e-184 < y < 3.1500000000000001e-167Initial program 91.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.6%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6431.7%
Simplified31.7%
if 3.1500000000000001e-167 < y Initial program 83.6%
Taylor expanded in b around inf
Simplified77.5%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6433.2%
Simplified33.2%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6435.1%
Applied egg-rr35.1%
Final simplification39.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (* x 18.0) y)))
(if (<= y -2.8e+130)
(* z (* t_1 t))
(if (<= y -2.7e+68)
(* -27.0 (* j k))
(if (<= y -1.25e-184)
(* b c)
(if (<= y 3.15e-167) (* -4.0 (* x i)) (* (* t_1 z) t)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (x * 18.0) * y;
double tmp;
if (y <= -2.8e+130) {
tmp = z * (t_1 * t);
} else if (y <= -2.7e+68) {
tmp = -27.0 * (j * k);
} else if (y <= -1.25e-184) {
tmp = b * c;
} else if (y <= 3.15e-167) {
tmp = -4.0 * (x * i);
} else {
tmp = (t_1 * z) * t;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (x * 18.0d0) * y
if (y <= (-2.8d+130)) then
tmp = z * (t_1 * t)
else if (y <= (-2.7d+68)) then
tmp = (-27.0d0) * (j * k)
else if (y <= (-1.25d-184)) then
tmp = b * c
else if (y <= 3.15d-167) then
tmp = (-4.0d0) * (x * i)
else
tmp = (t_1 * z) * t
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (x * 18.0) * y;
double tmp;
if (y <= -2.8e+130) {
tmp = z * (t_1 * t);
} else if (y <= -2.7e+68) {
tmp = -27.0 * (j * k);
} else if (y <= -1.25e-184) {
tmp = b * c;
} else if (y <= 3.15e-167) {
tmp = -4.0 * (x * i);
} else {
tmp = (t_1 * z) * t;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (x * 18.0) * y tmp = 0 if y <= -2.8e+130: tmp = z * (t_1 * t) elif y <= -2.7e+68: tmp = -27.0 * (j * k) elif y <= -1.25e-184: tmp = b * c elif y <= 3.15e-167: tmp = -4.0 * (x * i) else: tmp = (t_1 * z) * t return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(x * 18.0) * y) tmp = 0.0 if (y <= -2.8e+130) tmp = Float64(z * Float64(t_1 * t)); elseif (y <= -2.7e+68) tmp = Float64(-27.0 * Float64(j * k)); elseif (y <= -1.25e-184) tmp = Float64(b * c); elseif (y <= 3.15e-167) tmp = Float64(-4.0 * Float64(x * i)); else tmp = Float64(Float64(t_1 * z) * t); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = (x * 18.0) * y;
tmp = 0.0;
if (y <= -2.8e+130)
tmp = z * (t_1 * t);
elseif (y <= -2.7e+68)
tmp = -27.0 * (j * k);
elseif (y <= -1.25e-184)
tmp = b * c;
elseif (y <= 3.15e-167)
tmp = -4.0 * (x * i);
else
tmp = (t_1 * z) * t;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -2.8e+130], N[(z * N[(t$95$1 * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2.7e+68], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.25e-184], N[(b * c), $MachinePrecision], If[LessEqual[y, 3.15e-167], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * z), $MachinePrecision] * t), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := \left(x \cdot 18\right) \cdot y\\
\mathbf{if}\;y \leq -2.8 \cdot 10^{+130}:\\
\;\;\;\;z \cdot \left(t\_1 \cdot t\right)\\
\mathbf{elif}\;y \leq -2.7 \cdot 10^{+68}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;y \leq -1.25 \cdot 10^{-184}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;y \leq 3.15 \cdot 10^{-167}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot z\right) \cdot t\\
\end{array}
\end{array}
if y < -2.7999999999999999e130Initial program 88.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
Simplified90.8%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6445.2%
Simplified45.2%
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.4%
Applied egg-rr50.4%
if -2.7999999999999999e130 < y < -2.69999999999999991e68Initial program 93.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
Simplified93.9%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6457.7%
Simplified57.7%
if -2.69999999999999991e68 < y < -1.25000000000000001e-184Initial program 85.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
Simplified89.3%
Taylor expanded in b around inf
*-lowering-*.f6438.4%
Simplified38.4%
if -1.25000000000000001e-184 < y < 3.1500000000000001e-167Initial program 91.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.6%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6431.7%
Simplified31.7%
if 3.1500000000000001e-167 < y Initial program 83.6%
Taylor expanded in b around inf
Simplified77.5%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6433.2%
Simplified33.2%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6435.1%
Applied egg-rr35.1%
Final simplification39.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= z -4.5e-124)
(* t (* 18.0 (* x (* y z))))
(if (<= z 2.9e-120)
(* b c)
(if (<= z 2.9e-82)
(* -27.0 (* j k))
(if (<= z 1.46e+43) (* -4.0 (* x i)) (* t (* 18.0 (* y (* x z)))))))))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 (z <= -4.5e-124) {
tmp = t * (18.0 * (x * (y * z)));
} else if (z <= 2.9e-120) {
tmp = b * c;
} else if (z <= 2.9e-82) {
tmp = -27.0 * (j * k);
} else if (z <= 1.46e+43) {
tmp = -4.0 * (x * i);
} else {
tmp = t * (18.0 * (y * (x * 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.
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 (z <= (-4.5d-124)) then
tmp = t * (18.0d0 * (x * (y * z)))
else if (z <= 2.9d-120) then
tmp = b * c
else if (z <= 2.9d-82) then
tmp = (-27.0d0) * (j * k)
else if (z <= 1.46d+43) then
tmp = (-4.0d0) * (x * i)
else
tmp = t * (18.0d0 * (y * (x * 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;
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 (z <= -4.5e-124) {
tmp = t * (18.0 * (x * (y * z)));
} else if (z <= 2.9e-120) {
tmp = b * c;
} else if (z <= 2.9e-82) {
tmp = -27.0 * (j * k);
} else if (z <= 1.46e+43) {
tmp = -4.0 * (x * i);
} else {
tmp = t * (18.0 * (y * (x * z)));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if z <= -4.5e-124: tmp = t * (18.0 * (x * (y * z))) elif z <= 2.9e-120: tmp = b * c elif z <= 2.9e-82: tmp = -27.0 * (j * k) elif z <= 1.46e+43: tmp = -4.0 * (x * i) else: tmp = t * (18.0 * (y * (x * z))) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (z <= -4.5e-124) tmp = Float64(t * Float64(18.0 * Float64(x * Float64(y * z)))); elseif (z <= 2.9e-120) tmp = Float64(b * c); elseif (z <= 2.9e-82) tmp = Float64(-27.0 * Float64(j * k)); elseif (z <= 1.46e+43) tmp = Float64(-4.0 * Float64(x * i)); else tmp = Float64(t * Float64(18.0 * Float64(y * Float64(x * 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if (z <= -4.5e-124)
tmp = t * (18.0 * (x * (y * z)));
elseif (z <= 2.9e-120)
tmp = b * c;
elseif (z <= 2.9e-82)
tmp = -27.0 * (j * k);
elseif (z <= 1.46e+43)
tmp = -4.0 * (x * i);
else
tmp = t * (18.0 * (y * (x * 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. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[z, -4.5e-124], N[(t * N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.9e-120], N[(b * c), $MachinePrecision], If[LessEqual[z, 2.9e-82], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.46e+43], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], N[(t * N[(18.0 * N[(y * N[(x * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.5 \cdot 10^{-124}:\\
\;\;\;\;t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{elif}\;z \leq 2.9 \cdot 10^{-120}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;z \leq 2.9 \cdot 10^{-82}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;z \leq 1.46 \cdot 10^{+43}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(18 \cdot \left(y \cdot \left(x \cdot z\right)\right)\right)\\
\end{array}
\end{array}
if z < -4.4999999999999996e-124Initial program 79.8%
Taylor expanded in b around inf
Simplified76.3%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6439.3%
Simplified39.3%
if -4.4999999999999996e-124 < z < 2.9e-120Initial program 94.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
Simplified94.6%
Taylor expanded in b around inf
*-lowering-*.f6429.9%
Simplified29.9%
if 2.9e-120 < z < 2.89999999999999977e-82Initial program 79.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
Simplified80.0%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f64100.0%
Simplified100.0%
if 2.89999999999999977e-82 < z < 1.45999999999999989e43Initial program 83.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified83.4%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6426.2%
Simplified26.2%
if 1.45999999999999989e43 < z Initial program 85.7%
Taylor expanded in b around inf
Simplified77.9%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6441.1%
Simplified41.1%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6448.0%
Applied egg-rr48.0%
Final simplification37.5%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (* 18.0 (* x (* y z))))))
(if (<= y -4.8e+130)
t_1
(if (<= y -1.15e+73)
(* -27.0 (* j k))
(if (<= y -3.8e-185)
(* b c)
(if (<= y 3.1e-167) (* -4.0 (* x i)) t_1))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * (18.0 * (x * (y * z)));
double tmp;
if (y <= -4.8e+130) {
tmp = t_1;
} else if (y <= -1.15e+73) {
tmp = -27.0 * (j * k);
} else if (y <= -3.8e-185) {
tmp = b * c;
} else if (y <= 3.1e-167) {
tmp = -4.0 * (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.
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 * (18.0d0 * (x * (y * z)))
if (y <= (-4.8d+130)) then
tmp = t_1
else if (y <= (-1.15d+73)) then
tmp = (-27.0d0) * (j * k)
else if (y <= (-3.8d-185)) then
tmp = b * c
else if (y <= 3.1d-167) then
tmp = (-4.0d0) * (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;
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 * (18.0 * (x * (y * z)));
double tmp;
if (y <= -4.8e+130) {
tmp = t_1;
} else if (y <= -1.15e+73) {
tmp = -27.0 * (j * k);
} else if (y <= -3.8e-185) {
tmp = b * c;
} else if (y <= 3.1e-167) {
tmp = -4.0 * (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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = t * (18.0 * (x * (y * z))) tmp = 0 if y <= -4.8e+130: tmp = t_1 elif y <= -1.15e+73: tmp = -27.0 * (j * k) elif y <= -3.8e-185: tmp = b * c elif y <= 3.1e-167: tmp = -4.0 * (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]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(18.0 * Float64(x * Float64(y * z)))) tmp = 0.0 if (y <= -4.8e+130) tmp = t_1; elseif (y <= -1.15e+73) tmp = Float64(-27.0 * Float64(j * k)); elseif (y <= -3.8e-185) tmp = Float64(b * c); elseif (y <= 3.1e-167) tmp = Float64(-4.0 * 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * (18.0 * (x * (y * z)));
tmp = 0.0;
if (y <= -4.8e+130)
tmp = t_1;
elseif (y <= -1.15e+73)
tmp = -27.0 * (j * k);
elseif (y <= -3.8e-185)
tmp = b * c;
elseif (y <= 3.1e-167)
tmp = -4.0 * (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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(18.0 * N[(x * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.8e+130], t$95$1, If[LessEqual[y, -1.15e+73], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -3.8e-185], N[(b * c), $MachinePrecision], If[LessEqual[y, 3.1e-167], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(18 \cdot \left(x \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;y \leq -4.8 \cdot 10^{+130}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;y \leq -1.15 \cdot 10^{+73}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;y \leq -3.8 \cdot 10^{-185}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;y \leq 3.1 \cdot 10^{-167}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if y < -4.80000000000000048e130 or 3.1e-167 < y Initial program 85.0%
Taylor expanded in b around inf
Simplified77.5%
Taylor expanded in y around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6437.5%
Simplified37.5%
if -4.80000000000000048e130 < y < -1.15e73Initial program 93.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
Simplified93.9%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6457.7%
Simplified57.7%
if -1.15e73 < y < -3.7999999999999999e-185Initial program 85.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
Simplified89.6%
Taylor expanded in b around inf
*-lowering-*.f6437.6%
Simplified37.6%
if -3.7999999999999999e-185 < y < 3.1e-167Initial program 91.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
Simplified93.4%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6432.3%
Simplified32.3%
Final simplification37.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -4.0 (* t a))) (t_2 (* k (* j 27.0))))
(if (<= t_2 -1e+20)
(- t_1 t_2)
(if (<= t_2 3e-123) (+ (* b c) t_1) (- (* -4.0 (* x i)) t_2)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -4.0 * (t * a);
double t_2 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 - t_2;
} else if (t_2 <= 3e-123) {
tmp = (b * c) + t_1;
} else {
tmp = (-4.0 * (x * i)) - t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-4.0d0) * (t * a)
t_2 = k * (j * 27.0d0)
if (t_2 <= (-1d+20)) then
tmp = t_1 - t_2
else if (t_2 <= 3d-123) then
tmp = (b * c) + t_1
else
tmp = ((-4.0d0) * (x * i)) - t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -4.0 * (t * a);
double t_2 = k * (j * 27.0);
double tmp;
if (t_2 <= -1e+20) {
tmp = t_1 - t_2;
} else if (t_2 <= 3e-123) {
tmp = (b * c) + t_1;
} else {
tmp = (-4.0 * (x * i)) - t_2;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -4.0 * (t * a) t_2 = k * (j * 27.0) tmp = 0 if t_2 <= -1e+20: tmp = t_1 - t_2 elif t_2 <= 3e-123: tmp = (b * c) + t_1 else: tmp = (-4.0 * (x * i)) - t_2 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-4.0 * Float64(t * a)) t_2 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_2 <= -1e+20) tmp = Float64(t_1 - t_2); elseif (t_2 <= 3e-123) tmp = Float64(Float64(b * c) + t_1); else tmp = Float64(Float64(-4.0 * Float64(x * i)) - t_2); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -4.0 * (t * a);
t_2 = k * (j * 27.0);
tmp = 0.0;
if (t_2 <= -1e+20)
tmp = t_1 - t_2;
elseif (t_2 <= 3e-123)
tmp = (b * c) + t_1;
else
tmp = (-4.0 * (x * i)) - t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+20], N[(t$95$1 - t$95$2), $MachinePrecision], If[LessEqual[t$95$2, 3e-123], N[(N[(b * c), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \left(t \cdot a\right)\\
t_2 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+20}:\\
\;\;\;\;t\_1 - t\_2\\
\mathbf{elif}\;t\_2 \leq 3 \cdot 10^{-123}:\\
\;\;\;\;b \cdot c + t\_1\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -1e20Initial program 86.4%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.9%
Simplified70.9%
if -1e20 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 2.99999999999999984e-123Initial program 90.1%
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-*.f6456.0%
Simplified56.0%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6455.9%
Simplified55.9%
if 2.99999999999999984e-123 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 82.3%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6455.8%
Simplified55.8%
Final simplification58.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= t -3.05e+68)
(* t (+ (* a -4.0) (* x (* 18.0 (* y z)))))
(if (<= t 7.2e-163)
(- (* -4.0 (* x i)) (* k (* j 27.0)))
(if (<= t 3.2e+52)
(- (* b c) (* j (* k 27.0)))
(* t (+ (* a -4.0) (* (* 18.0 y) (* x z))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (t <= -3.05e+68) {
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
} else if (t <= 7.2e-163) {
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
} else if (t <= 3.2e+52) {
tmp = (b * c) - (j * (k * 27.0));
} else {
tmp = t * ((a * -4.0) + ((18.0 * y) * (x * 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.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if (t <= (-3.05d+68)) then
tmp = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
else if (t <= 7.2d-163) then
tmp = ((-4.0d0) * (x * i)) - (k * (j * 27.0d0))
else if (t <= 3.2d+52) then
tmp = (b * c) - (j * (k * 27.0d0))
else
tmp = t * ((a * (-4.0d0)) + ((18.0d0 * y) * (x * 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;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if (t <= -3.05e+68) {
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
} else if (t <= 7.2e-163) {
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
} else if (t <= 3.2e+52) {
tmp = (b * c) - (j * (k * 27.0));
} else {
tmp = t * ((a * -4.0) + ((18.0 * y) * (x * z)));
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if t <= -3.05e+68: tmp = t * ((a * -4.0) + (x * (18.0 * (y * z)))) elif t <= 7.2e-163: tmp = (-4.0 * (x * i)) - (k * (j * 27.0)) elif t <= 3.2e+52: tmp = (b * c) - (j * (k * 27.0)) else: tmp = t * ((a * -4.0) + ((18.0 * y) * (x * z))) return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (t <= -3.05e+68) tmp = Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))); elseif (t <= 7.2e-163) tmp = Float64(Float64(-4.0 * Float64(x * i)) - Float64(k * Float64(j * 27.0))); elseif (t <= 3.2e+52) tmp = Float64(Float64(b * c) - Float64(j * Float64(k * 27.0))); else tmp = Float64(t * Float64(Float64(a * -4.0) + Float64(Float64(18.0 * y) * Float64(x * 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if (t <= -3.05e+68)
tmp = t * ((a * -4.0) + (x * (18.0 * (y * z))));
elseif (t <= 7.2e-163)
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
elseif (t <= 3.2e+52)
tmp = (b * c) - (j * (k * 27.0));
else
tmp = t * ((a * -4.0) + ((18.0 * y) * (x * 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. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[t, -3.05e+68], N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7.2e-163], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.2e+52], N[(N[(b * c), $MachinePrecision] - N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(N[(18.0 * y), $MachinePrecision] * N[(x * 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])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.05 \cdot 10^{+68}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{elif}\;t \leq 7.2 \cdot 10^{-163}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{elif}\;t \leq 3.2 \cdot 10^{+52}:\\
\;\;\;\;b \cdot c - j \cdot \left(k \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(a \cdot -4 + \left(18 \cdot y\right) \cdot \left(x \cdot z\right)\right)\\
\end{array}
\end{array}
if t < -3.05e68Initial program 80.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
Simplified89.3%
Taylor expanded in t around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6462.5%
Simplified62.5%
if -3.05e68 < t < 7.1999999999999996e-163Initial program 87.4%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.4%
Simplified58.4%
if 7.1999999999999996e-163 < t < 3.2e52Initial program 92.0%
Taylor expanded in b around inf
*-lowering-*.f6459.0%
Simplified59.0%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.0%
Applied egg-rr59.0%
if 3.2e52 < t Initial program 85.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
Simplified87.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-*.f6469.5%
Simplified69.5%
*-commutativeN/A
associate-*r*N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6471.4%
Applied egg-rr71.4%
Final simplification61.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* t (+ (* a -4.0) (* x (* 18.0 (* y z)))))))
(if (<= t -6.6e+68)
t_1
(if (<= t 1.45e-163)
(- (* -4.0 (* x i)) (* k (* j 27.0)))
(if (<= t 2.6e+44) (- (* b c) (* j (* k 27.0))) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -6.6e+68) {
tmp = t_1;
} else if (t <= 1.45e-163) {
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
} else if (t <= 2.6e+44) {
tmp = (b * c) - (j * (k * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = t * ((a * (-4.0d0)) + (x * (18.0d0 * (y * z))))
if (t <= (-6.6d+68)) then
tmp = t_1
else if (t <= 1.45d-163) then
tmp = ((-4.0d0) * (x * i)) - (k * (j * 27.0d0))
else if (t <= 2.6d+44) then
tmp = (b * c) - (j * (k * 27.0d0))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
double tmp;
if (t <= -6.6e+68) {
tmp = t_1;
} else if (t <= 1.45e-163) {
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
} else if (t <= 2.6e+44) {
tmp = (b * c) - (j * (k * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) 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 <= -6.6e+68: tmp = t_1 elif t <= 1.45e-163: tmp = (-4.0 * (x * i)) - (k * (j * 27.0)) elif t <= 2.6e+44: tmp = (b * c) - (j * (k * 27.0)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(t * Float64(Float64(a * -4.0) + Float64(x * Float64(18.0 * Float64(y * z))))) tmp = 0.0 if (t <= -6.6e+68) tmp = t_1; elseif (t <= 1.45e-163) tmp = Float64(Float64(-4.0 * Float64(x * i)) - Float64(k * Float64(j * 27.0))); elseif (t <= 2.6e+44) tmp = Float64(Float64(b * c) - Float64(j * Float64(k * 27.0))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = t * ((a * -4.0) + (x * (18.0 * (y * z))));
tmp = 0.0;
if (t <= -6.6e+68)
tmp = t_1;
elseif (t <= 1.45e-163)
tmp = (-4.0 * (x * i)) - (k * (j * 27.0));
elseif (t <= 2.6e+44)
tmp = (b * c) - (j * (k * 27.0));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(t * N[(N[(a * -4.0), $MachinePrecision] + N[(x * N[(18.0 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -6.6e+68], t$95$1, If[LessEqual[t, 1.45e-163], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.6e+44], N[(N[(b * c), $MachinePrecision] - N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(a \cdot -4 + x \cdot \left(18 \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{if}\;t \leq -6.6 \cdot 10^{+68}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 1.45 \cdot 10^{-163}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{elif}\;t \leq 2.6 \cdot 10^{+44}:\\
\;\;\;\;b \cdot c - j \cdot \left(k \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -6.6000000000000001e68 or 2.5999999999999999e44 < t Initial program 83.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
Simplified88.4%
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-*.f6466.0%
Simplified66.0%
if -6.6000000000000001e68 < t < 1.4500000000000001e-163Initial program 87.4%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.4%
Simplified58.4%
if 1.4500000000000001e-163 < t < 2.5999999999999999e44Initial program 92.0%
Taylor expanded in b around inf
*-lowering-*.f6459.0%
Simplified59.0%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6459.0%
Applied egg-rr59.0%
Final simplification61.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (+ (* b c) (* t (+ (* (* (* x 18.0) y) z) (* a -4.0))))))
(if (<= t -4.3e+68)
t_1
(if (<= t 1.46e+43)
(- (- (* b c) (* (* x 4.0) i)) (* k (* j 27.0)))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
double tmp;
if (t <= -4.3e+68) {
tmp = t_1;
} else if (t <= 1.46e+43) {
tmp = ((b * c) - ((x * 4.0) * i)) - (k * (j * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (b * c) + (t * ((((x * 18.0d0) * y) * z) + (a * (-4.0d0))))
if (t <= (-4.3d+68)) then
tmp = t_1
else if (t <= 1.46d+43) then
tmp = ((b * c) - ((x * 4.0d0) * i)) - (k * (j * 27.0d0))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
double tmp;
if (t <= -4.3e+68) {
tmp = t_1;
} else if (t <= 1.46e+43) {
tmp = ((b * c) - ((x * 4.0) * i)) - (k * (j * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0))) tmp = 0 if t <= -4.3e+68: tmp = t_1 elif t <= 1.46e+43: tmp = ((b * c) - ((x * 4.0) * i)) - (k * (j * 27.0)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(b * c) + Float64(t * Float64(Float64(Float64(Float64(x * 18.0) * y) * z) + Float64(a * -4.0)))) tmp = 0.0 if (t <= -4.3e+68) tmp = t_1; elseif (t <= 1.46e+43) tmp = Float64(Float64(Float64(b * c) - Float64(Float64(x * 4.0) * i)) - Float64(k * Float64(j * 27.0))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = (b * c) + (t * ((((x * 18.0) * y) * z) + (a * -4.0)));
tmp = 0.0;
if (t <= -4.3e+68)
tmp = t_1;
elseif (t <= 1.46e+43)
tmp = ((b * c) - ((x * 4.0) * i)) - (k * (j * 27.0));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(b * c), $MachinePrecision] + N[(t * N[(N[(N[(N[(x * 18.0), $MachinePrecision] * y), $MachinePrecision] * z), $MachinePrecision] + N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -4.3e+68], t$95$1, If[LessEqual[t, 1.46e+43], N[(N[(N[(b * c), $MachinePrecision] - N[(N[(x * 4.0), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := b \cdot c + t \cdot \left(\left(\left(x \cdot 18\right) \cdot y\right) \cdot z + a \cdot -4\right)\\
\mathbf{if}\;t \leq -4.3 \cdot 10^{+68}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t \leq 1.46 \cdot 10^{+43}:\\
\;\;\;\;\left(b \cdot c - \left(x \cdot 4\right) \cdot i\right) - k \cdot \left(j \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if t < -4.3000000000000001e68 or 1.45999999999999989e43 < t Initial program 83.3%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified88.5%
Taylor expanded in b around inf
*-lowering-*.f6479.4%
Simplified79.4%
if -4.3000000000000001e68 < t < 1.45999999999999989e43Initial program 88.8%
Taylor expanded in t around 0
*-lowering-*.f6475.4%
Simplified75.4%
Final simplification76.9%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))))
(if (<= t_1 -2e+17)
(- (* b c) (* j (* k 27.0)))
(if (<= t_1 1e+122) (+ (* b c) (* -4.0 (* t a))) (- (* b c) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -2e+17) {
tmp = (b * c) - (j * (k * 27.0));
} else if (t_1 <= 1e+122) {
tmp = (b * c) + (-4.0 * (t * a));
} else {
tmp = (b * c) - t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = k * (j * 27.0d0)
if (t_1 <= (-2d+17)) then
tmp = (b * c) - (j * (k * 27.0d0))
else if (t_1 <= 1d+122) then
tmp = (b * c) + ((-4.0d0) * (t * a))
else
tmp = (b * c) - t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double tmp;
if (t_1 <= -2e+17) {
tmp = (b * c) - (j * (k * 27.0));
} else if (t_1 <= 1e+122) {
tmp = (b * c) + (-4.0 * (t * a));
} else {
tmp = (b * c) - t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) tmp = 0 if t_1 <= -2e+17: tmp = (b * c) - (j * (k * 27.0)) elif t_1 <= 1e+122: tmp = (b * c) + (-4.0 * (t * a)) else: tmp = (b * c) - t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (t_1 <= -2e+17) tmp = Float64(Float64(b * c) - Float64(j * Float64(k * 27.0))); elseif (t_1 <= 1e+122) tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))); else tmp = Float64(Float64(b * c) - t_1); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
tmp = 0.0;
if (t_1 <= -2e+17)
tmp = (b * c) - (j * (k * 27.0));
elseif (t_1 <= 1e+122)
tmp = (b * c) + (-4.0 * (t * a));
else
tmp = (b * c) - t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+17], N[(N[(b * c), $MachinePrecision] - N[(j * N[(k * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+122], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+17}:\\
\;\;\;\;b \cdot c - j \cdot \left(k \cdot 27\right)\\
\mathbf{elif}\;t\_1 \leq 10^{+122}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c - t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -2e17Initial program 85.3%
Taylor expanded in b around inf
*-lowering-*.f6462.5%
Simplified62.5%
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6462.5%
Applied egg-rr62.5%
if -2e17 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 1.00000000000000001e122Initial program 89.8%
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-*.f6451.1%
Simplified51.1%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.4%
Simplified50.4%
if 1.00000000000000001e122 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 75.5%
Taylor expanded in b around inf
*-lowering-*.f6473.1%
Simplified73.1%
Final simplification56.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))) (t_2 (- (* b c) t_1)))
(if (<= t_1 -2e+17)
t_2
(if (<= t_1 1e+122) (+ (* 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);
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 = k * (j * 27.0);
double t_2 = (b * c) - t_1;
double tmp;
if (t_1 <= -2e+17) {
tmp = t_2;
} else if (t_1 <= 1e+122) {
tmp = (b * c) + (-4.0 * (t * a));
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = k * (j * 27.0d0)
t_2 = (b * c) - t_1
if (t_1 <= (-2d+17)) then
tmp = t_2
else if (t_1 <= 1d+122) then
tmp = (b * c) + ((-4.0d0) * (t * a))
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = k * (j * 27.0);
double t_2 = (b * c) - t_1;
double tmp;
if (t_1 <= -2e+17) {
tmp = t_2;
} else if (t_1 <= 1e+122) {
tmp = (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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) t_2 = (b * c) - t_1 tmp = 0 if t_1 <= -2e+17: tmp = t_2 elif t_1 <= 1e+122: tmp = (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]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) t_2 = Float64(Float64(b * c) - t_1) tmp = 0.0 if (t_1 <= -2e+17) tmp = t_2; elseif (t_1 <= 1e+122) tmp = 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
t_2 = (b * c) - t_1;
tmp = 0.0;
if (t_1 <= -2e+17)
tmp = t_2;
elseif (t_1 <= 1e+122)
tmp = (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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+17], t$95$2, If[LessEqual[t$95$1, 1e+122], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $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])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
t_2 := b \cdot c - t\_1\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+17}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 10^{+122}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 j #s(literal 27 binary64)) k) < -2e17 or 1.00000000000000001e122 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) Initial program 81.4%
Taylor expanded in b around inf
*-lowering-*.f6466.8%
Simplified66.8%
if -2e17 < (*.f64 (*.f64 j #s(literal 27 binary64)) k) < 1.00000000000000001e122Initial program 89.8%
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-*.f6451.1%
Simplified51.1%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6450.4%
Simplified50.4%
Final simplification56.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= (* b c) -1.35e+154)
(* b c)
(if (<= (* b c) -3.5e-139)
(* 18.0 (* x (* t (* y z))))
(if (<= (* b c) 6e+124) (* -27.0 (* j k)) (* b c)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.35e+154) {
tmp = b * c;
} else if ((b * c) <= -3.5e-139) {
tmp = 18.0 * (x * (t * (y * z)));
} else if ((b * c) <= 6e+124) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: tmp
if ((b * c) <= (-1.35d+154)) then
tmp = b * c
else if ((b * c) <= (-3.5d-139)) then
tmp = 18.0d0 * (x * (t * (y * z)))
else if ((b * c) <= 6d+124) then
tmp = (-27.0d0) * (j * k)
else
tmp = b * c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double tmp;
if ((b * c) <= -1.35e+154) {
tmp = b * c;
} else if ((b * c) <= -3.5e-139) {
tmp = 18.0 * (x * (t * (y * z)));
} else if ((b * c) <= 6e+124) {
tmp = -27.0 * (j * k);
} else {
tmp = b * c;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if (b * c) <= -1.35e+154: tmp = b * c elif (b * c) <= -3.5e-139: tmp = 18.0 * (x * (t * (y * z))) elif (b * c) <= 6e+124: tmp = -27.0 * (j * k) else: tmp = b * c return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (Float64(b * c) <= -1.35e+154) tmp = Float64(b * c); elseif (Float64(b * c) <= -3.5e-139) tmp = Float64(18.0 * Float64(x * Float64(t * Float64(y * z)))); elseif (Float64(b * c) <= 6e+124) tmp = Float64(-27.0 * Float64(j * k)); else tmp = Float64(b * c); end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if ((b * c) <= -1.35e+154)
tmp = b * c;
elseif ((b * c) <= -3.5e-139)
tmp = 18.0 * (x * (t * (y * z)));
elseif ((b * c) <= 6e+124)
tmp = -27.0 * (j * k);
else
tmp = b * c;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[N[(b * c), $MachinePrecision], -1.35e+154], N[(b * c), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], -3.5e-139], N[(18.0 * N[(x * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 6e+124], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], N[(b * c), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;b \cdot c \leq -1.35 \cdot 10^{+154}:\\
\;\;\;\;b \cdot c\\
\mathbf{elif}\;b \cdot c \leq -3.5 \cdot 10^{-139}:\\
\;\;\;\;18 \cdot \left(x \cdot \left(t \cdot \left(y \cdot z\right)\right)\right)\\
\mathbf{elif}\;b \cdot c \leq 6 \cdot 10^{+124}:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{else}:\\
\;\;\;\;b \cdot c\\
\end{array}
\end{array}
if (*.f64 b c) < -1.35000000000000003e154 or 5.9999999999999999e124 < (*.f64 b c) Initial program 80.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
Simplified82.5%
Taylor expanded in b around inf
*-lowering-*.f6455.9%
Simplified55.9%
if -1.35000000000000003e154 < (*.f64 b c) < -3.50000000000000001e-139Initial program 90.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
Simplified90.8%
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.7%
Applied egg-rr90.7%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6437.9%
Simplified37.9%
if -3.50000000000000001e-139 < (*.f64 b c) < 5.9999999999999999e124Initial program 89.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
Simplified92.4%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6431.2%
Simplified31.2%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* k (* j 27.0))))
(if (<= (* b c) -1.52e+156)
(- (* b c) t_1)
(if (<= (* b c) 1.55e+152)
(- (* -4.0 (* x i)) t_1)
(+ (* b c) (* -4.0 (* t a)))))))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 = k * (j * 27.0);
double tmp;
if ((b * c) <= -1.52e+156) {
tmp = (b * c) - t_1;
} else if ((b * c) <= 1.55e+152) {
tmp = (-4.0 * (x * i)) - t_1;
} else {
tmp = (b * c) + (-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.
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 = k * (j * 27.0d0)
if ((b * c) <= (-1.52d+156)) then
tmp = (b * c) - t_1
else if ((b * c) <= 1.55d+152) then
tmp = ((-4.0d0) * (x * i)) - t_1
else
tmp = (b * c) + ((-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;
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 = k * (j * 27.0);
double tmp;
if ((b * c) <= -1.52e+156) {
tmp = (b * c) - t_1;
} else if ((b * c) <= 1.55e+152) {
tmp = (-4.0 * (x * i)) - t_1;
} else {
tmp = (b * c) + (-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]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = k * (j * 27.0) tmp = 0 if (b * c) <= -1.52e+156: tmp = (b * c) - t_1 elif (b * c) <= 1.55e+152: tmp = (-4.0 * (x * i)) - t_1 else: tmp = (b * c) + (-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]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(k * Float64(j * 27.0)) tmp = 0.0 if (Float64(b * c) <= -1.52e+156) tmp = Float64(Float64(b * c) - t_1); elseif (Float64(b * c) <= 1.55e+152) tmp = Float64(Float64(-4.0 * Float64(x * i)) - t_1); else tmp = Float64(Float64(b * c) + 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = k * (j * 27.0);
tmp = 0.0;
if ((b * c) <= -1.52e+156)
tmp = (b * c) - t_1;
elseif ((b * c) <= 1.55e+152)
tmp = (-4.0 * (x * i)) - t_1;
else
tmp = (b * c) + (-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.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b * c), $MachinePrecision], -1.52e+156], N[(N[(b * c), $MachinePrecision] - t$95$1), $MachinePrecision], If[LessEqual[N[(b * c), $MachinePrecision], 1.55e+152], N[(N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision], N[(N[(b * c), $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])\\
\\
\begin{array}{l}
t_1 := k \cdot \left(j \cdot 27\right)\\
\mathbf{if}\;b \cdot c \leq -1.52 \cdot 10^{+156}:\\
\;\;\;\;b \cdot c - t\_1\\
\mathbf{elif}\;b \cdot c \leq 1.55 \cdot 10^{+152}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right) - t\_1\\
\mathbf{else}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if (*.f64 b c) < -1.52e156Initial program 80.5%
Taylor expanded in b around inf
*-lowering-*.f6480.9%
Simplified80.9%
if -1.52e156 < (*.f64 b c) < 1.55e152Initial program 90.0%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6451.0%
Simplified51.0%
if 1.55e152 < (*.f64 b c) Initial program 78.0%
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-*.f6473.6%
Simplified73.6%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6464.3%
Simplified64.3%
Final simplification57.3%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* x (+ (* i -4.0) (* 18.0 (* z (* y t)))))))
(if (<= x -3.4e-37)
t_1
(if (<= x 1.15e+81) (- (* b c) (* k (* j 27.0))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -3.4e-37) {
tmp = t_1;
} else if (x <= 1.15e+81) {
tmp = (b * c) - (k * (j * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = x * ((i * (-4.0d0)) + (18.0d0 * (z * (y * t))))
if (x <= (-3.4d-37)) then
tmp = t_1
else if (x <= 1.15d+81) then
tmp = (b * c) - (k * (j * 27.0d0))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
double tmp;
if (x <= -3.4e-37) {
tmp = t_1;
} else if (x <= 1.15e+81) {
tmp = (b * c) - (k * (j * 27.0));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t)))) tmp = 0 if x <= -3.4e-37: tmp = t_1 elif x <= 1.15e+81: tmp = (b * c) - (k * (j * 27.0)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(x * Float64(Float64(i * -4.0) + Float64(18.0 * Float64(z * Float64(y * t))))) tmp = 0.0 if (x <= -3.4e-37) tmp = t_1; elseif (x <= 1.15e+81) tmp = Float64(Float64(b * c) - Float64(k * Float64(j * 27.0))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = x * ((i * -4.0) + (18.0 * (z * (y * t))));
tmp = 0.0;
if (x <= -3.4e-37)
tmp = t_1;
elseif (x <= 1.15e+81)
tmp = (b * c) - (k * (j * 27.0));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(x * N[(N[(i * -4.0), $MachinePrecision] + N[(18.0 * N[(z * N[(y * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.4e-37], t$95$1, If[LessEqual[x, 1.15e+81], N[(N[(b * c), $MachinePrecision] - N[(k * N[(j * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := x \cdot \left(i \cdot -4 + 18 \cdot \left(z \cdot \left(y \cdot t\right)\right)\right)\\
\mathbf{if}\;x \leq -3.4 \cdot 10^{-37}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \leq 1.15 \cdot 10^{+81}:\\
\;\;\;\;b \cdot c - k \cdot \left(j \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if x < -3.40000000000000018e-37 or 1.1499999999999999e81 < x Initial program 75.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
Simplified78.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6469.8%
Simplified69.8%
if -3.40000000000000018e-37 < x < 1.1499999999999999e81Initial program 96.3%
Taylor expanded in b around inf
*-lowering-*.f6459.2%
Simplified59.2%
Final simplification64.0%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(if (<= k -0.54)
(* -27.0 (* j k))
(if (<= k 3.2e-281)
(* -4.0 (* x i))
(if (<= k 7.5e+114) (* b c) (* j (* -27.0 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 (k <= -0.54) {
tmp = -27.0 * (j * k);
} else if (k <= 3.2e-281) {
tmp = -4.0 * (x * i);
} else if (k <= 7.5e+114) {
tmp = b * c;
} else {
tmp = 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.
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 (k <= (-0.54d0)) then
tmp = (-27.0d0) * (j * k)
else if (k <= 3.2d-281) then
tmp = (-4.0d0) * (x * i)
else if (k <= 7.5d+114) then
tmp = b * c
else
tmp = 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;
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 (k <= -0.54) {
tmp = -27.0 * (j * k);
} else if (k <= 3.2e-281) {
tmp = -4.0 * (x * i);
} else if (k <= 7.5e+114) {
tmp = b * c;
} else {
tmp = 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]) def code(x, y, z, t, a, b, c, i, j, k): tmp = 0 if k <= -0.54: tmp = -27.0 * (j * k) elif k <= 3.2e-281: tmp = -4.0 * (x * i) elif k <= 7.5e+114: tmp = b * c else: tmp = 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]) function code(x, y, z, t, a, b, c, i, j, k) tmp = 0.0 if (k <= -0.54) tmp = Float64(-27.0 * Float64(j * k)); elseif (k <= 3.2e-281) tmp = Float64(-4.0 * Float64(x * i)); elseif (k <= 7.5e+114) tmp = Float64(b * c); else tmp = 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])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
tmp = 0.0;
if (k <= -0.54)
tmp = -27.0 * (j * k);
elseif (k <= 3.2e-281)
tmp = -4.0 * (x * i);
elseif (k <= 7.5e+114)
tmp = b * c;
else
tmp = 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. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := If[LessEqual[k, -0.54], N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 3.2e-281], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 7.5e+114], N[(b * c), $MachinePrecision], N[(j * N[(-27.0 * k), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
\mathbf{if}\;k \leq -0.54:\\
\;\;\;\;-27 \cdot \left(j \cdot k\right)\\
\mathbf{elif}\;k \leq 3.2 \cdot 10^{-281}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;k \leq 7.5 \cdot 10^{+114}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;j \cdot \left(-27 \cdot k\right)\\
\end{array}
\end{array}
if k < -0.54000000000000004Initial program 80.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
Simplified88.3%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6440.8%
Simplified40.8%
if -0.54000000000000004 < k < 3.2000000000000001e-281Initial program 92.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
Simplified92.0%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6436.2%
Simplified36.2%
if 3.2000000000000001e-281 < k < 7.5000000000000001e114Initial program 88.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
Simplified89.6%
Taylor expanded in b around inf
*-lowering-*.f6428.6%
Simplified28.6%
if 7.5000000000000001e114 < k Initial program 82.2%
associate--l+N/A
associate--l+N/A
+-lowering-+.f64N/A
distribute-rgt-out--N/A
*-lowering-*.f64N/A
sub-negN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-evalN/A
Simplified82.2%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6458.0%
Simplified58.0%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6458.0%
Applied egg-rr58.0%
Final simplification38.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -27.0 (* j k))))
(if (<= k -0.5)
t_1
(if (<= k 9.2e-282) (* -4.0 (* x i)) (if (<= k 6.2e+115) (* b c) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (k <= -0.5) {
tmp = t_1;
} else if (k <= 9.2e-282) {
tmp = -4.0 * (x * i);
} else if (k <= 6.2e+115) {
tmp = b * c;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (-27.0d0) * (j * k)
if (k <= (-0.5d0)) then
tmp = t_1
else if (k <= 9.2d-282) then
tmp = (-4.0d0) * (x * i)
else if (k <= 6.2d+115) then
tmp = b * c
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (k <= -0.5) {
tmp = t_1;
} else if (k <= 9.2e-282) {
tmp = -4.0 * (x * i);
} else if (k <= 6.2e+115) {
tmp = b * c;
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -27.0 * (j * k) tmp = 0 if k <= -0.5: tmp = t_1 elif k <= 9.2e-282: tmp = -4.0 * (x * i) elif k <= 6.2e+115: tmp = b * c else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-27.0 * Float64(j * k)) tmp = 0.0 if (k <= -0.5) tmp = t_1; elseif (k <= 9.2e-282) tmp = Float64(-4.0 * Float64(x * i)); elseif (k <= 6.2e+115) tmp = Float64(b * c); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -27.0 * (j * k);
tmp = 0.0;
if (k <= -0.5)
tmp = t_1;
elseif (k <= 9.2e-282)
tmp = -4.0 * (x * i);
elseif (k <= 6.2e+115)
tmp = b * c;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[k, -0.5], t$95$1, If[LessEqual[k, 9.2e-282], N[(-4.0 * N[(x * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[k, 6.2e+115], N[(b * c), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;k \leq -0.5:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;k \leq 9.2 \cdot 10^{-282}:\\
\;\;\;\;-4 \cdot \left(x \cdot i\right)\\
\mathbf{elif}\;k \leq 6.2 \cdot 10^{+115}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if k < -0.5 or 6.2000000000000001e115 < k Initial 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.4%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6448.8%
Simplified48.8%
if -0.5 < k < 9.1999999999999996e-282Initial program 92.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
Simplified92.0%
Taylor expanded in i around inf
*-lowering-*.f64N/A
*-lowering-*.f6436.2%
Simplified36.2%
if 9.1999999999999996e-282 < k < 6.2000000000000001e115Initial program 88.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
Simplified89.6%
Taylor expanded in b around inf
*-lowering-*.f6428.6%
Simplified28.6%
Final simplification38.4%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* -27.0 (* j k))))
(if (<= j -6.2e+126)
t_1
(if (<= j 6e+110) (+ (* b c) (* -4.0 (* t a))) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (j <= -6.2e+126) {
tmp = t_1;
} else if (j <= 6e+110) {
tmp = (b * c) + (-4.0 * (t * a));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (-27.0d0) * (j * k)
if (j <= (-6.2d+126)) then
tmp = t_1
else if (j <= 6d+110) then
tmp = (b * c) + ((-4.0d0) * (t * a))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (j <= -6.2e+126) {
tmp = t_1;
} else if (j <= 6e+110) {
tmp = (b * c) + (-4.0 * (t * a));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -27.0 * (j * k) tmp = 0 if j <= -6.2e+126: tmp = t_1 elif j <= 6e+110: tmp = (b * c) + (-4.0 * (t * a)) else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-27.0 * Float64(j * k)) tmp = 0.0 if (j <= -6.2e+126) tmp = t_1; elseif (j <= 6e+110) tmp = Float64(Float64(b * c) + Float64(-4.0 * Float64(t * a))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -27.0 * (j * k);
tmp = 0.0;
if (j <= -6.2e+126)
tmp = t_1;
elseif (j <= 6e+110)
tmp = (b * c) + (-4.0 * (t * a));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -6.2e+126], t$95$1, If[LessEqual[j, 6e+110], N[(N[(b * c), $MachinePrecision] + N[(-4.0 * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;j \leq -6.2 \cdot 10^{+126}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq 6 \cdot 10^{+110}:\\
\;\;\;\;b \cdot c + -4 \cdot \left(t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if j < -6.2e126 or 6.00000000000000014e110 < j Initial program 84.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
Simplified85.7%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6453.9%
Simplified53.9%
if -6.2e126 < j < 6.00000000000000014e110Initial program 87.8%
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-*.f6454.4%
Simplified54.4%
Taylor expanded in j around 0
+-commutativeN/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6446.4%
Simplified46.4%
Final simplification48.7%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. (FPCore (x y z t a b c i j k) :precision binary64 (let* ((t_1 (* -27.0 (* j k)))) (if (<= j -6.5e+126) t_1 (if (<= j 8.2e-43) (* b c) t_1))))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (j <= -6.5e+126) {
tmp = t_1;
} else if (j <= 8.2e-43) {
tmp = b * c;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: tmp
t_1 = (-27.0d0) * (j * k)
if (j <= (-6.5d+126)) then
tmp = t_1
else if (j <= 8.2d-43) then
tmp = b * c
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = -27.0 * (j * k);
double tmp;
if (j <= -6.5e+126) {
tmp = t_1;
} else if (j <= 8.2e-43) {
tmp = b * c;
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): t_1 = -27.0 * (j * k) tmp = 0 if j <= -6.5e+126: tmp = t_1 elif j <= 8.2e-43: tmp = b * c else: tmp = t_1 return tmp
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(-27.0 * Float64(j * k)) tmp = 0.0 if (j <= -6.5e+126) tmp = t_1; elseif (j <= 8.2e-43) tmp = Float64(b * c); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k)
t_1 = -27.0 * (j * k);
tmp = 0.0;
if (j <= -6.5e+126)
tmp = t_1;
elseif (j <= 8.2e-43)
tmp = b * c;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(-27.0 * N[(j * k), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -6.5e+126], t$95$1, If[LessEqual[j, 8.2e-43], N[(b * c), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
\begin{array}{l}
t_1 := -27 \cdot \left(j \cdot k\right)\\
\mathbf{if}\;j \leq -6.5 \cdot 10^{+126}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;j \leq 8.2 \cdot 10^{-43}:\\
\;\;\;\;b \cdot c\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if j < -6.5000000000000005e126 or 8.1999999999999996e-43 < j Initial program 88.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
Simplified89.0%
Taylor expanded in j around inf
*-lowering-*.f64N/A
*-lowering-*.f6442.8%
Simplified42.8%
if -6.5000000000000005e126 < j < 8.1999999999999996e-43Initial program 85.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
Simplified88.5%
Taylor expanded in b around inf
*-lowering-*.f6430.1%
Simplified30.1%
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. (FPCore (x y z t a b c i j k) :precision binary64 (* b c))
assert(x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k);
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return b * c;
}
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
code = b * c
end function
assert x < y && y < z && z < t && t < a && a < b && b < c && c < i && i < j && j < k;
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
return b * c;
}
[x, y, z, t, a, b, c, i, j, k] = sort([x, y, z, t, a, b, c, i, j, k]) def code(x, y, z, t, a, b, c, i, j, k): return b * c
x, y, z, t, a, b, c, i, j, k = sort([x, y, z, t, a, b, c, i, j, k]) function code(x, y, z, t, a, b, c, i, j, k) return Float64(b * c) end
x, y, z, t, a, b, c, i, j, k = num2cell(sort([x, y, z, t, a, b, c, i, j, k])){:}
function tmp = code(x, y, z, t, a, b, c, i, j, k)
tmp = b * c;
end
NOTE: x, y, z, t, a, b, c, i, j, and k should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := N[(b * c), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c, i, j, k] = \mathsf{sort}([x, y, z, t, a, b, c, i, j, k])\\
\\
b \cdot c
\end{array}
Initial program 86.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
Simplified88.7%
Taylor expanded in b around inf
*-lowering-*.f6424.0%
Simplified24.0%
(FPCore (x y z t a b c i j k)
:precision binary64
(let* ((t_1 (* (+ (* a t) (* i x)) 4.0))
(t_2
(-
(- (* (* 18.0 t) (* (* x y) z)) t_1)
(- (* (* k j) 27.0) (* c b)))))
(if (< t -1.6210815397541398e-69)
t_2
(if (< t 165.68027943805222)
(+ (- (* (* 18.0 y) (* x (* z t))) t_1) (- (* c b) (* 27.0 (* k j))))
t_2))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = ((a * t) + (i * x)) * 4.0;
double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
double tmp;
if (t < -1.6210815397541398e-69) {
tmp = t_2;
} else if (t < 165.68027943805222) {
tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j, k)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8), intent (in) :: j
real(8), intent (in) :: k
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = ((a * t) + (i * x)) * 4.0d0
t_2 = (((18.0d0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0d0) - (c * b))
if (t < (-1.6210815397541398d-69)) then
tmp = t_2
else if (t < 165.68027943805222d0) then
tmp = (((18.0d0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0d0 * (k * j)))
else
tmp = t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j, double k) {
double t_1 = ((a * t) + (i * x)) * 4.0;
double t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b));
double tmp;
if (t < -1.6210815397541398e-69) {
tmp = t_2;
} else if (t < 165.68027943805222) {
tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j)));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j, k): t_1 = ((a * t) + (i * x)) * 4.0 t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b)) tmp = 0 if t < -1.6210815397541398e-69: tmp = t_2 elif t < 165.68027943805222: tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j))) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j, k) t_1 = Float64(Float64(Float64(a * t) + Float64(i * x)) * 4.0) t_2 = Float64(Float64(Float64(Float64(18.0 * t) * Float64(Float64(x * y) * z)) - t_1) - Float64(Float64(Float64(k * j) * 27.0) - Float64(c * b))) tmp = 0.0 if (t < -1.6210815397541398e-69) tmp = t_2; elseif (t < 165.68027943805222) tmp = Float64(Float64(Float64(Float64(18.0 * y) * Float64(x * Float64(z * t))) - t_1) + Float64(Float64(c * b) - Float64(27.0 * Float64(k * j)))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j, k) t_1 = ((a * t) + (i * x)) * 4.0; t_2 = (((18.0 * t) * ((x * y) * z)) - t_1) - (((k * j) * 27.0) - (c * b)); tmp = 0.0; if (t < -1.6210815397541398e-69) tmp = t_2; elseif (t < 165.68027943805222) tmp = (((18.0 * y) * (x * (z * t))) - t_1) + ((c * b) - (27.0 * (k * j))); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_, k_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] + N[(i * x), $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[(18.0 * t), $MachinePrecision] * N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] - N[(N[(N[(k * j), $MachinePrecision] * 27.0), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -1.6210815397541398e-69], t$95$2, If[Less[t, 165.68027943805222], N[(N[(N[(N[(18.0 * y), $MachinePrecision] * N[(x * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision] + N[(N[(c * b), $MachinePrecision] - N[(27.0 * N[(k * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(a \cdot t + i \cdot x\right) \cdot 4\\
t_2 := \left(\left(18 \cdot t\right) \cdot \left(\left(x \cdot y\right) \cdot z\right) - t\_1\right) - \left(\left(k \cdot j\right) \cdot 27 - c \cdot b\right)\\
\mathbf{if}\;t < -1.6210815397541398 \cdot 10^{-69}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t < 165.68027943805222:\\
\;\;\;\;\left(\left(18 \cdot y\right) \cdot \left(x \cdot \left(z \cdot t\right)\right) - t\_1\right) + \left(c \cdot b - 27 \cdot \left(k \cdot j\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024145
(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)))