
(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 20 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 (/ (/ (+ alpha 1.0) (* (/ (+ beta (+ alpha 3.0)) (+ beta 1.0)) (+ alpha (+ beta 2.0)))) (+ 2.0 (+ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((alpha + 1.0) / (((beta + (alpha + 3.0)) / (beta + 1.0)) * (alpha + (beta + 2.0)))) / (2.0 + (alpha + beta));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((alpha + 1.0d0) / (((beta + (alpha + 3.0d0)) / (beta + 1.0d0)) * (alpha + (beta + 2.0d0)))) / (2.0d0 + (alpha + beta))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((alpha + 1.0) / (((beta + (alpha + 3.0)) / (beta + 1.0)) * (alpha + (beta + 2.0)))) / (2.0 + (alpha + beta));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((alpha + 1.0) / (((beta + (alpha + 3.0)) / (beta + 1.0)) * (alpha + (beta + 2.0)))) / (2.0 + (alpha + beta))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(Float64(beta + Float64(alpha + 3.0)) / Float64(beta + 1.0)) * Float64(alpha + Float64(beta + 2.0)))) / Float64(2.0 + Float64(alpha + beta))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((alpha + 1.0) / (((beta + (alpha + 3.0)) / (beta + 1.0)) * (alpha + (beta + 2.0)))) / (2.0 + (alpha + beta));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{\alpha + 1}{\frac{\beta + \left(\alpha + 3\right)}{\beta + 1} \cdot \left(\alpha + \left(\beta + 2\right)\right)}}{2 + \left(\alpha + \beta\right)}
\end{array}
Initial program 94.8%
Simplified97.3%
associate-*r/97.4%
+-commutative97.4%
Applied egg-rr97.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
*-commutative99.8%
clear-num99.8%
+-commutative99.8%
associate-+r+99.8%
frac-times99.7%
*-un-lft-identity99.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
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.28e+14)
(* (/ (+ alpha 1.0) t_0) (/ (+ beta 1.0) (* t_0 (+ alpha (+ beta 3.0)))))
(/
(/ (+ alpha 1.0) (+ (+ beta 4.0) (* alpha 2.0)))
(+ 2.0 (+ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.28e+14) {
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.28d+14) then
tmp = ((alpha + 1.0d0) / t_0) * ((beta + 1.0d0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((alpha + 1.0d0) / ((beta + 4.0d0) + (alpha * 2.0d0))) / (2.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.28e+14) {
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / (2.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.28e+14: tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / (2.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 1.28e+14) tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(beta + 1.0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(beta + 4.0) + Float64(alpha * 2.0))) / Float64(2.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.28e+14)
tmp = ((alpha + 1.0) / t_0) * ((beta + 1.0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.28e+14], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.28 \cdot 10^{+14}:\\
\;\;\;\;\frac{\alpha + 1}{t_0} \cdot \frac{\beta + 1}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\beta + 4\right) + \alpha \cdot 2}}{2 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 1.28e14Initial program 99.8%
Simplified99.8%
if 1.28e14 < beta Initial program 84.2%
Simplified92.1%
associate-*r/92.2%
+-commutative92.2%
Applied egg-rr92.2%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
*-commutative99.8%
clear-num99.8%
+-commutative99.8%
associate-+r+99.8%
frac-times99.5%
*-un-lft-identity99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 80.1%
associate-+r+80.1%
Simplified80.1%
Final simplification93.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 50000000.0)
(/
(* (/ (+ beta 1.0) (+ beta 3.0)) (/ 1.0 (+ beta 2.0)))
(+ 2.0 (+ alpha beta)))
(* (/ (/ (+ alpha 1.0) t_0) t_0) (- 1.0 (/ (+ alpha 2.0) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 50000000.0) {
tmp = (((beta + 1.0) / (beta + 3.0)) * (1.0 / (beta + 2.0))) / (2.0 + (alpha + beta));
} else {
tmp = (((alpha + 1.0) / t_0) / t_0) * (1.0 - ((alpha + 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 <= 50000000.0d0) then
tmp = (((beta + 1.0d0) / (beta + 3.0d0)) * (1.0d0 / (beta + 2.0d0))) / (2.0d0 + (alpha + beta))
else
tmp = (((alpha + 1.0d0) / t_0) / t_0) * (1.0d0 - ((alpha + 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 <= 50000000.0) {
tmp = (((beta + 1.0) / (beta + 3.0)) * (1.0 / (beta + 2.0))) / (2.0 + (alpha + beta));
} else {
tmp = (((alpha + 1.0) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 50000000.0: tmp = (((beta + 1.0) / (beta + 3.0)) * (1.0 / (beta + 2.0))) / (2.0 + (alpha + beta)) else: tmp = (((alpha + 1.0) / t_0) / t_0) * (1.0 - ((alpha + 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 <= 50000000.0) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 3.0)) * Float64(1.0 / Float64(beta + 2.0))) / Float64(2.0 + Float64(alpha + beta))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) / t_0) * Float64(1.0 - Float64(Float64(alpha + 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 <= 50000000.0)
tmp = (((beta + 1.0) / (beta + 3.0)) * (1.0 / (beta + 2.0))) / (2.0 + (alpha + beta));
else
tmp = (((alpha + 1.0) / t_0) / t_0) * (1.0 - ((alpha + 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, 50000000.0], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 50000000:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 3} \cdot \frac{1}{\beta + 2}}{2 + \left(\alpha + \beta\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_0}}{t_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 5e7Initial program 99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 65.3%
+-commutative65.3%
Simplified65.3%
Taylor expanded in alpha around 0 65.4%
+-commutative65.4%
Simplified65.4%
if 5e7 < beta Initial program 84.6%
Simplified92.3%
associate-*r/92.4%
+-commutative92.4%
Applied egg-rr92.4%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 78.5%
mul-1-neg78.5%
unsub-neg78.5%
Simplified78.5%
Final simplification69.7%
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) (/ (+ beta 1.0) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / t_0) * ((beta + 1.0) / (alpha + (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((alpha + 1.0d0) / t_0) / t_0) * ((beta + 1.0d0) / (alpha + (beta + 3.0d0)))
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) * ((beta + 1.0) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((alpha + 1.0) / t_0) / t_0) * ((beta + 1.0) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) / t_0) * Float64(Float64(beta + 1.0) / Float64(alpha + Float64(beta + 3.0)))) 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) * ((beta + 1.0) / (alpha + (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t_0}}{t_0} \cdot \frac{\beta + 1}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.3%
associate-*r/97.4%
+-commutative97.4%
Applied egg-rr97.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (/ (* (/ (+ alpha 1.0) t_0) (/ (+ beta 1.0) (+ beta (+ alpha 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + (alpha + 3.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 = 2.0d0 + (alpha + beta)
code = (((alpha + 1.0d0) / t_0) * ((beta + 1.0d0) / (beta + (alpha + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + (alpha + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + (alpha + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(beta + 1.0) / Float64(beta + Float64(alpha + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + (alpha + 3.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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{\alpha + 1}{t_0} \cdot \frac{\beta + 1}{\beta + \left(\alpha + 3\right)}}{t_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.3%
associate-*r/97.4%
+-commutative97.4%
Applied egg-rr97.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (/ (+ alpha 1.0) t_0) t_0) (/ (+ beta 1.0) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / t_0) * ((beta + 1.0) / (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = (((alpha + 1.0d0) / t_0) / t_0) * ((beta + 1.0d0) / (beta + 3.0d0))
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) * ((beta + 1.0) / (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((alpha + 1.0) / t_0) / t_0) * ((beta + 1.0) / (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) / t_0) * Float64(Float64(beta + 1.0) / Float64(beta + 3.0))) 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) * ((beta + 1.0) / (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 3.0), $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{\beta + 1}{\beta + 3}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.3%
associate-*r/97.4%
+-commutative97.4%
Applied egg-rr97.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 69.7%
+-commutative69.7%
Simplified69.7%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (/ (* (/ (+ alpha 1.0) t_0) (/ (+ beta 1.0) (+ beta 3.0))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + 3.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 = 2.0d0 + (alpha + beta)
code = (((alpha + 1.0d0) / t_0) * ((beta + 1.0d0) / (beta + 3.0d0))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + 3.0))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + 3.0))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(beta + 1.0) / Float64(beta + 3.0))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((alpha + 1.0) / t_0) * ((beta + 1.0) / (beta + 3.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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{\alpha + 1}{t_0} \cdot \frac{\beta + 1}{\beta + 3}}{t_0}
\end{array}
\end{array}
Initial program 94.8%
Simplified97.3%
associate-*r/97.4%
+-commutative97.4%
Applied egg-rr97.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 69.7%
+-commutative69.7%
Simplified69.7%
Final simplification69.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 6.8)
(/ (/ (+ alpha 1.0) (* (+ alpha 3.0) (+ alpha 2.0))) t_0)
(/ (/ (+ alpha 1.0) beta) (+ t_0 1.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 6.8) {
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / beta) / (t_0 + 1.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 6.8d0) then
tmp = ((alpha + 1.0d0) / ((alpha + 3.0d0) * (alpha + 2.0d0))) / t_0
else
tmp = ((alpha + 1.0d0) / beta) / (t_0 + 1.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 6.8) {
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / beta) / (t_0 + 1.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 6.8: tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0 else: tmp = ((alpha + 1.0) / beta) / (t_0 + 1.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 6.8) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(t_0 + 1.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 6.8)
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
else
tmp = ((alpha + 1.0) / beta) / (t_0 + 1.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.8], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 6.8:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{t_0 + 1}\\
\end{array}
\end{array}
if beta < 6.79999999999999982Initial program 99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 97.3%
if 6.79999999999999982 < beta Initial program 84.7%
Taylor expanded in beta around -inf 77.2%
associate-*r/77.2%
mul-1-neg77.2%
sub-neg77.2%
mul-1-neg77.2%
distribute-neg-in77.2%
+-commutative77.2%
mul-1-neg77.2%
distribute-lft-in77.2%
metadata-eval77.2%
mul-1-neg77.2%
unsub-neg77.2%
Simplified77.2%
Final simplification90.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 3.5)
(/ (/ (+ alpha 1.0) (* (+ alpha 3.0) (+ alpha 2.0))) t_0)
(/ (/ (+ alpha 1.0) (+ (+ beta 4.0) (* alpha 2.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.5) {
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 3.5d0) then
tmp = ((alpha + 1.0d0) / ((alpha + 3.0d0) * (alpha + 2.0d0))) / t_0
else
tmp = ((alpha + 1.0d0) / ((beta + 4.0d0) + (alpha * 2.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 3.5) {
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 3.5: tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0 else: tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 3.5) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(beta + 4.0) + Float64(alpha * 2.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 3.5)
tmp = ((alpha + 1.0) / ((alpha + 3.0) * (alpha + 2.0))) / t_0;
else
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 3.5], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 3.5:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\beta + 4\right) + \alpha \cdot 2}}{t_0}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around 0 97.3%
if 3.5 < beta Initial program 84.7%
Simplified92.4%
associate-*r/92.5%
+-commutative92.5%
Applied egg-rr92.5%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
*-commutative99.8%
clear-num99.8%
+-commutative99.8%
associate-+r+99.8%
frac-times99.5%
*-un-lft-identity99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 78.9%
associate-+r+78.9%
Simplified78.9%
Final simplification91.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 17200000000000.0)
(/ (/ (+ beta 1.0) (* (+ beta 2.0) (+ beta 3.0))) t_0)
(/ (/ (+ alpha 1.0) (+ (+ beta 4.0) (* alpha 2.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 17200000000000.0) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 17200000000000.0d0) then
tmp = ((beta + 1.0d0) / ((beta + 2.0d0) * (beta + 3.0d0))) / t_0
else
tmp = ((alpha + 1.0d0) / ((beta + 4.0d0) + (alpha * 2.0d0))) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 17200000000000.0) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 17200000000000.0: tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0))) / t_0 else: tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 17200000000000.0) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(Float64(beta + 4.0) + Float64(alpha * 2.0))) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 17200000000000.0)
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 3.0))) / t_0;
else
tmp = ((alpha + 1.0) / ((beta + 4.0) + (alpha * 2.0))) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 17200000000000.0], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 17200000000000:\\
\;\;\;\;\frac{\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}}{t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\left(\beta + 4\right) + \alpha \cdot 2}}{t_0}\\
\end{array}
\end{array}
if beta < 1.72e13Initial program 99.8%
Simplified99.8%
associate-*r/99.8%
+-commutative99.8%
Applied egg-rr99.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around 0 65.3%
+-commutative65.3%
+-commutative65.3%
Simplified65.3%
if 1.72e13 < beta Initial program 84.2%
Simplified92.1%
associate-*r/92.2%
+-commutative92.2%
Applied egg-rr92.2%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
associate-*l/99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
*-commutative99.8%
clear-num99.8%
+-commutative99.8%
associate-+r+99.8%
frac-times99.5%
*-un-lft-identity99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 80.1%
associate-+r+80.1%
Simplified80.1%
Final simplification70.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.8)
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.8d0) then
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.8) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.8: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.8) 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) / Float64(2.0 + Float64(alpha + beta))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.8)
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.8], 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] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.8:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 5.79999999999999982Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 64.4%
*-commutative64.4%
Simplified64.4%
if 5.79999999999999982 < beta Initial program 84.7%
Simplified92.4%
Taylor expanded in beta around inf 77.0%
un-div-inv77.2%
+-commutative77.2%
associate-+r+77.2%
+-commutative77.2%
Applied egg-rr77.2%
Final simplification68.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.1)
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ alpha 1.0) beta) (+ (+ 2.0 (+ alpha beta)) 1.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.1) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / beta) / ((2.0 + (alpha + beta)) + 1.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.1d0) then
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((alpha + 1.0d0) / beta) / ((2.0d0 + (alpha + beta)) + 1.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.1) {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((alpha + 1.0) / beta) / ((2.0 + (alpha + beta)) + 1.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.1: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((alpha + 1.0) / beta) / ((2.0 + (alpha + beta)) + 1.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.1) 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(Float64(2.0 + Float64(alpha + beta)) + 1.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.1)
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((alpha + 1.0) / beta) / ((2.0 + (alpha + beta)) + 1.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.1], 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[(N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.1:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(2 + \left(\alpha + \beta\right)\right) + 1}\\
\end{array}
\end{array}
if beta < 5.0999999999999996Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 64.4%
*-commutative64.4%
Simplified64.4%
if 5.0999999999999996 < beta Initial program 84.7%
Taylor expanded in beta around -inf 77.2%
associate-*r/77.2%
mul-1-neg77.2%
sub-neg77.2%
mul-1-neg77.2%
distribute-neg-in77.2%
+-commutative77.2%
mul-1-neg77.2%
distribute-lft-in77.2%
metadata-eval77.2%
mul-1-neg77.2%
unsub-neg77.2%
Simplified77.2%
Final simplification68.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))
(if (<= beta 7.4e+159)
(* (/ -1.0 beta) (/ -1.0 (+ beta 2.0)))
(* (/ 1.0 beta) (/ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else if (beta <= 7.4e+159) {
tmp = (-1.0 / beta) * (-1.0 / (beta + 2.0));
} else {
tmp = (1.0 / beta) * (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 <= 6.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else if (beta <= 7.4d+159) then
tmp = ((-1.0d0) / beta) * ((-1.0d0) / (beta + 2.0d0))
else
tmp = (1.0d0 / beta) * (alpha / 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 if (beta <= 7.4e+159) {
tmp = (-1.0 / beta) * (-1.0 / (beta + 2.0));
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 / (beta + 2.0) elif beta <= 7.4e+159: tmp = (-1.0 / beta) * (-1.0 / (beta + 2.0)) else: tmp = (1.0 / beta) * (alpha / 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)); elseif (beta <= 7.4e+159) tmp = Float64(Float64(-1.0 / beta) * Float64(-1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / 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);
elseif (beta <= 7.4e+159)
tmp = (-1.0 / beta) * (-1.0 / (beta + 2.0));
else
tmp = (1.0 / beta) * (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, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 7.4e+159], N[(N[(-1.0 / beta), $MachinePrecision] * N[(-1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{elif}\;\beta \leq 7.4 \cdot 10^{+159}:\\
\;\;\;\;\frac{-1}{\beta} \cdot \frac{-1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
if 6 < beta < 7.40000000000000002e159Initial program 89.6%
Simplified96.1%
Taylor expanded in beta around inf 67.4%
Taylor expanded in alpha around 0 62.0%
if 7.40000000000000002e159 < beta Initial program 78.1%
Simplified87.4%
Taylor expanded in beta around inf 87.4%
Taylor expanded in alpha around inf 87.4%
Taylor expanded in beta around inf 90.0%
Final simplification66.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))
(if (<= beta 1.35e+154)
(/ 1.0 (* beta (+ beta 2.0)))
(* (/ 1.0 beta) (/ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else if (beta <= 1.35e+154) {
tmp = 1.0 / (beta * (beta + 2.0));
} else {
tmp = (1.0 / beta) * (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 <= 6.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else if (beta <= 1.35d+154) then
tmp = 1.0d0 / (beta * (beta + 2.0d0))
else
tmp = (1.0d0 / beta) * (alpha / 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 if (beta <= 1.35e+154) {
tmp = 1.0 / (beta * (beta + 2.0));
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.16666666666666666 / (beta + 2.0) elif beta <= 1.35e+154: tmp = 1.0 / (beta * (beta + 2.0)) else: tmp = (1.0 / beta) * (alpha / 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)); elseif (beta <= 1.35e+154) tmp = Float64(1.0 / Float64(beta * Float64(beta + 2.0))); else tmp = Float64(Float64(1.0 / beta) * Float64(alpha / 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);
elseif (beta <= 1.35e+154)
tmp = 1.0 / (beta * (beta + 2.0));
else
tmp = (1.0 / beta) * (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, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.35e+154], N[(1.0 / N[(beta * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{elif}\;\beta \leq 1.35 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
if 6 < beta < 1.35000000000000003e154Initial program 89.4%
Simplified97.0%
Taylor expanded in beta around inf 66.7%
Taylor expanded in alpha around 0 61.3%
if 1.35000000000000003e154 < beta Initial program 78.7%
Simplified86.4%
Taylor expanded in beta around inf 86.4%
Taylor expanded in alpha around inf 86.4%
Taylor expanded in beta around inf 88.9%
Final simplification66.6%
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) (+ 2.0 (+ alpha beta))) 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) / (2.0 + (alpha + beta))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / 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) / (2.0 + (alpha + beta))) / 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(2.0 + Float64(alpha + beta))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $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}{2 + \left(\alpha + \beta\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
if 6 < beta Initial program 84.7%
Simplified92.4%
Taylor expanded in beta around inf 77.0%
un-div-inv77.2%
+-commutative77.2%
associate-+r+77.2%
+-commutative77.2%
Applied egg-rr77.2%
Final simplification67.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (/ 0.16666666666666666 (+ beta 2.0)) (* (/ (+ alpha 1.0) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((alpha + 1.0d0) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((alpha + 1.0) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.8%
Simplified99.8%
Taylor expanded in beta around 0 97.3%
+-commutative97.3%
Simplified97.3%
Taylor expanded in alpha around 0 63.2%
+-commutative63.2%
Simplified63.2%
if 8 < beta Initial program 84.7%
Simplified92.4%
Taylor expanded in beta around inf 77.0%
Taylor expanded in beta around inf 76.8%
Final simplification67.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.8e+56) (/ 0.16666666666666666 (+ beta 2.0)) (* (/ 1.0 beta) (/ alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+56) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) * (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.8d+56) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (1.0d0 / beta) * (alpha / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+56) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) * (alpha / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.8e+56: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (1.0 / beta) * (alpha / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.8e+56) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 / beta) * 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.8e+56)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (1.0 / beta) * (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.8e+56], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.8 \cdot 10^{+56}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta} \cdot \frac{\alpha}{\beta}\\
\end{array}
\end{array}
if beta < 1.79999999999999999e56Initial program 99.3%
Simplified99.8%
Taylor expanded in beta around 0 91.3%
+-commutative91.3%
Simplified91.3%
Taylor expanded in alpha around 0 57.9%
+-commutative57.9%
Simplified57.9%
if 1.79999999999999999e56 < beta Initial program 82.2%
Simplified90.4%
Taylor expanded in beta around inf 87.1%
Taylor expanded in alpha around inf 58.2%
Taylor expanded in beta around inf 55.4%
Final simplification57.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 195000000000.0) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* alpha beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 195000000000.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (alpha * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (alpha <= 195000000000.0d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 1.0d0 / (alpha * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 195000000000.0) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (alpha * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 195000000000.0: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / (alpha * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 195000000000.0) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(1.0 / Float64(alpha * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 195000000000.0)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 1.0 / (alpha * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[alpha, 195000000000.0], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(alpha * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 195000000000:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\alpha \cdot \beta}\\
\end{array}
\end{array}
if alpha < 1.95e11Initial program 99.8%
Simplified99.4%
Taylor expanded in beta around 0 67.8%
+-commutative67.8%
Simplified67.8%
Taylor expanded in alpha around 0 63.9%
+-commutative63.9%
Simplified63.9%
if 1.95e11 < alpha Initial program 84.6%
Simplified93.0%
Taylor expanded in beta around inf 26.3%
Taylor expanded in beta around 0 51.0%
Taylor expanded in alpha around inf 13.6%
*-commutative13.6%
Simplified13.6%
Final simplification47.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 94.8%
Simplified97.3%
Taylor expanded in beta around 0 71.7%
+-commutative71.7%
Simplified71.7%
Taylor expanded in alpha around 0 44.5%
+-commutative44.5%
Simplified44.5%
Final simplification44.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta}
\end{array}
Initial program 94.8%
Simplified97.3%
Taylor expanded in beta around inf 31.5%
Taylor expanded in beta around 0 19.5%
Taylor expanded in alpha around 0 4.0%
Final simplification4.0%
herbie shell --seed 2024021
(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)))