
(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 22 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 (+ 2.0 (+ beta alpha))) (t_1 (+ beta (+ alpha 2.0))))
(if (<= beta 2e+135)
(*
(/ (+ alpha (+ beta (fma alpha beta 1.0))) t_1)
(/ 1.0 (* t_1 (+ alpha (+ beta 3.0)))))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double t_1 = beta + (alpha + 2.0);
double tmp;
if (beta <= 2e+135) {
tmp = ((alpha + (beta + fma(alpha, beta, 1.0))) / t_1) * (1.0 / (t_1 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) t_1 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 2e+135) tmp = Float64(Float64(Float64(alpha + Float64(beta + fma(alpha, beta, 1.0))) / t_1) * Float64(1.0 / Float64(t_1 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+135], N[(N[(N[(alpha + N[(beta + N[(alpha * beta + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(1.0 / N[(t$95$1 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
t_1 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+135}:\\
\;\;\;\;\frac{\alpha + \left(\beta + \mathsf{fma}\left(\alpha, \beta, 1\right)\right)}{t_1} \cdot \frac{1}{t_1 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 1.99999999999999992e135Initial program 98.8%
associate-/l/98.1%
div-inv98.2%
associate-+l+98.2%
associate-+l+98.2%
*-commutative98.2%
fma-def98.2%
+-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
*-commutative98.2%
+-commutative98.2%
metadata-eval98.2%
associate-+l+98.2%
metadata-eval98.2%
Applied egg-rr98.2%
if 1.99999999999999992e135 < beta Initial program 75.9%
Taylor expanded in beta around inf 94.0%
Final simplification97.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 5e+103)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* (+ 3.0 (+ beta alpha)) t_0))
(/
(+
(/ 1.0 beta)
(+
(+ (/ 1.0 (* beta beta)) (+ (/ alpha beta) (/ alpha (* beta beta))))
(/ (- -1.0 alpha) (/ (* beta beta) (+ 4.0 (* alpha 2.0))))))
(+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5e+103) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = ((1.0 / beta) + (((1.0 / (beta * beta)) + ((alpha / beta) + (alpha / (beta * beta)))) + ((-1.0 - alpha) / ((beta * beta) / (4.0 + (alpha * 2.0)))))) / (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 5d+103) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0d0 + (beta + alpha)) * t_0)
else
tmp = ((1.0d0 / beta) + (((1.0d0 / (beta * beta)) + ((alpha / beta) + (alpha / (beta * beta)))) + (((-1.0d0) - alpha) / ((beta * beta) / (4.0d0 + (alpha * 2.0d0)))))) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5e+103) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = ((1.0 / beta) + (((1.0 / (beta * beta)) + ((alpha / beta) + (alpha / (beta * beta)))) + ((-1.0 - alpha) / ((beta * beta) / (4.0 + (alpha * 2.0)))))) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 5e+103: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0) else: tmp = ((1.0 / beta) + (((1.0 / (beta * beta)) + ((alpha / beta) + (alpha / (beta * beta)))) + ((-1.0 - alpha) / ((beta * beta) / (4.0 + (alpha * 2.0)))))) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5e+103) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(Float64(3.0 + Float64(beta + alpha)) * t_0)); else tmp = Float64(Float64(Float64(1.0 / beta) + Float64(Float64(Float64(1.0 / Float64(beta * beta)) + Float64(Float64(alpha / beta) + Float64(alpha / Float64(beta * beta)))) + Float64(Float64(-1.0 - alpha) / Float64(Float64(beta * beta) / Float64(4.0 + Float64(alpha * 2.0)))))) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 5e+103)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
else
tmp = ((1.0 / beta) + (((1.0 / (beta * beta)) + ((alpha / beta) + (alpha / (beta * beta)))) + ((-1.0 - alpha) / ((beta * beta) / (4.0 + (alpha * 2.0)))))) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+103], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 / beta), $MachinePrecision] + N[(N[(N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision] + N[(N[(alpha / beta), $MachinePrecision] + N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - alpha), $MachinePrecision] / N[(N[(beta * beta), $MachinePrecision] / N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+103}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t_0}}{\left(3 + \left(\beta + \alpha\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta} + \left(\left(\frac{1}{\beta \cdot \beta} + \left(\frac{\alpha}{\beta} + \frac{\alpha}{\beta \cdot \beta}\right)\right) + \frac{-1 - \alpha}{\frac{\beta \cdot \beta}{4 + \alpha \cdot 2}}\right)}{1 + t_0}\\
\end{array}
\end{array}
if beta < 5e103Initial program 99.3%
metadata-eval99.3%
flip3-+79.8%
div-inv79.7%
metadata-eval79.7%
metadata-eval79.7%
metadata-eval79.7%
+-commutative79.7%
metadata-eval79.7%
metadata-eval79.7%
associate-+r-79.7%
pow279.7%
metadata-eval79.7%
Applied egg-rr79.7%
*-un-lft-identity79.7%
associate-/l/79.7%
+-commutative79.7%
associate-+l+79.7%
metadata-eval79.7%
+-commutative79.7%
+-commutative79.7%
Applied egg-rr98.6%
if 5e103 < beta Initial program 77.9%
Taylor expanded in beta around inf 84.1%
associate--l+84.1%
unpow284.1%
unpow284.1%
associate-/l*93.0%
unpow293.0%
Simplified93.0%
Final simplification97.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 5.5e+87)
(/
(+ 1.0 (+ (+ beta alpha) (* beta alpha)))
(* t_0 (* (+ 3.0 (+ beta alpha)) t_0)))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5.5e+87) {
tmp = (1.0 + ((beta + alpha) + (beta * alpha))) / (t_0 * ((3.0 + (beta + alpha)) * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 5.5d+87) then
tmp = (1.0d0 + ((beta + alpha) + (beta * alpha))) / (t_0 * ((3.0d0 + (beta + alpha)) * t_0))
else
tmp = ((alpha + 1.0d0) / t_0) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5.5e+87) {
tmp = (1.0 + ((beta + alpha) + (beta * alpha))) / (t_0 * ((3.0 + (beta + alpha)) * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 5.5e+87: tmp = (1.0 + ((beta + alpha) + (beta * alpha))) / (t_0 * ((3.0 + (beta + alpha)) * t_0)) else: tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5.5e+87) tmp = Float64(Float64(1.0 + Float64(Float64(beta + alpha) + Float64(beta * alpha))) / Float64(t_0 * Float64(Float64(3.0 + Float64(beta + alpha)) * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 5.5e+87)
tmp = (1.0 + ((beta + alpha) + (beta * alpha))) / (t_0 * ((3.0 + (beta + alpha)) * t_0));
else
tmp = ((alpha + 1.0) / t_0) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.5e+87], N[(N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+87}:\\
\;\;\;\;\frac{1 + \left(\left(\beta + \alpha\right) + \beta \cdot \alpha\right)}{t_0 \cdot \left(\left(3 + \left(\beta + \alpha\right)\right) \cdot t_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 5.50000000000000022e87Initial program 99.8%
metadata-eval99.8%
flip3-+79.8%
div-inv79.7%
metadata-eval79.7%
metadata-eval79.7%
metadata-eval79.7%
+-commutative79.7%
metadata-eval79.7%
metadata-eval79.7%
associate-+r-79.7%
pow279.7%
metadata-eval79.7%
Applied egg-rr79.7%
*-un-lft-identity79.7%
associate-/l/79.7%
+-commutative79.7%
associate-+l+79.7%
metadata-eval79.7%
+-commutative79.7%
+-commutative79.7%
Applied egg-rr99.1%
*-lft-identity99.1%
associate-/l/90.5%
associate-+r+90.5%
*-commutative90.5%
+-commutative90.5%
+-commutative90.5%
+-commutative90.5%
+-commutative90.5%
Simplified90.5%
if 5.50000000000000022e87 < beta Initial program 78.0%
Taylor expanded in beta around inf 92.3%
Final simplification90.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 4e+103)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* (+ 3.0 (+ beta alpha)) t_0))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 4e+103) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = ((alpha + 1.0) / t_0) / (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 4d+103) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0d0 + (beta + alpha)) * t_0)
else
tmp = ((alpha + 1.0d0) / t_0) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 4e+103) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 4e+103: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0) else: tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 4e+103) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(Float64(3.0 + Float64(beta + alpha)) * t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 4e+103)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / ((3.0 + (beta + alpha)) * t_0);
else
tmp = ((alpha + 1.0) / t_0) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+103], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+103}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t_0}}{\left(3 + \left(\beta + \alpha\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 4e103Initial program 99.3%
metadata-eval99.3%
flip3-+79.8%
div-inv79.7%
metadata-eval79.7%
metadata-eval79.7%
metadata-eval79.7%
+-commutative79.7%
metadata-eval79.7%
metadata-eval79.7%
associate-+r-79.7%
pow279.7%
metadata-eval79.7%
Applied egg-rr79.7%
*-un-lft-identity79.7%
associate-/l/79.7%
+-commutative79.7%
associate-+l+79.7%
metadata-eval79.7%
+-commutative79.7%
+-commutative79.7%
Applied egg-rr98.6%
if 4e103 < beta Initial program 77.9%
Taylor expanded in beta around inf 93.2%
Final simplification97.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= alpha 7.5e-57)
(/ (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ beta 2.0)) (+ beta 3.0))
(*
(/ (+ alpha 1.0) (+ 2.0 (+ beta alpha)))
(/ 1.0 (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5e-57) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (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 (alpha <= 7.5d-57) then
tmp = (((beta + 1.0d0) / (beta + 2.0d0)) / (beta + 2.0d0)) / (beta + 3.0d0)
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (beta + alpha))) * (1.0d0 / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5e-57) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 7.5e-57: tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0) else: tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7.5e-57) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(beta + 2.0)) / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(beta + alpha))) * Float64(1.0 / 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 (alpha <= 7.5e-57)
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
else
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (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[alpha, 7.5e-57], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7.5 \cdot 10^{-57}:\\
\;\;\;\;\frac{\frac{\frac{\beta + 1}{\beta + 2}}{\beta + 2}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{2 + \left(\beta + \alpha\right)} \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if alpha < 7.49999999999999973e-57Initial program 99.9%
Taylor expanded in alpha around 0 99.7%
*-un-lft-identity99.7%
associate-/l/98.9%
metadata-eval98.9%
associate-+l+98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
Applied egg-rr98.9%
associate-*r/98.9%
times-frac99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*r/99.7%
*-commutative99.7%
times-frac98.9%
associate-*r/98.9%
*-lft-identity98.9%
*-commutative98.9%
associate-*r/98.9%
Simplified99.7%
Taylor expanded in alpha around 0 99.9%
Taylor expanded in alpha around 0 99.7%
if 7.49999999999999973e-57 < alpha Initial program 83.9%
Taylor expanded in beta around inf 25.9%
div-inv25.9%
metadata-eval25.9%
+-commutative25.9%
+-commutative25.9%
metadata-eval25.9%
associate-+l+25.9%
metadata-eval25.9%
+-commutative25.9%
associate-+r+25.9%
+-commutative25.9%
Applied egg-rr25.9%
Final simplification74.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 1.56e+41)
(/ (+ beta 1.0) (* t_0 (* (+ beta 3.0) (+ beta 2.0))))
(/ (/ (+ alpha 1.0) beta) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.56e+41) {
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 1.56d+41) then
tmp = (beta + 1.0d0) / (t_0 * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.56e+41) {
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1.56e+41: tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.56e+41) tmp = Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 1.56e+41)
tmp = (beta + 1.0) / (t_0 * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.56e+41], N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.56 \cdot 10^{+41}:\\
\;\;\;\;\frac{\beta + 1}{t_0 \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 1.56e41Initial program 99.8%
Taylor expanded in alpha around 0 83.1%
*-un-lft-identity83.1%
associate-/l/83.0%
metadata-eval83.0%
associate-+l+83.0%
+-commutative83.0%
metadata-eval83.0%
metadata-eval83.0%
+-commutative83.0%
+-commutative83.0%
Applied egg-rr83.0%
associate-*r/83.0%
times-frac83.1%
*-lft-identity83.1%
*-commutative83.1%
associate-*r/83.1%
*-commutative83.1%
times-frac83.1%
associate-*r/83.1%
*-lft-identity83.1%
*-commutative83.1%
associate-*r/83.1%
Simplified83.1%
*-un-lft-identity83.1%
associate-/l/83.1%
+-commutative83.1%
associate-+r+83.1%
+-commutative83.1%
+-commutative83.1%
Applied egg-rr83.1%
*-lft-identity83.1%
associate-/l/83.1%
*-commutative83.1%
+-commutative83.1%
associate-+l+83.1%
+-commutative83.1%
Simplified83.1%
Taylor expanded in alpha around 0 70.7%
if 1.56e41 < beta Initial program 81.9%
Taylor expanded in beta around inf 89.9%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= alpha 7.5e-57)
(/ (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ beta 2.0)) (+ 3.0 (+ beta alpha)))
(*
(/ (+ alpha 1.0) (+ 2.0 (+ beta alpha)))
(/ 1.0 (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5e-57) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (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 (alpha <= 7.5d-57) then
tmp = (((beta + 1.0d0) / (beta + 2.0d0)) / (beta + 2.0d0)) / (3.0d0 + (beta + alpha))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (beta + alpha))) * (1.0d0 / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 7.5e-57) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 7.5e-57: tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha)) else: tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 7.5e-57) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(beta + 2.0)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(beta + alpha))) * Float64(1.0 / 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 (alpha <= 7.5e-57)
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
else
tmp = ((alpha + 1.0) / (2.0 + (beta + alpha))) * (1.0 / (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[alpha, 7.5e-57], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 7.5 \cdot 10^{-57}:\\
\;\;\;\;\frac{\frac{\frac{\beta + 1}{\beta + 2}}{\beta + 2}}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{2 + \left(\beta + \alpha\right)} \cdot \frac{1}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if alpha < 7.49999999999999973e-57Initial program 99.9%
Taylor expanded in alpha around 0 99.7%
*-un-lft-identity99.7%
associate-/l/98.9%
metadata-eval98.9%
associate-+l+98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
Applied egg-rr98.9%
associate-*r/98.9%
times-frac99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*r/99.7%
*-commutative99.7%
times-frac98.9%
associate-*r/98.9%
*-lft-identity98.9%
*-commutative98.9%
associate-*r/98.9%
Simplified99.7%
Taylor expanded in alpha around 0 99.9%
if 7.49999999999999973e-57 < alpha Initial program 83.9%
Taylor expanded in beta around inf 25.9%
div-inv25.9%
metadata-eval25.9%
+-commutative25.9%
+-commutative25.9%
metadata-eval25.9%
associate-+l+25.9%
metadata-eval25.9%
+-commutative25.9%
associate-+r+25.9%
+-commutative25.9%
Applied egg-rr25.9%
Final simplification74.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 5e+15)
(/ (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ beta 2.0)) (+ 3.0 (+ beta alpha)))
(/ (/ (+ alpha 1.0) t_0) (+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5e+15) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.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 = 2.0d0 + (beta + alpha)
if (beta <= 5d+15) then
tmp = (((beta + 1.0d0) / (beta + 2.0d0)) / (beta + 2.0d0)) / (3.0d0 + (beta + alpha))
else
tmp = ((alpha + 1.0d0) / t_0) / (1.0d0 + t_0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 5e+15) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 5e+15: tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha)) else: tmp = ((alpha + 1.0) / t_0) / (1.0 + t_0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 5e+15) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(beta + 2.0)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(1.0 + t_0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 5e+15)
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (3.0 + (beta + alpha));
else
tmp = ((alpha + 1.0) / t_0) / (1.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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+15], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\frac{\beta + 1}{\beta + 2}}{\beta + 2}}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{1 + t_0}\\
\end{array}
\end{array}
if beta < 5e15Initial program 99.8%
Taylor expanded in alpha around 0 82.6%
*-un-lft-identity82.6%
associate-/l/82.6%
metadata-eval82.6%
associate-+l+82.6%
+-commutative82.6%
metadata-eval82.6%
metadata-eval82.6%
+-commutative82.6%
+-commutative82.6%
Applied egg-rr82.6%
associate-*r/82.6%
times-frac82.6%
*-lft-identity82.6%
*-commutative82.6%
associate-*r/82.6%
*-commutative82.6%
times-frac82.6%
associate-*r/82.6%
*-lft-identity82.6%
*-commutative82.6%
associate-*r/82.6%
Simplified82.6%
Taylor expanded in alpha around 0 70.2%
if 5e15 < beta Initial program 83.0%
Taylor expanded in beta around inf 90.7%
Final simplification76.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 2.2e-80) (/ (/ (/ (+ beta 1.0) (+ beta 2.0)) (+ beta 2.0)) (+ beta 3.0)) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 2.2e-80) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / 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 (alpha <= 2.2d-80) then
tmp = (((beta + 1.0d0) / (beta + 2.0d0)) / (beta + 2.0d0)) / (beta + 3.0d0)
else
tmp = ((alpha + 1.0d0) / 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 (alpha <= 2.2e-80) {
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 2.2e-80: tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 2.2e-80) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(beta + 2.0)) / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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 (alpha <= 2.2e-80)
tmp = (((beta + 1.0) / (beta + 2.0)) / (beta + 2.0)) / (beta + 3.0);
else
tmp = ((alpha + 1.0) / 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[alpha, 2.2e-80], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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}\;\alpha \leq 2.2 \cdot 10^{-80}:\\
\;\;\;\;\frac{\frac{\frac{\beta + 1}{\beta + 2}}{\beta + 2}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if alpha < 2.2000000000000001e-80Initial program 99.9%
Taylor expanded in alpha around 0 99.7%
*-un-lft-identity99.7%
associate-/l/98.9%
metadata-eval98.9%
associate-+l+98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
Applied egg-rr98.9%
associate-*r/98.9%
times-frac99.6%
*-lft-identity99.6%
*-commutative99.6%
associate-*r/99.7%
*-commutative99.7%
times-frac98.8%
associate-*r/98.8%
*-lft-identity98.8%
*-commutative98.8%
associate-*r/98.8%
Simplified99.7%
Taylor expanded in alpha around 0 99.9%
Taylor expanded in alpha around 0 99.7%
if 2.2000000000000001e-80 < alpha Initial program 84.8%
Taylor expanded in beta around inf 24.6%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.76) (/ (+ 0.25 (* (* beta beta) -0.0625)) (+ 3.0 (+ beta alpha))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.76) {
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.76d0) then
tmp = (0.25d0 + ((beta * beta) * (-0.0625d0))) / (3.0d0 + (beta + alpha))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.76) {
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.76: tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.76) tmp = Float64(Float64(0.25 + Float64(Float64(beta * beta) * -0.0625)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.76)
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.76], N[(N[(0.25 + N[(N[(beta * beta), $MachinePrecision] * -0.0625), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.76:\\
\;\;\;\;\frac{0.25 + \left(\beta \cdot \beta\right) \cdot -0.0625}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.76000000000000001Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
*-commutative69.9%
unpow269.9%
Simplified69.9%
if 1.76000000000000001 < beta Initial program 83.4%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in beta around inf 90.0%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.76) (/ (+ 0.25 (* (* beta beta) -0.0625)) (+ 3.0 (+ beta alpha))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ beta alpha))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.76) {
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / 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.76d0) then
tmp = (0.25d0 + ((beta * beta) * (-0.0625d0))) / (3.0d0 + (beta + alpha))
else
tmp = ((alpha + 1.0d0) / 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.76) {
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (beta + alpha)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.76: tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (beta + alpha))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.76) tmp = Float64(Float64(0.25 + Float64(Float64(beta * beta) * -0.0625)) / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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.76)
tmp = (0.25 + ((beta * beta) * -0.0625)) / (3.0 + (beta + alpha));
else
tmp = ((alpha + 1.0) / 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.76], N[(N[(0.25 + N[(N[(beta * beta), $MachinePrecision] * -0.0625), $MachinePrecision]), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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.76:\\
\;\;\;\;\frac{0.25 + \left(\beta \cdot \beta\right) \cdot -0.0625}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\beta + \alpha\right)\right)}\\
\end{array}
\end{array}
if beta < 1.76000000000000001Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
*-commutative69.9%
unpow269.9%
Simplified69.9%
if 1.76000000000000001 < beta Initial program 83.4%
Taylor expanded in beta around inf 90.1%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 3.0 (+ beta alpha)))) (if (<= beta 2.0) (/ 0.25 t_0) (/ (/ 1.0 (+ beta 2.0)) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 2.0) {
tmp = 0.25 / t_0;
} else {
tmp = (1.0 / (beta + 2.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 = 3.0d0 + (beta + alpha)
if (beta <= 2.0d0) then
tmp = 0.25d0 / t_0
else
tmp = (1.0d0 / (beta + 2.0d0)) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 2.0) {
tmp = 0.25 / t_0;
} else {
tmp = (1.0 / (beta + 2.0)) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (beta + alpha) tmp = 0 if beta <= 2.0: tmp = 0.25 / t_0 else: tmp = (1.0 / (beta + 2.0)) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 2.0) tmp = Float64(0.25 / t_0); else tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.25 / t_0;
else
tmp = (1.0 / (beta + 2.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[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.0], N[(0.25 / t$95$0), $MachinePrecision], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;\frac{0.25}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta + 2}}{t_0}\\
\end{array}
\end{array}
if beta < 2Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 2 < beta Initial program 83.4%
Taylor expanded in alpha around 0 86.4%
*-un-lft-identity86.4%
associate-/l/84.8%
metadata-eval84.8%
associate-+l+84.8%
+-commutative84.8%
metadata-eval84.8%
metadata-eval84.8%
+-commutative84.8%
+-commutative84.8%
Applied egg-rr84.8%
associate-*r/84.8%
times-frac86.3%
*-lft-identity86.3%
*-commutative86.3%
associate-*r/86.4%
*-commutative86.4%
times-frac84.8%
associate-*r/84.8%
*-lft-identity84.8%
*-commutative84.8%
associate-*r/84.8%
Simplified86.4%
Taylor expanded in beta around inf 84.9%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.25 (+ 3.0 (+ beta alpha))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.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 <= 4.2d0) then
tmp = 0.25d0 / (3.0d0 + (beta + alpha))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 0.25 / (3.0 + (beta + alpha)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.2) tmp = Float64(0.25 / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.2)
tmp = 0.25 / (3.0 + (beta + alpha));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (beta + 2.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, 4.2], N[(0.25 / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.2:\\
\;\;\;\;\frac{0.25}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 4.20000000000000018 < beta Initial program 83.4%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in beta around inf 90.0%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ 0.25 (+ 3.0 (+ beta alpha))) (* (+ alpha 1.0) (/ 1.0 (* beta beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = (alpha + 1.0) * (1.0 / (beta * beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.2d0) then
tmp = 0.25d0 / (3.0d0 + (beta + alpha))
else
tmp = (alpha + 1.0d0) * (1.0d0 / (beta * beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = (alpha + 1.0) * (1.0 / (beta * beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = 0.25 / (3.0 + (beta + alpha)) else: tmp = (alpha + 1.0) * (1.0 / (beta * beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(0.25 / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(alpha + 1.0) * Float64(1.0 / Float64(beta * beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = 0.25 / (3.0 + (beta + alpha));
else
tmp = (alpha + 1.0) * (1.0 / (beta * beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.2], N[(0.25 / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{0.25}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 6.20000000000000018 < beta Initial program 83.4%
Taylor expanded in beta around inf 82.1%
unpow282.1%
Simplified82.1%
div-inv82.1%
Applied egg-rr82.1%
*-commutative82.1%
+-commutative82.1%
Simplified82.1%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 3.0 (+ beta alpha)))) (if (<= beta 4.0) (/ 0.25 t_0) (/ (/ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / t_0;
} else {
tmp = (1.0 / beta) / 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 = 3.0d0 + (beta + alpha)
if (beta <= 4.0d0) then
tmp = 0.25d0 / t_0
else
tmp = (1.0d0 / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 4.0) {
tmp = 0.25 / t_0;
} else {
tmp = (1.0 / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (beta + alpha) tmp = 0 if beta <= 4.0: tmp = 0.25 / t_0 else: tmp = (1.0 / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 4.0) tmp = Float64(0.25 / t_0); else tmp = Float64(Float64(1.0 / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.25 / t_0;
else
tmp = (1.0 / beta) / 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[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.0], N[(0.25 / t$95$0), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.25}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 4Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 4 < beta Initial program 83.4%
Taylor expanded in alpha around 0 86.4%
*-un-lft-identity86.4%
associate-/l/84.8%
metadata-eval84.8%
associate-+l+84.8%
+-commutative84.8%
metadata-eval84.8%
metadata-eval84.8%
+-commutative84.8%
+-commutative84.8%
Applied egg-rr84.8%
associate-*r/84.8%
times-frac86.3%
*-lft-identity86.3%
*-commutative86.3%
associate-*r/86.4%
*-commutative86.4%
times-frac84.8%
associate-*r/84.8%
*-lft-identity84.8%
*-commutative84.8%
associate-*r/84.8%
Simplified86.4%
Taylor expanded in beta around inf 84.8%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.4) (/ 0.25 (+ 3.0 (+ beta alpha))) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.4d0) then
tmp = 0.25d0 / (3.0d0 + (beta + alpha))
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.4: tmp = 0.25 / (3.0 + (beta + alpha)) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.4) tmp = Float64(0.25 / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.4)
tmp = 0.25 / (3.0 + (beta + alpha));
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.4], N[(0.25 / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.4:\\
\;\;\;\;\frac{0.25}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.4000000000000004Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 6.4000000000000004 < beta Initial program 83.4%
Taylor expanded in alpha around 0 86.4%
Taylor expanded in beta around inf 80.9%
unpow280.9%
Simplified80.9%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (/ 0.25 (+ 3.0 (+ beta alpha))) (/ (+ alpha 1.0) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.2d0) then
tmp = 0.25d0 / (3.0d0 + (beta + alpha))
else
tmp = (alpha + 1.0d0) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = 0.25 / (3.0 + (beta + alpha));
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = 0.25 / (3.0 + (beta + alpha)) else: tmp = (alpha + 1.0) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(0.25 / Float64(3.0 + Float64(beta + alpha))); else tmp = Float64(Float64(alpha + 1.0) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = 0.25 / (3.0 + (beta + alpha));
else
tmp = (alpha + 1.0) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.2], N[(0.25 / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{0.25}{3 + \left(\beta + \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in alpha around 0 69.9%
Taylor expanded in beta around 0 69.9%
if 6.20000000000000018 < beta Initial program 83.4%
Taylor expanded in beta around inf 82.1%
unpow282.1%
Simplified82.1%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.25 (+ beta 3.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.25 / (beta + 3.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 0.25 / (beta + 3.0);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Taylor expanded in alpha around 0 82.4%
*-un-lft-identity82.4%
associate-/l/82.4%
metadata-eval82.4%
associate-+l+82.4%
+-commutative82.4%
metadata-eval82.4%
metadata-eval82.4%
+-commutative82.4%
+-commutative82.4%
Applied egg-rr82.4%
associate-*r/82.4%
times-frac82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
*-commutative82.4%
times-frac82.4%
associate-*r/82.4%
*-lft-identity82.4%
*-commutative82.4%
associate-*r/82.4%
Simplified82.4%
Taylor expanded in beta around 0 82.4%
Taylor expanded in alpha around 0 68.7%
if 6 < beta Initial program 83.4%
Taylor expanded in alpha around 0 86.4%
Taylor expanded in beta around inf 80.9%
unpow280.9%
Simplified80.9%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (+ 0.08333333333333333 (* alpha -0.027777777777777776)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333 + (alpha * -0.027777777777777776);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333 + (alpha * -0.027777777777777776)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333 + \alpha \cdot -0.027777777777777776
\end{array}
Initial program 94.4%
Taylor expanded in beta around 0 64.9%
+-commutative64.9%
Simplified64.9%
Taylor expanded in alpha around 0 46.8%
*-commutative46.8%
Simplified46.8%
Final simplification46.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ alpha 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (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.25d0 / (alpha + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (alpha + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(alpha + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (alpha + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\alpha + 3}
\end{array}
Initial program 94.4%
Taylor expanded in alpha around 0 83.7%
Taylor expanded in beta around 0 58.8%
associate-/r*58.8%
+-commutative58.8%
Simplified58.8%
Taylor expanded in alpha around 0 48.2%
Final simplification48.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 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.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 94.4%
Taylor expanded in alpha around 0 83.7%
*-un-lft-identity83.7%
associate-/l/83.2%
metadata-eval83.2%
associate-+l+83.2%
+-commutative83.2%
metadata-eval83.2%
metadata-eval83.2%
+-commutative83.2%
+-commutative83.2%
Applied egg-rr83.2%
associate-*r/83.2%
times-frac83.7%
*-lft-identity83.7%
*-commutative83.7%
associate-*r/83.7%
*-commutative83.7%
times-frac83.2%
associate-*r/83.2%
*-lft-identity83.2%
*-commutative83.2%
associate-*r/83.2%
Simplified83.7%
Taylor expanded in beta around 0 61.0%
Taylor expanded in alpha around 0 48.5%
Final simplification48.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.4%
Taylor expanded in beta around 0 64.9%
+-commutative64.9%
Simplified64.9%
Taylor expanded in alpha around 0 47.1%
Final simplification47.1%
herbie shell --seed 2023174
(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)))