
(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 15 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
(/
1.0
(*
(*
(/ (+ beta (+ 2.0 alpha)) (+ 1.0 beta))
(/ (+ alpha (+ beta 3.0)) (+ 1.0 alpha)))
(+ alpha (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / ((((beta + (2.0 + alpha)) / (1.0 + beta)) * ((alpha + (beta + 3.0)) / (1.0 + alpha))) * (alpha + (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 = 1.0d0 / ((((beta + (2.0d0 + alpha)) / (1.0d0 + beta)) * ((alpha + (beta + 3.0d0)) / (1.0d0 + alpha))) * (alpha + (beta + 2.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / ((((beta + (2.0 + alpha)) / (1.0 + beta)) * ((alpha + (beta + 3.0)) / (1.0 + alpha))) * (alpha + (beta + 2.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / ((((beta + (2.0 + alpha)) / (1.0 + beta)) * ((alpha + (beta + 3.0)) / (1.0 + alpha))) * (alpha + (beta + 2.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(Float64(Float64(Float64(beta + Float64(2.0 + alpha)) / Float64(1.0 + beta)) * Float64(Float64(alpha + Float64(beta + 3.0)) / Float64(1.0 + alpha))) * Float64(alpha + Float64(beta + 2.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / ((((beta + (2.0 + alpha)) / (1.0 + beta)) * ((alpha + (beta + 3.0)) / (1.0 + alpha))) * (alpha + (beta + 2.0)));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(N[(N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\left(\frac{\beta + \left(2 + \alpha\right)}{1 + \beta} \cdot \frac{\alpha + \left(\beta + 3\right)}{1 + \alpha}\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}
\end{array}
Initial program 96.4%
associate-/l/95.4%
+-commutative95.4%
associate-+l+95.4%
*-commutative95.4%
metadata-eval95.4%
associate-+l+95.4%
metadata-eval95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
metadata-eval95.4%
metadata-eval95.4%
associate-+l+95.4%
Simplified95.4%
clear-num95.4%
inv-pow95.4%
*-commutative95.4%
associate-+r+95.4%
+-commutative95.4%
distribute-rgt1-in95.4%
fma-define95.4%
Applied egg-rr95.4%
unpow-195.4%
associate-/r/95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
times-frac99.3%
associate-+l+99.3%
+-commutative99.3%
Applied egg-rr99.3%
+-commutative99.3%
+-commutative99.3%
+-commutative99.3%
Simplified99.3%
Final simplification99.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 13.0)
(/
1.0
(*
(+ alpha (+ beta 2.0))
(* (+ 2.0 alpha) (/ (+ alpha 3.0) (+ 1.0 alpha)))))
(/
(* (+ 1.0 alpha) (/ (- 1.0 (/ (+ 3.0 (* 2.0 alpha)) beta)) beta))
(+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 13.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} else {
tmp = ((1.0 + alpha) * ((1.0 - ((3.0 + (2.0 * alpha)) / beta)) / 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 <= 13.0d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * ((2.0d0 + alpha) * ((alpha + 3.0d0) / (1.0d0 + alpha))))
else
tmp = ((1.0d0 + alpha) * ((1.0d0 - ((3.0d0 + (2.0d0 * alpha)) / beta)) / 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 <= 13.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} else {
tmp = ((1.0 + alpha) * ((1.0 - ((3.0 + (2.0 * alpha)) / beta)) / beta)) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 13.0: tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha)))) else: tmp = ((1.0 + alpha) * ((1.0 - ((3.0 + (2.0 * alpha)) / beta)) / beta)) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 13.0) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(2.0 + alpha) * Float64(Float64(alpha + 3.0) / Float64(1.0 + alpha))))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 - Float64(Float64(3.0 + Float64(2.0 * alpha)) / beta)) / 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 <= 13.0)
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
else
tmp = ((1.0 + alpha) * ((1.0 - ((3.0 + (2.0 * alpha)) / beta)) / 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, 13.0], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 - N[(N[(3.0 + N[(2.0 * alpha), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $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 13:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(2 + \alpha\right) \cdot \frac{\alpha + 3}{1 + \alpha}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1 - \frac{3 + 2 \cdot \alpha}{\beta}}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 13Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
if 13 < beta Initial program 89.5%
Simplified67.7%
*-un-lft-identity67.7%
associate-/l*76.0%
+-commutative76.0%
associate-+r+76.0%
associate-*r*76.0%
pow276.0%
associate-+r+76.0%
Applied egg-rr76.0%
*-lft-identity76.0%
+-commutative76.0%
associate-/r*93.2%
+-commutative93.2%
+-commutative93.2%
+-commutative93.2%
+-commutative93.2%
Simplified93.2%
associate-*r/95.4%
div-inv95.4%
+-commutative95.4%
associate-+r+95.4%
metadata-eval95.4%
pow-flip96.7%
metadata-eval96.7%
associate-+r+96.7%
+-commutative96.7%
associate-+l+96.7%
metadata-eval96.7%
+-commutative96.7%
Applied egg-rr96.7%
Taylor expanded in beta around inf 83.3%
mul-1-neg83.3%
Simplified83.3%
Final simplification92.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (+ 1.0 alpha) t_0) (/ (+ 1.0 beta) (* t_0 (+ alpha (+ beta 3.0)))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.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
real(8) :: t_0
t_0 = alpha + (beta + 2.0d0)
code = ((1.0d0 + alpha) / t_0) * ((1.0d0 + beta) / (t_0 * (alpha + (beta + 3.0d0))))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = ((1.0 + alpha) / t_0) * ((1.0 + beta) / (t_0 * (alpha + (beta + 3.0))));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{1 + \alpha}{t\_0} \cdot \frac{1 + \beta}{t\_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}
\end{array}
\end{array}
Initial program 96.4%
Simplified85.6%
times-frac98.1%
+-commutative98.1%
Applied egg-rr98.1%
Final simplification98.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 31.0)
(/
1.0
(*
(+ alpha (+ beta 2.0))
(* (+ 2.0 alpha) (/ (+ alpha 3.0) (+ 1.0 alpha)))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 31.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} 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 <= 31.0d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * ((2.0d0 + alpha) * ((alpha + 3.0d0) / (1.0d0 + alpha))))
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 <= 31.0) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} 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 <= 31.0: tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha)))) 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 <= 31.0) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(2.0 + alpha) * Float64(Float64(alpha + 3.0) / Float64(1.0 + alpha))))); 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 <= 31.0)
tmp = 1.0 / ((alpha + (beta + 2.0)) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
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, 31.0], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $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 31:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(2 + \alpha\right) \cdot \frac{\alpha + 3}{1 + \alpha}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 31Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
if 31 < beta Initial program 89.3%
Taylor expanded in beta around inf 84.6%
Taylor expanded in alpha around 0 84.6%
+-commutative84.6%
associate-+r+84.6%
+-commutative84.6%
+-commutative84.6%
+-commutative84.6%
Simplified84.6%
Final simplification93.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 1.0 (* (+ 2.0 alpha) (* (+ 2.0 alpha) (/ (+ alpha 3.0) (+ 1.0 alpha))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 1.0 / ((2.0 + alpha) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} 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 <= 4.5d0) then
tmp = 1.0d0 / ((2.0d0 + alpha) * ((2.0d0 + alpha) * ((alpha + 3.0d0) / (1.0d0 + alpha))))
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 <= 4.5) {
tmp = 1.0 / ((2.0 + alpha) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
} 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 <= 4.5: tmp = 1.0 / ((2.0 + alpha) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha)))) 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 <= 4.5) tmp = Float64(1.0 / Float64(Float64(2.0 + alpha) * Float64(Float64(2.0 + alpha) * Float64(Float64(alpha + 3.0) / Float64(1.0 + alpha))))); 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 <= 4.5)
tmp = 1.0 / ((2.0 + alpha) * ((2.0 + alpha) * ((alpha + 3.0) / (1.0 + alpha))));
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, 4.5], N[(1.0 / N[(N[(2.0 + alpha), $MachinePrecision] * N[(N[(2.0 + alpha), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] / N[(1.0 + alpha), $MachinePrecision]), $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 4.5:\\
\;\;\;\;\frac{1}{\left(2 + \alpha\right) \cdot \left(\left(2 + \alpha\right) \cdot \frac{\alpha + 3}{1 + \alpha}\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in beta around 0 97.3%
if 4.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
+-commutative83.6%
+-commutative83.6%
Simplified83.6%
Final simplification92.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.5) (/ 1.0 (* (+ 2.0 alpha) (+ 6.0 (* alpha (+ (* 2.0 alpha) -1.0))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.5) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 + (alpha * ((2.0 * alpha) + -1.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.5d0) then
tmp = 1.0d0 / ((2.0d0 + alpha) * (6.0d0 + (alpha * ((2.0d0 * alpha) + (-1.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.5) {
tmp = 1.0 / ((2.0 + alpha) * (6.0 + (alpha * ((2.0 * alpha) + -1.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.5: tmp = 1.0 / ((2.0 + alpha) * (6.0 + (alpha * ((2.0 * alpha) + -1.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.5) tmp = Float64(1.0 / Float64(Float64(2.0 + alpha) * Float64(6.0 + Float64(alpha * Float64(Float64(2.0 * alpha) + -1.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.5)
tmp = 1.0 / ((2.0 + alpha) * (6.0 + (alpha * ((2.0 * alpha) + -1.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.5], N[(1.0 / N[(N[(2.0 + alpha), $MachinePrecision] * N[(6.0 + N[(alpha * N[(N[(2.0 * alpha), $MachinePrecision] + -1.0), $MachinePrecision]), $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 3.5:\\
\;\;\;\;\frac{1}{\left(2 + \alpha\right) \cdot \left(6 + \alpha \cdot \left(2 \cdot \alpha + -1\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 3.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 78.0%
Taylor expanded in beta around 0 77.9%
if 3.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
+-commutative83.6%
+-commutative83.6%
Simplified83.6%
Final simplification79.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.5) (/ 1.0 (* (+ alpha (+ beta 2.0)) (- 6.0 alpha))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
} 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 <= 6.5d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * (6.0d0 - alpha))
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 <= 6.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
} 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 <= 6.5: tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha)) 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 <= 6.5) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 - alpha))); 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 <= 6.5)
tmp = 1.0 / ((alpha + (beta + 2.0)) * (6.0 - alpha));
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, 6.5], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 - alpha), $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 6.5:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 - \alpha\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 77.0%
mul-1-neg77.0%
Simplified77.0%
if 6.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
+-commutative83.6%
+-commutative83.6%
Simplified83.6%
Final simplification79.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5) (/ 1.0 (* (+ alpha (+ beta 2.0)) 6.0)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * 6.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 <= 5.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5: tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * 6.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 <= 5.5)
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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, 5.5], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * 6.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 5.5:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot 6}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 59.8%
if 5.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.6%
+-commutative83.6%
associate-+r+83.6%
+-commutative83.6%
+-commutative83.6%
+-commutative83.6%
Simplified83.6%
Final simplification67.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.5) (/ 1.0 (* (+ alpha (+ beta 2.0)) 6.0)) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * 6.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 <= 5.5) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5: tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.5) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * 6.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 <= 5.5)
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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, 5.5], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * 6.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 5.5:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot 6}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 59.8%
if 5.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 83.4%
+-commutative83.4%
Simplified83.4%
Final simplification67.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 1.0 (* (+ alpha (+ beta 2.0)) 6.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.2d0) then
tmp = 1.0d0 / ((alpha + (beta + 2.0d0)) * 6.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 <= 5.2) {
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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 <= 5.2) tmp = Float64(1.0 / Float64(Float64(alpha + Float64(beta + 2.0)) * 6.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = 1.0 / ((alpha + (beta + 2.0)) * 6.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, 5.2], N[(1.0 / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot 6}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 59.8%
if 5.20000000000000018 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 75.8%
associate-/r*77.0%
+-commutative77.0%
Simplified77.0%
Final simplification65.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.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 <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.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 <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 0.16666666666666666 / (beta + 2.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 <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.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, 5.2], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 58.6%
if 5.20000000000000018 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 75.8%
associate-/r*77.0%
+-commutative77.0%
Simplified77.0%
Final simplification64.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.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 <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.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 <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 0.16666666666666666 / (beta + 2.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 <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.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 <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.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, 5.2], N[(0.16666666666666666 / N[(beta + 2.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 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 58.6%
if 5.20000000000000018 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 75.8%
Final simplification64.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.5) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = 0.16666666666666666 / (beta + 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 <= 7.5d0) then
tmp = 0.16666666666666666d0 / (beta + 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 <= 7.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.5: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.5) tmp = Float64(0.16666666666666666 / Float64(beta + 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 <= 7.5)
tmp = 0.16666666666666666 / (beta + 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, 7.5], N[(0.16666666666666666 / N[(beta + 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 7.5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 7.5Initial program 99.8%
associate-/l/99.6%
+-commutative99.6%
associate-+l+99.6%
*-commutative99.6%
metadata-eval99.6%
associate-+l+99.6%
metadata-eval99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
metadata-eval99.6%
metadata-eval99.6%
associate-+l+99.6%
Simplified99.6%
clear-num99.6%
inv-pow99.6%
*-commutative99.6%
associate-+r+99.6%
+-commutative99.6%
distribute-rgt1-in99.6%
fma-define99.6%
Applied egg-rr99.6%
unpow-199.6%
associate-/r/99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
fma-undefine99.6%
+-commutative99.6%
*-commutative99.6%
+-commutative99.6%
associate-+r+99.6%
distribute-lft1-in99.6%
+-commutative99.6%
+-commutative99.6%
+-commutative99.6%
Simplified99.6%
Taylor expanded in beta around 0 97.4%
associate-/l*97.4%
Simplified97.4%
Taylor expanded in alpha around 0 58.6%
if 7.5 < beta Initial program 89.5%
Taylor expanded in beta around inf 83.6%
Taylor expanded in alpha around 0 75.8%
Taylor expanded in beta around inf 75.8%
Final simplification64.4%
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 96.4%
associate-/l/95.4%
+-commutative95.4%
associate-+l+95.4%
*-commutative95.4%
metadata-eval95.4%
associate-+l+95.4%
metadata-eval95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
metadata-eval95.4%
metadata-eval95.4%
associate-+l+95.4%
Simplified95.4%
clear-num95.4%
inv-pow95.4%
*-commutative95.4%
associate-+r+95.4%
+-commutative95.4%
distribute-rgt1-in95.4%
fma-define95.4%
Applied egg-rr95.4%
unpow-195.4%
associate-/r/95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
fma-undefine95.4%
+-commutative95.4%
*-commutative95.4%
+-commutative95.4%
associate-+r+95.4%
distribute-lft1-in95.4%
+-commutative95.4%
+-commutative95.4%
+-commutative95.4%
Simplified95.4%
Taylor expanded in beta around 0 71.0%
associate-/l*71.0%
Simplified71.0%
Taylor expanded in alpha around 0 41.1%
Final simplification41.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.3333333333333333 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.3333333333333333 / 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 = 0.3333333333333333d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.3333333333333333 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.3333333333333333 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.3333333333333333 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.3333333333333333 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.3333333333333333 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.3333333333333333}{\beta}
\end{array}
Initial program 96.4%
Taylor expanded in beta around inf 30.1%
Taylor expanded in alpha around 0 27.5%
Taylor expanded in beta around 0 4.3%
herbie shell --seed 2024155
(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)))