
(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 (let* ((t_0 (+ alpha (+ beta 2.0)))) (* (/ (/ (+ alpha 1.0) t_0) (+ alpha (+ beta 3.0))) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_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 = (((alpha + 1.0d0) / t_0) / (alpha + (beta + 3.0d0))) * ((1.0d0 + beta) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((alpha + 1.0) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((alpha + 1.0) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) return Float64(Float64(Float64(Float64(alpha + 1.0) / t_0) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = (((alpha + 1.0) / t_0) / (alpha + (beta + 3.0))) * ((1.0 + beta) / t_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[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{\alpha + 1}{t_0}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \beta}{t_0}
\end{array}
\end{array}
Initial program 96.0%
associate-/l/94.6%
associate-/r*85.2%
+-commutative85.2%
associate-+r+85.2%
+-commutative85.2%
associate-+r+85.2%
associate-+r+85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
*-commutative85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
metadata-eval85.2%
associate-+l+85.2%
*-commutative85.2%
metadata-eval85.2%
associate-+l+85.2%
Simplified85.2%
*-commutative85.2%
frac-times96.4%
*-commutative96.4%
associate-+r+96.4%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Final simplification99.8%
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 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+153)
(* (/ (+ 1.0 beta) t_1) (/ (+ alpha 1.0) (* t_1 t_0)))
(* (/ (/ (+ alpha 1.0) t_1) t_0) (+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+153) {
tmp = ((1.0 + beta) / t_1) * ((alpha + 1.0) / (t_1 * t_0));
} else {
tmp = (((alpha + 1.0) / t_1) / t_0) * (1.0 + ((-1.0 - alpha) / 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) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 5d+153) then
tmp = ((1.0d0 + beta) / t_1) * ((alpha + 1.0d0) / (t_1 * t_0))
else
tmp = (((alpha + 1.0d0) / t_1) / t_0) * (1.0d0 + (((-1.0d0) - alpha) / beta))
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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+153) {
tmp = ((1.0 + beta) / t_1) * ((alpha + 1.0) / (t_1 * t_0));
} else {
tmp = (((alpha + 1.0) / t_1) / t_0) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+153: tmp = ((1.0 + beta) / t_1) * ((alpha + 1.0) / (t_1 * t_0)) else: tmp = (((alpha + 1.0) / t_1) / t_0) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+153) tmp = Float64(Float64(Float64(1.0 + beta) / t_1) * Float64(Float64(alpha + 1.0) / Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / t_1) / t_0) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 5e+153)
tmp = ((1.0 + beta) / t_1) * ((alpha + 1.0) / (t_1 * t_0));
else
tmp = (((alpha + 1.0) / t_1) / t_0) * (1.0 + ((-1.0 - alpha) / beta));
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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+153], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$1), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 5 \cdot 10^{+153}:\\
\;\;\;\;\frac{1 + \beta}{t_1} \cdot \frac{\alpha + 1}{t_1 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t_1}}{t_0} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 5.00000000000000018e153Initial program 99.8%
associate-/l/98.6%
associate-/r*87.3%
+-commutative87.3%
associate-+l+87.3%
associate-+r+87.3%
*-commutative87.3%
distribute-rgt1-in87.3%
+-commutative87.3%
*-commutative87.3%
distribute-rgt1-in87.3%
+-commutative87.3%
times-frac98.6%
Simplified98.6%
if 5.00000000000000018e153 < beta Initial program 77.6%
associate-/l/75.1%
associate-/r*75.1%
+-commutative75.1%
associate-+r+75.1%
+-commutative75.1%
associate-+r+75.1%
associate-+r+75.1%
distribute-rgt1-in75.1%
+-commutative75.1%
*-commutative75.1%
distribute-rgt1-in75.1%
+-commutative75.1%
metadata-eval75.1%
associate-+l+75.1%
*-commutative75.1%
metadata-eval75.1%
associate-+l+75.1%
Simplified75.1%
*-commutative75.1%
frac-times86.2%
*-commutative86.2%
associate-+r+86.2%
associate-/r*99.8%
associate-+r+99.8%
+-commutative99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 85.6%
mul-1-neg85.6%
Simplified85.6%
Final simplification96.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.95)
(/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ 3.0 (+ alpha beta))))
(*
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) (+ alpha (+ beta 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.95) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / 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 <= 3.95d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = (((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / (alpha + (beta + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.95) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.95: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta))) else: tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.95) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(alpha + Float64(beta + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.95)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
else
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * (1.0 + ((-1.0 - alpha) / 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, 3.95], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.95:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\alpha + \left(\beta + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.9500000000000002Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in beta around 0 97.9%
if 3.9500000000000002 < beta Initial program 87.9%
associate-/l/84.5%
associate-/r*69.1%
+-commutative69.1%
associate-+r+69.1%
+-commutative69.1%
associate-+r+69.1%
associate-+r+69.1%
distribute-rgt1-in69.1%
+-commutative69.1%
*-commutative69.1%
distribute-rgt1-in69.1%
+-commutative69.1%
metadata-eval69.1%
associate-+l+69.1%
*-commutative69.1%
metadata-eval69.1%
associate-+l+69.1%
Simplified69.1%
*-commutative69.1%
frac-times90.4%
*-commutative90.4%
associate-+r+90.4%
associate-/r*99.7%
associate-+r+99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 88.2%
mul-1-neg88.2%
Simplified88.2%
Final simplification94.8%
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 beta) t_0) t_0) (/ (+ alpha 1.0) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
return (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.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 + beta) / t_0) / t_0) * ((alpha + 1.0d0) / (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 + beta) / t_0) / t_0) * ((alpha + 1.0) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) return (((1.0 + beta) / t_0) / t_0) * ((alpha + 1.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(Float64(1.0 + beta) / t_0) / t_0) * Float64(Float64(alpha + 1.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 + beta) / t_0) / t_0) * ((alpha + 1.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[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\frac{\frac{1 + \beta}{t_0}}{t_0} \cdot \frac{\alpha + 1}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 96.0%
associate-/l/94.6%
associate-/r*85.2%
+-commutative85.2%
associate-+l+85.2%
associate-+r+85.2%
*-commutative85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
*-commutative85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
times-frac96.4%
Simplified96.4%
associate-*r/96.5%
+-commutative96.5%
Applied egg-rr96.5%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.3)
(/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) (+ 3.0 (+ alpha beta))))
(*
(/ (/ (+ alpha 1.0) (+ alpha (+ beta 2.0))) (+ alpha (+ beta 3.0)))
(/ (+ 1.0 beta) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * ((1.0 + beta) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.3d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (alpha + beta)))
else
tmp = (((alpha + 1.0d0) / (alpha + (beta + 2.0d0))) / (alpha + (beta + 3.0d0))) * ((1.0d0 + beta) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
} else {
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * ((1.0 + beta) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.3: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta))) else: tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * ((1.0 + beta) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.3) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(beta + 2.0))) / Float64(alpha + Float64(beta + 3.0))) * Float64(Float64(1.0 + beta) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.3)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (alpha + beta)));
else
tmp = (((alpha + 1.0) / (alpha + (beta + 2.0))) / (alpha + (beta + 3.0))) * ((1.0 + beta) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.3], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.3:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(\beta + 2\right)}}{\alpha + \left(\beta + 3\right)} \cdot \frac{1 + \beta}{\beta}\\
\end{array}
\end{array}
if beta < 4.29999999999999982Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in beta around 0 97.9%
if 4.29999999999999982 < beta Initial program 87.9%
associate-/l/84.5%
associate-/r*69.1%
+-commutative69.1%
associate-+r+69.1%
+-commutative69.1%
associate-+r+69.1%
associate-+r+69.1%
distribute-rgt1-in69.1%
+-commutative69.1%
*-commutative69.1%
distribute-rgt1-in69.1%
+-commutative69.1%
metadata-eval69.1%
associate-+l+69.1%
*-commutative69.1%
metadata-eval69.1%
associate-+l+69.1%
Simplified69.1%
*-commutative69.1%
frac-times90.4%
*-commutative90.4%
associate-+r+90.4%
associate-/r*99.7%
associate-+r+99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 88.0%
Final simplification94.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 3.0 (+ alpha beta))))
(if (<= beta 33.0)
(/ (/ (+ alpha 1.0) (+ alpha 2.0)) (* (+ alpha 2.0) t_0))
(/ (/ (+ alpha 1.0) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 33.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * t_0);
} else {
tmp = ((alpha + 1.0) / 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) :: tmp
t_0 = 3.0d0 + (alpha + beta)
if (beta <= 33.0d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * t_0)
else
tmp = ((alpha + 1.0d0) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 3.0 + (alpha + beta);
double tmp;
if (beta <= 33.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * t_0);
} else {
tmp = ((alpha + 1.0) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 3.0 + (alpha + beta) tmp = 0 if beta <= 33.0: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * t_0) else: tmp = ((alpha + 1.0) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(3.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 33.0) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 3.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 33.0)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + 2.0) * t_0);
else
tmp = ((alpha + 1.0) / 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[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 33.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 3 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 33:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + 2\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 33Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in beta around 0 97.9%
if 33 < beta Initial program 87.9%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Final simplification94.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8e+50) (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0)))) (/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8e+50) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + 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 <= 8d+50) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8e+50) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8e+50: tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8e+50) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8e+50)
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + 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, 8e+50], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8 \cdot 10^{+50}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 8.0000000000000006e50Initial program 99.9%
associate-/l/98.9%
associate-+l+98.9%
*-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
associate-+r+98.9%
+-commutative98.9%
flip-+98.9%
pow298.9%
metadata-eval98.9%
Applied egg-rr98.9%
Taylor expanded in alpha around inf 99.0%
Taylor expanded in alpha around 0 62.8%
+-commutative62.8%
*-commutative62.8%
associate--l+62.8%
*-commutative62.8%
*-rgt-identity62.8%
distribute-lft-out--62.8%
metadata-eval62.8%
*-rgt-identity62.8%
+-commutative62.8%
Simplified62.8%
if 8.0000000000000006e50 < beta Initial program 85.9%
Taylor expanded in beta around inf 88.4%
Taylor expanded in alpha around 0 88.4%
+-commutative88.4%
Simplified88.4%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (/ 0.5 (+ beta 2.0)) (+ beta 3.0)) (/ (/ (+ alpha 1.0) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = (0.5d0 / (beta + 2.0d0)) / (beta + 3.0d0)
else
tmp = ((alpha + 1.0d0) / beta) / (3.0d0 + (alpha + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = (0.5 / (beta + 2.0)) / (beta + 3.0) else: tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(0.5 / Float64(beta + 2.0)) / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(3.0 + Float64(alpha + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
else
tmp = ((alpha + 1.0) / beta) / (3.0 + (alpha + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{0.5}{\beta + 2}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in alpha around 0 59.9%
associate-/r*59.9%
+-commutative59.9%
Simplified59.9%
if 4.5 < beta Initial program 87.9%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.7%
+-commutative87.7%
Simplified87.7%
Final simplification68.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ 0.5 (* (+ beta 3.0) (+ beta 2.0))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (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 <= 4.5d0) then
tmp = 0.5d0 / ((beta + 3.0d0) * (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 <= 4.5) {
tmp = 0.5 / ((beta + 3.0) * (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 <= 4.5: tmp = 0.5 / ((beta + 3.0) * (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 <= 4.5) tmp = Float64(0.5 / Float64(Float64(beta + 3.0) * 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 <= 4.5)
tmp = 0.5 / ((beta + 3.0) * (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, 4.5], N[(0.5 / N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $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 4.5:\\
\;\;\;\;\frac{0.5}{\left(\beta + 3\right) \cdot \left(\beta + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in alpha around 0 59.9%
if 4.5 < beta Initial program 87.9%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 81.4%
associate-/r*81.4%
+-commutative81.4%
Simplified81.4%
Final simplification66.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.7) (/ (/ 0.5 (+ beta 2.0)) (+ beta 3.0)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.7) {
tmp = (0.5 / (beta + 2.0)) / (beta + 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 <= 4.7d0) then
tmp = (0.5d0 / (beta + 2.0d0)) / (beta + 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 <= 4.7) {
tmp = (0.5 / (beta + 2.0)) / (beta + 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 <= 4.7: tmp = (0.5 / (beta + 2.0)) / (beta + 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 <= 4.7) tmp = Float64(Float64(0.5 / Float64(beta + 2.0)) / Float64(beta + 3.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 <= 4.7)
tmp = (0.5 / (beta + 2.0)) / (beta + 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, 4.7], N[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.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 4.7:\\
\;\;\;\;\frac{\frac{0.5}{\beta + 2}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.70000000000000018Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in alpha around 0 59.9%
associate-/r*59.9%
+-commutative59.9%
Simplified59.9%
if 4.70000000000000018 < beta Initial program 87.9%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 81.4%
associate-/r*81.4%
+-commutative81.4%
Simplified81.4%
Final simplification66.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.5) (/ (/ 0.5 (+ beta 2.0)) (+ beta 3.0)) (/ (/ (+ alpha 1.0) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.5d0) then
tmp = (0.5d0 / (beta + 2.0d0)) / (beta + 3.0d0)
else
tmp = ((alpha + 1.0d0) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.5) {
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
} else {
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.5: tmp = (0.5 / (beta + 2.0)) / (beta + 3.0) else: tmp = ((alpha + 1.0) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(0.5 / Float64(beta + 2.0)) / Float64(beta + 3.0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.5)
tmp = (0.5 / (beta + 2.0)) / (beta + 3.0);
else
tmp = ((alpha + 1.0) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.5], N[(N[(0.5 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{\frac{0.5}{\beta + 2}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.9%
associate-/l/99.4%
associate-+l+99.4%
*-commutative99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
associate-+l+99.4%
metadata-eval99.4%
+-commutative99.4%
metadata-eval99.4%
associate-+l+99.4%
Simplified99.4%
Taylor expanded in beta around 0 97.2%
Taylor expanded in alpha around 0 59.9%
associate-/r*59.9%
+-commutative59.9%
Simplified59.9%
if 4.5 < beta Initial program 87.9%
Taylor expanded in beta around inf 87.7%
Taylor expanded in alpha around 0 87.6%
+-commutative87.6%
Simplified87.6%
Final simplification68.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 (* beta (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / (beta * (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
code = 1.0d0 / (beta * (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / (beta * (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / (beta * (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / Float64(beta * Float64(beta + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / (beta * (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta \cdot \left(\beta + 3\right)}
\end{array}
Initial program 96.0%
Taylor expanded in beta around inf 30.4%
Taylor expanded in alpha around 0 28.4%
Final simplification28.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ (/ 1.0 beta) (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return (1.0 / beta) / (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
code = (1.0d0 / beta) / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return (1.0 / beta) / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return (1.0 / beta) / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(Float64(1.0 / beta) / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = (1.0 / beta) / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{\frac{1}{\beta}}{\beta + 3}
\end{array}
Initial program 96.0%
Taylor expanded in beta around inf 30.4%
Taylor expanded in alpha around 0 28.4%
associate-/r*28.4%
+-commutative28.4%
Simplified28.4%
Final simplification28.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ -1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return -1.0 / 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 = (-1.0d0) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return -1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return -1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(-1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = -1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(-1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{-1}{\beta}
\end{array}
Initial program 96.0%
associate-/l/94.6%
associate-/r*85.2%
+-commutative85.2%
associate-+l+85.2%
associate-+r+85.2%
*-commutative85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
*-commutative85.2%
distribute-rgt1-in85.2%
+-commutative85.2%
times-frac96.4%
Simplified96.4%
Taylor expanded in alpha around inf 31.1%
Taylor expanded in beta around inf 2.6%
associate-*r/2.6%
distribute-lft-in2.6%
metadata-eval2.6%
mul-1-neg2.6%
unsub-neg2.6%
Simplified2.6%
Taylor expanded in alpha around inf 3.6%
Final simplification3.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / 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 = 1.0d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta}
\end{array}
Initial program 96.0%
Taylor expanded in beta around inf 30.4%
Taylor expanded in alpha around inf 4.3%
Final simplification4.3%
herbie shell --seed 2023307
(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)))