
(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 17 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 2.0) alpha)))
(if (<= beta 6.5e+54)
(* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (* t_0 (+ alpha (+ beta 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 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 6.5e+54) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 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 = (beta + 2.0d0) + alpha
if (beta <= 6.5d+54) then
tmp = (1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / (t_0 * (alpha + (beta + 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 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 6.5e+54) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 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 = (beta + 2.0) + alpha tmp = 0 if beta <= 6.5e+54: tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 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(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 6.5e+54) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 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 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 6.5e+54)
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 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[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 6.5e+54], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $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 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 6.5 \cdot 10^{+54}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_0}}{t_0 \cdot \left(\alpha + \left(\beta + 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 < 6.5e54Initial program 99.8%
associate-/l/99.0%
associate-+l+99.0%
+-commutative99.0%
associate-+r+99.0%
associate-+l+99.0%
distribute-rgt1-in99.0%
*-rgt-identity99.0%
distribute-lft-out99.0%
+-commutative99.0%
associate-*l/99.0%
*-commutative99.0%
associate-*r/89.5%
Simplified89.5%
if 6.5e54 < beta Initial program 78.6%
associate-/l/74.5%
associate-+l+74.5%
+-commutative74.5%
associate-+r+74.5%
associate-+l+74.5%
distribute-rgt1-in74.5%
*-rgt-identity74.5%
distribute-lft-out74.5%
+-commutative74.5%
associate-*l/89.3%
*-commutative89.3%
associate-*r/89.3%
Simplified89.3%
associate-*r/89.3%
+-commutative89.3%
Applied egg-rr89.3%
+-commutative89.3%
*-commutative89.3%
+-commutative89.3%
associate-*r/89.3%
+-commutative89.3%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 90.5%
associate-*r/90.5%
neg-mul-190.5%
distribute-neg-in90.5%
metadata-eval90.5%
unsub-neg90.5%
Simplified90.5%
Final simplification89.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 3.2e-94)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.0)))))
(if (<= beta 5e+49)
(* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3.2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 5e+49) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((beta + 2.0) * (beta + 3.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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 3.2d-94) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.0d0))))
else if (beta <= 5d+49) then
tmp = (1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / ((beta + 2.0d0) * (beta + 3.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 t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3.2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 5e+49) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 3.2e-94: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0)))) elif beta <= 5e+49: tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 3.2e-94) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); elseif (beta <= 5e+49) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(Float64(beta + 2.0) * Float64(beta + 3.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)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 3.2e-94)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
elseif (beta <= 5e+49)
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((beta + 2.0) * (beta + 3.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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 3.2e-94], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5e+49], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$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[(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 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 3.2 \cdot 10^{-94}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{elif}\;\beta \leq 5 \cdot 10^{+49}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_0}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 3.19999999999999997e-94Initial program 99.8%
associate-/l/98.8%
associate-/r*88.5%
associate-+l+88.5%
+-commutative88.5%
associate-+r+88.5%
associate-+l+88.5%
distribute-rgt1-in88.5%
*-rgt-identity88.5%
distribute-lft-out88.5%
*-commutative88.5%
metadata-eval88.5%
associate-+l+88.5%
+-commutative88.5%
Simplified88.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in beta around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in alpha around 0 87.1%
unpow287.1%
distribute-rgt-out87.1%
+-commutative87.1%
Simplified87.1%
if 3.19999999999999997e-94 < beta < 5.0000000000000004e49Initial program 99.6%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*l/99.7%
*-commutative99.7%
associate-*r/92.1%
Simplified92.1%
Taylor expanded in alpha around 0 73.1%
if 5.0000000000000004e49 < beta Initial program 78.6%
Taylor expanded in beta around -inf 90.0%
Final simplification85.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)) (t_1 (/ (+ 1.0 beta) t_0)))
(if (<= beta 3.2e-94)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.0)))))
(if (<= beta 7e+49)
(* (+ 1.0 alpha) (/ t_1 (* (+ beta 2.0) (+ beta 3.0))))
(* t_1 (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double t_1 = (1.0 + beta) / t_0;
double tmp;
if (beta <= 3.2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 7e+49) {
tmp = (1.0 + alpha) * (t_1 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = t_1 * (((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) :: t_1
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
t_1 = (1.0d0 + beta) / t_0
if (beta <= 3.2d-94) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.0d0))))
else if (beta <= 7d+49) then
tmp = (1.0d0 + alpha) * (t_1 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = t_1 * (((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 = (beta + 2.0) + alpha;
double t_1 = (1.0 + beta) / t_0;
double tmp;
if (beta <= 3.2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 7e+49) {
tmp = (1.0 + alpha) * (t_1 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = t_1 * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha t_1 = (1.0 + beta) / t_0 tmp = 0 if beta <= 3.2e-94: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0)))) elif beta <= 7e+49: tmp = (1.0 + alpha) * (t_1 / ((beta + 2.0) * (beta + 3.0))) else: tmp = t_1 * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) t_1 = Float64(Float64(1.0 + beta) / t_0) tmp = 0.0 if (beta <= 3.2e-94) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); elseif (beta <= 7e+49) tmp = Float64(Float64(1.0 + alpha) * Float64(t_1 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(t_1 * 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 = (beta + 2.0) + alpha;
t_1 = (1.0 + beta) / t_0;
tmp = 0.0;
if (beta <= 3.2e-94)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
elseif (beta <= 7e+49)
tmp = (1.0 + alpha) * (t_1 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = t_1 * (((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[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 3.2e-94], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 7e+49], N[(N[(1.0 + alpha), $MachinePrecision] * N[(t$95$1 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * 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 := \left(\beta + 2\right) + \alpha\\
t_1 := \frac{1 + \beta}{t_0}\\
\mathbf{if}\;\beta \leq 3.2 \cdot 10^{-94}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{elif}\;\beta \leq 7 \cdot 10^{+49}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{t_1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;t_1 \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 3.19999999999999997e-94Initial program 99.8%
associate-/l/98.8%
associate-/r*88.5%
associate-+l+88.5%
+-commutative88.5%
associate-+r+88.5%
associate-+l+88.5%
distribute-rgt1-in88.5%
*-rgt-identity88.5%
distribute-lft-out88.5%
*-commutative88.5%
metadata-eval88.5%
associate-+l+88.5%
+-commutative88.5%
Simplified88.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in beta around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in alpha around 0 87.1%
unpow287.1%
distribute-rgt-out87.1%
+-commutative87.1%
Simplified87.1%
if 3.19999999999999997e-94 < beta < 6.9999999999999995e49Initial program 99.6%
associate-/l/99.8%
associate-+l+99.8%
+-commutative99.8%
associate-+r+99.8%
associate-+l+99.8%
distribute-rgt1-in99.8%
*-rgt-identity99.8%
distribute-lft-out99.8%
+-commutative99.8%
associate-*l/99.7%
*-commutative99.7%
associate-*r/92.1%
Simplified92.1%
Taylor expanded in alpha around 0 73.1%
if 6.9999999999999995e49 < beta Initial program 78.6%
associate-/l/74.5%
associate-+l+74.5%
+-commutative74.5%
associate-+r+74.5%
associate-+l+74.5%
distribute-rgt1-in74.5%
*-rgt-identity74.5%
distribute-lft-out74.5%
+-commutative74.5%
associate-*l/89.3%
*-commutative89.3%
associate-*r/89.3%
Simplified89.3%
associate-*r/89.3%
+-commutative89.3%
Applied egg-rr89.3%
+-commutative89.3%
*-commutative89.3%
+-commutative89.3%
associate-*r/89.3%
+-commutative89.3%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 90.5%
Final simplification86.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 34.0)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.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 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 34.0) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.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 = (beta + 2.0d0) + alpha
if (beta <= 34.0d0) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.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 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 34.0) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.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 = (beta + 2.0) + alpha tmp = 0 if beta <= 34.0: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.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(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 34.0) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.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 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 34.0)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.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[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 34.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $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 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 34:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\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 < 34Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in alpha around 0 86.6%
unpow286.6%
distribute-rgt-out86.6%
+-commutative86.6%
Simplified86.6%
if 34 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
associate-*r/91.3%
+-commutative91.3%
Applied egg-rr91.3%
+-commutative91.3%
*-commutative91.3%
+-commutative91.3%
associate-*r/91.3%
+-commutative91.3%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 90.2%
associate-*r/90.2%
neg-mul-190.2%
distribute-neg-in90.2%
metadata-eval90.2%
unsub-neg90.2%
Simplified90.2%
Final simplification87.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ beta 2.0) alpha))) (* (/ (+ 1.0 beta) t_0) (/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (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
real(8) :: t_0
t_0 = (beta + 2.0d0) + alpha
code = ((1.0d0 + beta) / t_0) * (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) return Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $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 := \left(\beta + 2\right) + \alpha\\
\frac{1 + \beta}{t_0} \cdot \frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)}
\end{array}
\end{array}
Initial program 94.8%
associate-/l/93.3%
associate-+l+93.3%
+-commutative93.3%
associate-+r+93.3%
associate-+l+93.3%
distribute-rgt1-in93.3%
*-rgt-identity93.3%
distribute-lft-out93.3%
+-commutative93.3%
associate-*l/96.7%
*-commutative96.7%
associate-*r/89.4%
Simplified89.4%
associate-*r/96.7%
+-commutative96.7%
Applied egg-rr96.7%
+-commutative96.7%
*-commutative96.7%
+-commutative96.7%
associate-*r/96.7%
+-commutative96.7%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 3e-94)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.0)))))
(if (<= beta 1.52e+38)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 1.52e+38) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 3d-94) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.0d0))))
else if (beta <= 1.52d+38) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 1.52e+38) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 3e-94: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0)))) elif beta <= 1.52e+38: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 3e-94) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); elseif (beta <= 1.52e+38) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * Float64(-1.0 / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 3e-94)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
elseif (beta <= 1.52e+38)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 3e-94], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.52e+38], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{-94}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{elif}\;\beta \leq 1.52 \cdot 10^{+38}:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.0000000000000001e-94Initial program 99.8%
associate-/l/98.8%
associate-/r*88.5%
associate-+l+88.5%
+-commutative88.5%
associate-+r+88.5%
associate-+l+88.5%
distribute-rgt1-in88.5%
*-rgt-identity88.5%
distribute-lft-out88.5%
*-commutative88.5%
metadata-eval88.5%
associate-+l+88.5%
+-commutative88.5%
Simplified88.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in beta around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in alpha around 0 87.1%
unpow287.1%
distribute-rgt-out87.1%
+-commutative87.1%
Simplified87.1%
if 3.0000000000000001e-94 < beta < 1.51999999999999996e38Initial program 99.6%
associate-/l/99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+l+99.7%
distribute-rgt1-in99.7%
*-rgt-identity99.7%
distribute-lft-out99.7%
+-commutative99.7%
associate-*l/99.6%
*-commutative99.6%
associate-*r/93.8%
Simplified93.8%
associate-*r/99.6%
+-commutative99.6%
Applied egg-rr99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-*r/99.6%
+-commutative99.6%
associate-/r*99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
Simplified99.4%
Taylor expanded in alpha around 0 72.7%
if 1.51999999999999996e38 < beta Initial program 80.2%
associate-/l/76.4%
associate-+l+76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+l+76.4%
distribute-rgt1-in76.4%
*-rgt-identity76.4%
distribute-lft-out76.4%
+-commutative76.4%
associate-*l/90.1%
*-commutative90.1%
associate-*r/88.7%
Simplified88.7%
Taylor expanded in beta around inf 84.1%
unpow284.1%
Simplified84.1%
inv-pow84.1%
unpow-prod-down84.8%
inv-pow84.8%
inv-pow84.8%
Applied egg-rr84.8%
Final simplification84.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 1e-94)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.0)))))
(if (<= beta 1.52e+38)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 1.52e+38) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1d-94) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.0d0))))
else if (beta <= 1.52d+38) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.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 t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 1.52e+38) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1e-94: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0)))) elif beta <= 1.52e+38: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1e-94) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); elseif (beta <= 1.52e+38) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.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)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1e-94)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
elseif (beta <= 1.52e+38)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1e-94], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.52e+38], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $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}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 10^{-94}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{elif}\;\beta \leq 1.52 \cdot 10^{+38}:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 9.9999999999999996e-95Initial program 99.8%
associate-/l/98.8%
associate-/r*88.5%
associate-+l+88.5%
+-commutative88.5%
associate-+r+88.5%
associate-+l+88.5%
distribute-rgt1-in88.5%
*-rgt-identity88.5%
distribute-lft-out88.5%
*-commutative88.5%
metadata-eval88.5%
associate-+l+88.5%
+-commutative88.5%
Simplified88.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in beta around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in alpha around 0 87.1%
unpow287.1%
distribute-rgt-out87.1%
+-commutative87.1%
Simplified87.1%
if 9.9999999999999996e-95 < beta < 1.51999999999999996e38Initial program 99.6%
associate-/l/99.7%
associate-+l+99.7%
+-commutative99.7%
associate-+r+99.7%
associate-+l+99.7%
distribute-rgt1-in99.7%
*-rgt-identity99.7%
distribute-lft-out99.7%
+-commutative99.7%
associate-*l/99.6%
*-commutative99.6%
associate-*r/93.8%
Simplified93.8%
associate-*r/99.6%
+-commutative99.6%
Applied egg-rr99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-*r/99.6%
+-commutative99.6%
associate-/r*99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
Simplified99.4%
Taylor expanded in alpha around 0 72.7%
if 1.51999999999999996e38 < beta Initial program 80.2%
Taylor expanded in beta around -inf 89.3%
Final simplification85.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 2e-94)
(/ (+ 1.0 alpha) (* t_0 (+ 6.0 (* alpha (+ alpha 5.0)))))
(if (<= beta 2.5e+36)
(/ (+ 1.0 beta) (* t_0 (* (+ beta 2.0) (+ beta 3.0))))
(* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 2.5e+36) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 2d-94) then
tmp = (1.0d0 + alpha) / (t_0 * (6.0d0 + (alpha * (alpha + 5.0d0))))
else if (beta <= 2.5d+36) then
tmp = (1.0d0 + beta) / (t_0 * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 2e-94) {
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
} else if (beta <= 2.5e+36) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 2e-94: tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0)))) elif beta <= 2.5e+36: tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 2e-94) tmp = Float64(Float64(1.0 + alpha) / Float64(t_0 * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); elseif (beta <= 2.5e+36) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * Float64(-1.0 / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 2e-94)
tmp = (1.0 + alpha) / (t_0 * (6.0 + (alpha * (alpha + 5.0))));
elseif (beta <= 2.5e+36)
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 2e-94], N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2.5e+36], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{-94}:\\
\;\;\;\;\frac{1 + \alpha}{t_0 \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{elif}\;\beta \leq 2.5 \cdot 10^{+36}:\\
\;\;\;\;\frac{1 + \beta}{t_0 \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.9999999999999999e-94Initial program 99.8%
associate-/l/98.8%
associate-/r*88.5%
associate-+l+88.5%
+-commutative88.5%
associate-+r+88.5%
associate-+l+88.5%
distribute-rgt1-in88.5%
*-rgt-identity88.5%
distribute-lft-out88.5%
*-commutative88.5%
metadata-eval88.5%
associate-+l+88.5%
+-commutative88.5%
Simplified88.5%
Taylor expanded in beta around 0 87.0%
Taylor expanded in beta around 0 87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in alpha around 0 87.1%
unpow287.1%
distribute-rgt-out87.1%
+-commutative87.1%
Simplified87.1%
if 1.9999999999999999e-94 < beta < 2.49999999999999988e36Initial program 99.6%
associate-/l/99.7%
associate-/r*93.5%
associate-+l+93.5%
+-commutative93.5%
associate-+r+93.5%
associate-+l+93.5%
distribute-rgt1-in93.5%
*-rgt-identity93.5%
distribute-lft-out93.5%
*-commutative93.5%
metadata-eval93.5%
associate-+l+93.5%
+-commutative93.5%
Simplified93.5%
Taylor expanded in alpha around 0 70.8%
Taylor expanded in alpha around 0 71.6%
if 2.49999999999999988e36 < beta Initial program 80.5%
associate-/l/76.8%
associate-+l+76.8%
+-commutative76.8%
associate-+r+76.8%
associate-+l+76.8%
distribute-rgt1-in76.8%
*-rgt-identity76.8%
distribute-lft-out76.8%
+-commutative76.8%
associate-*l/90.3%
*-commutative90.3%
associate-*r/88.8%
Simplified88.8%
Taylor expanded in beta around inf 84.4%
unpow284.4%
Simplified84.4%
inv-pow84.4%
unpow-prod-down85.0%
inv-pow85.0%
inv-pow85.0%
Applied egg-rr85.0%
Final simplification84.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 36.0) (/ (+ 1.0 alpha) (* (+ (+ beta 2.0) alpha) (* (+ alpha 3.0) (+ 2.0 alpha)))) (* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 36.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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 <= 36.0d0) then
tmp = (1.0d0 + alpha) / (((beta + 2.0d0) + alpha) * ((alpha + 3.0d0) * (2.0d0 + alpha)))
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 36.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 36.0: tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha))) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 36.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * 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 <= 36.0)
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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, 36.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 36:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 36Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
if 36 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
Taylor expanded in beta around inf 84.6%
unpow284.6%
Simplified84.6%
inv-pow84.6%
unpow-prod-down85.1%
inv-pow85.1%
inv-pow85.1%
Applied egg-rr85.1%
Final simplification86.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.6) (/ (+ 1.0 alpha) (* (+ (+ beta 2.0) alpha) (+ 6.0 (* alpha (+ alpha 5.0))))) (* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * (alpha + 5.0))));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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 <= 7.6d0) then
tmp = (1.0d0 + alpha) / (((beta + 2.0d0) + alpha) * (6.0d0 + (alpha * (alpha + 5.0d0))))
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.6) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * (alpha + 5.0))));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.6: tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * (alpha + 5.0)))) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.6) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(6.0 + Float64(alpha * Float64(alpha + 5.0))))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * 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 <= 7.6)
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * (alpha + 5.0))));
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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, 7.6], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(6.0 + N[(alpha * N[(alpha + 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.6:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(6 + \alpha \cdot \left(\alpha + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 7.5999999999999996Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in alpha around 0 86.6%
unpow286.6%
distribute-rgt-out86.6%
+-commutative86.6%
Simplified86.6%
if 7.5999999999999996 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
Taylor expanded in beta around inf 84.6%
unpow284.6%
Simplified84.6%
inv-pow84.6%
unpow-prod-down85.1%
inv-pow85.1%
inv-pow85.1%
Applied egg-rr85.1%
Final simplification86.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 59.0) (/ (+ 1.0 alpha) (* (+ (+ beta 2.0) alpha) (+ 6.0 (* alpha 5.0)))) (* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 59.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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 <= 59.0d0) then
tmp = (1.0d0 + alpha) / (((beta + 2.0d0) + alpha) * (6.0d0 + (alpha * 5.0d0)))
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 59.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 59.0: tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0))) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 59.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * 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 <= 59.0)
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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, 59.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 59:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 59Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in alpha around 0 76.4%
*-commutative76.4%
Simplified76.4%
if 59 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
Taylor expanded in beta around inf 84.6%
unpow284.6%
Simplified84.6%
inv-pow84.6%
unpow-prod-down85.1%
inv-pow85.1%
inv-pow85.1%
Applied egg-rr85.1%
Final simplification78.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.8) (/ 0.16666666666666666 (+ beta 2.0)) (* (+ 1.0 alpha) (* (/ -1.0 beta) (/ -1.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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 <= 7.8d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (1.0d0 + alpha) * (((-1.0d0) / beta) * ((-1.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.8: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (1.0 + alpha) * ((-1.0 / beta) * (-1.0 / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.8) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(-1.0 / beta) * 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 <= 7.8)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (1.0 + alpha) * ((-1.0 / beta) * (-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, 7.8], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \left(\frac{-1}{\beta} \cdot \frac{-1}{\beta}\right)\\
\end{array}
\end{array}
if beta < 7.79999999999999982Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in alpha around 0 56.9%
if 7.79999999999999982 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
Taylor expanded in beta around inf 84.6%
unpow284.6%
Simplified84.6%
inv-pow84.6%
unpow-prod-down85.1%
inv-pow85.1%
inv-pow85.1%
Applied egg-rr85.1%
Final simplification65.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.8) (/ 0.16666666666666666 (+ beta 2.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.16666666666666666 / (beta + 2.0);
} 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 <= 7.8d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
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 <= 7.8) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.8: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.8) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.8)
tmp = 0.16666666666666666 / (beta + 2.0);
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, 7.8], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999982Initial program 99.8%
associate-/l/98.9%
associate-/r*88.9%
associate-+l+88.9%
+-commutative88.9%
associate-+r+88.9%
associate-+l+88.9%
distribute-rgt1-in88.9%
*-rgt-identity88.9%
distribute-lft-out88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
+-commutative88.9%
Simplified88.9%
Taylor expanded in beta around 0 86.4%
Taylor expanded in beta around 0 86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in alpha around 0 56.9%
if 7.79999999999999982 < beta Initial program 82.6%
associate-/l/79.3%
associate-+l+79.3%
+-commutative79.3%
associate-+r+79.3%
associate-+l+79.3%
distribute-rgt1-in79.3%
*-rgt-identity79.3%
distribute-lft-out79.3%
+-commutative79.3%
associate-*l/91.3%
*-commutative91.3%
associate-*r/90.0%
Simplified90.0%
Taylor expanded in beta around inf 84.6%
unpow284.6%
Simplified84.6%
un-div-inv84.6%
Applied egg-rr84.6%
Final simplification64.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7e+38) (/ 0.16666666666666666 (+ beta 2.0)) (/ alpha (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7e+38) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 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 <= 7d+38) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = alpha / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7e+38) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = alpha / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7e+38: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = alpha / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7e+38) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(alpha / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7e+38)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 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, 7e+38], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7 \cdot 10^{+38}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 7.00000000000000003e38Initial program 99.8%
associate-/l/99.0%
associate-/r*89.4%
associate-+l+89.4%
+-commutative89.4%
associate-+r+89.4%
associate-+l+89.4%
distribute-rgt1-in89.4%
*-rgt-identity89.4%
distribute-lft-out89.4%
*-commutative89.4%
metadata-eval89.4%
associate-+l+89.4%
+-commutative89.4%
Simplified89.4%
Taylor expanded in beta around 0 82.7%
Taylor expanded in beta around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in alpha around 0 54.6%
if 7.00000000000000003e38 < beta Initial program 80.2%
associate-/l/76.4%
associate-+l+76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+l+76.4%
distribute-rgt1-in76.4%
*-rgt-identity76.4%
distribute-lft-out76.4%
+-commutative76.4%
associate-*l/90.1%
*-commutative90.1%
associate-*r/88.7%
Simplified88.7%
Taylor expanded in beta around inf 84.1%
unpow284.1%
Simplified84.1%
Taylor expanded in alpha around inf 59.3%
unpow259.3%
Simplified59.3%
Final simplification55.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (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 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (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[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 94.8%
associate-/l/93.3%
associate-/r*81.8%
associate-+l+81.8%
+-commutative81.8%
associate-+r+81.8%
associate-+l+81.8%
distribute-rgt1-in81.8%
*-rgt-identity81.8%
distribute-lft-out81.8%
*-commutative81.8%
metadata-eval81.8%
associate-+l+81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 75.9%
Taylor expanded in beta around 0 67.1%
+-commutative67.1%
Simplified67.1%
Taylor expanded in alpha around 0 42.4%
Final simplification42.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 alpha))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / 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
code = 0.3333333333333333d0 / alpha
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / alpha;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / alpha
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / alpha) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / alpha;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / alpha), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\alpha}
\end{array}
Initial program 94.8%
associate-/l/93.3%
associate-/l/81.8%
associate-+l+81.8%
+-commutative81.8%
associate-+r+81.8%
associate-+l+81.8%
distribute-rgt1-in81.8%
*-rgt-identity81.8%
distribute-lft-out81.8%
+-commutative81.8%
times-frac96.7%
Simplified96.7%
Taylor expanded in beta around 0 84.1%
+-commutative84.1%
Simplified84.1%
Taylor expanded in alpha around inf 33.1%
Taylor expanded in alpha around 0 4.3%
Final simplification4.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / beta;
}
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 = 1.0d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta}
\end{array}
Initial program 94.8%
associate-/l/93.3%
associate-+l+93.3%
+-commutative93.3%
associate-+r+93.3%
associate-+l+93.3%
distribute-rgt1-in93.3%
*-rgt-identity93.3%
distribute-lft-out93.3%
+-commutative93.3%
associate-*l/96.7%
*-commutative96.7%
associate-*r/89.4%
Simplified89.4%
associate-*r/96.7%
+-commutative96.7%
Applied egg-rr96.7%
+-commutative96.7%
*-commutative96.7%
+-commutative96.7%
associate-*r/96.7%
+-commutative96.7%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around inf 41.2%
Taylor expanded in beta around inf 3.9%
Final simplification3.9%
herbie shell --seed 2023178
(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)))