
(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 15 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 (+ beta (+ alpha 2.0))))
(/
(/ (* (+ 1.0 beta) (/ (+ 1.0 alpha) t_0)) t_0)
(+ 1.0 (+ 2.0 (+ beta alpha))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) * ((1.0 + alpha) / t_0)) / t_0) / (1.0 + (2.0 + (beta + alpha)));
}
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
t_0 = beta + (alpha + 2.0d0)
code = (((1.0d0 + beta) * ((1.0d0 + alpha) / t_0)) / t_0) / (1.0d0 + (2.0d0 + (beta + alpha)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + beta) * ((1.0 + alpha) / t_0)) / t_0) / (1.0 + (2.0 + (beta + alpha)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + beta) * ((1.0 + alpha) / t_0)) / t_0) / (1.0 + (2.0 + (beta + alpha)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / t_0)) / t_0) / Float64(1.0 + Float64(2.0 + Float64(beta + alpha)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + beta) * ((1.0 + alpha) / t_0)) / t_0) / (1.0 + (2.0 + (beta + alpha)));
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]}, N[(N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $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 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{t_0}}{t_0}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}
\end{array}
\end{array}
Initial program 94.0%
metadata-eval94.0%
div-inv94.0%
Applied egg-rr94.0%
*-commutative94.0%
associate-*l/94.0%
*-lft-identity94.0%
*-commutative94.0%
/-rgt-identity94.0%
associate-*r/99.8%
/-rgt-identity99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
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 3.8)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* t_0 (* (+ alpha 2.0) (+ alpha 3.0))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.8) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / 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 <= 3.8d0) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (t_0 * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / 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 <= 3.8) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.8: tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / 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 <= 3.8) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(t_0 * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / 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 <= 3.8)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / 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, 3.8], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $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.8:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t_0 \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.7999999999999998Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
if 3.7999999999999998 < beta Initial program 81.5%
metadata-eval81.5%
div-inv81.5%
Applied egg-rr81.5%
*-commutative81.5%
associate-*l/81.5%
*-lft-identity81.5%
*-commutative81.5%
/-rgt-identity81.5%
associate-*r/99.7%
/-rgt-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
metadata-eval99.7%
associate-/l/87.1%
+-commutative87.1%
*-commutative87.1%
associate-+r+87.1%
+-commutative87.1%
associate-+r+87.1%
metadata-eval87.1%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
associate-*r/85.4%
distribute-lft-in85.4%
metadata-eval85.4%
neg-mul-185.4%
unsub-neg85.4%
Simplified85.4%
Final simplification91.5%
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)))) (* (/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0))) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + beta) / t_0);
}
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
t_0 = alpha + (beta + 2.0d0)
code = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * ((1.0d0 + beta) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + beta) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * ((1.0 + beta) / t_0);
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]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \frac{1 + \beta}{t_0}
\end{array}
\end{array}
Initial program 94.0%
metadata-eval94.0%
div-inv94.0%
Applied egg-rr94.0%
*-commutative94.0%
associate-*l/94.0%
*-lft-identity94.0%
*-commutative94.0%
/-rgt-identity94.0%
associate-*r/99.8%
/-rgt-identity99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-/l/95.8%
+-commutative95.8%
*-commutative95.8%
associate-+r+95.8%
+-commutative95.8%
associate-+r+95.8%
metadata-eval95.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.7)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(* (+ alpha (+ beta 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.7) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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 <= 6.7d0) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / ((alpha + (beta + 2.0d0)) * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((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 <= 6.7) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.7: tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.7) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.7)
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((alpha + (beta + 2.0)) * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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, 6.7], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $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[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.7:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 6.70000000000000018Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
if 6.70000000000000018 < beta Initial program 81.5%
metadata-eval81.5%
div-inv81.5%
Applied egg-rr81.5%
*-commutative81.5%
associate-*l/81.5%
*-lft-identity81.5%
*-commutative81.5%
/-rgt-identity81.5%
associate-*r/99.7%
/-rgt-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
metadata-eval99.7%
associate-/l/87.1%
+-commutative87.1%
*-commutative87.1%
associate-+r+87.1%
+-commutative87.1%
associate-+r+87.1%
metadata-eval87.1%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
associate-*r/85.4%
distribute-lft-in85.4%
metadata-eval85.4%
neg-mul-185.4%
unsub-neg85.4%
Simplified85.4%
Taylor expanded in beta around inf 84.7%
Final simplification91.3%
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 14.5)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* t_0 (* (+ alpha 2.0) (+ alpha 3.0))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(- 1.0 (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 14.5) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / 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 <= 14.5d0) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (t_0 * ((alpha + 2.0d0) * (alpha + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 - (alpha / 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 <= 14.5) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 14.5: tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / 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 <= 14.5) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(t_0 * Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 - Float64(alpha / 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 <= 14.5)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_0 * ((alpha + 2.0) * (alpha + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / 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, 14.5], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $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 14.5:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t_0 \cdot \left(\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 - \frac{\alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 14.5Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
if 14.5 < beta Initial program 81.5%
metadata-eval81.5%
div-inv81.5%
Applied egg-rr81.5%
*-commutative81.5%
associate-*l/81.5%
*-lft-identity81.5%
*-commutative81.5%
/-rgt-identity81.5%
associate-*r/99.7%
/-rgt-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
metadata-eval99.7%
associate-/l/87.1%
+-commutative87.1%
*-commutative87.1%
associate-+r+87.1%
+-commutative87.1%
associate-+r+87.1%
metadata-eval87.1%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
associate-*r/85.4%
distribute-lft-in85.4%
metadata-eval85.4%
neg-mul-185.4%
unsub-neg85.4%
Simplified85.4%
Taylor expanded in alpha around inf 84.8%
mul-1-neg84.8%
distribute-neg-frac84.8%
Simplified84.8%
Final simplification91.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.7e+16)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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.7d+16) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((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.7e+16) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7e+16: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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.7e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(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.7e+16)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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.7e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.7e16Initial program 99.8%
associate-/l/99.9%
*-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 2.7e16 < beta Initial program 81.1%
metadata-eval81.1%
div-inv81.1%
Applied egg-rr81.1%
*-commutative81.1%
associate-*l/81.1%
*-lft-identity81.1%
*-commutative81.1%
/-rgt-identity81.1%
associate-*r/99.8%
/-rgt-identity99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
metadata-eval99.8%
associate-/l/86.8%
+-commutative86.8%
*-commutative86.8%
associate-+r+86.8%
+-commutative86.8%
associate-+r+86.8%
metadata-eval86.8%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
associate-*r/85.4%
distribute-lft-in85.4%
metadata-eval85.4%
neg-mul-185.4%
unsub-neg85.4%
Simplified85.4%
Taylor expanded in beta around inf 85.4%
Final simplification75.5%
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 4.2)
(/ (/ (+ 1.0 alpha) (+ alpha 3.0)) (* t_0 t_0))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.2) {
tmp = ((1.0 + alpha) / (alpha + 3.0)) / (t_0 * t_0);
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4.2d0) then
tmp = ((1.0d0 + alpha) / (alpha + 3.0d0)) / (t_0 * t_0)
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((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 t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4.2) {
tmp = ((1.0 + alpha) / (alpha + 3.0)) / (t_0 * t_0);
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4.2: tmp = ((1.0 + alpha) / (alpha + 3.0)) / (t_0 * t_0) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 4.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 3.0)) / Float64(t_0 * t_0)); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0)))); 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 <= 4.2)
tmp = ((1.0 + alpha) / (alpha + 3.0)) / (t_0 * t_0);
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $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 4.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 3}}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.8%
associate-/l/99.8%
associate-/l/95.2%
associate-/r*99.9%
Simplified99.9%
Taylor expanded in beta around 0 98.9%
if 4.20000000000000018 < beta Initial program 81.5%
metadata-eval81.5%
div-inv81.5%
Applied egg-rr81.5%
*-commutative81.5%
associate-*l/81.5%
*-lft-identity81.5%
*-commutative81.5%
/-rgt-identity81.5%
associate-*r/99.7%
/-rgt-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
metadata-eval99.7%
associate-/l/87.1%
+-commutative87.1%
*-commutative87.1%
associate-+r+87.1%
+-commutative87.1%
associate-+r+87.1%
metadata-eval87.1%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
associate-*r/85.4%
distribute-lft-in85.4%
metadata-eval85.4%
neg-mul-185.4%
unsub-neg85.4%
Simplified85.4%
Taylor expanded in beta around inf 84.7%
Final simplification94.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 1.0)
(* 0.16666666666666666 (/ (+ 1.0 beta) (+ beta 2.0)))
(/ (/ (+ 1.0 alpha) t_0) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.0) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.0d0) then
tmp = 0.16666666666666666d0 * ((1.0d0 + beta) / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / t_0) / t_0
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.0) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.0: tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0)) else: tmp = ((1.0 + alpha) / t_0) / t_0 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.0) tmp = Float64(0.16666666666666666 * Float64(Float64(1.0 + beta) / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0); 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.0)
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
else
tmp = ((1.0 + alpha) / t_0) / t_0;
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.0], N[(0.16666666666666666 * N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $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:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1 + \beta}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0}\\
\end{array}
\end{array}
if beta < 1Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
Taylor expanded in alpha around 0 69.9%
if 1 < beta Initial program 81.5%
associate-/l/77.6%
associate-/l/60.4%
associate-/r*77.6%
Simplified77.6%
Taylor expanded in beta around inf 83.8%
associate-+r+83.8%
metadata-eval83.8%
associate-+r+83.8%
metadata-eval83.8%
associate-/r*85.3%
div-inv85.2%
metadata-eval85.2%
associate-+r+85.2%
metadata-eval85.2%
associate-+r+85.2%
Applied egg-rr85.2%
associate-*r/85.3%
*-rgt-identity85.3%
+-commutative85.3%
+-commutative85.3%
Simplified85.3%
Final simplification74.8%
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 3.5e+15)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))
(/ (/ (+ 1.0 alpha) t_0) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 3.5e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 3.5d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / t_0) / t_0
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 <= 3.5e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / t_0) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 3.5e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / t_0) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 3.5e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0); 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 <= 3.5e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / t_0) / t_0;
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, 3.5e+15], N[(N[(N[(1.0 + beta), $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] / t$95$0), $MachinePrecision] / t$95$0), $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.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{t_0}\\
\end{array}
\end{array}
if beta < 3.5e15Initial program 99.8%
associate-/l/99.9%
*-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Taylor expanded in alpha around 0 71.2%
+-commutative71.2%
Simplified71.2%
if 3.5e15 < beta Initial program 81.1%
associate-/l/77.0%
associate-/l/59.4%
associate-/r*77.0%
Simplified77.0%
Taylor expanded in beta around inf 84.5%
associate-+r+84.5%
metadata-eval84.5%
associate-+r+84.5%
metadata-eval84.5%
associate-/r*86.0%
div-inv85.9%
metadata-eval85.9%
associate-+r+85.9%
metadata-eval85.9%
associate-+r+85.9%
Applied egg-rr85.9%
associate-*r/86.0%
*-rgt-identity86.0%
+-commutative86.0%
+-commutative86.0%
Simplified86.0%
Final simplification75.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) (* 0.16666666666666666 (/ (+ 1.0 beta) (+ beta 2.0))) (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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 <= 2.0d0) then
tmp = 0.16666666666666666d0 * ((1.0d0 + beta) / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = Float64(0.16666666666666666 * Float64(Float64(1.0 + beta) / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.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, 2.0], N[(0.16666666666666666 * N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1 + \beta}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
Taylor expanded in alpha around 0 69.9%
if 2 < beta Initial program 81.5%
associate-/l/77.6%
associate-/l/60.4%
associate-/r*77.6%
Simplified77.6%
Taylor expanded in beta around inf 83.8%
associate-+r+83.8%
metadata-eval83.8%
associate-+r+83.8%
metadata-eval83.8%
associate-/r*85.3%
div-inv85.2%
metadata-eval85.2%
associate-+r+85.2%
metadata-eval85.2%
associate-+r+85.2%
Applied egg-rr85.2%
Taylor expanded in beta around inf 84.8%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.75) (* 0.16666666666666666 (/ (+ 1.0 beta) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.75) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((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) :: tmp
if (beta <= 1.75d0) then
tmp = 0.16666666666666666d0 * ((1.0d0 + beta) / (beta + 2.0d0))
else
tmp = ((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 tmp;
if (beta <= 1.75) {
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.75: tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.75) tmp = Float64(0.16666666666666666 * Float64(Float64(1.0 + beta) / Float64(beta + 2.0))); else tmp = Float64(Float64(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)
tmp = 0.0;
if (beta <= 1.75)
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
else
tmp = ((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_] := If[LessEqual[beta, 1.75], N[(0.16666666666666666 * N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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}
\mathbf{if}\;\beta \leq 1.75:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1 + \beta}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.75Initial program 99.8%
associate-/l/99.9%
associate-/r*95.2%
+-commutative95.2%
+-commutative95.2%
*-commutative95.2%
associate-+l+95.2%
associate-+r+95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
*-commutative95.2%
distribute-rgt1-in95.2%
+-commutative95.2%
metadata-eval95.2%
associate-+l+95.2%
*-commutative95.2%
Simplified95.2%
Taylor expanded in beta around 0 94.3%
Taylor expanded in alpha around 0 69.9%
if 1.75 < beta Initial program 81.5%
Taylor expanded in beta around inf 84.9%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* 0.16666666666666666 (/ (+ 1.0 alpha) (+ alpha 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
}
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.16666666666666666d0 * ((1.0d0 + alpha) / (alpha + 2.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 * Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 * ((1.0 + alpha) / (alpha + 2.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 * N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666 \cdot \frac{1 + \alpha}{\alpha + 2}
\end{array}
Initial program 94.0%
associate-/l/92.8%
associate-/r*84.2%
+-commutative84.2%
+-commutative84.2%
*-commutative84.2%
associate-+l+84.2%
associate-+r+84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
metadata-eval84.2%
associate-+l+84.2%
*-commutative84.2%
Simplified84.2%
Taylor expanded in beta around 0 66.3%
Taylor expanded in alpha around 0 49.2%
Taylor expanded in beta around 0 49.0%
Final simplification49.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (* 0.16666666666666666 (/ (+ 1.0 beta) (+ beta 2.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
}
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.16666666666666666d0 * ((1.0d0 + beta) / (beta + 2.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 * Float64(Float64(1.0 + beta) / Float64(beta + 2.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 * ((1.0 + beta) / (beta + 2.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 * N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666 \cdot \frac{1 + \beta}{\beta + 2}
\end{array}
Initial program 94.0%
associate-/l/92.8%
associate-/r*84.2%
+-commutative84.2%
+-commutative84.2%
*-commutative84.2%
associate-+l+84.2%
associate-+r+84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
metadata-eval84.2%
associate-+l+84.2%
*-commutative84.2%
Simplified84.2%
Taylor expanded in beta around 0 66.3%
Taylor expanded in alpha around 0 49.0%
Final simplification49.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.5 (* (+ alpha 2.0) (+ alpha 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.5 / ((alpha + 2.0) * (alpha + 3.0));
}
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.5d0 / ((alpha + 2.0d0) * (alpha + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.5 / ((alpha + 2.0) * (alpha + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.5 / ((alpha + 2.0) * (alpha + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.5 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.5 / ((alpha + 2.0) * (alpha + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.5 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.5}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}
\end{array}
Initial program 94.0%
associate-/l/92.8%
*-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
+-commutative92.8%
Simplified92.8%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Taylor expanded in beta around 0 63.8%
Final simplification63.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.16666666666666666)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666;
}
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.16666666666666666d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.16666666666666666 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.16666666666666666
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.16666666666666666
\end{array}
Initial program 94.0%
associate-/l/92.8%
associate-/r*84.2%
+-commutative84.2%
+-commutative84.2%
*-commutative84.2%
associate-+l+84.2%
associate-+r+84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
*-commutative84.2%
distribute-rgt1-in84.2%
+-commutative84.2%
metadata-eval84.2%
associate-+l+84.2%
*-commutative84.2%
Simplified84.2%
Taylor expanded in beta around 0 66.3%
Taylor expanded in alpha around 0 49.2%
Taylor expanded in beta around inf 10.8%
Taylor expanded in alpha around 0 11.2%
Final simplification11.2%
herbie shell --seed 2023305
(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)))