
(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 19 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 (+ 2.0 beta)))) (/ (/ (+ 1.0 alpha) t_0) (* (/ t_0 (+ 1.0 beta)) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return ((1.0 + alpha) / t_0) / ((t_0 / (1.0 + beta)) * (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 + (2.0d0 + beta)
code = ((1.0d0 + alpha) / t_0) / ((t_0 / (1.0d0 + beta)) * (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return ((1.0 + alpha) / t_0) / ((t_0 / (1.0 + beta)) * (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return ((1.0 + alpha) / t_0) / ((t_0 / (1.0 + beta)) * (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(Float64(t_0 / Float64(1.0 + beta)) * Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = ((1.0 + alpha) / t_0) / ((t_0 / (1.0 + beta)) * (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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $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(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0}}{\frac{t_0}{1 + \beta} \cdot \left(\alpha + \left(\beta + 3\right)\right)}
\end{array}
\end{array}
Initial program 94.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
associate-*r/96.1%
+-commutative96.1%
Applied egg-rr96.1%
associate-*r/96.0%
*-commutative96.0%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
clear-num99.8%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
Final simplification99.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ 2.0 beta)))) (* (/ (/ (+ 1.0 alpha) t_0) (+ 3.0 (+ alpha beta))) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / 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 + (2.0d0 + beta)
code = (((1.0d0 + alpha) / t_0) / (3.0d0 + (alpha + beta))) * ((1.0d0 + beta) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(3.0 + Float64(alpha + beta))) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
tmp = (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / 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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
\frac{\frac{1 + \alpha}{t_0}}{3 + \left(\alpha + \beta\right)} \cdot \frac{1 + \beta}{t_0}
\end{array}
\end{array}
Initial program 94.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
associate-*r/96.1%
+-commutative96.1%
Applied egg-rr96.1%
associate-*r/96.0%
*-commutative96.0%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Final simplification99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.5)
(*
(/ 1.0 (+ alpha (+ beta 3.0)))
(/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (+ alpha 2.0)))
(/
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ (+ beta 4.0) (* alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = (1.0 / (alpha + (beta + 3.0))) * (((1.0 + alpha) / (alpha + 2.0)) / (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = (1.0d0 / (alpha + (beta + 3.0d0))) * (((1.0d0 + alpha) / (alpha + 2.0d0)) / (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / ((beta + 4.0d0) + (alpha * 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = (1.0 / (alpha + (beta + 3.0))) * (((1.0 + alpha) / (alpha + 2.0)) / (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = (1.0 / (alpha + (beta + 3.0))) * (((1.0 + alpha) / (alpha + 2.0)) / (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(Float64(1.0 / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(Float64(beta + 4.0) + Float64(alpha * 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = (1.0 / (alpha + (beta + 3.0))) * (((1.0 + alpha) / (alpha + 2.0)) / (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\frac{1}{\alpha + \left(\beta + 3\right)} \cdot \frac{\frac{1 + \alpha}{\alpha + 2}}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\left(\beta + 4\right) + \alpha \cdot 2}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
*-un-lft-identity98.9%
+-commutative98.9%
*-commutative98.9%
times-frac99.5%
+-commutative99.5%
+-commutative99.5%
Applied egg-rr99.5%
if 2.5 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 87.0%
associate-+r+87.0%
Simplified87.0%
Final simplification95.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (/ (+ 2.0 beta) (/ (+ 1.0 beta) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / ((2.0d0 + beta) / ((1.0d0 + beta) / (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(Float64(2.0 + beta) / Float64(Float64(1.0 + beta) / Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\frac{2 + \beta}{\frac{1 + \beta}{\beta + 3}}}
\end{array}
Initial program 94.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
associate-*r/96.1%
+-commutative96.1%
Applied egg-rr96.1%
associate-*r/96.0%
*-commutative96.0%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
clear-num99.8%
frac-times99.4%
*-un-lft-identity99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
+-commutative99.4%
associate-+r+99.4%
Applied egg-rr99.4%
Taylor expanded in alpha around 0 70.6%
associate-/l*72.2%
+-commutative72.2%
+-commutative72.2%
Simplified72.2%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 68000000.0) (/ (/ 1.0 (+ 2.0 beta)) (/ (* (+ 2.0 beta) (+ beta 3.0)) (+ 1.0 beta))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 68000000.0) {
tmp = (1.0 / (2.0 + beta)) / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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 <= 68000000.0d0) then
tmp = (1.0d0 / (2.0d0 + beta)) / (((2.0d0 + beta) * (beta + 3.0d0)) / (1.0d0 + beta))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 68000000.0) {
tmp = (1.0 / (2.0 + beta)) / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 68000000.0: tmp = (1.0 / (2.0 + beta)) / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 68000000.0) tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) / Float64(Float64(Float64(2.0 + beta) * Float64(beta + 3.0)) / Float64(1.0 + beta))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 68000000.0)
tmp = (1.0 / (2.0 + beta)) / (((2.0 + beta) * (beta + 3.0)) / (1.0 + beta));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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, 68000000.0], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(2.0 + beta), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 68000000:\\
\;\;\;\;\frac{\frac{1}{2 + \beta}}{\frac{\left(2 + \beta\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 6.8e7Initial program 99.9%
associate-/l/99.2%
associate-/r*95.6%
+-commutative95.6%
associate-+l+95.6%
associate-+r+95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
times-frac99.2%
Simplified99.2%
associate-*r/99.2%
+-commutative99.2%
Applied egg-rr99.2%
associate-*r/99.2%
*-commutative99.2%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
clear-num99.8%
frac-times99.3%
*-un-lft-identity99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
associate-+r+99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
associate-+r+99.3%
Applied egg-rr99.3%
Taylor expanded in alpha around 0 64.7%
Taylor expanded in alpha around 0 64.7%
+-commutative3.3%
Simplified64.7%
if 6.8e7 < beta Initial program 83.4%
associate-/l/79.4%
associate-/r*60.6%
+-commutative60.6%
associate-+l+60.6%
associate-+r+60.6%
*-commutative60.6%
distribute-rgt1-in60.5%
+-commutative60.5%
*-commutative60.5%
distribute-rgt1-in60.6%
+-commutative60.6%
times-frac89.5%
Simplified89.5%
associate-*r/89.5%
+-commutative89.5%
Applied egg-rr89.5%
associate-*r/89.5%
*-commutative89.5%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 82.8%
associate-/l*87.6%
+-commutative87.6%
+-commutative87.6%
Simplified87.6%
Taylor expanded in beta around inf 87.6%
+-commutative87.6%
Simplified87.6%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 65000000.0) (/ (/ 1.0 (+ 2.0 beta)) (/ (+ 2.0 beta) (/ (+ 1.0 beta) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 65000000.0) {
tmp = (1.0 / (2.0 + beta)) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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 <= 65000000.0d0) then
tmp = (1.0d0 / (2.0d0 + beta)) / ((2.0d0 + beta) / ((1.0d0 + beta) / (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 65000000.0) {
tmp = (1.0 / (2.0 + beta)) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 65000000.0: tmp = (1.0 / (2.0 + beta)) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0))) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 65000000.0) tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) / Float64(Float64(2.0 + beta) / Float64(Float64(1.0 + beta) / Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 65000000.0)
tmp = (1.0 / (2.0 + beta)) / ((2.0 + beta) / ((1.0 + beta) / (beta + 3.0)));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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, 65000000.0], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(2.0 + beta), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 65000000:\\
\;\;\;\;\frac{\frac{1}{2 + \beta}}{\frac{2 + \beta}{\frac{1 + \beta}{\beta + 3}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 6.5e7Initial program 99.9%
associate-/l/99.2%
associate-/r*95.6%
+-commutative95.6%
associate-+l+95.6%
associate-+r+95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
*-commutative95.6%
distribute-rgt1-in95.6%
+-commutative95.6%
times-frac99.2%
Simplified99.2%
associate-*r/99.2%
+-commutative99.2%
Applied egg-rr99.2%
associate-*r/99.2%
*-commutative99.2%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
*-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
clear-num99.8%
frac-times99.3%
*-un-lft-identity99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
associate-+r+99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
associate-+r+99.3%
Applied egg-rr99.3%
Taylor expanded in alpha around 0 64.7%
associate-/l*64.7%
+-commutative64.7%
+-commutative64.7%
Simplified64.7%
Taylor expanded in alpha around 0 64.7%
+-commutative3.3%
Simplified64.7%
if 6.5e7 < beta Initial program 83.4%
associate-/l/79.4%
associate-/r*60.6%
+-commutative60.6%
associate-+l+60.6%
associate-+r+60.6%
*-commutative60.6%
distribute-rgt1-in60.5%
+-commutative60.5%
*-commutative60.5%
distribute-rgt1-in60.6%
+-commutative60.6%
times-frac89.5%
Simplified89.5%
associate-*r/89.5%
+-commutative89.5%
Applied egg-rr89.5%
associate-*r/89.5%
*-commutative89.5%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 82.8%
associate-/l*87.6%
+-commutative87.6%
+-commutative87.6%
Simplified87.6%
Taylor expanded in beta around inf 87.6%
+-commutative87.6%
Simplified87.6%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha (+ beta 3.0)) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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.9d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + (beta + 3.0d0)) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.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.9], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
if 2.89999999999999991 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 83.4%
associate-/l*88.0%
+-commutative88.0%
+-commutative88.0%
Simplified88.0%
Taylor expanded in beta around inf 86.7%
+-commutative86.7%
Simplified86.7%
Final simplification94.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.2)
(/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha (+ beta 3.0)) (+ alpha 2.0)))
(/
(/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta)))
(+ (+ beta 4.0) (* alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + (beta + 3.0d0)) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / ((beta + 4.0d0) + (alpha * 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(Float64(beta + 4.0) + Float64(alpha * 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / ((beta + 4.0) + (alpha * 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 4.0), $MachinePrecision] + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\left(\beta + 4\right) + \alpha \cdot 2}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
if 5.20000000000000018 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 87.0%
associate-+r+87.0%
Simplified87.0%
Final simplification94.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.3) (/ (+ 0.5 (* alpha 0.25)) (* (+ alpha (+ beta 3.0)) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3) {
tmp = (0.5 + (alpha * 0.25)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.3d0) then
tmp = (0.5d0 + (alpha * 0.25d0)) / ((alpha + (beta + 3.0d0)) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.3) {
tmp = (0.5 + (alpha * 0.25)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.3: tmp = (0.5 + (alpha * 0.25)) / ((alpha + (beta + 3.0)) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.3) tmp = Float64(Float64(0.5 + Float64(alpha * 0.25)) / Float64(Float64(alpha + Float64(beta + 3.0)) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.3)
tmp = (0.5 + (alpha * 0.25)) / ((alpha + (beta + 3.0)) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.3], N[(N[(0.5 + N[(alpha * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.3:\\
\;\;\;\;\frac{0.5 + \alpha \cdot 0.25}{\left(\alpha + \left(\beta + 3\right)\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 1.30000000000000004Initial program 99.9%
associate-/l/99.2%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 82.4%
*-commutative82.4%
Simplified82.4%
if 1.30000000000000004 < beta Initial program 84.1%
associate-/l/80.3%
associate-/r*62.3%
+-commutative62.3%
associate-+l+62.3%
associate-+r+62.3%
*-commutative62.3%
distribute-rgt1-in62.3%
+-commutative62.3%
*-commutative62.3%
distribute-rgt1-in62.3%
+-commutative62.3%
times-frac89.9%
Simplified89.9%
associate-*r/90.0%
+-commutative90.0%
Applied egg-rr90.0%
associate-*r/89.9%
*-commutative89.9%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 82.4%
associate-/l*87.1%
+-commutative87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in beta around inf 85.8%
+-commutative85.8%
Simplified85.8%
Final simplification83.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (/ 0.25 (+ beta 3.0)) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) (+ beta 4.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.2d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / (beta + 4.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / Float64(beta + 4.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2)
tmp = 0.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / (beta + 4.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.2], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 4.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta + 4}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.9%
associate-/l/99.2%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 64.2%
+-commutative64.2%
Simplified64.2%
if 1.19999999999999996 < beta Initial program 84.1%
associate-/l/80.3%
associate-/r*62.3%
+-commutative62.3%
associate-+l+62.3%
associate-+r+62.3%
*-commutative62.3%
distribute-rgt1-in62.3%
+-commutative62.3%
*-commutative62.3%
distribute-rgt1-in62.3%
+-commutative62.3%
times-frac89.9%
Simplified89.9%
associate-*r/90.0%
+-commutative90.0%
Applied egg-rr90.0%
associate-*r/89.9%
*-commutative89.9%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in alpha around 0 82.4%
associate-/l*87.1%
+-commutative87.1%
+-commutative87.1%
Simplified87.1%
Taylor expanded in beta around inf 85.8%
+-commutative85.8%
Simplified85.8%
Final simplification71.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ (/ (+ 1.0 alpha) (+ alpha (+ 2.0 beta))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / (alpha + (2.0d0 + beta))) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(2.0 + beta))) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / (alpha + (2.0 + beta))) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(2 + \beta\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 63.8%
+-commutative63.8%
Simplified63.8%
if 4.5 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = 1.0d0 / (beta * (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = 1.0 / (beta * (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 63.8%
+-commutative63.8%
Simplified63.8%
if 4.5 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Taylor expanded in alpha around 0 76.8%
+-commutative76.8%
Simplified76.8%
Final simplification68.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ beta 3.0)) (/ (/ 1.0 (+ 2.0 beta)) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = (1.0 / (2.0 + beta)) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 / (beta + 3.0d0)
else
tmp = (1.0d0 / (2.0d0 + beta)) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = (1.0 / (2.0 + beta)) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (beta + 3.0) else: tmp = (1.0 / (2.0 + beta)) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(1.0 / Float64(2.0 + beta)) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (beta + 3.0);
else
tmp = (1.0 / (2.0 + beta)) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{2 + \beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 63.8%
+-commutative63.8%
Simplified63.8%
if 4.5 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Taylor expanded in alpha around 0 77.3%
+-commutative77.3%
Simplified77.3%
Final simplification68.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.0) (/ 0.25 (+ beta 3.0)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + 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.25d0 / (beta + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = 0.25 / (beta + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = 0.25 / (beta + 3.0) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(0.25 / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(1.0 + 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.25 / (beta + 3.0);
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{0.25}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
associate-/r*98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
frac-times98.3%
*-un-lft-identity98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
+-commutative98.3%
associate-+r+98.3%
Applied egg-rr98.3%
Taylor expanded in beta around 0 98.9%
Taylor expanded in alpha around 0 63.8%
+-commutative63.8%
Simplified63.8%
if 6 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Taylor expanded in beta around inf 85.3%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 11.5) (+ 0.08333333333333333 (* alpha -0.041666666666666664)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 11.5) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = 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 <= 11.5d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.041666666666666664d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 11.5) {
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 11.5: tmp = 0.08333333333333333 + (alpha * -0.041666666666666664) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 11.5) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.041666666666666664)); else tmp = 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 <= 11.5)
tmp = 0.08333333333333333 + (alpha * -0.041666666666666664);
else
tmp = 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, 11.5], N[(0.08333333333333333 + N[(alpha * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 11.5:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 11.5Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.4%
+-commutative64.4%
Simplified64.4%
Taylor expanded in beta around 0 64.4%
Taylor expanded in alpha around 0 62.6%
*-commutative62.6%
Simplified62.6%
if 11.5 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Taylor expanded in alpha around inf 7.0%
Final simplification43.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 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 <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = 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 <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 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, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.9%
associate-/l/99.3%
associate-/r*95.5%
+-commutative95.5%
associate-+l+95.5%
associate-+r+95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
*-commutative95.5%
distribute-rgt1-in95.5%
+-commutative95.5%
times-frac99.2%
Simplified99.2%
Taylor expanded in beta around 0 98.3%
Taylor expanded in alpha around 0 64.4%
+-commutative64.4%
Simplified64.4%
Taylor expanded in beta around 0 64.4%
Taylor expanded in alpha around 0 63.3%
if 12 < beta Initial program 84.0%
associate-/l/80.0%
associate-/r*61.9%
+-commutative61.9%
associate-+l+61.9%
associate-+r+61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
*-commutative61.9%
distribute-rgt1-in61.9%
+-commutative61.9%
times-frac89.8%
Simplified89.8%
associate-*r/89.9%
+-commutative89.9%
Applied egg-rr89.9%
associate-*r/89.8%
*-commutative89.8%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
clear-num99.7%
frac-times99.7%
*-un-lft-identity99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 85.4%
Taylor expanded in alpha around inf 7.0%
Final simplification44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 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 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 94.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
Taylor expanded in beta around 0 81.8%
Taylor expanded in alpha around 0 59.4%
+-commutative59.4%
Simplified59.4%
Taylor expanded in beta around 0 44.2%
Final simplification44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 94.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
Taylor expanded in beta around 0 81.8%
associate-/r*82.3%
+-commutative82.3%
+-commutative82.3%
+-commutative82.3%
associate-+r+82.3%
+-commutative82.3%
+-commutative82.3%
frac-times81.9%
*-un-lft-identity81.9%
+-commutative81.9%
+-commutative81.9%
+-commutative81.9%
+-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-+r+81.9%
Applied egg-rr81.9%
Taylor expanded in beta around 0 71.0%
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.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.5%
associate-/l/92.7%
associate-/r*84.1%
+-commutative84.1%
associate-+l+84.1%
associate-+r+84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
*-commutative84.1%
distribute-rgt1-in84.1%
+-commutative84.1%
times-frac96.0%
Simplified96.0%
Taylor expanded in beta around 0 81.8%
Taylor expanded in alpha around 0 59.4%
+-commutative59.4%
Simplified59.4%
Taylor expanded in beta around 0 44.2%
Taylor expanded in alpha around 0 43.2%
Final simplification43.2%
herbie shell --seed 2023309
(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)))