
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.8e+132)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/
(+
(+ 1.0 (+ alpha (+ (/ 1.0 beta) (/ alpha beta))))
(* (/ (+ alpha 2.0) beta) (- -1.0 alpha)))
(+ 2.0 (+ beta alpha)))
(* beta (+ (/ alpha beta) (+ 1.0 (/ 3.0 beta))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.8e+132) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.8d+132) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = (((1.0d0 + (alpha + ((1.0d0 / beta) + (alpha / beta)))) + (((alpha + 2.0d0) / beta) * ((-1.0d0) - alpha))) / (2.0d0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0d0 + (3.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.8e+132) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.8e+132: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.8e+132) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(alpha + Float64(Float64(1.0 / beta) + Float64(alpha / beta)))) + Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(-1.0 - alpha))) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta * Float64(Float64(alpha / beta) + Float64(1.0 + Float64(3.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.8e+132)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = (((1.0 + (alpha + ((1.0 / beta) + (alpha / beta)))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.8e+132], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(alpha + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta * N[(N[(alpha / beta), $MachinePrecision] + N[(1.0 + N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+132}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \left(\alpha + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right)\right) + \frac{\alpha + 2}{\beta} \cdot \left(-1 - \alpha\right)}{2 + \left(\beta + \alpha\right)}}{\beta \cdot \left(\frac{\alpha}{\beta} + \left(1 + \frac{3}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 1.80000000000000008e132Initial program 99.3%
associate-/l/98.2%
+-commutative98.2%
associate-+l+98.2%
*-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
metadata-eval98.2%
associate-+l+98.2%
Simplified98.2%
if 1.80000000000000008e132 < beta Initial program 79.3%
Taylor expanded in beta around inf 79.3%
associate-+r+79.3%
associate-*r/79.3%
metadata-eval79.3%
Simplified79.3%
Taylor expanded in beta around inf 82.7%
associate-/l*93.7%
Simplified93.7%
Final simplification97.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1e+132)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/
(+
(+ 1.0 (+ (/ alpha beta) (+ alpha (/ 1.0 beta))))
(* (/ (+ 4.0 (* alpha 2.0)) beta) (- -1.0 alpha)))
beta)
(+ 1.0 (+ 2.0 (+ beta alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+132) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = (((1.0 + ((alpha / beta) + (alpha + (1.0 / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+132) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = (((1.0d0 + ((alpha / beta) + (alpha + (1.0d0 / beta)))) + (((4.0d0 + (alpha * 2.0d0)) / beta) * ((-1.0d0) - alpha))) / beta) / (1.0d0 + (2.0d0 + (beta + alpha)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+132) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = (((1.0 + ((alpha / beta) + (alpha + (1.0 / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+132: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = (((1.0 + ((alpha / beta) + (alpha + (1.0 / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1e+132) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(Float64(1.0 + Float64(Float64(alpha / beta) + Float64(alpha + Float64(1.0 / beta)))) + Float64(Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta) * Float64(-1.0 - alpha))) / beta) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1e+132)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = (((1.0 + ((alpha / beta) + (alpha + (1.0 / beta)))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha))) / beta) / (1.0 + (2.0 + (beta + alpha)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+132], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + N[(N[(alpha / beta), $MachinePrecision] + N[(alpha + N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 10^{+132}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \left(\frac{\alpha}{\beta} + \left(\alpha + \frac{1}{\beta}\right)\right)\right) + \frac{4 + \alpha \cdot 2}{\beta} \cdot \left(-1 - \alpha\right)}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 9.99999999999999991e131Initial program 99.3%
associate-/l/98.2%
+-commutative98.2%
associate-+l+98.2%
*-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
metadata-eval98.2%
associate-+l+98.2%
Simplified98.2%
if 9.99999999999999991e131 < beta Initial program 79.3%
Taylor expanded in beta around inf 82.7%
associate-/l*93.6%
cancel-sign-sub-inv93.6%
associate-+r+93.6%
mul-1-neg93.6%
distribute-lft-in93.6%
metadata-eval93.6%
mul-1-neg93.6%
unsub-neg93.6%
Simplified93.6%
Final simplification97.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2e+152)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha)))
(* beta (+ (/ alpha beta) (+ 1.0 (/ 3.0 beta))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+152) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2d+152) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0d0 + (3.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+152) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2e+152: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2e+152) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta * Float64(Float64(alpha / beta) + Float64(1.0 + Float64(3.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2e+152)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+152], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta * N[(N[(alpha / beta), $MachinePrecision] + N[(1.0 + N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+152}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta \cdot \left(\frac{\alpha}{\beta} + \left(1 + \frac{3}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 2.0000000000000001e152Initial program 99.3%
associate-/l/98.2%
+-commutative98.2%
associate-+l+98.2%
*-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
metadata-eval98.2%
associate-+l+98.2%
Simplified98.3%
if 2.0000000000000001e152 < beta Initial program 77.3%
Taylor expanded in beta around inf 77.3%
associate-+r+77.3%
associate-*r/77.3%
metadata-eval77.3%
Simplified77.3%
Taylor expanded in beta around inf 93.9%
Final simplification97.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 3e+129)
(/
(/ 1.0 (/ t_0 (* (+ 1.0 alpha) (+ beta 1.0))))
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha)))
(* beta (+ (/ alpha beta) (+ 1.0 (/ 3.0 beta))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3e+129) {
tmp = (1.0 / (t_0 / ((1.0 + alpha) * (beta + 1.0)))) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3d+129) then
tmp = (1.0d0 / (t_0 / ((1.0d0 + alpha) * (beta + 1.0d0)))) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0d0 + (3.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3e+129) {
tmp = (1.0 / (t_0 / ((1.0 + alpha) * (beta + 1.0)))) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3e+129: tmp = (1.0 / (t_0 / ((1.0 + alpha) * (beta + 1.0)))) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3e+129) tmp = Float64(Float64(1.0 / Float64(t_0 / Float64(Float64(1.0 + alpha) * Float64(beta + 1.0)))) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta * Float64(Float64(alpha / beta) + Float64(1.0 + Float64(3.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 3e+129)
tmp = (1.0 / (t_0 / ((1.0 + alpha) * (beta + 1.0)))) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3e+129], N[(N[(1.0 / N[(t$95$0 / N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta * N[(N[(alpha / beta), $MachinePrecision] + N[(1.0 + N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{+129}:\\
\;\;\;\;\frac{\frac{1}{\frac{t\_0}{\left(1 + \alpha\right) \cdot \left(\beta + 1\right)}}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta \cdot \left(\frac{\alpha}{\beta} + \left(1 + \frac{3}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 3.0000000000000003e129Initial program 99.3%
associate-/l/98.2%
+-commutative98.2%
associate-+l+98.2%
*-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
metadata-eval98.2%
associate-+l+98.2%
Simplified98.2%
clear-num98.2%
inv-pow98.2%
+-commutative98.2%
distribute-rgt1-in98.2%
fma-define98.2%
Applied egg-rr98.2%
unpow-198.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
+-commutative98.2%
fma-undefine98.2%
+-commutative98.2%
*-commutative98.2%
+-commutative98.2%
associate-+r+98.2%
distribute-lft1-in98.2%
+-commutative98.2%
+-commutative98.2%
Simplified98.2%
if 3.0000000000000003e129 < beta Initial program 80.0%
Taylor expanded in beta around inf 80.0%
associate-+r+80.0%
associate-*r/80.0%
metadata-eval80.0%
Simplified80.0%
Taylor expanded in beta around inf 93.0%
Final simplification97.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 8.2e+151)
(* (+ 1.0 alpha) (/ (/ (+ beta 1.0) (* t_0 t_0)) (+ (+ beta alpha) 3.0)))
(/
(/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha)))
(* beta (+ (/ alpha beta) (+ 1.0 (/ 3.0 beta))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 8.2e+151) {
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * t_0)) / ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 8.2d+151) then
tmp = (1.0d0 + alpha) * (((beta + 1.0d0) / (t_0 * t_0)) / ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0d0 + (3.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 8.2e+151) {
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * t_0)) / ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 8.2e+151: tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * t_0)) / ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 8.2e+151) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(beta + 1.0) / Float64(t_0 * t_0)) / Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta * Float64(Float64(alpha / beta) + Float64(1.0 + Float64(3.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 8.2e+151)
tmp = (1.0 + alpha) * (((beta + 1.0) / (t_0 * t_0)) / ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.2e+151], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta * N[(N[(alpha / beta), $MachinePrecision] + N[(1.0 + N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 8.2 \cdot 10^{+151}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{\beta + 1}{t\_0 \cdot t\_0}}{\left(\beta + \alpha\right) + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta \cdot \left(\frac{\alpha}{\beta} + \left(1 + \frac{3}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 8.1999999999999996e151Initial program 99.3%
Simplified87.9%
*-un-lft-identity87.9%
associate-/l*88.3%
+-commutative88.3%
associate-+r+88.3%
associate-*r*88.3%
pow288.3%
associate-+r+88.3%
Applied egg-rr88.3%
*-lft-identity88.3%
+-commutative88.3%
associate-/r*94.1%
+-commutative94.1%
+-commutative94.1%
+-commutative94.1%
associate-+r+94.1%
+-commutative94.1%
+-commutative94.1%
Simplified94.1%
unpow294.1%
associate-+l+94.1%
associate-+l+94.1%
Applied egg-rr94.1%
if 8.1999999999999996e151 < beta Initial program 77.3%
Taylor expanded in beta around inf 77.3%
associate-+r+77.3%
associate-*r/77.3%
metadata-eval77.3%
Simplified77.3%
Taylor expanded in beta around inf 93.9%
Final simplification94.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.2)
(/ (+ 1.0 alpha) (* (+ alpha (+ beta 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))))
(/
(/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha)))
(* beta (+ (/ alpha beta) (+ 1.0 (/ 3.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.2d0) then
tmp = (1.0d0 + alpha) / ((alpha + (beta + 2.0d0)) * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0d0 + (3.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.2) {
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.2: tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.2) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta * Float64(Float64(alpha / beta) + Float64(1.0 + Float64(3.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.2)
tmp = (1.0 + alpha) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta * ((alpha / beta) + (1.0 + (3.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.2], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta * N[(N[(alpha / beta), $MachinePrecision] + N[(1.0 + N[(3.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.2:\\
\;\;\;\;\frac{1 + \alpha}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta \cdot \left(\frac{\alpha}{\beta} + \left(1 + \frac{3}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 3.2000000000000002Initial program 99.9%
Simplified94.7%
Taylor expanded in beta around 0 92.8%
Taylor expanded in beta around 0 93.0%
if 3.2000000000000002 < beta Initial program 85.9%
Taylor expanded in beta around inf 85.9%
associate-+r+85.9%
associate-*r/85.9%
metadata-eval85.9%
Simplified85.9%
Taylor expanded in beta around inf 84.7%
Final simplification90.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5e+31) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ (+ beta alpha) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+31) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5d+31) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((beta + alpha) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+31) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+31: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+31) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(beta + alpha) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5e+31)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5e+31], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+31}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\beta + \alpha\right) + 3}\\
\end{array}
\end{array}
if beta < 5.00000000000000027e31Initial program 99.3%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 88.0%
+-commutative88.0%
Simplified88.0%
Taylor expanded in alpha around 0 61.9%
+-commutative61.9%
+-commutative61.9%
Simplified61.9%
if 5.00000000000000027e31 < beta Initial program 85.6%
Taylor expanded in beta around inf 89.4%
Taylor expanded in alpha around 0 89.4%
+-commutative89.4%
Simplified89.4%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9e+30) (/ (+ beta 1.0) (* (+ beta 2.0) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ (+ beta alpha) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9e+30) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d+30) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / ((beta + alpha) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9e+30) {
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9e+30: tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9e+30) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(beta + alpha) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9e+30)
tmp = (beta + 1.0) / ((beta + 2.0) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9e+30], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9 \cdot 10^{+30}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\beta + \alpha\right) + 3}\\
\end{array}
\end{array}
if beta < 2.8999999999999998e30Initial program 99.3%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 88.0%
+-commutative88.0%
Simplified88.0%
Taylor expanded in alpha around 0 61.9%
+-commutative61.9%
+-commutative61.9%
Simplified61.9%
*-un-lft-identity61.9%
Applied egg-rr61.9%
*-lft-identity61.9%
associate-/l/61.9%
+-commutative61.9%
associate-*l*61.9%
Simplified61.9%
if 2.8999999999999998e30 < beta Initial program 85.6%
Taylor expanded in beta around inf 89.4%
Taylor expanded in alpha around 0 89.4%
+-commutative89.4%
Simplified89.4%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.72)
(+
0.08333333333333333
(*
beta
(-
(* beta (- (* beta 0.024691358024691357) 0.011574074074074073))
0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ (+ beta alpha) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.72) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.72d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * ((beta * 0.024691358024691357d0) - 0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((beta + alpha) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.72) {
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.72: tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.72) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * Float64(Float64(beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(beta + alpha) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.72)
tmp = 0.08333333333333333 + (beta * ((beta * ((beta * 0.024691358024691357) - 0.011574074074074073)) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.72], N[(0.08333333333333333 + N[(beta * N[(N[(beta * N[(N[(beta * 0.024691358024691357), $MachinePrecision] - 0.011574074074074073), $MachinePrecision]), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.72:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot \left(\beta \cdot 0.024691358024691357 - 0.011574074074074073\right) - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\beta + \alpha\right) + 3}\\
\end{array}
\end{array}
if beta < 1.71999999999999997Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 62.5%
+-commutative62.5%
+-commutative62.5%
Simplified62.5%
Taylor expanded in beta around 0 62.1%
if 1.71999999999999997 < beta Initial program 86.1%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ (+ beta alpha) 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / ((beta + alpha) + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(beta + alpha) + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / ((beta + alpha) + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\beta + \alpha\right) + 3}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 62.5%
+-commutative62.5%
+-commutative62.5%
Simplified62.5%
Taylor expanded in beta around 0 62.1%
if 1.55000000000000004 < beta Initial program 86.1%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.58)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.58) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.58d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.58) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.58: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.58) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.58)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.58], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.58:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.5800000000000001Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 62.5%
+-commutative62.5%
+-commutative62.5%
Simplified62.5%
Taylor expanded in beta around 0 62.1%
if 1.5800000000000001 < beta Initial program 86.1%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.4%
+-commutative83.4%
Simplified83.4%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.7)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.7d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.7: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.7)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 0.027777777777777776));
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.7], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.8%
+-commutative87.8%
Simplified87.8%
Taylor expanded in alpha around 0 62.5%
+-commutative62.5%
+-commutative62.5%
Simplified62.5%
Taylor expanded in beta around 0 62.1%
if 1.69999999999999996 < beta Initial program 86.1%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around -inf 80.5%
associate-*r*80.5%
mul-1-neg80.5%
sub-neg80.5%
associate-*r/80.5%
distribute-lft-in80.5%
metadata-eval80.5%
metadata-eval80.5%
mul-1-neg80.5%
unsub-neg80.5%
metadata-eval80.5%
metadata-eval80.5%
Simplified80.5%
Taylor expanded in beta around inf 83.4%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.7%
if 2.7999999999999998 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around -inf 81.2%
associate-*r*81.2%
mul-1-neg81.2%
sub-neg81.2%
associate-*r/81.2%
distribute-lft-in81.2%
metadata-eval81.2%
metadata-eval81.2%
mul-1-neg81.2%
unsub-neg81.2%
metadata-eval81.2%
metadata-eval81.2%
Simplified81.2%
Taylor expanded in beta around inf 84.1%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.7%
if 2.5 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 75.5%
associate-/r*75.5%
+-commutative75.5%
Simplified75.5%
Final simplification66.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.7%
if 2.5 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 75.5%
Final simplification66.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.7%
if 2.7999999999999998 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 75.5%
Taylor expanded in beta around inf 75.5%
Final simplification66.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.7%
if 2.7999999999999998 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 75.5%
Taylor expanded in beta around 0 7.4%
Final simplification42.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in alpha around 0 87.9%
+-commutative87.9%
Simplified87.9%
Taylor expanded in alpha around 0 62.7%
+-commutative62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in beta around 0 61.0%
if 4 < beta Initial program 85.9%
Taylor expanded in beta around inf 84.3%
Taylor expanded in alpha around 0 75.5%
Taylor expanded in beta around 0 7.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.9%
associate-/l/93.5%
+-commutative93.5%
associate-+l+93.5%
*-commutative93.5%
metadata-eval93.5%
associate-+l+93.5%
metadata-eval93.5%
+-commutative93.5%
+-commutative93.5%
+-commutative93.5%
metadata-eval93.5%
metadata-eval93.5%
associate-+l+93.5%
Simplified93.5%
Taylor expanded in alpha around 0 85.3%
+-commutative85.3%
Simplified85.3%
Taylor expanded in alpha around 0 67.6%
+-commutative67.6%
+-commutative67.6%
Simplified67.6%
Taylor expanded in beta around 0 40.5%
herbie shell --seed 2024182
(FPCore (alpha beta)
:name "Octave 3.8, jcobi/3"
:precision binary64
:pre (and (> alpha -1.0) (> beta -1.0))
(/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ alpha beta) (* 2.0 1.0))) (+ (+ (+ alpha beta) (* 2.0 1.0)) 1.0)))