
(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 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5000000000.0)
(/ (* (+ 1.0 beta) (+ alpha 1.0)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/
(/ (+ alpha 1.0) t_0)
(* t_0 (+ 1.0 (+ (/ alpha beta) (/ 2.0 beta))))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5000000000.0) {
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (t_0 * (1.0 + ((alpha / beta) + (2.0 / beta))));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5000000000.0d0) then
tmp = ((1.0d0 + beta) * (alpha + 1.0d0)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) / (t_0 * (1.0d0 + ((alpha / beta) + (2.0d0 / beta))))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5000000000.0) {
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) / (t_0 * (1.0 + ((alpha / beta) + (2.0 / beta))));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5000000000.0: tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / t_0) / (t_0 * (1.0 + ((alpha / beta) + (2.0 / beta)))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(alpha + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(t_0 * Float64(1.0 + Float64(Float64(alpha / beta) + Float64(2.0 / beta))))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5000000000.0)
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha + 1.0) / t_0) / (t_0 * (1.0 + ((alpha / beta) + (2.0 / beta))));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(1.0 + N[(N[(alpha / beta), $MachinePrecision] + N[(2.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5000000000:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(\alpha + 1\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_0 \cdot \left(1 + \left(\frac{\alpha}{\beta} + \frac{2}{\beta}\right)\right)}\\
\end{array}
\end{array}
if beta < 5e9Initial program 99.8%
Simplified93.6%
if 5e9 < beta Initial program 82.0%
Simplified64.1%
times-frac92.0%
+-commutative92.0%
Applied egg-rr92.0%
clear-num91.9%
inv-pow91.9%
Applied egg-rr91.9%
unpow-191.9%
associate-/l*99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
un-div-inv99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in beta around inf 99.6%
+-commutative99.6%
associate-*r/99.6%
metadata-eval99.6%
Simplified99.6%
Final simplification95.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 1.6e+61)
(* (/ (+ alpha 1.0) t_1) (/ (+ 1.0 beta) (* t_1 t_0)))
(/ (/ (+ alpha 1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.6e+61) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
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 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 1.6d+61) then
tmp = ((alpha + 1.0d0) / t_1) * ((1.0d0 + beta) / (t_1 * t_0))
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.6e+61) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.6e+61: tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0)) else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.6e+61) tmp = Float64(Float64(Float64(alpha + 1.0) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.6e+61)
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
else
tmp = ((alpha + 1.0) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.6e+61], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.6 \cdot 10^{+61}:\\
\;\;\;\;\frac{\alpha + 1}{t\_1} \cdot \frac{1 + \beta}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 1.5999999999999999e61Initial program 99.8%
Simplified93.7%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
if 1.5999999999999999e61 < beta Initial program 76.8%
associate-/l/76.5%
+-commutative76.5%
associate-+l+76.5%
*-commutative76.5%
metadata-eval76.5%
associate-+l+76.5%
metadata-eval76.5%
associate-+l+76.5%
metadata-eval76.5%
metadata-eval76.5%
associate-+l+76.5%
Simplified76.5%
Taylor expanded in beta around inf 89.9%
*-un-lft-identity89.9%
associate-/r*86.1%
associate-+r+86.1%
Applied egg-rr86.1%
*-lft-identity86.1%
+-commutative86.1%
+-commutative86.1%
Simplified86.1%
Final simplification96.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 1.95e+93)
(/ (* (+ 1.0 beta) (+ alpha 1.0)) (* t_1 (* t_1 t_0)))
(/ (/ (+ alpha 1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.95e+93) {
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
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 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 1.95d+93) then
tmp = ((1.0d0 + beta) * (alpha + 1.0d0)) / (t_1 * (t_1 * t_0))
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.95e+93) {
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.95e+93: tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_1 * (t_1 * t_0)) else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.95e+93) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(alpha + 1.0)) / Float64(t_1 * Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.95e+93)
tmp = ((1.0 + beta) * (alpha + 1.0)) / (t_1 * (t_1 * t_0));
else
tmp = ((alpha + 1.0) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.95e+93], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(alpha + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.95 \cdot 10^{+93}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(\alpha + 1\right)}{t\_1 \cdot \left(t\_1 \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 1.9500000000000001e93Initial program 99.3%
Simplified93.4%
if 1.9500000000000001e93 < beta Initial program 76.2%
associate-/l/75.8%
+-commutative75.8%
associate-+l+75.8%
*-commutative75.8%
metadata-eval75.8%
associate-+l+75.8%
metadata-eval75.8%
associate-+l+75.8%
metadata-eval75.8%
metadata-eval75.8%
associate-+l+75.8%
Simplified75.8%
Taylor expanded in beta around inf 88.8%
*-un-lft-identity88.8%
associate-/r*88.1%
associate-+r+88.1%
Applied egg-rr88.1%
*-lft-identity88.1%
+-commutative88.1%
+-commutative88.1%
Simplified88.1%
Final simplification92.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 128000000.0)
(*
(/ 1.0 (+ beta 2.0))
(/ 1.0 (/ (* (+ beta 3.0) (+ beta 2.0)) (+ 1.0 beta))))
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 128000000.0) {
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.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 <= 128000000.0d0) then
tmp = (1.0d0 / (beta + 2.0d0)) * (1.0d0 / (((beta + 3.0d0) * (beta + 2.0d0)) / (1.0d0 + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 128000000.0) {
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 128000000.0: tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 128000000.0) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(1.0 / Float64(Float64(Float64(beta + 3.0) * Float64(beta + 2.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 128000000.0)
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.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, 128000000.0], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 128000000:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{1}{\frac{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.28e8Initial program 99.8%
Simplified93.6%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
clear-num99.8%
inv-pow99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/l*99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 66.9%
Taylor expanded in alpha around 0 66.9%
if 1.28e8 < beta Initial program 82.0%
Simplified64.1%
times-frac92.0%
+-commutative92.0%
Applied egg-rr92.0%
clear-num91.9%
inv-pow91.9%
Applied egg-rr91.9%
unpow-191.9%
associate-/l*99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
Taylor expanded in beta around inf 84.7%
mul-1-neg84.7%
unsub-neg84.7%
Simplified84.7%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (+ alpha 1.0) t_0) (* t_0 (/ (+ alpha (+ beta 3.0)) (+ 1.0 beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (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
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) / t_0) / (t_0 * ((alpha + (beta + 3.0d0)) / (1.0d0 + beta)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(1.0 + beta)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) / t_0) / (t_0 * ((alpha + (beta + 3.0)) / (1.0 + beta)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t\_0}}{t\_0 \cdot \frac{\alpha + \left(\beta + 3\right)}{1 + \beta}}
\end{array}
\end{array}
Initial program 94.4%
Simplified84.6%
times-frac97.4%
+-commutative97.4%
Applied egg-rr97.4%
clear-num97.4%
inv-pow97.4%
Applied egg-rr97.4%
unpow-197.4%
associate-/l*99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
un-div-inv99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.5e+15)
(*
(/ 1.0 (+ beta 2.0))
(/ 1.0 (/ (* (+ beta 3.0) (+ beta 2.0)) (+ 1.0 beta))))
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5e+15) {
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (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.5d+15) then
tmp = (1.0d0 / (beta + 2.0d0)) * (1.0d0 / (((beta + 3.0d0) * (beta + 2.0d0)) / (1.0d0 + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (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.5e+15) {
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5e+15: tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5e+15) tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) * Float64(1.0 / Float64(Float64(Float64(beta + 3.0) * Float64(beta + 2.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + 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.5e+15)
tmp = (1.0 / (beta + 2.0)) * (1.0 / (((beta + 3.0) * (beta + 2.0)) / (1.0 + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (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.5e+15], N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5 \cdot 10^{+15}:\\
\;\;\;\;\frac{1}{\beta + 2} \cdot \frac{1}{\frac{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 4.5e15Initial program 99.8%
Simplified93.7%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
clear-num99.8%
inv-pow99.8%
Applied egg-rr99.8%
unpow-199.8%
associate-/l*99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 67.3%
Taylor expanded in alpha around 0 67.3%
if 4.5e15 < beta Initial program 81.6%
associate-/l/81.4%
+-commutative81.4%
associate-+l+81.4%
*-commutative81.4%
metadata-eval81.4%
associate-+l+81.4%
metadata-eval81.4%
associate-+l+81.4%
metadata-eval81.4%
metadata-eval81.4%
associate-+l+81.4%
Simplified81.4%
Taylor expanded in beta around inf 89.5%
*-un-lft-identity89.5%
associate-/r*85.3%
associate-+r+85.3%
Applied egg-rr85.3%
*-lft-identity85.3%
+-commutative85.3%
+-commutative85.3%
Simplified85.3%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))))
(if (<= beta 5.6)
(* t_0 (+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ t_0 beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 5.6) {
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = t_0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (alpha + 1.0d0) / (alpha + (beta + 2.0d0))
if (beta <= 5.6d0) then
tmp = t_0 * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = t_0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 5.6) {
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = t_0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + 1.0) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 5.6: tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = t_0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 5.6) tmp = Float64(t_0 * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(t_0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (alpha + 1.0) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 5.6)
tmp = t_0 * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = t_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[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.6], N[(t$95$0 * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 5.6:\\
\;\;\;\;t\_0 \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{t\_0}{\beta}\\
\end{array}
\end{array}
if beta < 5.5999999999999996Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.1%
*-commutative65.1%
Simplified65.1%
if 5.5999999999999996 < beta Initial program 83.0%
Simplified66.2%
times-frac92.4%
+-commutative92.4%
Applied egg-rr92.4%
clear-num92.4%
inv-pow92.4%
Applied egg-rr92.4%
unpow-192.4%
associate-/l*99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
un-div-inv99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in beta around inf 81.8%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.2)
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.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) :: tmp
if (beta <= 5.2d0) then
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.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_] := If[LessEqual[beta, 5.2], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.1%
*-commutative65.1%
Simplified65.1%
if 5.20000000000000018 < beta Initial program 83.0%
Taylor expanded in beta around inf 81.9%
Final simplification70.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) beta) (+ 1.0 (+ 2.0 (+ alpha beta))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.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) :: tmp
if (beta <= 3.0d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (1.0d0 + (2.0d0 + (alpha + beta)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((alpha + 1.0) / beta) / (1.0 + (2.0 + (alpha + beta))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((alpha + 1.0) / beta) / (1.0 + (2.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_] := If[LessEqual[beta, 3.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 99.2%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
if 3 < beta Initial program 83.0%
Taylor expanded in beta around inf 81.9%
Final simplification93.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.0) (/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (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.0d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (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.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.0: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.0) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + 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.0)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (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.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in beta around 0 99.2%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
if 1 < beta Initial program 83.0%
associate-/l/82.9%
+-commutative82.9%
associate-+l+82.9%
*-commutative82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
metadata-eval82.9%
associate-+l+82.9%
Simplified82.9%
Taylor expanded in beta around inf 86.4%
*-un-lft-identity86.4%
associate-/r*82.6%
associate-+r+82.6%
Applied egg-rr82.6%
*-lft-identity82.6%
+-commutative82.6%
+-commutative82.6%
Simplified82.6%
Final simplification93.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.1) (/ 0.16666666666666666 (+ beta 2.0)) (/ (+ alpha 1.0) (* (+ beta 3.0) (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (alpha + 1.0) / ((beta + 3.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 <= 3.1d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (alpha + 1.0d0) / ((beta + 3.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 <= 3.1) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (alpha + 1.0) / ((beta + 3.0) * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (alpha + 1.0) / ((beta + 3.0) * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(beta + 3.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 <= 3.1)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (alpha + 1.0) / ((beta + 3.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, 3.1], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.1:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
if 3.10000000000000009 < beta Initial program 83.0%
associate-/l/82.9%
+-commutative82.9%
associate-+l+82.9%
*-commutative82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
metadata-eval82.9%
associate-+l+82.9%
Simplified82.9%
Taylor expanded in beta around inf 86.4%
Taylor expanded in alpha around 0 81.7%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.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 <= 6.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / 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.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / 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.16666666666666666 / (beta + 2.0);
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.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, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
if 6 < beta Initial program 83.0%
Simplified66.2%
times-frac92.4%
+-commutative92.4%
Applied egg-rr92.4%
clear-num92.4%
inv-pow92.4%
Applied egg-rr92.4%
unpow-192.4%
associate-/l*99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
un-div-inv99.6%
+-commutative99.6%
+-commutative99.6%
Applied egg-rr99.6%
Taylor expanded in beta around inf 81.8%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* (+ beta 3.0) (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / ((beta + 3.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 <= 3.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 1.0d0 / ((beta + 3.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 <= 3.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / ((beta + 3.0) * (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / ((beta + 3.0) * (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(1.0 / Float64(Float64(beta + 3.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 <= 3.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 1.0 / ((beta + 3.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, 3.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 3Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
if 3 < beta Initial program 83.0%
associate-/l/82.9%
+-commutative82.9%
associate-+l+82.9%
*-commutative82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
associate-+l+82.9%
metadata-eval82.9%
metadata-eval82.9%
associate-+l+82.9%
Simplified82.9%
Taylor expanded in beta around inf 86.4%
Taylor expanded in alpha around 0 78.8%
Final simplification69.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
if 5.20000000000000018 < beta Initial program 83.0%
Taylor expanded in beta around inf 78.9%
associate-+r+78.9%
associate-/l*82.6%
Simplified82.6%
Taylor expanded in alpha around 0 79.7%
associate-*r/79.7%
metadata-eval79.7%
Simplified79.7%
Taylor expanded in beta around inf 78.5%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
if 5.20000000000000018 < beta Initial program 83.0%
Taylor expanded in beta around inf 78.9%
associate-+r+78.9%
associate-/l*82.6%
Simplified82.6%
Taylor expanded in alpha around 0 82.6%
associate--l+82.6%
associate--l+82.6%
*-commutative82.6%
associate-*r/82.6%
metadata-eval82.6%
associate-*r/82.6%
metadata-eval82.6%
Simplified82.6%
Taylor expanded in alpha around 0 79.7%
associate-/r*78.7%
associate-*r/78.7%
metadata-eval78.7%
sub-neg78.7%
distribute-neg-frac78.7%
metadata-eval78.7%
+-commutative78.7%
Simplified78.7%
Taylor expanded in beta around inf 77.6%
Final simplification69.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.8%
Simplified93.4%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 99.3%
+-commutative99.3%
Simplified99.3%
Taylor expanded in alpha around 0 65.5%
+-commutative65.5%
Simplified65.5%
Taylor expanded in beta around 0 65.5%
if 2 < beta Initial program 83.0%
Simplified66.2%
times-frac92.4%
+-commutative92.4%
Applied egg-rr92.4%
Taylor expanded in beta around 0 18.3%
+-commutative18.3%
Simplified18.3%
Taylor expanded in alpha around 0 7.2%
+-commutative7.2%
Simplified7.2%
Taylor expanded in beta around inf 7.2%
Final simplification46.6%
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.4%
Simplified84.6%
times-frac97.4%
+-commutative97.4%
Applied egg-rr97.4%
Taylor expanded in beta around 0 73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 46.6%
+-commutative46.6%
Simplified46.6%
Final simplification46.6%
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%
Simplified84.6%
times-frac97.4%
+-commutative97.4%
Applied egg-rr97.4%
Taylor expanded in beta around 0 73.0%
+-commutative73.0%
Simplified73.0%
Taylor expanded in alpha around 0 46.6%
+-commutative46.6%
Simplified46.6%
Taylor expanded in beta around 0 45.7%
Final simplification45.7%
herbie shell --seed 2024057
(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)))