
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 14 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 1.3e+147)
(/
1.0
(*
t_0
(/ (+ 3.0 (+ beta alpha)) (/ (* (+ 1.0 beta) (+ 1.0 alpha)) t_0))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.3e+147) {
tmp = 1.0 / (t_0 * ((3.0 + (beta + alpha)) / (((1.0 + beta) * (1.0 + alpha)) / t_0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1.3d+147) then
tmp = 1.0d0 / (t_0 * ((3.0d0 + (beta + alpha)) / (((1.0d0 + beta) * (1.0d0 + alpha)) / t_0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1.3e+147) {
tmp = 1.0 / (t_0 * ((3.0 + (beta + alpha)) / (((1.0 + beta) * (1.0 + alpha)) / t_0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1.3e+147: tmp = 1.0 / (t_0 * ((3.0 + (beta + alpha)) / (((1.0 + beta) * (1.0 + alpha)) / t_0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1.3e+147) tmp = Float64(1.0 / Float64(t_0 * Float64(Float64(3.0 + Float64(beta + alpha)) / Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / t_0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1.3e+147)
tmp = 1.0 / (t_0 * ((3.0 + (beta + alpha)) / (((1.0 + beta) * (1.0 + alpha)) / t_0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1.3e+147], N[(1.0 / N[(t$95$0 * N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 1.3 \cdot 10^{+147}:\\
\;\;\;\;\frac{1}{t\_0 \cdot \frac{3 + \left(\beta + \alpha\right)}{\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_0}}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.2999999999999999e147Initial program 98.9%
associate-/l/97.6%
+-commutative97.6%
associate-+l+97.6%
*-commutative97.6%
metadata-eval97.6%
associate-+l+97.6%
metadata-eval97.6%
+-commutative97.6%
+-commutative97.6%
+-commutative97.6%
metadata-eval97.6%
metadata-eval97.6%
associate-+l+97.6%
Simplified97.6%
clear-num97.6%
inv-pow97.6%
*-commutative97.6%
associate-+r+97.6%
+-commutative97.6%
distribute-rgt1-in97.6%
fma-define97.6%
Applied egg-rr97.6%
unpow-197.6%
associate-/l*98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
associate-+r+98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
fma-undefine98.1%
+-commutative98.1%
*-commutative98.1%
+-commutative98.1%
associate-+r+98.1%
distribute-lft1-in98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 1.2999999999999999e147 < beta Initial program 69.5%
Taylor expanded in beta around inf 88.0%
div-inv88.0%
metadata-eval88.0%
associate-+l+88.0%
metadata-eval88.0%
associate-+r+88.0%
Applied egg-rr88.0%
associate-*r/88.0%
*-commutative88.0%
*-lft-identity88.0%
+-commutative88.0%
+-commutative88.0%
Simplified88.0%
Final simplification95.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ (+ beta 2.0) alpha)))
(if (<= beta 3e+21)
(/ (* (+ 1.0 beta) (+ 1.0 alpha)) (* t_1 (* t_1 t_0)))
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3e+21) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / 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 = alpha + (beta + 3.0d0)
t_1 = (beta + 2.0d0) + alpha
if (beta <= 3d+21) then
tmp = ((1.0d0 + beta) * (1.0d0 + alpha)) / (t_1 * (t_1 * t_0))
else
tmp = ((1.0d0 + alpha) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3e+21) {
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = (beta + 2.0) + alpha tmp = 0 if beta <= 3e+21: tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_1 * t_0)) else: tmp = ((1.0 + alpha) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 3e+21) tmp = Float64(Float64(Float64(1.0 + beta) * Float64(1.0 + alpha)) / Float64(t_1 * Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 3e+21)
tmp = ((1.0 + beta) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
else
tmp = ((1.0 + alpha) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 3e+21], N[(N[(N[(1.0 + beta), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $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 := \alpha + \left(\beta + 3\right)\\
t_1 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 3 \cdot 10^{+21}:\\
\;\;\;\;\frac{\left(1 + \beta\right) \cdot \left(1 + \alpha\right)}{t\_1 \cdot \left(t\_1 \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 3e21Initial program 99.9%
Simplified90.8%
if 3e21 < beta Initial program 77.9%
Taylor expanded in beta around inf 82.0%
div-inv81.8%
metadata-eval81.8%
associate-+l+81.8%
metadata-eval81.8%
associate-+r+81.8%
Applied egg-rr81.8%
associate-*r/82.0%
*-commutative82.0%
*-lft-identity82.0%
+-commutative82.0%
+-commutative82.0%
Simplified82.0%
Final simplification87.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(/
1.0
(*
(+ (+ beta 2.0) alpha)
(/
(+ 3.0 (+ beta alpha))
(/ 1.0 (/ (/ (+ 2.0 (+ beta alpha)) (+ 1.0 beta)) (+ 1.0 alpha)))))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((3.0 + (beta + alpha)) / (1.0 / (((2.0 + (beta + alpha)) / (1.0 + beta)) / (1.0 + alpha)))));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / (((beta + 2.0d0) + alpha) * ((3.0d0 + (beta + alpha)) / (1.0d0 / (((2.0d0 + (beta + alpha)) / (1.0d0 + beta)) / (1.0d0 + alpha)))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((3.0 + (beta + alpha)) / (1.0 / (((2.0 + (beta + alpha)) / (1.0 + beta)) / (1.0 + alpha)))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((beta + 2.0) + alpha) * ((3.0 + (beta + alpha)) / (1.0 / (((2.0 + (beta + alpha)) / (1.0 + beta)) / (1.0 + alpha)))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(3.0 + Float64(beta + alpha)) / Float64(1.0 / Float64(Float64(Float64(2.0 + Float64(beta + alpha)) / Float64(1.0 + beta)) / Float64(1.0 + alpha)))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((beta + 2.0) + alpha) * ((3.0 + (beta + alpha)) / (1.0 / (((2.0 + (beta + alpha)) / (1.0 + beta)) / (1.0 + alpha)))));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 / N[(N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \frac{3 + \left(\beta + \alpha\right)}{\frac{1}{\frac{\frac{2 + \left(\beta + \alpha\right)}{1 + \beta}}{1 + \alpha}}}}
\end{array}
Initial program 92.6%
associate-/l/90.4%
+-commutative90.4%
associate-+l+90.4%
*-commutative90.4%
metadata-eval90.4%
associate-+l+90.4%
metadata-eval90.4%
+-commutative90.4%
+-commutative90.4%
+-commutative90.4%
metadata-eval90.4%
metadata-eval90.4%
associate-+l+90.4%
Simplified90.4%
clear-num90.4%
inv-pow90.4%
*-commutative90.4%
associate-+r+90.4%
+-commutative90.4%
distribute-rgt1-in90.4%
fma-define90.4%
Applied egg-rr90.4%
unpow-190.4%
associate-/l*91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
fma-undefine91.6%
+-commutative91.6%
*-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
distribute-lft1-in91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
Simplified91.6%
clear-num91.6%
inv-pow91.6%
associate-+l+91.6%
Applied egg-rr91.6%
unpow-191.6%
associate-/r*98.9%
+-commutative98.9%
associate-+r+98.9%
+-commutative98.9%
+-commutative98.9%
Simplified98.9%
Final simplification98.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(/
1.0
(*
(+ (+ beta 2.0) alpha)
(/
(+ alpha (+ beta 3.0))
(* (+ 1.0 beta) (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))))))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (2.0 + (beta + alpha))))));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / (((beta + 2.0d0) + alpha) * ((alpha + (beta + 3.0d0)) / ((1.0d0 + beta) * ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (2.0 + (beta + alpha))))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (2.0 + (beta + alpha))))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(Float64(1.0 + beta) * Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (((beta + 2.0) + alpha) * ((alpha + (beta + 3.0)) / ((1.0 + beta) * ((1.0 + alpha) / (2.0 + (beta + alpha))))));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \frac{\alpha + \left(\beta + 3\right)}{\left(1 + \beta\right) \cdot \frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}}
\end{array}
Initial program 92.6%
associate-/l/90.4%
+-commutative90.4%
associate-+l+90.4%
*-commutative90.4%
metadata-eval90.4%
associate-+l+90.4%
metadata-eval90.4%
+-commutative90.4%
+-commutative90.4%
+-commutative90.4%
metadata-eval90.4%
metadata-eval90.4%
associate-+l+90.4%
Simplified90.4%
clear-num90.4%
inv-pow90.4%
*-commutative90.4%
associate-+r+90.4%
+-commutative90.4%
distribute-rgt1-in90.4%
fma-define90.4%
Applied egg-rr90.4%
unpow-190.4%
associate-/l*91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
fma-undefine91.6%
+-commutative91.6%
*-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
distribute-lft1-in91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
Simplified91.6%
*-un-lft-identity91.6%
+-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
associate-/l*98.9%
associate-+l+98.9%
Applied egg-rr98.9%
*-lft-identity98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
associate-+r+98.9%
Simplified98.9%
Final simplification98.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.2e+18) (/ (+ 1.0 beta) (* (+ (+ beta 2.0) alpha) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2e+18) {
tmp = (1.0 + beta) / (((beta + 2.0) + alpha) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.2d+18) then
tmp = (1.0d0 + beta) / (((beta + 2.0d0) + alpha) * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.2e+18) {
tmp = (1.0 + beta) / (((beta + 2.0) + alpha) * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.2e+18: tmp = (1.0 + beta) / (((beta + 2.0) + alpha) * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.2e+18) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.2e+18)
tmp = (1.0 + beta) / (((beta + 2.0) + alpha) * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.2e+18], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.2 \cdot 10^{+18}:\\
\;\;\;\;\frac{1 + \beta}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.2e18Initial program 99.9%
Simplified90.8%
Taylor expanded in alpha around 0 79.2%
Taylor expanded in alpha around 0 65.7%
+-commutative65.7%
+-commutative65.7%
Simplified65.7%
if 2.2e18 < beta Initial program 78.1%
Taylor expanded in beta around inf 81.1%
div-inv80.9%
metadata-eval80.9%
associate-+l+80.9%
metadata-eval80.9%
associate-+r+80.9%
Applied egg-rr80.9%
associate-*r/81.1%
*-commutative81.1%
*-lft-identity81.1%
+-commutative81.1%
+-commutative81.1%
Simplified81.1%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5e+34) (/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5e+34) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.5d+34) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5e+34) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.5e+34: tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0)) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.5e+34) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.5e+34)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((beta + 2.0) * (beta + 3.0));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.5e+34], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+34}:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.49999999999999998e34Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified99.0%
Taylor expanded in alpha around 0 80.9%
+-commutative80.9%
Simplified80.9%
Taylor expanded in alpha around 0 64.6%
if 3.49999999999999998e34 < beta Initial program 77.1%
Taylor expanded in beta around inf 82.5%
div-inv82.3%
metadata-eval82.3%
associate-+l+82.3%
metadata-eval82.3%
associate-+r+82.3%
Applied egg-rr82.3%
associate-*r/82.5%
*-commutative82.5%
*-lft-identity82.5%
+-commutative82.5%
+-commutative82.5%
Simplified82.5%
Final simplification70.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.05)
(/ 0.25 (+ alpha 3.0))
(if (<= beta 1.32e+154)
(/ 1.0 (* (+ beta 2.0) (+ beta 3.0)))
(/ (/ alpha beta) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05) {
tmp = 0.25 / (alpha + 3.0);
} else if (beta <= 1.32e+154) {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (alpha / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.05d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else if (beta <= 1.32d+154) then
tmp = 1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0))
else
tmp = (alpha / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.05) {
tmp = 0.25 / (alpha + 3.0);
} else if (beta <= 1.32e+154) {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
} else {
tmp = (alpha / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.05: tmp = 0.25 / (alpha + 3.0) elif beta <= 1.32e+154: tmp = 1.0 / ((beta + 2.0) * (beta + 3.0)) else: tmp = (alpha / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.05) tmp = Float64(0.25 / Float64(alpha + 3.0)); elseif (beta <= 1.32e+154) tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); else tmp = Float64(Float64(alpha / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.05)
tmp = 0.25 / (alpha + 3.0);
elseif (beta <= 1.32e+154)
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
else
tmp = (alpha / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.05], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.32e+154], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(alpha / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.05:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{elif}\;\beta \leq 1.32 \cdot 10^{+154}:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.05000000000000004Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 65.3%
if 1.05000000000000004 < beta < 1.31999999999999998e154Initial program 92.1%
associate-/l/88.9%
+-commutative88.9%
associate-+l+88.9%
*-commutative88.9%
metadata-eval88.9%
associate-+l+88.9%
metadata-eval88.9%
+-commutative88.9%
+-commutative88.9%
+-commutative88.9%
metadata-eval88.9%
metadata-eval88.9%
associate-+l+88.9%
Simplified88.9%
Taylor expanded in beta around -inf 82.9%
Taylor expanded in alpha around 0 58.6%
if 1.31999999999999998e154 < beta Initial program 69.7%
Taylor expanded in beta around inf 89.2%
div-inv89.2%
metadata-eval89.2%
associate-+l+89.2%
metadata-eval89.2%
associate-+r+89.2%
Applied egg-rr89.2%
associate-*r/89.2%
*-commutative89.2%
*-lft-identity89.2%
+-commutative89.2%
+-commutative89.2%
Simplified89.2%
Taylor expanded in alpha around inf 87.5%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.25 / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 65.3%
if 2.5 < beta Initial program 79.3%
Taylor expanded in beta around inf 79.2%
div-inv79.1%
metadata-eval79.1%
associate-+l+79.1%
metadata-eval79.1%
associate-+r+79.1%
Applied egg-rr79.1%
associate-*r/79.2%
*-commutative79.2%
*-lft-identity79.2%
+-commutative79.2%
+-commutative79.2%
Simplified79.2%
Final simplification70.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.9) (/ 0.25 (+ alpha 3.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.9d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.9) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.9: tmp = 0.25 / (alpha + 3.0) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.9) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.9)
tmp = 0.25 / (alpha + 3.0);
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.9], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.9:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.89999999999999991Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 65.3%
if 2.89999999999999991 < beta Initial program 79.3%
Taylor expanded in beta around inf 79.2%
Taylor expanded in alpha around 0 79.0%
+-commutative79.0%
Simplified79.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.2) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.2d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.2) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.2: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / ((beta + 2.0) * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.2) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.2)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / ((beta + 2.0) * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.2], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.2:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.19999999999999996Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 65.3%
if 1.19999999999999996 < beta Initial program 79.3%
associate-/l/74.6%
+-commutative74.6%
associate-+l+74.6%
*-commutative74.6%
metadata-eval74.6%
associate-+l+74.6%
metadata-eval74.6%
+-commutative74.6%
+-commutative74.6%
+-commutative74.6%
metadata-eval74.6%
metadata-eval74.6%
associate-+l+74.6%
Simplified74.6%
Taylor expanded in beta around -inf 85.6%
Taylor expanded in alpha around 0 75.2%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.25 (+ alpha 3.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.5d0) then
tmp = 0.25d0 / (alpha + 3.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.25 / (alpha + 3.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.5: tmp = 0.25 / (alpha + 3.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.5) tmp = Float64(0.25 / Float64(alpha + 3.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.25 / (alpha + 3.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.5], N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $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 2.5:\\
\;\;\;\;\frac{0.25}{\alpha + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 65.3%
if 2.5 < beta Initial program 79.3%
Taylor expanded in beta around inf 79.2%
Taylor expanded in alpha around 0 75.2%
Final simplification68.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
associate-/l/99.1%
+-commutative99.1%
associate-+l+99.1%
*-commutative99.1%
metadata-eval99.1%
associate-+l+99.1%
metadata-eval99.1%
+-commutative99.1%
+-commutative99.1%
+-commutative99.1%
metadata-eval99.1%
metadata-eval99.1%
associate-+l+99.1%
Simplified99.1%
Taylor expanded in alpha around 0 81.8%
+-commutative81.8%
Simplified81.8%
Taylor expanded in beta around 0 80.8%
associate-/r*80.8%
+-commutative80.8%
Simplified80.8%
Taylor expanded in alpha around 0 64.0%
if 2 < beta Initial program 79.3%
associate-/l/74.6%
+-commutative74.6%
associate-+l+74.6%
*-commutative74.6%
metadata-eval74.6%
associate-+l+74.6%
metadata-eval74.6%
+-commutative74.6%
+-commutative74.6%
+-commutative74.6%
metadata-eval74.6%
metadata-eval74.6%
associate-+l+74.6%
Simplified74.6%
clear-num74.6%
inv-pow74.6%
*-commutative74.6%
associate-+r+74.6%
+-commutative74.6%
distribute-rgt1-in74.6%
fma-define74.6%
Applied egg-rr74.6%
unpow-174.6%
associate-/l*78.0%
+-commutative78.0%
+-commutative78.0%
+-commutative78.0%
associate-+r+78.0%
+-commutative78.0%
+-commutative78.0%
+-commutative78.0%
fma-undefine78.0%
+-commutative78.0%
*-commutative78.0%
+-commutative78.0%
associate-+r+78.0%
distribute-lft1-in78.0%
+-commutative78.0%
+-commutative78.0%
+-commutative78.0%
+-commutative78.0%
Simplified78.0%
Taylor expanded in beta around 0 26.1%
+-commutative26.1%
+-commutative26.1%
Simplified26.1%
Taylor expanded in alpha around 0 6.8%
distribute-lft-in6.8%
metadata-eval6.8%
Simplified6.8%
Taylor expanded in beta around inf 6.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 92.6%
associate-/l/90.4%
+-commutative90.4%
associate-+l+90.4%
*-commutative90.4%
metadata-eval90.4%
associate-+l+90.4%
metadata-eval90.4%
+-commutative90.4%
+-commutative90.4%
+-commutative90.4%
metadata-eval90.4%
metadata-eval90.4%
associate-+l+90.4%
Simplified90.4%
clear-num90.4%
inv-pow90.4%
*-commutative90.4%
associate-+r+90.4%
+-commutative90.4%
distribute-rgt1-in90.4%
fma-define90.4%
Applied egg-rr90.4%
unpow-190.4%
associate-/l*91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
fma-undefine91.6%
+-commutative91.6%
*-commutative91.6%
+-commutative91.6%
associate-+r+91.6%
distribute-lft1-in91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
+-commutative91.6%
Simplified91.6%
Taylor expanded in beta around 0 72.1%
+-commutative72.1%
+-commutative72.1%
Simplified72.1%
Taylor expanded in alpha around 0 43.7%
Final simplification43.7%
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 92.6%
associate-/l/90.4%
+-commutative90.4%
associate-+l+90.4%
*-commutative90.4%
metadata-eval90.4%
associate-+l+90.4%
metadata-eval90.4%
+-commutative90.4%
+-commutative90.4%
+-commutative90.4%
metadata-eval90.4%
metadata-eval90.4%
associate-+l+90.4%
Simplified90.4%
Taylor expanded in alpha around 0 82.2%
+-commutative82.2%
Simplified82.2%
Taylor expanded in beta around 0 58.9%
associate-/r*58.9%
+-commutative58.9%
Simplified58.9%
Taylor expanded in alpha around 0 42.6%
herbie shell --seed 2024165
(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)))