
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 15 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (+ alpha 1.0) (* (/ (+ alpha (+ beta 3.0)) (+ beta 1.0)) t_0)) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / (((alpha + (beta + 3.0)) / (beta + 1.0)) * t_0)) / t_0;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) / (((alpha + (beta + 3.0d0)) / (beta + 1.0d0)) * t_0)) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) / (((alpha + (beta + 3.0)) / (beta + 1.0)) * t_0)) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) / (((alpha + (beta + 3.0)) / (beta + 1.0)) * t_0)) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(beta + 1.0)) * t_0)) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) / (((alpha + (beta + 3.0)) / (beta + 1.0)) * t_0)) / t_0;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{\frac{\alpha + \left(\beta + 3\right)}{\beta + 1} \cdot t\_0}}{t\_0}
\end{array}
\end{array}
Initial program 94.1%
Simplified85.1%
times-frac95.8%
+-commutative95.8%
Applied egg-rr95.8%
clear-num95.8%
inv-pow95.8%
Applied egg-rr95.8%
unpow-195.8%
associate-/l*99.4%
Simplified99.4%
associate-*l/99.5%
Applied egg-rr99.5%
associate-*r/99.5%
*-rgt-identity99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
+-commutative99.5%
Simplified99.5%
Final simplification99.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5.5e+102)
(/ (* (+ alpha 1.0) (+ beta 1.0)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(*
(/ (+ alpha 1.0) t_0)
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.5e+102) {
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5.5d+102) then
tmp = ((alpha + 1.0d0) * (beta + 1.0d0)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / t_0) * ((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 t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5.5e+102) {
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5.5e+102: tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / 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 <= 5.5e+102) tmp = Float64(Float64(Float64(alpha + 1.0) * Float64(beta + 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(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)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5.5e+102)
tmp = ((alpha + 1.0) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha + 1.0) / t_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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.5e+102], N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(beta + 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[(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}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5.5 \cdot 10^{+102}:\\
\;\;\;\;\frac{\left(\alpha + 1\right) \cdot \left(\beta + 1\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.49999999999999981e102Initial program 99.9%
Simplified92.6%
if 5.49999999999999981e102 < beta Initial program 74.1%
Simplified58.6%
times-frac82.4%
+-commutative82.4%
Applied egg-rr82.4%
Taylor expanded in beta around inf 91.4%
mul-1-neg91.4%
metadata-eval91.4%
distribute-lft-in91.4%
distribute-rgt-in91.4%
metadata-eval91.4%
Simplified91.4%
Final simplification92.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))) (t_1 (/ (+ alpha 1.0) t_0)))
(if (<= beta 2e+117)
(* t_1 (/ (+ beta 1.0) (* t_0 (+ alpha (+ beta 3.0)))))
(* t_1 (/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2e+117) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
t_1 = (alpha + 1.0d0) / t_0
if (beta <= 2d+117) then
tmp = t_1 * ((beta + 1.0d0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = t_1 * ((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 t_0 = alpha + (beta + 2.0);
double t_1 = (alpha + 1.0) / t_0;
double tmp;
if (beta <= 2e+117) {
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) t_1 = (alpha + 1.0) / t_0 tmp = 0 if beta <= 2e+117: tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = t_1 * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) t_1 = Float64(Float64(alpha + 1.0) / t_0) tmp = 0.0 if (beta <= 2e+117) tmp = Float64(t_1 * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(t_1 * 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)
t_0 = alpha + (beta + 2.0);
t_1 = (alpha + 1.0) / t_0;
tmp = 0.0;
if (beta <= 2e+117)
tmp = t_1 * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = t_1 * ((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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 2e+117], N[(t$95$1 * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * 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}
t_0 := \alpha + \left(\beta + 2\right)\\
t_1 := \frac{\alpha + 1}{t\_0}\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+117}:\\
\;\;\;\;t\_1 \cdot \frac{\beta + 1}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.0000000000000001e117Initial program 99.4%
Simplified90.9%
times-frac99.2%
+-commutative99.2%
Applied egg-rr99.2%
if 2.0000000000000001e117 < beta Initial program 74.0%
Simplified62.6%
times-frac82.8%
+-commutative82.8%
Applied egg-rr82.8%
Taylor expanded in beta around inf 92.6%
mul-1-neg92.6%
metadata-eval92.6%
distribute-lft-in92.6%
distribute-rgt-in92.6%
metadata-eval92.6%
Simplified92.6%
Final simplification97.9%
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 13.2)
(/ (+ alpha 1.0) (* t_0 (* (+ alpha (+ beta 3.0)) (+ alpha 2.0))))
(*
(/ (+ alpha 1.0) t_0)
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 13.2) {
tmp = (alpha + 1.0) / (t_0 * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 13.2d0) then
tmp = (alpha + 1.0d0) / (t_0 * ((alpha + (beta + 3.0d0)) * (alpha + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / t_0) * ((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 t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 13.2) {
tmp = (alpha + 1.0) / (t_0 * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 13.2: tmp = (alpha + 1.0) / (t_0 * ((alpha + (beta + 3.0)) * (alpha + 2.0))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / 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 <= 13.2) tmp = Float64(Float64(alpha + 1.0) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_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)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 13.2)
tmp = (alpha + 1.0) / (t_0 * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
else
tmp = ((alpha + 1.0) / t_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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 13.2], N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $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}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 13.2:\\
\;\;\;\;\frac{\alpha + 1}{t\_0 \cdot \left(\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 13.199999999999999Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
add098.5%
associate-/l/91.6%
*-commutative91.6%
associate-+r+91.6%
+-commutative91.6%
Applied egg-rr91.6%
add091.6%
associate-*l*91.6%
Simplified91.6%
if 13.199999999999999 < beta Initial program 81.8%
Simplified68.7%
times-frac87.6%
+-commutative87.6%
Applied egg-rr87.6%
Taylor expanded in beta around inf 84.2%
mul-1-neg84.2%
metadata-eval84.2%
distribute-lft-in84.2%
distribute-rgt-in84.2%
metadata-eval84.2%
Simplified84.2%
Final simplification89.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.5)
(/
(+ alpha 1.0)
(* (+ alpha (+ beta 2.0)) (* (+ alpha (+ beta 3.0)) (+ alpha 2.0))))
(/ (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = (alpha + 1.0) / ((alpha + (beta + 2.0)) * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 9.5d0) then
tmp = (alpha + 1.0d0) / ((alpha + (beta + 2.0d0)) * ((alpha + (beta + 3.0d0)) * (alpha + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = (alpha + 1.0) / ((alpha + (beta + 2.0)) * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.5: tmp = (alpha + 1.0) / ((alpha + (beta + 2.0)) * ((alpha + (beta + 3.0)) * (alpha + 2.0))) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.5) tmp = Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.5)
tmp = (alpha + 1.0) / ((alpha + (beta + 2.0)) * ((alpha + (beta + 3.0)) * (alpha + 2.0)));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 9.5], N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5:\\
\;\;\;\;\frac{\alpha + 1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 9.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
add098.5%
associate-/l/91.6%
*-commutative91.6%
associate-+r+91.6%
+-commutative91.6%
Applied egg-rr91.6%
add091.6%
associate-*l*91.6%
Simplified91.6%
if 9.5 < beta Initial program 81.8%
Taylor expanded in alpha around 0 72.9%
+-commutative72.9%
Simplified72.9%
Taylor expanded in beta around inf 83.7%
Final simplification89.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.5) (/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 9.5d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.5: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.5) 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(2.0 + Float64(alpha + beta))) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.5)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 9.5], 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.5:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 9.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.5%
if 9.5 < beta Initial program 81.8%
Taylor expanded in alpha around 0 72.9%
+-commutative72.9%
Simplified72.9%
Taylor expanded in beta around inf 83.7%
Final simplification93.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 27.0) (/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ alpha 3.0))) (/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 27.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (3.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 <= 27.0d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (alpha + 3.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 27.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 27.0: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0)) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 27.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(3.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 <= 27.0)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (alpha + 3.0));
else
tmp = ((alpha + 1.0) / beta) / (3.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, 27.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[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 27:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 27Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.5%
if 27 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Final simplification93.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.95) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / (3.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 <= 1.95d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.95) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.95: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.95) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(3.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 <= 1.95)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) / (3.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, 1.95], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.95:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 1.94999999999999996Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 1.94999999999999996 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
Simplified83.6%
Final simplification72.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.3d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.3)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.3], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 3.2999999999999998 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in beta around inf 83.4%
Final simplification72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = (1.0d0 / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = (1.0 / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 2.10000000000000009 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
div-inv83.5%
metadata-eval83.5%
associate-+l+83.5%
metadata-eval83.5%
associate-+r+83.5%
Applied egg-rr83.5%
Taylor expanded in alpha around 0 72.1%
associate-/r*72.3%
+-commutative72.3%
Simplified72.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 2.10000000000000009 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 72.1%
Final simplification68.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (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 <= 3.5d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / 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 <= 3.5)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / (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, 3.5], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot 3}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 3.5 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 72.1%
Taylor expanded in beta around 0 6.9%
*-commutative6.9%
Simplified6.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 67.4%
*-commutative67.4%
Simplified67.4%
if 2.89999999999999991 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 72.1%
Taylor expanded in beta around 0 6.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) 0.08333333333333333 (/ 0.3333333333333333 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.3333333333333333d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.3333333333333333 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 0.08333333333333333 else: tmp = 0.3333333333333333 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = 0.08333333333333333; else tmp = Float64(0.3333333333333333 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 0.08333333333333333;
else
tmp = 0.3333333333333333 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], 0.08333333333333333, N[(0.3333333333333333 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.3333333333333333}{\beta}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in alpha around 0 84.7%
Taylor expanded in beta around 0 84.7%
Taylor expanded in alpha around 0 68.0%
if 4 < beta Initial program 81.8%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 72.1%
Taylor expanded in beta around 0 6.9%
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.1%
associate-/l/93.8%
+-commutative93.8%
associate-+l+93.8%
*-commutative93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
associate-+l+93.8%
metadata-eval93.8%
metadata-eval93.8%
associate-+l+93.8%
Simplified93.8%
Taylor expanded in beta around 0 84.9%
Taylor expanded in alpha around 0 75.7%
Taylor expanded in beta around 0 61.5%
Taylor expanded in alpha around 0 47.5%
herbie shell --seed 2024107
(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)))