
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* y 9.0) z)))
(if (<= t_1 2e+185)
(+ (- (* x 2.0) (* t_1 t)) (* (* a 27.0) b))
(+ (* x 2.0) (+ (* a (* 27.0 b)) (* y (* t (* z -9.0))))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (y * 9.0) * z;
double tmp;
if (t_1 <= 2e+185) {
tmp = ((x * 2.0) - (t_1 * t)) + ((a * 27.0) * b);
} else {
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = (y * 9.0d0) * z
if (t_1 <= 2d+185) then
tmp = ((x * 2.0d0) - (t_1 * t)) + ((a * 27.0d0) * b)
else
tmp = (x * 2.0d0) + ((a * (27.0d0 * b)) + (y * (t * (z * (-9.0d0)))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (y * 9.0) * z;
double tmp;
if (t_1 <= 2e+185) {
tmp = ((x * 2.0) - (t_1 * t)) + ((a * 27.0) * b);
} else {
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (y * 9.0) * z tmp = 0 if t_1 <= 2e+185: tmp = ((x * 2.0) - (t_1 * t)) + ((a * 27.0) * b) else: tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0)))) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(y * 9.0) * z) tmp = 0.0 if (t_1 <= 2e+185) tmp = Float64(Float64(Float64(x * 2.0) - Float64(t_1 * t)) + Float64(Float64(a * 27.0) * b)); else tmp = Float64(Float64(x * 2.0) + Float64(Float64(a * Float64(27.0 * b)) + Float64(y * Float64(t * Float64(z * -9.0))))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (y * 9.0) * z;
tmp = 0.0;
if (t_1 <= 2e+185)
tmp = ((x * 2.0) - (t_1 * t)) + ((a * 27.0) * b);
else
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$1, 2e+185], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(t$95$1 * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] + N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(y \cdot 9\right) \cdot z\\
\mathbf{if}\;t\_1 \leq 2 \cdot 10^{+185}:\\
\;\;\;\;\left(x \cdot 2 - t\_1 \cdot t\right) + \left(a \cdot 27\right) \cdot b\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2 + \left(a \cdot \left(27 \cdot b\right) + y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 2e185Initial program 97.5%
if 2e185 < (*.f64 (*.f64 y #s(literal 9 binary64)) z) Initial program 88.9%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval95.9%
Simplified95.9%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* t (* z (* y -9.0)))) (t_2 (* (* a 27.0) b)))
(if (<= t_2 -2e+119)
(* a (/ b 0.037037037037037035))
(if (<= t_2 -1e-307)
t_1
(if (<= t_2 2e-180)
(* x 2.0)
(if (<= t_2 4e+19) t_1 (* 27.0 (* a b))))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = t * (z * (y * -9.0));
double t_2 = (a * 27.0) * b;
double tmp;
if (t_2 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_2 <= -1e-307) {
tmp = t_1;
} else if (t_2 <= 2e-180) {
tmp = x * 2.0;
} else if (t_2 <= 4e+19) {
tmp = t_1;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = t * (z * (y * (-9.0d0)))
t_2 = (a * 27.0d0) * b
if (t_2 <= (-2d+119)) then
tmp = a * (b / 0.037037037037037035d0)
else if (t_2 <= (-1d-307)) then
tmp = t_1
else if (t_2 <= 2d-180) then
tmp = x * 2.0d0
else if (t_2 <= 4d+19) then
tmp = t_1
else
tmp = 27.0d0 * (a * b)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = t * (z * (y * -9.0));
double t_2 = (a * 27.0) * b;
double tmp;
if (t_2 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_2 <= -1e-307) {
tmp = t_1;
} else if (t_2 <= 2e-180) {
tmp = x * 2.0;
} else if (t_2 <= 4e+19) {
tmp = t_1;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = t * (z * (y * -9.0)) t_2 = (a * 27.0) * b tmp = 0 if t_2 <= -2e+119: tmp = a * (b / 0.037037037037037035) elif t_2 <= -1e-307: tmp = t_1 elif t_2 <= 2e-180: tmp = x * 2.0 elif t_2 <= 4e+19: tmp = t_1 else: tmp = 27.0 * (a * b) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(t * Float64(z * Float64(y * -9.0))) t_2 = Float64(Float64(a * 27.0) * b) tmp = 0.0 if (t_2 <= -2e+119) tmp = Float64(a * Float64(b / 0.037037037037037035)); elseif (t_2 <= -1e-307) tmp = t_1; elseif (t_2 <= 2e-180) tmp = Float64(x * 2.0); elseif (t_2 <= 4e+19) tmp = t_1; else tmp = Float64(27.0 * Float64(a * b)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = t * (z * (y * -9.0));
t_2 = (a * 27.0) * b;
tmp = 0.0;
if (t_2 <= -2e+119)
tmp = a * (b / 0.037037037037037035);
elseif (t_2 <= -1e-307)
tmp = t_1;
elseif (t_2 <= 2e-180)
tmp = x * 2.0;
elseif (t_2 <= 4e+19)
tmp = t_1;
else
tmp = 27.0 * (a * b);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(t * N[(z * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+119], N[(a * N[(b / 0.037037037037037035), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-307], t$95$1, If[LessEqual[t$95$2, 2e-180], N[(x * 2.0), $MachinePrecision], If[LessEqual[t$95$2, 4e+19], t$95$1, N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := t \cdot \left(z \cdot \left(y \cdot -9\right)\right)\\
t_2 := \left(a \cdot 27\right) \cdot b\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+119}:\\
\;\;\;\;a \cdot \frac{b}{0.037037037037037035}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-307}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-180}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+19}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999989e119Initial program 96.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.9%
Simplified91.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6476.7%
Simplified76.7%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6476.7%
Applied egg-rr76.7%
if -1.99999999999999989e119 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -9.99999999999999909e-308 or 2e-180 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4e19Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval98.0%
Simplified98.0%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6455.5%
Simplified55.5%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.3%
Applied egg-rr54.3%
if -9.99999999999999909e-308 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 2e-180Initial program 97.7%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval89.5%
Simplified89.5%
Taylor expanded in x around inf
*-lowering-*.f6461.1%
Simplified61.1%
if 4e19 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval90.3%
Simplified90.3%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6469.6%
Simplified69.6%
Final simplification63.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b)))
(if (<= t_1 -2e+119)
(* a (/ b 0.037037037037037035))
(if (<= t_1 -1e-307)
(* (* z t) (* y -9.0))
(if (<= t_1 2e-180)
(* x 2.0)
(if (<= t_1 4e+19) (* -9.0 (* y (* z t))) (* 27.0 (* a b))))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_1 <= -1e-307) {
tmp = (z * t) * (y * -9.0);
} else if (t_1 <= 2e-180) {
tmp = x * 2.0;
} else if (t_1 <= 4e+19) {
tmp = -9.0 * (y * (z * t));
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = (a * 27.0d0) * b
if (t_1 <= (-2d+119)) then
tmp = a * (b / 0.037037037037037035d0)
else if (t_1 <= (-1d-307)) then
tmp = (z * t) * (y * (-9.0d0))
else if (t_1 <= 2d-180) then
tmp = x * 2.0d0
else if (t_1 <= 4d+19) then
tmp = (-9.0d0) * (y * (z * t))
else
tmp = 27.0d0 * (a * b)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_1 <= -1e-307) {
tmp = (z * t) * (y * -9.0);
} else if (t_1 <= 2e-180) {
tmp = x * 2.0;
} else if (t_1 <= 4e+19) {
tmp = -9.0 * (y * (z * t));
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b tmp = 0 if t_1 <= -2e+119: tmp = a * (b / 0.037037037037037035) elif t_1 <= -1e-307: tmp = (z * t) * (y * -9.0) elif t_1 <= 2e-180: tmp = x * 2.0 elif t_1 <= 4e+19: tmp = -9.0 * (y * (z * t)) else: tmp = 27.0 * (a * b) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) tmp = 0.0 if (t_1 <= -2e+119) tmp = Float64(a * Float64(b / 0.037037037037037035)); elseif (t_1 <= -1e-307) tmp = Float64(Float64(z * t) * Float64(y * -9.0)); elseif (t_1 <= 2e-180) tmp = Float64(x * 2.0); elseif (t_1 <= 4e+19) tmp = Float64(-9.0 * Float64(y * Float64(z * t))); else tmp = Float64(27.0 * Float64(a * b)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
tmp = 0.0;
if (t_1 <= -2e+119)
tmp = a * (b / 0.037037037037037035);
elseif (t_1 <= -1e-307)
tmp = (z * t) * (y * -9.0);
elseif (t_1 <= 2e-180)
tmp = x * 2.0;
elseif (t_1 <= 4e+19)
tmp = -9.0 * (y * (z * t));
else
tmp = 27.0 * (a * b);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+119], N[(a * N[(b / 0.037037037037037035), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-307], N[(N[(z * t), $MachinePrecision] * N[(y * -9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-180], N[(x * 2.0), $MachinePrecision], If[LessEqual[t$95$1, 4e+19], N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+119}:\\
\;\;\;\;a \cdot \frac{b}{0.037037037037037035}\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-307}:\\
\;\;\;\;\left(z \cdot t\right) \cdot \left(y \cdot -9\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-180}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+19}:\\
\;\;\;\;-9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999989e119Initial program 96.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.9%
Simplified91.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6476.7%
Simplified76.7%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6476.7%
Applied egg-rr76.7%
if -1.99999999999999989e119 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -9.99999999999999909e-308Initial program 96.3%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval98.4%
Simplified98.4%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6456.3%
Simplified56.3%
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6456.4%
Applied egg-rr56.4%
if -9.99999999999999909e-308 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 2e-180Initial program 97.7%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval89.5%
Simplified89.5%
Taylor expanded in x around inf
*-lowering-*.f6461.1%
Simplified61.1%
if 2e-180 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4e19Initial program 97.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval97.2%
Simplified97.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6454.0%
Simplified54.0%
if 4e19 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval90.3%
Simplified90.3%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6469.6%
Simplified69.6%
Final simplification63.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* -9.0 (* y (* z t)))) (t_2 (* (* a 27.0) b)))
(if (<= t_2 -2e+119)
(* a (/ b 0.037037037037037035))
(if (<= t_2 -1e-307)
t_1
(if (<= t_2 2e-180)
(* x 2.0)
(if (<= t_2 4e+19) t_1 (* 27.0 (* a b))))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = -9.0 * (y * (z * t));
double t_2 = (a * 27.0) * b;
double tmp;
if (t_2 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_2 <= -1e-307) {
tmp = t_1;
} else if (t_2 <= 2e-180) {
tmp = x * 2.0;
} else if (t_2 <= 4e+19) {
tmp = t_1;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (-9.0d0) * (y * (z * t))
t_2 = (a * 27.0d0) * b
if (t_2 <= (-2d+119)) then
tmp = a * (b / 0.037037037037037035d0)
else if (t_2 <= (-1d-307)) then
tmp = t_1
else if (t_2 <= 2d-180) then
tmp = x * 2.0d0
else if (t_2 <= 4d+19) then
tmp = t_1
else
tmp = 27.0d0 * (a * b)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = -9.0 * (y * (z * t));
double t_2 = (a * 27.0) * b;
double tmp;
if (t_2 <= -2e+119) {
tmp = a * (b / 0.037037037037037035);
} else if (t_2 <= -1e-307) {
tmp = t_1;
} else if (t_2 <= 2e-180) {
tmp = x * 2.0;
} else if (t_2 <= 4e+19) {
tmp = t_1;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = -9.0 * (y * (z * t)) t_2 = (a * 27.0) * b tmp = 0 if t_2 <= -2e+119: tmp = a * (b / 0.037037037037037035) elif t_2 <= -1e-307: tmp = t_1 elif t_2 <= 2e-180: tmp = x * 2.0 elif t_2 <= 4e+19: tmp = t_1 else: tmp = 27.0 * (a * b) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(-9.0 * Float64(y * Float64(z * t))) t_2 = Float64(Float64(a * 27.0) * b) tmp = 0.0 if (t_2 <= -2e+119) tmp = Float64(a * Float64(b / 0.037037037037037035)); elseif (t_2 <= -1e-307) tmp = t_1; elseif (t_2 <= 2e-180) tmp = Float64(x * 2.0); elseif (t_2 <= 4e+19) tmp = t_1; else tmp = Float64(27.0 * Float64(a * b)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = -9.0 * (y * (z * t));
t_2 = (a * 27.0) * b;
tmp = 0.0;
if (t_2 <= -2e+119)
tmp = a * (b / 0.037037037037037035);
elseif (t_2 <= -1e-307)
tmp = t_1;
elseif (t_2 <= 2e-180)
tmp = x * 2.0;
elseif (t_2 <= 4e+19)
tmp = t_1;
else
tmp = 27.0 * (a * b);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+119], N[(a * N[(b / 0.037037037037037035), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, -1e-307], t$95$1, If[LessEqual[t$95$2, 2e-180], N[(x * 2.0), $MachinePrecision], If[LessEqual[t$95$2, 4e+19], t$95$1, N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := -9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
t_2 := \left(a \cdot 27\right) \cdot b\\
\mathbf{if}\;t\_2 \leq -2 \cdot 10^{+119}:\\
\;\;\;\;a \cdot \frac{b}{0.037037037037037035}\\
\mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-307}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-180}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+19}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999989e119Initial program 96.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.9%
Simplified91.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6476.7%
Simplified76.7%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6476.7%
Applied egg-rr76.7%
if -1.99999999999999989e119 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -9.99999999999999909e-308 or 2e-180 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4e19Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval98.0%
Simplified98.0%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6455.5%
Simplified55.5%
if -9.99999999999999909e-308 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 2e-180Initial program 97.7%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval89.5%
Simplified89.5%
Taylor expanded in x around inf
*-lowering-*.f6461.1%
Simplified61.1%
if 4e19 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval90.3%
Simplified90.3%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6469.6%
Simplified69.6%
Final simplification63.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b))
(t_2 (* 27.0 (* a b)))
(t_3 (* -9.0 (* y (* z t)))))
(if (<= t_1 -5e-64)
(+ t_2 (* (* y z) (* t -9.0)))
(if (<= t_1 2e-77) (+ (* x 2.0) t_3) (+ t_2 t_3)))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = 27.0 * (a * b);
double t_3 = -9.0 * (y * (z * t));
double tmp;
if (t_1 <= -5e-64) {
tmp = t_2 + ((y * z) * (t * -9.0));
} else if (t_1 <= 2e-77) {
tmp = (x * 2.0) + t_3;
} else {
tmp = t_2 + t_3;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (a * 27.0d0) * b
t_2 = 27.0d0 * (a * b)
t_3 = (-9.0d0) * (y * (z * t))
if (t_1 <= (-5d-64)) then
tmp = t_2 + ((y * z) * (t * (-9.0d0)))
else if (t_1 <= 2d-77) then
tmp = (x * 2.0d0) + t_3
else
tmp = t_2 + t_3
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = 27.0 * (a * b);
double t_3 = -9.0 * (y * (z * t));
double tmp;
if (t_1 <= -5e-64) {
tmp = t_2 + ((y * z) * (t * -9.0));
} else if (t_1 <= 2e-77) {
tmp = (x * 2.0) + t_3;
} else {
tmp = t_2 + t_3;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b t_2 = 27.0 * (a * b) t_3 = -9.0 * (y * (z * t)) tmp = 0 if t_1 <= -5e-64: tmp = t_2 + ((y * z) * (t * -9.0)) elif t_1 <= 2e-77: tmp = (x * 2.0) + t_3 else: tmp = t_2 + t_3 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = Float64(27.0 * Float64(a * b)) t_3 = Float64(-9.0 * Float64(y * Float64(z * t))) tmp = 0.0 if (t_1 <= -5e-64) tmp = Float64(t_2 + Float64(Float64(y * z) * Float64(t * -9.0))); elseif (t_1 <= 2e-77) tmp = Float64(Float64(x * 2.0) + t_3); else tmp = Float64(t_2 + t_3); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
t_2 = 27.0 * (a * b);
t_3 = -9.0 * (y * (z * t));
tmp = 0.0;
if (t_1 <= -5e-64)
tmp = t_2 + ((y * z) * (t * -9.0));
elseif (t_1 <= 2e-77)
tmp = (x * 2.0) + t_3;
else
tmp = t_2 + t_3;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-64], N[(t$95$2 + N[(N[(y * z), $MachinePrecision] * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-77], N[(N[(x * 2.0), $MachinePrecision] + t$95$3), $MachinePrecision], N[(t$95$2 + t$95$3), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := 27 \cdot \left(a \cdot b\right)\\
t_3 := -9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-64}:\\
\;\;\;\;t\_2 + \left(y \cdot z\right) \cdot \left(t \cdot -9\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-77}:\\
\;\;\;\;x \cdot 2 + t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_2 + t\_3\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -5.00000000000000033e-64Initial program 97.3%
associate-*r*N/A
+-commutativeN/A
associate-+r-N/A
+-commutativeN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6494.8%
Applied egg-rr94.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
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6488.7%
Simplified88.7%
if -5.00000000000000033e-64 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.9999999999999999e-77Initial program 96.5%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval93.2%
Simplified93.2%
Taylor expanded in a around 0
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6490.8%
Simplified90.8%
if 1.9999999999999999e-77 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.2%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval92.7%
Simplified92.7%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6481.9%
Simplified81.9%
Final simplification87.4%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* -9.0 (* y (* z t))))
(t_2 (* (* a 27.0) b))
(t_3 (+ (* 27.0 (* a b)) t_1)))
(if (<= t_2 -5e-64) t_3 (if (<= t_2 2e-77) (+ (* x 2.0) t_1) t_3))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = -9.0 * (y * (z * t));
double t_2 = (a * 27.0) * b;
double t_3 = (27.0 * (a * b)) + t_1;
double tmp;
if (t_2 <= -5e-64) {
tmp = t_3;
} else if (t_2 <= 2e-77) {
tmp = (x * 2.0) + t_1;
} else {
tmp = t_3;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (-9.0d0) * (y * (z * t))
t_2 = (a * 27.0d0) * b
t_3 = (27.0d0 * (a * b)) + t_1
if (t_2 <= (-5d-64)) then
tmp = t_3
else if (t_2 <= 2d-77) then
tmp = (x * 2.0d0) + t_1
else
tmp = t_3
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = -9.0 * (y * (z * t));
double t_2 = (a * 27.0) * b;
double t_3 = (27.0 * (a * b)) + t_1;
double tmp;
if (t_2 <= -5e-64) {
tmp = t_3;
} else if (t_2 <= 2e-77) {
tmp = (x * 2.0) + t_1;
} else {
tmp = t_3;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = -9.0 * (y * (z * t)) t_2 = (a * 27.0) * b t_3 = (27.0 * (a * b)) + t_1 tmp = 0 if t_2 <= -5e-64: tmp = t_3 elif t_2 <= 2e-77: tmp = (x * 2.0) + t_1 else: tmp = t_3 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(-9.0 * Float64(y * Float64(z * t))) t_2 = Float64(Float64(a * 27.0) * b) t_3 = Float64(Float64(27.0 * Float64(a * b)) + t_1) tmp = 0.0 if (t_2 <= -5e-64) tmp = t_3; elseif (t_2 <= 2e-77) tmp = Float64(Float64(x * 2.0) + t_1); else tmp = t_3; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = -9.0 * (y * (z * t));
t_2 = (a * 27.0) * b;
t_3 = (27.0 * (a * b)) + t_1;
tmp = 0.0;
if (t_2 <= -5e-64)
tmp = t_3;
elseif (t_2 <= 2e-77)
tmp = (x * 2.0) + t_1;
else
tmp = t_3;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$3 = N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-64], t$95$3, If[LessEqual[t$95$2, 2e-77], N[(N[(x * 2.0), $MachinePrecision] + t$95$1), $MachinePrecision], t$95$3]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := -9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
t_2 := \left(a \cdot 27\right) \cdot b\\
t_3 := 27 \cdot \left(a \cdot b\right) + t\_1\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{-64}:\\
\;\;\;\;t\_3\\
\mathbf{elif}\;t\_2 \leq 2 \cdot 10^{-77}:\\
\;\;\;\;x \cdot 2 + t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_3\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -5.00000000000000033e-64 or 1.9999999999999999e-77 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.8%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval93.8%
Simplified93.8%
Taylor expanded in x around 0
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.0%
Simplified84.0%
if -5.00000000000000033e-64 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.9999999999999999e-77Initial program 96.5%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval93.2%
Simplified93.2%
Taylor expanded in a around 0
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6490.8%
Simplified90.8%
Final simplification86.6%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b)))
(if (<= t_1 -2e+119)
(+ (* x 2.0) (/ 1.0 (/ (/ 0.037037037037037035 a) b)))
(if (<= t_1 4e+19)
(+ (* x 2.0) (* -9.0 (* y (* z t))))
(- (* x 2.0) (/ (* a b) -0.037037037037037035))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -2e+119) {
tmp = (x * 2.0) + (1.0 / ((0.037037037037037035 / a) / b));
} else if (t_1 <= 4e+19) {
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
} else {
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = (a * 27.0d0) * b
if (t_1 <= (-2d+119)) then
tmp = (x * 2.0d0) + (1.0d0 / ((0.037037037037037035d0 / a) / b))
else if (t_1 <= 4d+19) then
tmp = (x * 2.0d0) + ((-9.0d0) * (y * (z * t)))
else
tmp = (x * 2.0d0) - ((a * b) / (-0.037037037037037035d0))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -2e+119) {
tmp = (x * 2.0) + (1.0 / ((0.037037037037037035 / a) / b));
} else if (t_1 <= 4e+19) {
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
} else {
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b tmp = 0 if t_1 <= -2e+119: tmp = (x * 2.0) + (1.0 / ((0.037037037037037035 / a) / b)) elif t_1 <= 4e+19: tmp = (x * 2.0) + (-9.0 * (y * (z * t))) else: tmp = (x * 2.0) - ((a * b) / -0.037037037037037035) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) tmp = 0.0 if (t_1 <= -2e+119) tmp = Float64(Float64(x * 2.0) + Float64(1.0 / Float64(Float64(0.037037037037037035 / a) / b))); elseif (t_1 <= 4e+19) tmp = Float64(Float64(x * 2.0) + Float64(-9.0 * Float64(y * Float64(z * t)))); else tmp = Float64(Float64(x * 2.0) - Float64(Float64(a * b) / -0.037037037037037035)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
tmp = 0.0;
if (t_1 <= -2e+119)
tmp = (x * 2.0) + (1.0 / ((0.037037037037037035 / a) / b));
elseif (t_1 <= 4e+19)
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
else
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+119], N[(N[(x * 2.0), $MachinePrecision] + N[(1.0 / N[(N[(0.037037037037037035 / a), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 4e+19], N[(N[(x * 2.0), $MachinePrecision] + N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / -0.037037037037037035), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+119}:\\
\;\;\;\;x \cdot 2 + \frac{1}{\frac{\frac{0.037037037037037035}{a}}{b}}\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+19}:\\
\;\;\;\;x \cdot 2 + -9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2 - \frac{a \cdot b}{-0.037037037037037035}\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999989e119Initial program 96.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval91.9%
Simplified91.9%
flip3-+N/A
clear-numN/A
/-lowering-/.f64N/A
clear-numN/A
flip3-+N/A
Applied egg-rr91.9%
Taylor expanded in a around inf
/-lowering-/.f64N/A
*-lowering-*.f6480.5%
Simplified80.5%
associate-/r*N/A
/-lowering-/.f64N/A
/-lowering-/.f6480.5%
Applied egg-rr80.5%
if -1.99999999999999989e119 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4e19Initial program 96.9%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval95.4%
Simplified95.4%
Taylor expanded in a around 0
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6482.2%
Simplified82.2%
if 4e19 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.6%
Taylor expanded in x around inf
*-lowering-*.f6483.3%
Simplified83.3%
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
fma-defineN/A
metadata-evalN/A
distribute-neg-fracN/A
fmm-undefN/A
div-invN/A
metadata-evalN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
neg-mul-1N/A
clear-numN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-eval83.3%
Applied egg-rr83.3%
Final simplification82.1%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b))
(t_2 (- (* x 2.0) (/ (* a b) -0.037037037037037035))))
(if (<= t_1 -2e+119)
t_2
(if (<= t_1 4e+19) (+ (* x 2.0) (* -9.0 (* y (* z t)))) t_2))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = (x * 2.0) - ((a * b) / -0.037037037037037035);
double tmp;
if (t_1 <= -2e+119) {
tmp = t_2;
} else if (t_1 <= 4e+19) {
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (a * 27.0d0) * b
t_2 = (x * 2.0d0) - ((a * b) / (-0.037037037037037035d0))
if (t_1 <= (-2d+119)) then
tmp = t_2
else if (t_1 <= 4d+19) then
tmp = (x * 2.0d0) + ((-9.0d0) * (y * (z * t)))
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = (x * 2.0) - ((a * b) / -0.037037037037037035);
double tmp;
if (t_1 <= -2e+119) {
tmp = t_2;
} else if (t_1 <= 4e+19) {
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b t_2 = (x * 2.0) - ((a * b) / -0.037037037037037035) tmp = 0 if t_1 <= -2e+119: tmp = t_2 elif t_1 <= 4e+19: tmp = (x * 2.0) + (-9.0 * (y * (z * t))) else: tmp = t_2 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = Float64(Float64(x * 2.0) - Float64(Float64(a * b) / -0.037037037037037035)) tmp = 0.0 if (t_1 <= -2e+119) tmp = t_2; elseif (t_1 <= 4e+19) tmp = Float64(Float64(x * 2.0) + Float64(-9.0 * Float64(y * Float64(z * t)))); else tmp = t_2; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
t_2 = (x * 2.0) - ((a * b) / -0.037037037037037035);
tmp = 0.0;
if (t_1 <= -2e+119)
tmp = t_2;
elseif (t_1 <= 4e+19)
tmp = (x * 2.0) + (-9.0 * (y * (z * t)));
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * 2.0), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / -0.037037037037037035), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+119], t$95$2, If[LessEqual[t$95$1, 4e+19], N[(N[(x * 2.0), $MachinePrecision] + N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := x \cdot 2 - \frac{a \cdot b}{-0.037037037037037035}\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+119}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+19}:\\
\;\;\;\;x \cdot 2 + -9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.99999999999999989e119 or 4e19 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.4%
Taylor expanded in x around inf
*-lowering-*.f6482.1%
Simplified82.1%
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
fma-defineN/A
metadata-evalN/A
distribute-neg-fracN/A
fmm-undefN/A
div-invN/A
metadata-evalN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
neg-mul-1N/A
clear-numN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-eval82.1%
Applied egg-rr82.1%
if -1.99999999999999989e119 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4e19Initial program 96.9%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval95.4%
Simplified95.4%
Taylor expanded in a around 0
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6482.2%
Simplified82.2%
Final simplification82.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b)))
(if (<= t_1 -5e-64)
(* a (* 27.0 b))
(if (<= t_1 1e-68) (* x 2.0) (* 27.0 (* a b))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -5e-64) {
tmp = a * (27.0 * b);
} else if (t_1 <= 1e-68) {
tmp = x * 2.0;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = (a * 27.0d0) * b
if (t_1 <= (-5d-64)) then
tmp = a * (27.0d0 * b)
else if (t_1 <= 1d-68) then
tmp = x * 2.0d0
else
tmp = 27.0d0 * (a * b)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double tmp;
if (t_1 <= -5e-64) {
tmp = a * (27.0 * b);
} else if (t_1 <= 1e-68) {
tmp = x * 2.0;
} else {
tmp = 27.0 * (a * b);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b tmp = 0 if t_1 <= -5e-64: tmp = a * (27.0 * b) elif t_1 <= 1e-68: tmp = x * 2.0 else: tmp = 27.0 * (a * b) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) tmp = 0.0 if (t_1 <= -5e-64) tmp = Float64(a * Float64(27.0 * b)); elseif (t_1 <= 1e-68) tmp = Float64(x * 2.0); else tmp = Float64(27.0 * Float64(a * b)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
tmp = 0.0;
if (t_1 <= -5e-64)
tmp = a * (27.0 * b);
elseif (t_1 <= 1e-68)
tmp = x * 2.0;
else
tmp = 27.0 * (a * b);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-64], N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e-68], N[(x * 2.0), $MachinePrecision], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-64}:\\
\;\;\;\;a \cdot \left(27 \cdot b\right)\\
\mathbf{elif}\;t\_1 \leq 10^{-68}:\\
\;\;\;\;x \cdot 2\\
\mathbf{else}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -5.00000000000000033e-64Initial program 97.3%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval94.8%
Simplified94.8%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6460.6%
Simplified60.6%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
metadata-evalN/A
div-invN/A
/-lowering-/.f6460.5%
Applied egg-rr60.5%
associate-*l/N/A
div-invN/A
metadata-evalN/A
*-commutativeN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f6460.5%
Applied egg-rr60.5%
if -5.00000000000000033e-64 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 1.00000000000000007e-68Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval93.3%
Simplified93.3%
Taylor expanded in x around inf
*-lowering-*.f6447.0%
Simplified47.0%
if 1.00000000000000007e-68 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 96.1%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval92.5%
Simplified92.5%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6461.6%
Simplified61.6%
Final simplification55.6%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= z 3900000.0) (+ (* x 2.0) (+ (* a (* 27.0 b)) (* y (* t (* z -9.0))))) (+ (* 27.0 (* a b)) (* (* y z) (* t -9.0)))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= 3900000.0) {
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
} else {
tmp = (27.0 * (a * b)) + ((y * z) * (t * -9.0));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (z <= 3900000.0d0) then
tmp = (x * 2.0d0) + ((a * (27.0d0 * b)) + (y * (t * (z * (-9.0d0)))))
else
tmp = (27.0d0 * (a * b)) + ((y * z) * (t * (-9.0d0)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= 3900000.0) {
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
} else {
tmp = (27.0 * (a * b)) + ((y * z) * (t * -9.0));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if z <= 3900000.0: tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0)))) else: tmp = (27.0 * (a * b)) + ((y * z) * (t * -9.0)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= 3900000.0) tmp = Float64(Float64(x * 2.0) + Float64(Float64(a * Float64(27.0 * b)) + Float64(y * Float64(t * Float64(z * -9.0))))); else tmp = Float64(Float64(27.0 * Float64(a * b)) + Float64(Float64(y * z) * Float64(t * -9.0))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (z <= 3900000.0)
tmp = (x * 2.0) + ((a * (27.0 * b)) + (y * (t * (z * -9.0))));
else
tmp = (27.0 * (a * b)) + ((y * z) * (t * -9.0));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 3900000.0], N[(N[(x * 2.0), $MachinePrecision] + N[(N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision] + N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + N[(N[(y * z), $MachinePrecision] * N[(t * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 3900000:\\
\;\;\;\;x \cdot 2 + \left(a \cdot \left(27 \cdot b\right) + y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right) + \left(y \cdot z\right) \cdot \left(t \cdot -9\right)\\
\end{array}
\end{array}
if z < 3.9e6Initial program 98.0%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval95.6%
Simplified95.6%
if 3.9e6 < z Initial program 93.3%
associate-*r*N/A
+-commutativeN/A
associate-+r-N/A
+-commutativeN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6489.3%
Applied egg-rr89.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
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6485.1%
Simplified85.1%
Final simplification92.6%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(if (<= z -61000000000000.0)
(* y (* t (* z -9.0)))
(if (<= z 4.5e+22)
(- (* x 2.0) (/ (* a b) -0.037037037037037035))
(* t (* z (* y -9.0))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -61000000000000.0) {
tmp = y * (t * (z * -9.0));
} else if (z <= 4.5e+22) {
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
} else {
tmp = t * (z * (y * -9.0));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (z <= (-61000000000000.0d0)) then
tmp = y * (t * (z * (-9.0d0)))
else if (z <= 4.5d+22) then
tmp = (x * 2.0d0) - ((a * b) / (-0.037037037037037035d0))
else
tmp = t * (z * (y * (-9.0d0)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -61000000000000.0) {
tmp = y * (t * (z * -9.0));
} else if (z <= 4.5e+22) {
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
} else {
tmp = t * (z * (y * -9.0));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if z <= -61000000000000.0: tmp = y * (t * (z * -9.0)) elif z <= 4.5e+22: tmp = (x * 2.0) - ((a * b) / -0.037037037037037035) else: tmp = t * (z * (y * -9.0)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= -61000000000000.0) tmp = Float64(y * Float64(t * Float64(z * -9.0))); elseif (z <= 4.5e+22) tmp = Float64(Float64(x * 2.0) - Float64(Float64(a * b) / -0.037037037037037035)); else tmp = Float64(t * Float64(z * Float64(y * -9.0))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (z <= -61000000000000.0)
tmp = y * (t * (z * -9.0));
elseif (z <= 4.5e+22)
tmp = (x * 2.0) - ((a * b) / -0.037037037037037035);
else
tmp = t * (z * (y * -9.0));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -61000000000000.0], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.5e+22], N[(N[(x * 2.0), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / -0.037037037037037035), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -61000000000000:\\
\;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\
\mathbf{elif}\;z \leq 4.5 \cdot 10^{+22}:\\
\;\;\;\;x \cdot 2 - \frac{a \cdot b}{-0.037037037037037035}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(z \cdot \left(y \cdot -9\right)\right)\\
\end{array}
\end{array}
if z < -6.1e13Initial program 96.5%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval86.4%
Simplified86.4%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9%
Simplified46.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6447.0%
Applied egg-rr47.0%
if -6.1e13 < z < 4.4999999999999998e22Initial program 98.7%
Taylor expanded in x around inf
*-lowering-*.f6477.0%
Simplified77.0%
*-commutativeN/A
associate-*r*N/A
metadata-evalN/A
associate-/r/N/A
fma-defineN/A
metadata-evalN/A
distribute-neg-fracN/A
fmm-undefN/A
div-invN/A
metadata-evalN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
metadata-evalN/A
neg-mul-1N/A
clear-numN/A
distribute-neg-frac2N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
metadata-eval77.0%
Applied egg-rr77.0%
if 4.4999999999999998e22 < z Initial program 92.8%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval87.2%
Simplified87.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6448.9%
Simplified48.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.6%
Applied egg-rr54.6%
Final simplification64.5%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= z -4100000000000.0) (* y (* t (* z -9.0))) (if (<= z 1.15e+22) (+ (* x 2.0) (* (* a 27.0) b)) (* t (* z (* y -9.0))))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -4100000000000.0) {
tmp = y * (t * (z * -9.0));
} else if (z <= 1.15e+22) {
tmp = (x * 2.0) + ((a * 27.0) * b);
} else {
tmp = t * (z * (y * -9.0));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (z <= (-4100000000000.0d0)) then
tmp = y * (t * (z * (-9.0d0)))
else if (z <= 1.15d+22) then
tmp = (x * 2.0d0) + ((a * 27.0d0) * b)
else
tmp = t * (z * (y * (-9.0d0)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -4100000000000.0) {
tmp = y * (t * (z * -9.0));
} else if (z <= 1.15e+22) {
tmp = (x * 2.0) + ((a * 27.0) * b);
} else {
tmp = t * (z * (y * -9.0));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if z <= -4100000000000.0: tmp = y * (t * (z * -9.0)) elif z <= 1.15e+22: tmp = (x * 2.0) + ((a * 27.0) * b) else: tmp = t * (z * (y * -9.0)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= -4100000000000.0) tmp = Float64(y * Float64(t * Float64(z * -9.0))); elseif (z <= 1.15e+22) tmp = Float64(Float64(x * 2.0) + Float64(Float64(a * 27.0) * b)); else tmp = Float64(t * Float64(z * Float64(y * -9.0))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (z <= -4100000000000.0)
tmp = y * (t * (z * -9.0));
elseif (z <= 1.15e+22)
tmp = (x * 2.0) + ((a * 27.0) * b);
else
tmp = t * (z * (y * -9.0));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -4100000000000.0], N[(y * N[(t * N[(z * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.15e+22], N[(N[(x * 2.0), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision], N[(t * N[(z * N[(y * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4100000000000:\\
\;\;\;\;y \cdot \left(t \cdot \left(z \cdot -9\right)\right)\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{+22}:\\
\;\;\;\;x \cdot 2 + \left(a \cdot 27\right) \cdot b\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(z \cdot \left(y \cdot -9\right)\right)\\
\end{array}
\end{array}
if z < -4.1e12Initial program 96.5%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval86.4%
Simplified86.4%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6446.9%
Simplified46.9%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6447.0%
Applied egg-rr47.0%
if -4.1e12 < z < 1.1500000000000001e22Initial program 98.7%
Taylor expanded in x around inf
*-lowering-*.f6477.0%
Simplified77.0%
if 1.1500000000000001e22 < z Initial program 92.8%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval87.2%
Simplified87.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6448.9%
Simplified48.9%
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.6%
Applied egg-rr54.6%
Final simplification64.5%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* 27.0 (* a b)))) (if (<= b -2.65e-163) t_1 (if (<= b 1.2e-8) (* x 2.0) t_1))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 27.0 * (a * b);
double tmp;
if (b <= -2.65e-163) {
tmp = t_1;
} else if (b <= 1.2e-8) {
tmp = x * 2.0;
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = 27.0d0 * (a * b)
if (b <= (-2.65d-163)) then
tmp = t_1
else if (b <= 1.2d-8) then
tmp = x * 2.0d0
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 27.0 * (a * b);
double tmp;
if (b <= -2.65e-163) {
tmp = t_1;
} else if (b <= 1.2e-8) {
tmp = x * 2.0;
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = 27.0 * (a * b) tmp = 0 if b <= -2.65e-163: tmp = t_1 elif b <= 1.2e-8: tmp = x * 2.0 else: tmp = t_1 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(27.0 * Float64(a * b)) tmp = 0.0 if (b <= -2.65e-163) tmp = t_1; elseif (b <= 1.2e-8) tmp = Float64(x * 2.0); else tmp = t_1; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = 27.0 * (a * b);
tmp = 0.0;
if (b <= -2.65e-163)
tmp = t_1;
elseif (b <= 1.2e-8)
tmp = x * 2.0;
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -2.65e-163], t$95$1, If[LessEqual[b, 1.2e-8], N[(x * 2.0), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := 27 \cdot \left(a \cdot b\right)\\
\mathbf{if}\;b \leq -2.65 \cdot 10^{-163}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;b \leq 1.2 \cdot 10^{-8}:\\
\;\;\;\;x \cdot 2\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if b < -2.65000000000000008e-163 or 1.19999999999999999e-8 < b Initial program 96.6%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval92.2%
Simplified92.2%
Taylor expanded in a around inf
*-lowering-*.f64N/A
*-lowering-*.f6451.1%
Simplified51.1%
if -2.65000000000000008e-163 < b < 1.19999999999999999e-8Initial program 96.8%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval95.7%
Simplified95.7%
Taylor expanded in x around inf
*-lowering-*.f6442.2%
Simplified42.2%
Final simplification47.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* x 2.0))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
return x * 2.0;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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
code = x * 2.0d0
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
return x * 2.0;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): return x * 2.0
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) return Float64(x * 2.0) end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
tmp = x * 2.0;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
x \cdot 2
\end{array}
Initial program 96.7%
sub-negN/A
associate-+l+N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*l*N/A
associate-*l*N/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-rgt-neg-inN/A
*-lowering-*.f64N/A
metadata-eval93.5%
Simplified93.5%
Taylor expanded in x around inf
*-lowering-*.f6426.4%
Simplified26.4%
Final simplification26.4%
(FPCore (x y z t a b) :precision binary64 (if (< y 7.590524218811189e-161) (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b))) (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y < 7.590524218811189e-161) {
tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
} else {
tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (y < 7.590524218811189d-161) then
tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
else
tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y < 7.590524218811189e-161) {
tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
} else {
tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if y < 7.590524218811189e-161: tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b)) else: tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b) return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (y < 7.590524218811189e-161) tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b))); else tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if (y < 7.590524218811189e-161) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b)); else tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\
\;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\
\end{array}
\end{array}
herbie shell --seed 2024150
(FPCore (x y z t a b)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, A"
:precision binary64
:alt
(! :herbie-platform default (if (< y 7590524218811189/100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (- (* x 2) (* (* (* y 9) z) t)) (* a (* 27 b))) (+ (- (* x 2) (* 9 (* y (* t z)))) (* (* a 27) b))))
(+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))