
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta alpha) 2.0)))
(if (<= beta 2e+111)
(/
(/ (+ (fma alpha beta (+ beta alpha)) 1.0) t_0)
(* t_0 (+ alpha (+ beta 3.0))))
(/
(/
(+
(+ (+ alpha 1.0) (+ (/ 1.0 beta) (/ alpha beta)))
(* (- -1.0 alpha) (/ (fma 2.0 alpha 4.0) beta)))
beta)
(+ 1.0 t_0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2e+111) {
tmp = ((fma(alpha, beta, (beta + alpha)) + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0)));
} else {
tmp = ((((alpha + 1.0) + ((1.0 / beta) + (alpha / beta))) + ((-1.0 - alpha) * (fma(2.0, alpha, 4.0) / beta))) / beta) / (1.0 + t_0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 2e+111) tmp = Float64(Float64(Float64(fma(alpha, beta, Float64(beta + alpha)) + 1.0) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(Float64(alpha + 1.0) + Float64(Float64(1.0 / beta) + Float64(alpha / beta))) + Float64(Float64(-1.0 - alpha) * Float64(fma(2.0, alpha, 4.0) / beta))) / beta) / Float64(1.0 + t_0)); 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, 2e+111], N[(N[(N[(N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] + N[(N[(1.0 / beta), $MachinePrecision] + N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - alpha), $MachinePrecision] * N[(N[(2.0 * alpha + 4.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+111}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1}{t\_0}}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(\alpha + 1\right) + \left(\frac{1}{\beta} + \frac{\alpha}{\beta}\right)\right) + \left(-1 - \alpha\right) \cdot \frac{\mathsf{fma}\left(2, \alpha, 4\right)}{\beta}}{\beta}}{1 + t\_0}\\
\end{array}
\end{array}
if beta < 1.99999999999999991e111Initial program 99.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
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr99.2%
if 1.99999999999999991e111 < beta Initial program 78.1%
Taylor expanded in beta around inf
lower-/.f64N/A
Simplified88.2%
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 (+ (+ beta alpha) 2.0)))
(if (<= beta 2e+111)
(/
(/ (+ (fma alpha beta (+ beta alpha)) 1.0) t_0)
(* t_0 (+ alpha (+ beta 3.0))))
(/ (/ (+ alpha 1.0) (+ beta (+ alpha 3.0))) (+ beta (+ alpha 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2e+111) {
tmp = ((fma(alpha, beta, (beta + alpha)) + 1.0) / t_0) / (t_0 * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 2e+111) tmp = Float64(Float64(Float64(fma(alpha, beta, Float64(beta + alpha)) + 1.0) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) / Float64(beta + Float64(alpha + 2.0))); 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, 2e+111], N[(N[(N[(N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 2 \cdot 10^{+111}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1}{t\_0}}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 1.99999999999999991e111Initial program 99.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
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr99.2%
if 1.99999999999999991e111 < beta Initial program 78.1%
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-rr74.2%
Taylor expanded in beta around inf
lower-+.f6487.6
Simplified87.6%
lift-+.f64N/A
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
associate-/r*N/A
lower-/.f64N/A
Applied egg-rr88.8%
Final simplification96.6%
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 2.5e+96)
(/
(+ (fma alpha beta (+ beta alpha)) 1.0)
(* t_0 (* t_0 (+ alpha (+ beta 3.0)))))
(/ (/ (+ alpha 1.0) (+ beta (+ alpha 3.0))) (+ beta (+ alpha 2.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2.5e+96) {
tmp = (fma(alpha, beta, (beta + alpha)) + 1.0) / (t_0 * (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) tmp = 0.0 if (beta <= 2.5e+96) tmp = Float64(Float64(fma(alpha, beta, Float64(beta + alpha)) + 1.0) / Float64(t_0 * Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) / Float64(beta + Float64(alpha + 2.0))); 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, 2.5e+96], N[(N[(N[(alpha * beta + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / N[(t$95$0 * N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 2.5 \cdot 10^{+96}:\\
\;\;\;\;\frac{\mathsf{fma}\left(\alpha, \beta, \beta + \alpha\right) + 1}{t\_0 \cdot \left(t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 2.5000000000000002e96Initial program 99.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
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr94.3%
if 2.5000000000000002e96 < beta Initial program 78.1%
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-rr74.2%
Taylor expanded in beta around inf
lower-+.f6487.6
Simplified87.6%
lift-+.f64N/A
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
associate-/r*N/A
lower-/.f64N/A
Applied egg-rr88.8%
Final simplification93.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.25e+16)
(/
(/ (+ beta 1.0) (* (+ beta 2.0) (+ beta 2.0)))
(+ 1.0 (+ (+ beta alpha) 2.0)))
(/ (/ (+ alpha 1.0) (+ beta (+ alpha 3.0))) (+ beta (+ alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.25e+16) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.25d+16) then
tmp = ((beta + 1.0d0) / ((beta + 2.0d0) * (beta + 2.0d0))) / (1.0d0 + ((beta + alpha) + 2.0d0))
else
tmp = ((alpha + 1.0d0) / (beta + (alpha + 3.0d0))) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.25e+16) {
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.25e+16: tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + ((beta + alpha) + 2.0)) else: tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.25e+16) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(beta + 2.0))) / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.25e+16)
tmp = ((beta + 1.0) / ((beta + 2.0) * (beta + 2.0))) / (1.0 + ((beta + alpha) + 2.0));
else
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.25e+16], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.25 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(\beta + 2\right)}}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 1.25e16Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6468.2
Simplified68.2%
if 1.25e16 < beta Initial program 84.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
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr82.3%
Taylor expanded in beta around inf
lower-+.f6486.9
Simplified86.9%
lift-+.f64N/A
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
associate-/r*N/A
lower-/.f64N/A
Applied egg-rr86.6%
Final simplification74.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.6e+16) (/ (+ beta 1.0) (fma beta (fma beta (+ beta 7.0) 16.0) 12.0)) (/ (/ (+ alpha 1.0) (+ beta (+ alpha 3.0))) (+ beta (+ alpha 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.6e+16) {
tmp = (beta + 1.0) / fma(beta, fma(beta, (beta + 7.0), 16.0), 12.0);
} else {
tmp = ((alpha + 1.0) / (beta + (alpha + 3.0))) / (beta + (alpha + 2.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.6e+16) tmp = Float64(Float64(beta + 1.0) / fma(beta, fma(beta, Float64(beta + 7.0), 16.0), 12.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(beta + Float64(alpha + 3.0))) / Float64(beta + Float64(alpha + 2.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, 5.6e+16], N[(N[(beta + 1.0), $MachinePrecision] / N[(beta * N[(beta * N[(beta + 7.0), $MachinePrecision] + 16.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta + \left(\alpha + 3\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 5.6e16Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
if 5.6e16 < beta Initial program 84.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
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
Applied egg-rr82.1%
Taylor expanded in beta around inf
lower-+.f6486.8
Simplified86.8%
lift-+.f64N/A
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
associate-/r*N/A
lower-/.f64N/A
Applied egg-rr86.4%
Final simplification74.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+18) (/ (+ beta 1.0) (fma beta (fma beta (+ beta 7.0) 16.0) 12.0)) (/ (/ (+ alpha 1.0) beta) (+ (+ beta alpha) 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+18) {
tmp = (beta + 1.0) / fma(beta, fma(beta, (beta + 7.0), 16.0), 12.0);
} else {
tmp = ((alpha + 1.0) / beta) / ((beta + alpha) + 3.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+18) tmp = Float64(Float64(beta + 1.0) / fma(beta, fma(beta, Float64(beta + 7.0), 16.0), 12.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(Float64(beta + alpha) + 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, 3e+18], N[(N[(beta + 1.0), $MachinePrecision] / N[(beta * N[(beta * N[(beta + 7.0), $MachinePrecision] + 16.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+18}:\\
\;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\left(\beta + \alpha\right) + 3}\\
\end{array}
\end{array}
if beta < 3e18Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
if 3e18 < beta Initial program 84.6%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6486.1
Simplified86.1%
lift-+.f64N/A
metadata-evalN/A
associate-+l+N/A
metadata-evalN/A
lower-+.f6486.1
lift-+.f64N/A
+-commutativeN/A
lower-+.f6486.1
Applied egg-rr86.1%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+18) (/ (+ beta 1.0) (fma beta (fma beta (+ beta 7.0) 16.0) 12.0)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+18) {
tmp = (beta + 1.0) / fma(beta, fma(beta, (beta + 7.0), 16.0), 12.0);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+18) tmp = Float64(Float64(beta + 1.0) / fma(beta, fma(beta, Float64(beta + 7.0), 16.0), 12.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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, 3e+18], N[(N[(beta + 1.0), $MachinePrecision] / N[(beta * N[(beta * N[(beta + 7.0), $MachinePrecision] + 16.0), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+18}:\\
\;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \beta + 7, 16\right), 12\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3e18Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
if 3e18 < beta Initial program 84.6%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6484.5
Simplified84.5%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6486.0
Applied egg-rr86.0%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3e+18) (/ (+ beta 1.0) (fma beta (* beta (+ beta 7.0)) 12.0)) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3e+18) {
tmp = (beta + 1.0) / fma(beta, (beta * (beta + 7.0)), 12.0);
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3e+18) tmp = Float64(Float64(beta + 1.0) / fma(beta, Float64(beta * Float64(beta + 7.0)), 12.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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, 3e+18], N[(N[(beta + 1.0), $MachinePrecision] / N[(beta * N[(beta * N[(beta + 7.0), $MachinePrecision]), $MachinePrecision] + 12.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3 \cdot 10^{+18}:\\
\;\;\;\;\frac{\beta + 1}{\mathsf{fma}\left(\beta, \beta \cdot \left(\beta + 7\right), 12\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3e18Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-+.f6467.2
Simplified67.2%
Taylor expanded in beta around inf
unpow2N/A
associate-*l*N/A
+-commutativeN/A
distribute-rgt-inN/A
associate-*l*N/A
lft-mult-inverseN/A
metadata-evalN/A
*-lft-identityN/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6466.6
Simplified66.6%
if 3e18 < beta Initial program 84.6%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6484.5
Simplified84.5%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6486.0
Applied egg-rr86.0%
Final simplification73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.0) (/ 0.25 (+ 1.0 (+ (+ beta alpha) 2.0))) (/ (/ (+ alpha 1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.0d0) then
tmp = 0.25d0 / (1.0d0 + ((beta + alpha) + 2.0d0))
else
tmp = ((alpha + 1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = ((alpha + 1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.0: tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0)) else: tmp = ((alpha + 1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.0) tmp = Float64(0.25 / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.0)
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
else
tmp = ((alpha + 1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.0], N[(0.25 / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7:\\
\;\;\;\;\frac{0.25}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6468.1
Simplified68.1%
Taylor expanded in beta around 0
Simplified67.7%
if 7 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
associate-/r*N/A
lower-/.f64N/A
lower-/.f6484.4
Applied egg-rr84.4%
Final simplification74.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.25 (+ 1.0 (+ (+ beta alpha) 2.0))) (/ (+ alpha 1.0) (* beta (+ beta (+ alpha 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = (alpha + 1.0) / (beta * (beta + (alpha + 3.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = 0.25d0 / (1.0d0 + ((beta + alpha) + 2.0d0))
else
tmp = (alpha + 1.0d0) / (beta * (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = (alpha + 1.0) / (beta * (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0)) else: tmp = (alpha + 1.0) / (beta * (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(0.25 / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); else tmp = Float64(Float64(alpha + 1.0) / Float64(beta * Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
else
tmp = (alpha + 1.0) / (beta * (beta + (alpha + 3.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(0.25 / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{0.25}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6468.1
Simplified68.1%
Taylor expanded in beta around 0
Simplified67.7%
if 4.5 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6484.6
Simplified84.6%
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
lift-+.f64N/A
lift-+.f64N/A
associate-/l/N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6484.1
lift-+.f64N/A
lift-+.f64N/A
lift-*.f64N/A
metadata-evalN/A
associate-+l+N/A
lift-+.f64N/A
metadata-evalN/A
+-commutativeN/A
associate-+l+N/A
lower-+.f64N/A
lower-+.f6484.1
Applied egg-rr84.1%
Final simplification73.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.0) (/ 0.25 (+ 1.0 (+ (+ beta alpha) 2.0))) (* (+ alpha 1.0) (/ 1.0 (* beta beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = (alpha + 1.0) * (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 <= 7.0d0) then
tmp = 0.25d0 / (1.0d0 + ((beta + alpha) + 2.0d0))
else
tmp = (alpha + 1.0d0) * (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 <= 7.0) {
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
} else {
tmp = (alpha + 1.0) * (1.0 / (beta * beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.0: tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0)) else: tmp = (alpha + 1.0) * (1.0 / (beta * beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.0) tmp = Float64(0.25 / Float64(1.0 + Float64(Float64(beta + alpha) + 2.0))); else tmp = Float64(Float64(alpha + 1.0) * 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 <= 7.0)
tmp = 0.25 / (1.0 + ((beta + alpha) + 2.0));
else
tmp = (alpha + 1.0) * (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, 7.0], N[(0.25 / N[(1.0 + N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7:\\
\;\;\;\;\frac{0.25}{1 + \left(\left(\beta + \alpha\right) + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 7Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6468.1
Simplified68.1%
Taylor expanded in beta around 0
Simplified67.7%
if 7 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
lift-*.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6483.0
Applied egg-rr83.0%
Final simplification73.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(fma
beta
(fma
beta
(fma beta 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(* (+ alpha 1.0) (/ 1.0 (* beta beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = (alpha + 1.0) * (1.0 / (beta * beta));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(Float64(alpha + 1.0) * Float64(1.0 / Float64(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, 2.2], N[(beta * N[(beta * N[(beta * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] * N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\alpha + 1\right) \cdot \frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.6
Simplified66.6%
if 2.2000000000000002 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
lift-+.f64N/A
lift-*.f64N/A
clear-numN/A
associate-/r/N/A
lower-*.f64N/A
lower-/.f6483.0
Applied egg-rr83.0%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(fma
beta
(fma
beta
(fma beta 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ (+ alpha 1.0) (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = (alpha + 1.0) / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(Float64(alpha + 1.0) / Float64(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, 2.2], N[(beta * N[(beta * N[(beta * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(N[(alpha + 1.0), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.6
Simplified66.6%
if 2.2000000000000002 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
Final simplification72.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.7)
(fma
beta
(fma
beta
(fma beta 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(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, 1.7], N[(beta * N[(beta * N[(beta * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], 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 1.7:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.6
Simplified66.6%
if 1.69999999999999996 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6484.6
Simplified84.6%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f6479.9
Simplified79.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1)
(fma
beta
(fma
beta
(fma beta 0.024691358024691357 -0.011574074074074073)
-0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = fma(beta, fma(beta, fma(beta, 0.024691358024691357, -0.011574074074074073), -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(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, 2.1], N[(beta * N[(beta * N[(beta * 0.024691358024691357 + -0.011574074074074073), $MachinePrecision] + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, 0.024691358024691357, -0.011574074074074073\right), -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
metadata-evalN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.6
Simplified66.6%
if 2.10000000000000009 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
Taylor expanded in alpha around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6479.9
Simplified79.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.65)
(fma
beta
(fma beta -0.011574074074074073 -0.027777777777777776)
0.08333333333333333)
(/ 1.0 (* beta beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.65) {
tmp = fma(beta, fma(beta, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.65) tmp = fma(beta, fma(beta, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / Float64(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, 1.65], N[(beta * N[(beta * -0.011574074074074073 + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.65:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 1.6499999999999999Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.5
Simplified66.5%
if 1.6499999999999999 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6483.0
Simplified83.0%
Taylor expanded in alpha around 0
lower-/.f64N/A
unpow2N/A
lower-*.f6479.9
Simplified79.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.7)
(fma
beta
(fma beta -0.011574074074074073 -0.027777777777777776)
0.08333333333333333)
(/ 1.0 beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.7) {
tmp = fma(beta, fma(beta, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.7) tmp = fma(beta, fma(beta, -0.011574074074074073, -0.027777777777777776), 0.08333333333333333); else tmp = Float64(1.0 / 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, 1.7], N[(beta * N[(beta * -0.011574074074074073 + -0.027777777777777776), $MachinePrecision] + 0.08333333333333333), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.7:\\
\;\;\;\;\mathsf{fma}\left(\beta, \mathsf{fma}\left(\beta, -0.011574074074074073, -0.027777777777777776\right), 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 1.69999999999999996Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
lower-fma.f64N/A
sub-negN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f6466.5
Simplified66.5%
if 1.69999999999999996 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6484.6
Simplified84.6%
Taylor expanded in alpha around inf
lower-/.f647.4
Simplified7.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (fma beta -0.027777777777777776 0.08333333333333333) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = fma(beta, -0.027777777777777776, 0.08333333333333333);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = fma(beta, -0.027777777777777776, 0.08333333333333333); else tmp = Float64(1.0 / 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, 2.9], N[(beta * -0.027777777777777776 + 0.08333333333333333), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\mathsf{fma}\left(\beta, -0.027777777777777776, 0.08333333333333333\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6466.8
Simplified66.8%
Taylor expanded in beta around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f6466.4
Simplified66.4%
if 2.89999999999999991 < beta Initial program 85.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6484.6
Simplified84.6%
Taylor expanded in alpha around inf
lower-/.f647.4
Simplified7.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.5%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
lower-*.f64N/A
unpow2N/A
lower-*.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6469.6
Simplified69.6%
Taylor expanded in beta around 0
Simplified43.0%
herbie shell --seed 2024208
(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)))