
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (/ (* (+ alpha 1.0) (/ (+ 1.0 beta) t_0)) (+ alpha (+ beta 3.0))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) * ((1.0 + beta) / t_0)) / (alpha + (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 = alpha + (beta + 2.0d0)
code = (((alpha + 1.0d0) * ((1.0d0 + beta) / t_0)) / (alpha + (beta + 3.0d0))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((alpha + 1.0) * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0))) / t_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) * Float64(Float64(1.0 + beta) / t_0)) / Float64(alpha + Float64(beta + 3.0))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((alpha + 1.0) * ((1.0 + beta) / t_0)) / (alpha + (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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 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 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\left(\alpha + 1\right) \cdot \frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 92.2%
Simplified84.6%
times-frac95.5%
+-commutative95.5%
Applied egg-rr95.5%
associate-*l/95.5%
associate-+r+95.5%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.9%
Applied egg-rr99.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= alpha 86.0)
(* (/ (+ alpha 1.0) t_1) (/ (+ 1.0 beta) (* t_1 t_0)))
(/ (/ (* alpha (/ (+ 1.0 beta) t_1)) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 86.0) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((alpha * ((1.0 + beta) / t_1)) / t_0) / t_1;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (alpha <= 86.0d0) then
tmp = ((alpha + 1.0d0) / t_1) * ((1.0d0 + beta) / (t_1 * t_0))
else
tmp = ((alpha * ((1.0d0 + beta) / t_1)) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 86.0) {
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
} else {
tmp = ((alpha * ((1.0 + beta) / t_1)) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if alpha <= 86.0: tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0)) else: tmp = ((alpha * ((1.0 + beta) / t_1)) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= 86.0) tmp = Float64(Float64(Float64(alpha + 1.0) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(alpha * Float64(Float64(1.0 + beta) / t_1)) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (alpha <= 86.0)
tmp = ((alpha + 1.0) / t_1) * ((1.0 + beta) / (t_1 * t_0));
else
tmp = ((alpha * ((1.0 + beta) / t_1)) / t_0) / t_1;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 86.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha * N[(N[(1.0 + beta), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq 86:\\
\;\;\;\;\frac{\alpha + 1}{t\_1} \cdot \frac{1 + \beta}{t\_1 \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha \cdot \frac{1 + \beta}{t\_1}}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if alpha < 86Initial program 99.9%
Simplified97.1%
times-frac99.8%
+-commutative99.8%
Applied egg-rr99.8%
if 86 < alpha Initial program 77.2%
Simplified60.4%
times-frac87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-*l/87.2%
associate-+r+87.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around inf 99.3%
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 (<= alpha 1.75)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta))))
(/ (/ (* alpha (/ (+ 1.0 beta) t_0)) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 1.75) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.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 = alpha + (beta + 2.0d0)
if (alpha <= 1.75d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((alpha * ((1.0d0 + beta) / t_0)) / (alpha + (beta + 3.0d0))) / t_0
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 (alpha <= 1.75) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if alpha <= 1.75: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((alpha * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= 1.75) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha * Float64(Float64(1.0 + beta) / t_0)) / Float64(alpha + Float64(beta + 3.0))) / t_0); 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 (alpha <= 1.75)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((alpha * ((1.0 + beta) / t_0)) / (alpha + (beta + 3.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 1.75], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(alpha + 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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq 1.75:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha \cdot \frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 1.75Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 97.4%
+-commutative97.4%
Simplified97.4%
Taylor expanded in alpha around 0 98.8%
+-commutative98.8%
Simplified98.8%
if 1.75 < alpha Initial program 77.2%
Simplified60.4%
times-frac87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-*l/87.2%
associate-+r+87.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around inf 99.3%
Final simplification99.0%
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 (<= alpha 2.2)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta))))
(/ (* alpha (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (alpha <= 2.2) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (alpha * (((1.0 + beta) / t_0) / (alpha + (beta + 3.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 = alpha + (beta + 2.0d0)
if (alpha <= 2.2d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = (alpha * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
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 (alpha <= 2.2) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (alpha * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if alpha <= 2.2: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = (alpha * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (alpha <= 2.2) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(alpha * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0); 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 (alpha <= 2.2)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = (alpha * (((1.0 + beta) / t_0) / (alpha + (beta + 3.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[alpha, 2.2], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\alpha \leq 2.2:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if alpha < 2.2000000000000002Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
associate-+l+99.9%
*-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
associate-+l+99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 97.4%
+-commutative97.4%
Simplified97.4%
Taylor expanded in alpha around 0 98.8%
+-commutative98.8%
Simplified98.8%
if 2.2000000000000002 < alpha Initial program 77.2%
Simplified60.4%
times-frac87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-*l/87.2%
associate-+r+87.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in alpha around inf 99.3%
Final simplification99.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 400000000.0)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta))))
(*
(/ (+ alpha 1.0) (+ alpha (+ beta 2.0)))
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 400000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 400000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 400000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 400000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 400000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 400000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 2.0))) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 400000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 400000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4e8Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in alpha around 0 68.1%
+-commutative68.1%
Simplified68.1%
if 4e8 < beta Initial program 75.3%
Simplified63.4%
times-frac86.6%
+-commutative86.6%
Applied egg-rr86.6%
Taylor expanded in beta around inf 82.8%
mul-1-neg82.8%
Simplified82.8%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (/ (* (+ alpha 1.0) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (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 = alpha + (beta + 2.0d0)
code = ((alpha + 1.0d0) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(alpha + 1.0) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((alpha + 1.0) * (((1.0 + beta) / t_0) / (alpha + (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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\left(\alpha + 1\right) \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 92.2%
Simplified84.6%
times-frac95.5%
+-commutative95.5%
Applied egg-rr95.5%
associate-*l/95.5%
associate-+r+95.5%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ 3.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (3.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1e15Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 83.2%
+-commutative83.2%
Simplified83.2%
Taylor expanded in alpha around 0 68.7%
+-commutative68.7%
Simplified68.7%
if 1e15 < beta Initial program 74.3%
Simplified62.0%
times-frac86.2%
+-commutative86.2%
Applied egg-rr86.2%
associate-*l/86.2%
associate-+r+86.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 82.6%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 7.8e+15)
(/ (/ (+ 1.0 beta) (* (+ beta 2.0) (+ beta 3.0))) t_0)
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 7.8e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.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 = alpha + (beta + 2.0d0)
if (beta <= 7.8d+15) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) * (beta + 3.0d0))) / t_0
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / t_0
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 <= 7.8e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 7.8e+15: tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0 else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 7.8e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))) / t_0); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / t_0); 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 <= 7.8e+15)
tmp = ((1.0 + beta) / ((beta + 2.0) * (beta + 3.0))) / t_0;
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 7.8e+15], N[(N[(N[(1.0 + beta), $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[(alpha + 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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 7.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 7.8e15Initial program 99.9%
Simplified94.4%
times-frac99.5%
+-commutative99.5%
Applied egg-rr99.5%
associate-*l/99.5%
associate-+r+99.5%
associate-/r*99.9%
associate-+r+99.9%
Applied egg-rr99.9%
Taylor expanded in alpha around 0 67.5%
+-commutative67.5%
+-commutative67.5%
Simplified67.5%
if 7.8e15 < beta Initial program 74.3%
Simplified62.0%
times-frac86.2%
+-commutative86.2%
Applied egg-rr86.2%
associate-*l/86.2%
associate-+r+86.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 82.6%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95e+15) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.95d+15) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95e+15) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95e+15: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.95e+15)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.95e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.95 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 2.95e15Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 83.2%
+-commutative83.2%
Simplified83.2%
Taylor expanded in alpha around 0 66.6%
+-commutative66.6%
+-commutative66.6%
Simplified66.6%
if 2.95e15 < beta Initial program 74.3%
Simplified62.0%
times-frac86.2%
+-commutative86.2%
Applied egg-rr86.2%
associate-*l/86.2%
associate-+r+86.2%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 82.6%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.85) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))) (+ alpha (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.85d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / (alpha + (beta + 3.0d0))) / (alpha + (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.85: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.85) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 3.0))) / Float64(alpha + Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.85)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / (alpha + (beta + 3.0))) / (alpha + (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.85], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}}{\alpha + \left(\beta + 2\right)}\\
\end{array}
\end{array}
if beta < 1.8500000000000001Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.7%
*-commutative82.7%
Simplified82.7%
Taylor expanded in alpha around 0 65.7%
+-commutative66.0%
+-commutative66.0%
Simplified65.7%
if 1.8500000000000001 < beta Initial program 75.3%
Simplified63.4%
times-frac86.6%
+-commutative86.6%
Applied egg-rr86.6%
associate-*l/86.7%
associate-+r+86.7%
associate-/r*99.8%
associate-+r+99.8%
Applied egg-rr99.8%
associate-*r/99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 82.5%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ alpha 1.0) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.7%
*-commutative82.7%
Simplified82.7%
Taylor expanded in alpha around 0 65.7%
+-commutative66.0%
+-commutative66.0%
Simplified65.7%
if 4 < beta Initial program 75.3%
Taylor expanded in beta around inf 82.0%
metadata-eval82.0%
associate-+l+82.0%
metadata-eval82.0%
+-commutative82.0%
associate-+r+82.0%
*-un-lft-identity82.0%
fma-define82.0%
Applied egg-rr82.0%
fma-undefine82.0%
*-lft-identity82.0%
+-commutative82.0%
Simplified82.0%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 26.0) (/ 0.5 (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ alpha 1.0) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 26.0) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 26.0d0) then
tmp = 0.5d0 / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 26.0) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 26.0: tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 26.0) tmp = Float64(0.5 / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 26.0)
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((alpha + 1.0) / beta) / (beta + (alpha + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 26.0], N[(0.5 / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 26:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 26Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.2%
if 26 < beta Initial program 75.3%
Taylor expanded in beta around inf 82.0%
metadata-eval82.0%
associate-+l+82.0%
metadata-eval82.0%
+-commutative82.0%
associate-+r+82.0%
*-un-lft-identity82.0%
fma-define82.0%
Applied egg-rr82.0%
fma-undefine82.0%
*-lft-identity82.0%
+-commutative82.0%
Simplified82.0%
Final simplification82.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ 0.5 (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = 0.5d0 / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.5 / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.5 / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.2%
if 2.89999999999999991 < beta Initial program 75.3%
Taylor expanded in beta around inf 82.0%
Taylor expanded in alpha around 0 81.7%
+-commutative81.7%
Simplified81.7%
Final simplification82.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2300.0) (/ 0.5 (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2300.0) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2300.0d0) then
tmp = 0.5d0 / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2300.0) {
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2300.0: tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2300.0) tmp = Float64(0.5 / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2300.0)
tmp = 0.5 / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2300.0], N[(0.5 / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2300:\\
\;\;\;\;\frac{0.5}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2300Initial program 99.9%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
Taylor expanded in alpha around 0 82.9%
+-commutative82.9%
Simplified82.9%
Taylor expanded in beta around 0 82.2%
if 2300 < beta Initial program 75.3%
Taylor expanded in beta around inf 82.0%
metadata-eval82.0%
associate-+l+82.0%
metadata-eval82.0%
+-commutative82.0%
associate-+r+82.0%
*-un-lft-identity82.0%
fma-define82.0%
Applied egg-rr82.0%
fma-undefine82.0%
*-lft-identity82.0%
+-commutative82.0%
Simplified82.0%
Taylor expanded in beta around inf 81.7%
Final simplification82.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ (+ alpha 1.0) beta) beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return ((alpha + 1.0) / beta) / 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) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return ((alpha + 1.0) / beta) / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return ((alpha + 1.0) / beta) / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(Float64(alpha + 1.0) / beta) / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = ((alpha + 1.0) / beta) / 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] / beta), $MachinePrecision] / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{\alpha + 1}{\beta}}{\beta}
\end{array}
Initial program 92.2%
Taylor expanded in beta around inf 27.5%
metadata-eval27.5%
associate-+l+27.5%
metadata-eval27.5%
+-commutative27.5%
associate-+r+27.5%
*-un-lft-identity27.5%
fma-define27.5%
Applied egg-rr27.5%
fma-undefine27.5%
*-lft-identity27.5%
+-commutative27.5%
Simplified27.5%
Taylor expanded in beta around inf 27.9%
Final simplification27.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ 1.0 beta) (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (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 / beta) / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 / beta) / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 / beta) / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 / beta) / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (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[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{\beta}}{\beta + 3}
\end{array}
Initial program 92.2%
Taylor expanded in beta around inf 27.5%
Taylor expanded in alpha around 0 26.1%
associate-/r*26.1%
+-commutative26.1%
Simplified26.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 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 / (beta * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 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[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 92.2%
Taylor expanded in beta around inf 27.5%
Taylor expanded in alpha around 0 26.1%
Final simplification26.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / 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.25d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta}
\end{array}
Initial program 92.2%
associate-/l/91.2%
+-commutative91.2%
associate-+l+91.2%
*-commutative91.2%
metadata-eval91.2%
associate-+l+91.2%
metadata-eval91.2%
associate-+l+91.2%
metadata-eval91.2%
metadata-eval91.2%
associate-+l+91.2%
Simplified91.2%
Taylor expanded in alpha around 0 82.0%
+-commutative82.0%
Simplified82.0%
Taylor expanded in beta around 0 71.8%
*-commutative71.8%
Simplified71.8%
Taylor expanded in beta around inf 4.3%
herbie shell --seed 2024141
(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)))