
(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 16 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 13000000000000.0)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(*
(fma (+ (+ alpha beta) 3.0) (+ alpha beta) (fma (+ alpha beta) 2.0 6.0))
t_0))
(/
(/
(-
(+ (+ 1.0 alpha) (+ (/ alpha beta) (pow beta -1.0)))
(* (+ 1.0 alpha) (/ (fma 2.0 alpha 5.0) beta)))
beta)
t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 13000000000000.0) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (fma(((alpha + beta) + 3.0), (alpha + beta), fma((alpha + beta), 2.0, 6.0)) * t_0);
} else {
tmp = ((((1.0 + alpha) + ((alpha / beta) + pow(beta, -1.0))) - ((1.0 + alpha) * (fma(2.0, alpha, 5.0) / beta))) / beta) / 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 <= 13000000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(fma(Float64(Float64(alpha + beta) + 3.0), Float64(alpha + beta), fma(Float64(alpha + beta), 2.0, 6.0)) * t_0)); else tmp = Float64(Float64(Float64(Float64(Float64(1.0 + alpha) + Float64(Float64(alpha / beta) + (beta ^ -1.0))) - Float64(Float64(1.0 + alpha) * Float64(fma(2.0, alpha, 5.0) / beta))) / beta) / 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, 13000000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(alpha + beta), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 2.0 + 6.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] + N[(N[(alpha / beta), $MachinePrecision] + N[Power[beta, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(2.0 * alpha + 5.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 13000000000000:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\mathsf{fma}\left(\left(\alpha + \beta\right) + 3, \alpha + \beta, \mathsf{fma}\left(\alpha + \beta, 2, 6\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(\left(1 + \alpha\right) + \left(\frac{\alpha}{\beta} + {\beta}^{-1}\right)\right) - \left(1 + \alpha\right) \cdot \frac{\mathsf{fma}\left(2, \alpha, 5\right)}{\beta}}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.3e13Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites94.9%
Taylor expanded in beta around 0
associate-+r+N/A
distribute-rgt1-inN/A
+-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6494.9
Applied rewrites94.9%
lift-*.f64N/A
lift-+.f64N/A
distribute-lft-inN/A
lower-fma.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
lower-fma.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
metadata-eval94.9
Applied rewrites94.9%
if 1.3e13 < beta Initial program 80.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-/.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-fma.f6482.1
Applied rewrites82.1%
Final simplification90.7%
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 1.52e+16)
(/
(* (+ 1.0 beta) (+ 1.0 alpha))
(*
(fma (+ (+ alpha beta) 3.0) (+ alpha beta) (fma (+ alpha beta) 2.0 6.0))
t_0))
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 1.52e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (fma(((alpha + beta) + 3.0), (alpha + beta), fma((alpha + beta), 2.0, 6.0)) * t_0);
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / 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 <= 1.52e+16) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(fma(Float64(Float64(alpha + beta) + 3.0), Float64(alpha + beta), fma(Float64(alpha + beta), 2.0, 6.0)) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / 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, 1.52e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision] * N[(alpha + beta), $MachinePrecision] + N[(N[(alpha + beta), $MachinePrecision] * 2.0 + 6.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 1.52 \cdot 10^{+16}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\mathsf{fma}\left(\left(\alpha + \beta\right) + 3, \alpha + \beta, \mathsf{fma}\left(\alpha + \beta, 2, 6\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.52e16Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites94.9%
Taylor expanded in beta around 0
associate-+r+N/A
distribute-rgt1-inN/A
+-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6494.9
Applied rewrites94.9%
lift-*.f64N/A
lift-+.f64N/A
distribute-lft-inN/A
lower-fma.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
*-commutativeN/A
lift-+.f64N/A
+-commutativeN/A
distribute-lft-inN/A
*-commutativeN/A
lower-fma.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
metadata-eval94.9
Applied rewrites94.9%
if 1.52e16 < beta Initial program 80.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6483.0
Applied rewrites83.0%
Final simplification91.0%
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)) (t_1 (+ 3.0 (+ beta alpha))))
(if (<= beta 1.52e+16)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* (* t_1 t_0) t_0))
(/ (/ (+ 1.0 alpha) t_1) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 1.52e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((t_1 * t_0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_1) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (beta + alpha) + 2.0d0
t_1 = 3.0d0 + (beta + alpha)
if (beta <= 1.52d+16) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / ((t_1 * t_0) * t_0)
else
tmp = ((1.0d0 + alpha) / t_1) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double t_1 = 3.0 + (beta + alpha);
double tmp;
if (beta <= 1.52e+16) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((t_1 * t_0) * t_0);
} else {
tmp = ((1.0 + alpha) / t_1) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + alpha) + 2.0 t_1 = 3.0 + (beta + alpha) tmp = 0 if beta <= 1.52e+16: tmp = ((1.0 + beta) * (1.0 + alpha)) / ((t_1 * t_0) * t_0) else: tmp = ((1.0 + alpha) / t_1) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + alpha) + 2.0) t_1 = Float64(3.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 1.52e+16) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(Float64(t_1 * t_0) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + alpha) + 2.0;
t_1 = 3.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 1.52e+16)
tmp = ((1.0 + beta) * (1.0 + alpha)) / ((t_1 * t_0) * t_0);
else
tmp = ((1.0 + alpha) / t_1) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]}, Block[{t$95$1 = N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.52e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(t$95$1 * t$95$0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
t_1 := 3 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 1.52 \cdot 10^{+16}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{\left(t\_1 \cdot t\_0\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_1}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.52e16Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
lift-/.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites94.9%
Taylor expanded in beta around 0
associate-+r+N/A
distribute-rgt1-inN/A
+-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6494.9
Applied rewrites94.9%
if 1.52e16 < beta Initial program 80.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.8%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6483.0
Applied rewrites83.0%
Final simplification91.0%
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 4.6e+16)
(/ (/ (+ 1.0 beta) (fma (+ 5.0 beta) beta 6.0)) t_0)
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 4.6e+16) {
tmp = ((1.0 + beta) / fma((5.0 + beta), beta, 6.0)) / t_0;
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / 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 <= 4.6e+16) tmp = Float64(Float64(Float64(1.0 + beta) / fma(Float64(5.0 + beta), beta, 6.0)) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / 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, 4.6e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(5.0 + beta), $MachinePrecision] * beta + 6.0), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 4.6 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\mathsf{fma}\left(5 + \beta, \beta, 6\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 4.6e16Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6468.1
Applied rewrites68.1%
Taylor expanded in beta around 0
Applied rewrites68.1%
if 4.6e16 < beta Initial program 80.6%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites80.6%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6482.8
Applied rewrites82.8%
Final simplification72.8%
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 1.5)
(/
(fma
(fma
(fma 0.03780864197530864 beta -0.05092592592592592)
beta
0.027777777777777776)
beta
0.16666666666666666)
t_0)
(/ (/ (+ 1.0 alpha) (+ 3.0 (+ beta alpha))) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 1.5) {
tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
} else {
tmp = ((1.0 + alpha) / (3.0 + (beta + alpha))) / 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 <= 1.5) tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(3.0 + Float64(beta + alpha))) / 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, 1.5], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 1.5:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{3 + \left(\beta + \alpha\right)}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.5Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.2%
if 1.5 < beta Initial program 81.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.0%
Taylor expanded in beta around -inf
mul-1-negN/A
lower-neg.f64N/A
sub-negN/A
mul-1-negN/A
distribute-neg-inN/A
+-commutativeN/A
distribute-neg-inN/A
metadata-evalN/A
unsub-negN/A
lower--.f6482.5
Applied rewrites82.5%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.2)
(/
(fma
(fma
(fma 0.03780864197530864 beta -0.05092592592592592)
beta
0.027777777777777776)
beta
0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (+ 1.0 alpha) beta) (+ (+ (+ alpha beta) 2.0) 1.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2) {
tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (((alpha + beta) + 2.0) + 1.0);
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2) tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(Float64(alpha + beta) + 2.0) + 1.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, 2.2], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\left(\left(\alpha + \beta\right) + 2\right) + 1}\\
\end{array}
\end{array}
if beta < 2.2000000000000002Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.2%
if 2.2000000000000002 < beta Initial program 81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6481.8
Applied rewrites81.8%
Final simplification72.0%
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.3)
(/
(fma
(fma
(fma 0.03780864197530864 beta -0.05092592592592592)
beta
0.027777777777777776)
beta
0.16666666666666666)
t_0)
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 2.3) {
tmp = fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
} else {
tmp = ((1.0 + alpha) / beta) / 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 <= 2.3) tmp = Float64(fma(fma(fma(0.03780864197530864, beta, -0.05092592592592592), beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / 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, 2.3], N[(N[(N[(N[(0.03780864197530864 * beta + -0.05092592592592592), $MachinePrecision] * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $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.3:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.03780864197530864, \beta, -0.05092592592592592\right), \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.2%
if 2.2999999999999998 < beta Initial program 81.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6481.8
Applied rewrites81.8%
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 1.9)
(/
(fma
(fma -0.05092592592592592 beta 0.027777777777777776)
beta
0.16666666666666666)
t_0)
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + alpha) + 2.0;
double tmp;
if (beta <= 1.9) {
tmp = fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0;
} else {
tmp = ((1.0 + alpha) / beta) / 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 <= 1.9) tmp = Float64(fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / 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, 1.9], N[(N[(N[(-0.05092592592592592 * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + \alpha\right) + 2\\
\mathbf{if}\;\beta \leq 1.9:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.1%
if 1.8999999999999999 < beta Initial program 81.0%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f6481.8
Applied rewrites81.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.1)
(/
(fma
(fma -0.05092592592592592 beta 0.027777777777777776)
beta
0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / ((beta + alpha) + 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 <= 2.1) tmp = Float64(fma(fma(-0.05092592592592592, beta, 0.027777777777777776), beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 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, 2.1], N[(N[(N[(-0.05092592592592592 * beta + 0.027777777777777776), $MachinePrecision] * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;\frac{\mathsf{fma}\left(\mathsf{fma}\left(-0.05092592592592592, \beta, 0.027777777777777776\right), \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites67.1%
if 2.10000000000000009 < beta Initial program 81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6481.8
Applied rewrites81.8%
Applied rewrites81.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.2)
(/
(fma 0.027777777777777776 beta 0.16666666666666666)
(+ (+ beta alpha) 2.0))
(if (<= beta 1.5e+151)
(/ (+ 1.0 alpha) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 2.0);
} else if (beta <= 1.5e+151) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 2.0)); elseif (beta <= 1.5e+151) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(Float64(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, 5.2], N[(N[(0.027777777777777776 * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.5e+151], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{elif}\;\beta \leq 1.5 \cdot 10^{+151}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites66.8%
if 5.20000000000000018 < beta < 1.5e151Initial program 85.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6471.1
Applied rewrites71.1%
if 1.5e151 < beta Initial program 77.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6489.8
Applied rewrites89.8%
Taylor expanded in alpha around inf
Applied rewrites89.8%
Applied rewrites89.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 8.0)
(/ 0.16666666666666666 (+ (+ beta alpha) 2.0))
(if (<= beta 1.5e+151)
(/ (+ 1.0 alpha) (* beta beta))
(/ (/ alpha beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 1.5e+151) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (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 <= 8.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
else if (beta <= 1.5d+151) then
tmp = (1.0d0 + alpha) / (beta * beta)
else
tmp = (alpha / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else if (beta <= 1.5e+151) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = (alpha / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) elif beta <= 1.5e+151: tmp = (1.0 + alpha) / (beta * beta) else: tmp = (alpha / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); elseif (beta <= 1.5e+151) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(Float64(alpha / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
elseif (beta <= 1.5e+151)
tmp = (1.0 + alpha) / (beta * beta);
else
tmp = (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, 8.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.5e+151], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / beta), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{elif}\;\beta \leq 1.5 \cdot 10^{+151}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites66.3%
if 8 < beta < 1.5e151Initial program 85.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6471.1
Applied rewrites71.1%
if 1.5e151 < beta Initial program 77.4%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6489.8
Applied rewrites89.8%
Taylor expanded in alpha around inf
Applied rewrites89.8%
Applied rewrites89.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.2)
(/
(fma 0.027777777777777776 beta 0.16666666666666666)
(+ (+ beta alpha) 2.0))
(/ (/ (+ 1.0 alpha) beta) beta)))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = fma(0.027777777777777776, beta, 0.16666666666666666) / ((beta + alpha) + 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 <= 5.2) tmp = Float64(fma(0.027777777777777776, beta, 0.16666666666666666) / Float64(Float64(beta + alpha) + 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, 5.2], N[(N[(0.027777777777777776 * beta + 0.16666666666666666), $MachinePrecision] / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{\mathsf{fma}\left(0.027777777777777776, \beta, 0.16666666666666666\right)}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites66.8%
if 5.20000000000000018 < beta Initial program 81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6481.8
Applied rewrites81.8%
Applied rewrites81.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (/ 0.16666666666666666 (+ (+ beta alpha) 2.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 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 <= 8.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 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 <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 / ((beta + alpha) + 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 <= 8.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 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 <= 8.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 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, 8.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $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 8:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites66.3%
if 8 < beta Initial program 81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6481.8
Applied rewrites81.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.0) (/ 0.16666666666666666 (+ (+ beta alpha) 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} 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 <= 8.0d0) then
tmp = 0.16666666666666666d0 / ((beta + alpha) + 2.0d0)
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 <= 8.0) {
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.0: tmp = 0.16666666666666666 / ((beta + alpha) + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.0) tmp = Float64(0.16666666666666666 / Float64(Float64(beta + alpha) + 2.0)); 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 <= 8.0)
tmp = 0.16666666666666666 / ((beta + alpha) + 2.0);
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, 8.0], N[(0.16666666666666666 / N[(N[(beta + alpha), $MachinePrecision] + 2.0), $MachinePrecision]), $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 8:\\
\;\;\;\;\frac{0.16666666666666666}{\left(\beta + \alpha\right) + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 8Initial program 99.8%
lift-/.f64N/A
lift-/.f64N/A
associate-/l/N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites99.9%
Taylor expanded in alpha around 0
lower-/.f64N/A
lower-+.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-+.f64N/A
lower-+.f6467.7
Applied rewrites67.7%
Taylor expanded in beta around 0
Applied rewrites66.3%
if 8 < beta Initial program 81.0%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6481.8
Applied rewrites81.8%
Taylor expanded in alpha around 0
Applied rewrites78.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= alpha 0.49) (/ 1.0 (* beta beta)) (/ alpha (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (alpha <= 0.49) {
tmp = 1.0 / (beta * beta);
} else {
tmp = 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 (alpha <= 0.49d0) then
tmp = 1.0d0 / (beta * beta)
else
tmp = alpha / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (alpha <= 0.49) {
tmp = 1.0 / (beta * beta);
} else {
tmp = alpha / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if alpha <= 0.49: tmp = 1.0 / (beta * beta) else: tmp = alpha / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (alpha <= 0.49) tmp = Float64(1.0 / Float64(beta * beta)); else tmp = Float64(alpha / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (alpha <= 0.49)
tmp = 1.0 / (beta * beta);
else
tmp = 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[alpha, 0.49], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\alpha \leq 0.49:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if alpha < 0.48999999999999999Initial program 99.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6435.9
Applied rewrites35.9%
Taylor expanded in alpha around 0
Applied rewrites35.6%
if 0.48999999999999999 < alpha Initial program 80.8%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6415.5
Applied rewrites15.5%
Taylor expanded in alpha around inf
Applied rewrites15.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ alpha (* beta beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
return alpha / (beta * beta);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = alpha / (beta * beta)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return alpha / (beta * beta);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return alpha / (beta * beta)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(alpha / Float64(beta * beta)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = alpha / (beta * beta);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(alpha / N[(beta * beta), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\alpha}{\beta \cdot \beta}
\end{array}
Initial program 93.7%
Taylor expanded in beta around inf
lower-/.f64N/A
lower-+.f64N/A
unpow2N/A
lower-*.f6429.3
Applied rewrites29.3%
Taylor expanded in alpha around inf
Applied rewrites20.2%
herbie shell --seed 2024313
(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)))