
(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 14 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 (+ (+ beta alpha) 2.0)))
(if (<= beta 3e+140)
(/
1.0
(*
(* t_0 (/ t_0 (+ 1.0 (fma alpha beta (+ beta alpha)))))
(+ alpha (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 3e+140) {
tmp = 1.0 / ((t_0 * (t_0 / (1.0 + fma(alpha, beta, (beta + alpha))))) * (alpha + (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 3e+140) tmp = Float64(1.0 / Float64(Float64(t_0 * Float64(t_0 / Float64(1.0 + fma(alpha, beta, Float64(beta + alpha))))) * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 3e+140], N[(1.0 / N[(N[(t$95$0 * N[(t$95$0 / N[(1.0 + N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{+140}:\\
\;\;\;\;\frac{1}{\left(t\_0 \cdot \frac{t\_0}{1 + \mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right)}\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.99999999999999997e140Initial program 98.5%
Applied egg-rr98.1%
if 2.99999999999999997e140 < beta Initial program 76.5%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr65.0%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6490.9
Simplified90.9%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6482.0
Simplified82.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6490.8
Applied egg-rr90.8%
Final simplification96.9%
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))))
(if (<= beta 9.5e+17)
(/
(+ 1.0 (fma alpha beta (+ beta alpha)))
(* (+ (+ beta alpha) 2.0) (fma t_0 (+ beta alpha) (* 2.0 t_0))))
(/ (/ (+ 1.0 alpha) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 3.0);
double tmp;
if (beta <= 9.5e+17) {
tmp = (1.0 + fma(alpha, beta, (beta + alpha))) / (((beta + alpha) + 2.0) * fma(t_0, (beta + alpha), (2.0 * t_0)));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 3.0)) tmp = 0.0 if (beta <= 9.5e+17) tmp = Float64(Float64(1.0 + fma(alpha, beta, Float64(beta + alpha))) / Float64(Float64(Float64(beta + alpha) + 2.0) * fma(t_0, Float64(beta + alpha), Float64(2.0 * t_0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return 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]}, If[LessEqual[beta, 9.5e+17], N[(N[(1.0 + N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision] * N[(t$95$0 * N[(beta + alpha), $MachinePrecision] + N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 3\right)\\
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+17}:\\
\;\;\;\;\frac{1 + \mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right)}{\left(\left(\beta + \alpha\right) + 2\right) \cdot \mathsf{fma}\left(t\_0, \beta + \alpha, 2 \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9.5e17Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr94.2%
lift-+.f64N/A
lift-+.f64N/A
associate-+r+N/A
lift-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
*-commutativeN/A
lift-+.f64N/A
distribute-lft-inN/A
lower-fma.f64N/A
Applied egg-rr94.2%
if 9.5e17 < beta Initial program 83.6%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr77.4%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6487.7
Simplified87.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6487.6
Applied egg-rr87.6%
Final simplification92.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) 2.0)))
(if (<= beta 3e+140)
(/
(/ (+ 1.0 (fma alpha beta (+ beta alpha))) t_0)
(* t_0 (+ alpha (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 3e+140) {
tmp = ((1.0 + fma(alpha, beta, (beta + alpha))) / t_0) / (t_0 * (alpha + (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 3e+140) tmp = Float64(Float64(Float64(1.0 + fma(alpha, beta, Float64(beta + alpha))) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 3e+140], N[(N[(N[(1.0 + N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{+140}:\\
\;\;\;\;\frac{\frac{1 + \mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right)}{t\_0}}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.99999999999999997e140Initial program 98.5%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr98.1%
if 2.99999999999999997e140 < beta Initial program 76.5%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr65.0%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6490.9
Simplified90.9%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6482.0
Simplified82.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6490.8
Applied egg-rr90.8%
Final simplification96.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 9.5e+17)
(/
(+ 1.0 (fma alpha beta (+ beta alpha)))
(* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (+ 1.0 alpha) beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 9.5e+17) {
tmp = (1.0 + fma(alpha, beta, (beta + alpha))) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 9.5e+17) tmp = Float64(Float64(1.0 + fma(alpha, beta, Float64(beta + alpha))) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, If[LessEqual[beta, 9.5e+17], N[(N[(1.0 + N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $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] / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 9.5 \cdot 10^{+17}:\\
\;\;\;\;\frac{1 + \mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right)}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9.5e17Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr94.2%
if 9.5e17 < beta Initial program 83.6%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr77.4%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6487.7
Simplified87.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6487.6
Applied egg-rr87.6%
Final simplification92.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.3e+17) (/ (+ beta 1.0) (* (* (+ beta 3.0) (+ beta 2.0)) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3e+17) {
tmp = (beta + 1.0) / (((beta + 3.0) * (beta + 2.0)) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.3d+17) then
tmp = (beta + 1.0d0) / (((beta + 3.0d0) * (beta + 2.0d0)) * (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3e+17) {
tmp = (beta + 1.0) / (((beta + 3.0) * (beta + 2.0)) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.3e+17: tmp = (beta + 1.0) / (((beta + 3.0) * (beta + 2.0)) * (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.3e+17) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(Float64(beta + 3.0) * Float64(beta + 2.0)) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.3e+17)
tmp = (beta + 1.0) / (((beta + 3.0) * (beta + 2.0)) * (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.3e+17], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.3 \cdot 10^{+17}:\\
\;\;\;\;\frac{\beta + 1}{\left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.3e17Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.2
Simplified84.2%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6470.2
Simplified70.2%
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
lift-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
associate-*l*N/A
lower-*.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-*.f6470.2
lift-+.f64N/A
+-commutativeN/A
lower-+.f6470.2
Applied egg-rr70.2%
if 4.3e17 < beta Initial program 83.6%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr77.4%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6487.7
Simplified87.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6487.6
Applied egg-rr87.6%
Final simplification75.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) (/ (+ 1.0 alpha) (* (* (+ alpha 2.0) (+ alpha 2.0)) (+ alpha 3.0))) (/ (/ (- alpha -1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.0d0) then
tmp = (1.0d0 + alpha) / (((alpha + 2.0d0) * (alpha + 2.0d0)) * (alpha + 3.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 <= 3.0) {
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.0: tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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 <= 3.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(alpha + 2.0) * Float64(alpha + 2.0)) * Float64(alpha + 3.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 <= 3.0)
tmp = (1.0 + alpha) / (((alpha + 2.0) * (alpha + 2.0)) * (alpha + 3.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, 3.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] * N[(alpha + 3.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 3:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\alpha + 2\right) \cdot \left(\alpha + 2\right)\right) \cdot \left(\alpha + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr94.6%
Taylor expanded in beta around 0
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f64N/A
lower-+.f6493.5
Simplified93.5%
Taylor expanded in beta around 0
lower-+.f6493.6
Simplified93.6%
if 3 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in alpha around 0
+-commutativeN/A
lower-+.f6484.5
Simplified84.5%
Final simplification90.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.5)
(/
(fma beta 0.2222222222222222 0.3333333333333333)
(* (+ beta 2.0) (+ beta 2.0)))
(/ (/ (- alpha -1.0) beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = fma(beta, 0.2222222222222222, 0.3333333333333333) / ((beta + 2.0) * (beta + 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 <= 4.5) tmp = Float64(fma(beta, 0.2222222222222222, 0.3333333333333333) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / Float64(beta + 3.0)); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(N[(beta * 0.2222222222222222 + 0.3333333333333333), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 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 4.5:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, 0.2222222222222222, 0.3333333333333333\right)}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6470.6
Simplified70.6%
if 4.5 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in alpha around 0
+-commutativeN/A
lower-+.f6484.5
Simplified84.5%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.5)
(/
(fma beta 0.2222222222222222 0.3333333333333333)
(* (+ beta 2.0) (+ beta 2.0)))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = fma(beta, 0.2222222222222222, 0.3333333333333333) / ((beta + 2.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(fma(beta, 0.2222222222222222, 0.3333333333333333) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.5], N[(N[(beta * 0.2222222222222222 + 0.3333333333333333), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{\mathsf{fma}\left(\beta, 0.2222222222222222, 0.3333333333333333\right)}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6470.6
Simplified70.6%
if 6.5 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6484.5
Applied egg-rr84.5%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.3333333333333333 (* (+ beta 2.0) (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.5d0) then
tmp = 0.3333333333333333d0 / ((beta + 2.0d0) * (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(0.3333333333333333 / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5)
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.5], N[(0.3333333333333333 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{0.3333333333333333}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
Simplified70.1%
if 6.5 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lower-/.f6484.5
Applied egg-rr84.5%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 0.3333333333333333 (* (+ beta 2.0) (+ beta 2.0))) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.5d0) then
tmp = 0.3333333333333333d0 / ((beta + 2.0d0) * (beta + 2.0d0))
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.5: tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0)) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.5) tmp = Float64(0.3333333333333333 / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.5)
tmp = 0.3333333333333333 / ((beta + 2.0) * (beta + 2.0));
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.5], N[(0.3333333333333333 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;\frac{0.3333333333333333}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
Simplified70.1%
if 6.5 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8) 0.041666666666666664 (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.041666666666666664;
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.8d0) then
tmp = 0.041666666666666664d0
else
tmp = (1.0d0 + alpha) / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.041666666666666664;
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8: tmp = 0.041666666666666664 else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8) tmp = 0.041666666666666664; else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8)
tmp = 0.041666666666666664;
else
tmp = (1.0 + alpha) / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.8], 0.041666666666666664, N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8:\\
\;\;\;\;0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.79999999999999982Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
Simplified14.7%
if 4.79999999999999982 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
Final simplification35.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.6) 0.041666666666666664 (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.041666666666666664;
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.6d0) then
tmp = 0.041666666666666664d0
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.041666666666666664;
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.041666666666666664 else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = 0.041666666666666664; else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6)
tmp = 0.041666666666666664;
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.6], 0.041666666666666664, N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
Simplified14.7%
if 3.60000000000000009 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6478.4
Simplified78.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8) 0.041666666666666664 (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.041666666666666664;
} else {
tmp = 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 <= 4.8d0) then
tmp = 0.041666666666666664d0
else
tmp = 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 <= 4.8) {
tmp = 0.041666666666666664;
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8: tmp = 0.041666666666666664 else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8) tmp = 0.041666666666666664; else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.8)
tmp = 0.041666666666666664;
else
tmp = 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, 4.8], 0.041666666666666664, N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8:\\
\;\;\;\;0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 4.79999999999999982Initial program 99.9%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr99.4%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6484.3
Simplified84.3%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6471.1
Simplified71.1%
Taylor expanded in beta around 0
Simplified14.7%
if 4.79999999999999982 < beta Initial program 84.4%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
flip-+N/A
associate-/r/N/A
lower-*.f64N/A
Applied egg-rr78.5%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
lower-/.f64N/A
sub-negN/A
metadata-evalN/A
lower-+.f64N/A
mul-1-negN/A
lower-neg.f6484.7
Simplified84.7%
Taylor expanded in beta around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
unpow2N/A
lower-*.f6480.1
Simplified80.1%
Taylor expanded in alpha around 0
Simplified78.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.041666666666666664)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.041666666666666664;
}
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.041666666666666664d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.041666666666666664;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.041666666666666664
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.041666666666666664 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.041666666666666664;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.041666666666666664
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.041666666666666664
\end{array}
Initial program 94.8%
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-/.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
div-invN/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
Applied egg-rr92.6%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-+.f6485.8
Simplified85.8%
Taylor expanded in alpha around 0
unpow2N/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6473.5
Simplified73.5%
Taylor expanded in beta around 0
Simplified11.2%
herbie shell --seed 2024214
(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)))