
(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 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 1.25e+104)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/
(+
(+ (+ 1.0 alpha) (+ (/ 1.0 beta) (/ alpha beta)))
(* (/ (+ alpha 2.0) beta) (- -1.0 alpha)))
(+ 2.0 (+ beta alpha)))
(+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.25e+104) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((((1.0 + alpha) + ((1.0 / beta) + (alpha / beta))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.25d+104) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((((1.0d0 + alpha) + ((1.0d0 / beta) + (alpha / beta))) + (((alpha + 2.0d0) / beta) * ((-1.0d0) - alpha))) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.25e+104) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((((1.0 + alpha) + ((1.0 / beta) + (alpha / beta))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.25e+104: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((((1.0 + alpha) + ((1.0 / beta) + (alpha / beta))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 1.25e+104) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(Float64(Float64(1.0 + alpha) + Float64(Float64(1.0 / beta) + Float64(alpha / beta))) + Float64(Float64(Float64(alpha + 2.0) / beta) * Float64(-1.0 - alpha))) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 1.25e+104)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((((1.0 + alpha) + ((1.0 / beta) + (alpha / beta))) + (((alpha + 2.0) / beta) * (-1.0 - alpha))) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.25e+104], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.25 \cdot 10^{+104}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(1 + \alpha\right) + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right) + \frac{\alpha + 2}{\beta} \cdot \left(-1 - \alpha\right)}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.2499999999999999e104Initial program 98.8%
associate-/l/98.4%
+-commutative98.4%
associate-+l+98.4%
*-commutative98.4%
metadata-eval98.4%
associate-+l+98.4%
metadata-eval98.4%
+-commutative98.4%
+-commutative98.4%
+-commutative98.4%
metadata-eval98.4%
metadata-eval98.4%
associate-+l+98.4%
Simplified98.4%
if 1.2499999999999999e104 < beta Initial program 79.0%
Taylor expanded in alpha around 0 79.0%
+-commutative79.0%
+-commutative79.0%
associate-+l+79.0%
+-commutative79.0%
Simplified79.0%
Taylor expanded in beta around inf 85.4%
associate-+r+85.4%
associate-/l*92.7%
Simplified92.7%
Final simplification97.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 (<= beta 1.5e+14)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/
(/
(+
1.0
(+
(+ (/ alpha beta) (+ alpha (/ 1.0 beta)))
(* (/ (+ 4.0 (* alpha 2.0)) beta) (- -1.0 alpha))))
beta)
(+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.5e+14) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + (((alpha / beta) + (alpha + (1.0 / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha)))) / 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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1.5d+14) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + (((alpha / beta) + (alpha + (1.0d0 / beta))) + (((4.0d0 + (alpha * 2.0d0)) / beta) * ((-1.0d0) - alpha)))) / beta) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1.5e+14) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + (((alpha / beta) + (alpha + (1.0 / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha)))) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1.5e+14: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + (((alpha / beta) + (alpha + (1.0 / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha)))) / beta) / (beta + (alpha + 3.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 <= 1.5e+14) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + Float64(Float64(Float64(alpha / beta) + Float64(alpha + Float64(1.0 / beta))) + Float64(Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta) * Float64(-1.0 - alpha)))) / beta) / Float64(beta + Float64(alpha + 3.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 <= 1.5e+14)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + (((alpha / beta) + (alpha + (1.0 / beta))) + (((4.0 + (alpha * 2.0)) / beta) * (-1.0 - alpha)))) / 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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.5e+14], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + N[(N[(N[(alpha / beta), $MachinePrecision] + N[(alpha + N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(4.0 + N[(alpha * 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(-1.0 - alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 1.5 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \left(\left(\frac{\alpha}{\beta} + \left(\alpha + \frac{1}{\beta}\right)\right) + \frac{4 + \alpha \cdot 2}{\beta} \cdot \left(-1 - \alpha\right)\right)}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.5e14Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
if 1.5e14 < beta Initial program 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
+-commutative82.1%
associate-+l+82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in beta around inf 84.5%
associate--l+84.4%
associate-+r+84.4%
associate-/l*89.6%
Simplified89.6%
Final simplification96.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 4e+104)
(/
(/ (+ 1.0 (+ alpha (+ beta (* beta alpha)))) t_0)
(* t_0 (+ (+ beta alpha) 3.0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+104) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4d+104) then
tmp = ((1.0d0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.0d0))
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 <= 4e+104) {
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4e+104: tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 4e+104) tmp = Float64(Float64(Float64(1.0 + Float64(alpha + Float64(beta + Float64(beta * alpha)))) / t_0) / Float64(t_0 * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 4e+104)
tmp = ((1.0 + (alpha + (beta + (beta * alpha)))) / t_0) / (t_0 * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+104], N[(N[(N[(1.0 + N[(alpha + N[(beta + N[(beta * alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+104}:\\
\;\;\;\;\frac{\frac{1 + \left(\alpha + \left(\beta + \beta \cdot \alpha\right)\right)}{t\_0}}{t\_0 \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4e104Initial program 98.8%
associate-/l/98.4%
+-commutative98.4%
associate-+l+98.4%
*-commutative98.4%
metadata-eval98.4%
associate-+l+98.4%
metadata-eval98.4%
+-commutative98.4%
+-commutative98.4%
+-commutative98.4%
metadata-eval98.4%
metadata-eval98.4%
associate-+l+98.4%
Simplified98.4%
if 4e104 < beta Initial program 79.0%
Taylor expanded in alpha around 0 79.0%
+-commutative79.0%
+-commutative79.0%
associate-+l+79.0%
+-commutative79.0%
Simplified79.0%
Taylor expanded in beta around inf 92.7%
Final simplification97.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 (<= beta 4e+26)
(/ (* (+ 1.0 alpha) (+ beta 1.0)) (* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 4e+26) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 4d+26) then
tmp = ((1.0d0 + alpha) * (beta + 1.0d0)) / (t_0 * (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (beta + (alpha + 3.0d0))
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 <= 4e+26) {
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 4e+26: tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0)))) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.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 <= 4e+26) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(beta + 1.0)) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / Float64(beta + Float64(alpha + 3.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 <= 4e+26)
tmp = ((1.0 + alpha) * (beta + 1.0)) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4e+26], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta + 1.0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+26}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(\beta + 1\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4.00000000000000019e26Initial program 99.9%
Simplified96.2%
if 4.00000000000000019e26 < beta Initial program 81.4%
Taylor expanded in alpha around 0 81.4%
+-commutative81.4%
+-commutative81.4%
associate-+l+81.4%
+-commutative81.4%
Simplified81.4%
Taylor expanded in beta around inf 89.7%
Final simplification94.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 3.0))) (t_1 (+ 2.0 (+ beta alpha))))
(if (<= beta 1.45e+15)
(/ (/ (/ (+ beta 1.0) (+ beta 2.0)) t_1) t_0)
(/ (/ (+ 1.0 alpha) t_1) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double t_1 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.45e+15) {
tmp = (((beta + 1.0) / (beta + 2.0)) / t_1) / t_0;
} else {
tmp = ((1.0 + alpha) / t_1) / 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) :: t_1
real(8) :: tmp
t_0 = beta + (alpha + 3.0d0)
t_1 = 2.0d0 + (beta + alpha)
if (beta <= 1.45d+15) then
tmp = (((beta + 1.0d0) / (beta + 2.0d0)) / t_1) / t_0
else
tmp = ((1.0d0 + alpha) / t_1) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double t_1 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 1.45e+15) {
tmp = (((beta + 1.0) / (beta + 2.0)) / t_1) / t_0;
} else {
tmp = ((1.0 + alpha) / t_1) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 3.0) t_1 = 2.0 + (beta + alpha) tmp = 0 if beta <= 1.45e+15: tmp = (((beta + 1.0) / (beta + 2.0)) / t_1) / t_0 else: tmp = ((1.0 + alpha) / t_1) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 3.0)) t_1 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.45e+15) tmp = Float64(Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / t_1) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 3.0);
t_1 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 1.45e+15)
tmp = (((beta + 1.0) / (beta + 2.0)) / t_1) / t_0;
else
tmp = ((1.0 + alpha) / t_1) / 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[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.45e+15], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 3\right)\\
t_1 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.45 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{\frac{\beta + 1}{\beta + 2}}{t\_1}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_1}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.45e15Initial program 99.9%
Taylor expanded in alpha around 0 99.9%
+-commutative99.9%
+-commutative99.9%
associate-+l+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in alpha around 0 83.5%
+-commutative83.5%
Simplified83.5%
if 1.45e15 < beta Initial program 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
+-commutative82.1%
associate-+l+82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in beta around inf 90.0%
Final simplification85.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.6e+14)
(/
(/ (+ beta 1.0) (+ beta 2.0))
(* (+ alpha (+ beta 2.0)) (+ (+ beta alpha) 3.0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 5.6d+14) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((alpha + (beta + 2.0d0)) * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 5.6e+14) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.6e+14: tmp = ((beta + 1.0) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.6e+14) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 5.6e+14)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 5.6e+14], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 5.6 \cdot 10^{+14}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.6e14Initial program 99.9%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 83.5%
+-commutative83.5%
Simplified83.5%
if 5.6e14 < beta Initial program 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
+-commutative82.1%
associate-+l+82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in beta around inf 90.0%
Final simplification85.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 16.5)
(/
(/ (+ 1.0 alpha) (+ alpha 2.0))
(* (+ alpha (+ beta 2.0)) (+ (+ beta alpha) 3.0)))
(/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 16.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 16.5d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + (beta + 2.0d0)) * ((beta + alpha) + 3.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 16.5) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 16.5: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 16.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + alpha) + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 16.5)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + (beta + 2.0)) * ((beta + alpha) + 3.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 16.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 16.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 16.5Initial 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%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
metadata-eval99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.2%
if 16.5 < beta Initial program 82.8%
Taylor expanded in alpha around 0 82.8%
+-commutative82.8%
+-commutative82.8%
associate-+l+82.8%
+-commutative82.8%
Simplified82.8%
Taylor expanded in beta around inf 86.6%
Final simplification95.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 0.92) 0.08333333333333333 (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 0.92) {
tmp = 0.08333333333333333;
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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 <= 0.92d0) then
tmp = 0.08333333333333333d0
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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 <= 0.92) {
tmp = 0.08333333333333333;
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 0.92: tmp = 0.08333333333333333 else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 0.92) tmp = 0.08333333333333333; else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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 <= 0.92)
tmp = 0.08333333333333333;
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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, 0.92], 0.08333333333333333, N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $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 0.92:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 0.92000000000000004Initial program 99.9%
Taylor expanded in beta around inf 95.2%
Taylor expanded in beta around 0 94.6%
Taylor expanded in alpha around 0 66.1%
Taylor expanded in beta around 0 67.0%
if 0.92000000000000004 < beta Initial program 82.8%
Taylor expanded in alpha around 0 82.8%
+-commutative82.8%
+-commutative82.8%
associate-+l+82.8%
+-commutative82.8%
Simplified82.8%
Taylor expanded in beta around inf 86.6%
Final simplification73.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.3) 0.08333333333333333 (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.08333333333333333;
} else {
tmp = ((1.0 + alpha) / 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 <= 2.3d0) then
tmp = 0.08333333333333333d0
else
tmp = ((1.0d0 + alpha) / 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 <= 2.3) {
tmp = 0.08333333333333333;
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.08333333333333333 else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = 0.08333333333333333; else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 2.3)
tmp = 0.08333333333333333;
else
tmp = ((1.0 + alpha) / 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, 2.3], 0.08333333333333333, N[(N[(N[(1.0 + alpha), $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 2.3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.9%
Taylor expanded in beta around inf 95.2%
Taylor expanded in beta around 0 94.6%
Taylor expanded in alpha around 0 66.1%
Taylor expanded in beta around 0 67.0%
if 2.2999999999999998 < beta Initial program 82.8%
Taylor expanded in alpha around 0 82.8%
+-commutative82.8%
+-commutative82.8%
associate-+l+82.8%
+-commutative82.8%
Simplified82.8%
Taylor expanded in beta around inf 86.3%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.0) 0.08333333333333333 (/ (/ 1.0 (+ beta 2.0)) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = 0.08333333333333333;
} else {
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.0d0) then
tmp = 0.08333333333333333d0
else
tmp = (1.0d0 / (beta + 2.0d0)) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = 0.08333333333333333;
} else {
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.0: tmp = 0.08333333333333333 else: tmp = (1.0 / (beta + 2.0)) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.0) tmp = 0.08333333333333333; else tmp = Float64(Float64(1.0 / Float64(beta + 2.0)) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.0)
tmp = 0.08333333333333333;
else
tmp = (1.0 / (beta + 2.0)) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.0], 0.08333333333333333, N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta + 2}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1Initial program 99.9%
Taylor expanded in beta around inf 95.2%
Taylor expanded in beta around 0 94.6%
Taylor expanded in alpha around 0 66.1%
Taylor expanded in beta around 0 67.0%
if 1 < beta Initial program 82.8%
associate-/l/78.1%
+-commutative78.1%
associate-+l+78.1%
*-commutative78.1%
metadata-eval78.1%
associate-+l+78.1%
metadata-eval78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
metadata-eval78.1%
metadata-eval78.1%
associate-+l+78.1%
Simplified78.1%
Taylor expanded in beta around inf 82.8%
Taylor expanded in alpha around 0 75.9%
+-commutative75.9%
+-commutative75.9%
Simplified75.9%
*-un-lft-identity75.9%
Applied egg-rr75.9%
*-lft-identity75.9%
associate-/r*76.3%
Simplified76.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.0) 0.08333333333333333 (/ 1.0 (* (+ beta 2.0) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.0: tmp = 0.08333333333333333 else: tmp = 1.0 / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.0], 0.08333333333333333, N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1Initial program 99.9%
Taylor expanded in beta around inf 95.2%
Taylor expanded in beta around 0 94.6%
Taylor expanded in alpha around 0 66.1%
Taylor expanded in beta around 0 67.0%
if 1 < beta Initial program 82.8%
associate-/l/78.1%
+-commutative78.1%
associate-+l+78.1%
*-commutative78.1%
metadata-eval78.1%
associate-+l+78.1%
metadata-eval78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
metadata-eval78.1%
metadata-eval78.1%
associate-+l+78.1%
Simplified78.1%
Taylor expanded in beta around inf 82.8%
Taylor expanded in alpha around 0 75.9%
+-commutative75.9%
+-commutative75.9%
Simplified75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.45) 0.08333333333333333 (/ 0.5 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45) {
tmp = 0.08333333333333333;
} else {
tmp = 0.5 / (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 <= 2.45d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.5d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.45) {
tmp = 0.08333333333333333;
} else {
tmp = 0.5 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.45: tmp = 0.08333333333333333 else: tmp = 0.5 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.45) tmp = 0.08333333333333333; else tmp = Float64(0.5 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.45)
tmp = 0.08333333333333333;
else
tmp = 0.5 / (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, 2.45], 0.08333333333333333, N[(0.5 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.45:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.5}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.4500000000000002Initial program 99.9%
Taylor expanded in beta around inf 95.2%
Taylor expanded in beta around 0 94.6%
Taylor expanded in alpha around 0 66.1%
Taylor expanded in beta around 0 67.0%
if 2.4500000000000002 < beta Initial program 82.8%
Taylor expanded in beta around inf 82.9%
Taylor expanded in beta around 0 56.3%
Taylor expanded in alpha around 0 53.9%
Taylor expanded in beta around inf 53.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.1%
Taylor expanded in beta around inf 91.0%
Taylor expanded in beta around 0 81.6%
Taylor expanded in alpha around 0 62.0%
Taylor expanded in beta around 0 45.6%
herbie shell --seed 2024111
(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)))