
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 5.8e+152)
(* (/ (+ 1.0 beta) t_0) (/ (+ alpha 1.0) (* t_0 (+ (+ alpha beta) 3.0))))
(* (/ (+ alpha 1.0) t_0) (/ (- 1.0 (* 2.0 (/ alpha beta))) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.8e+152) {
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 5.8d+152) then
tmp = ((1.0d0 + beta) / t_0) * ((alpha + 1.0d0) / (t_0 * ((alpha + beta) + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 - (2.0d0 * (alpha / beta))) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.8e+152) {
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 5.8e+152: tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * ((alpha + beta) + 3.0))) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 5.8e+152) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(alpha + 1.0) / Float64(t_0 * Float64(Float64(alpha + beta) + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 - Float64(2.0 * Float64(alpha / beta))) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 5.8e+152)
tmp = ((1.0 + beta) / t_0) * ((alpha + 1.0) / (t_0 * ((alpha + beta) + 3.0)));
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.8e+152], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(alpha + 1.0), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 5.8 \cdot 10^{+152}:\\
\;\;\;\;\frac{1 + \beta}{t\_0} \cdot \frac{\alpha + 1}{t\_0 \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - 2 \cdot \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.7999999999999997e152Initial program 98.0%
associate-/l/97.1%
+-commutative97.1%
+-commutative97.1%
associate-+r+97.1%
associate-+r+97.1%
associate-+r+97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
*-commutative97.1%
distribute-rgt1-in97.1%
+-commutative97.1%
metadata-eval97.1%
associate-+l+97.1%
Simplified97.1%
associate-+r+97.2%
metadata-eval97.2%
associate-/l/85.1%
times-frac99.0%
associate-+r+99.0%
+-commutative99.0%
associate-+r+99.0%
+-commutative99.0%
metadata-eval99.0%
+-commutative99.0%
Applied egg-rr99.0%
if 5.7999999999999997e152 < beta Initial program 71.1%
associate-/l/64.4%
+-commutative64.4%
+-commutative64.4%
associate-+r+64.4%
associate-+r+64.4%
associate-+r+64.4%
distribute-rgt1-in64.4%
+-commutative64.4%
*-commutative64.4%
distribute-rgt1-in64.4%
+-commutative64.4%
metadata-eval64.4%
associate-+l+64.4%
Simplified64.4%
associate-+r+64.4%
metadata-eval64.4%
associate-/l*76.7%
associate-+r+76.7%
metadata-eval76.7%
associate-+r+76.7%
metadata-eval76.7%
associate-+l+76.7%
metadata-eval76.7%
times-frac99.7%
metadata-eval99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 95.2%
mul-1-neg95.2%
metadata-eval95.2%
distribute-lft-in95.2%
Simplified95.2%
Taylor expanded in alpha around inf 95.2%
Final simplification98.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 1.55e+40)
(* (/ (+ alpha 1.0) t_0) (/ (+ 1.0 beta) (* t_0 (+ (+ alpha beta) 3.0))))
(/ (/ (+ alpha 1.0) (+ alpha (+ 2.0 beta))) (+ alpha (+ beta 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 1.55e+40) {
tmp = ((alpha + 1.0) / t_0) * ((1.0 + beta) / (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 1.55d+40) then
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 + beta) / (t_0 * ((alpha + beta) + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (alpha + (2.0d0 + beta))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 1.55e+40) {
tmp = ((alpha + 1.0) / t_0) * ((1.0 + beta) / (t_0 * ((alpha + beta) + 3.0)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 1.55e+40: tmp = ((alpha + 1.0) / t_0) * ((1.0 + beta) / (t_0 * ((alpha + beta) + 3.0))) else: tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 1.55e+40) tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(alpha + beta) + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(2.0 + beta))) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 1.55e+40)
tmp = ((alpha + 1.0) / t_0) * ((1.0 + beta) / (t_0 * ((alpha + beta) + 3.0)));
else
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.55e+40], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 1.55 \cdot 10^{+40}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 + \beta}{t\_0 \cdot \left(\left(\alpha + \beta\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(2 + \beta\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.5499999999999999e40Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
*-commutative99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
associate-+r+99.9%
metadata-eval99.9%
associate-/l/92.3%
*-commutative92.3%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
metadata-eval99.8%
+-commutative99.8%
Applied egg-rr99.8%
if 1.5499999999999999e40 < beta Initial program 78.1%
associate-/l/72.0%
+-commutative72.0%
+-commutative72.0%
associate-+r+72.0%
associate-+r+72.0%
associate-+r+72.0%
distribute-rgt1-in72.0%
+-commutative72.0%
*-commutative72.0%
distribute-rgt1-in72.0%
+-commutative72.0%
metadata-eval72.0%
associate-+l+72.0%
Simplified72.0%
Taylor expanded in beta around inf 83.1%
associate-+r+83.1%
associate-/r*88.4%
+-commutative88.4%
+-commutative88.4%
associate-+r+88.4%
Applied egg-rr88.4%
Final simplification96.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.4e+15)
(/
(/ (+ 1.0 beta) (+ 2.0 beta))
(* (+ alpha (+ 2.0 beta)) (+ alpha (+ beta 3.0))))
(*
(/ (+ alpha 1.0) (+ 2.0 (+ alpha beta)))
(/ (- 1.0 (/ (* 2.0 (+ alpha 2.0)) beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - ((2.0 * (alpha + 2.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.4d+15) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((alpha + (2.0d0 + beta)) * (alpha + (beta + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) * ((1.0d0 - ((2.0d0 * (alpha + 2.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.4e+15) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - ((2.0 * (alpha + 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.4e+15: tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0))) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - ((2.0 * (alpha + 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.4e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) * Float64(Float64(1.0 - Float64(Float64(2.0 * Float64(alpha + 2.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.4e+15)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - ((2.0 * (alpha + 2.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.4e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(N[(2.0 * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.4 \cdot 10^{+15}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)} \cdot \frac{1 - \frac{2 \cdot \left(\alpha + 2\right)}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.4e15Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
*-commutative99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 80.7%
+-commutative80.7%
Simplified80.7%
if 4.4e15 < beta Initial program 80.2%
associate-/l/74.6%
+-commutative74.6%
+-commutative74.6%
associate-+r+74.6%
associate-+r+74.6%
associate-+r+74.6%
distribute-rgt1-in74.6%
+-commutative74.6%
*-commutative74.6%
distribute-rgt1-in74.6%
+-commutative74.6%
metadata-eval74.6%
associate-+l+74.6%
Simplified74.6%
associate-+r+74.6%
metadata-eval74.6%
associate-/l*85.8%
associate-+r+85.8%
metadata-eval85.8%
associate-+r+85.8%
metadata-eval85.8%
associate-+l+85.8%
metadata-eval85.8%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 88.8%
mul-1-neg88.8%
metadata-eval88.8%
distribute-lft-in88.8%
Simplified88.8%
Final simplification83.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ 2.0 (+ alpha beta)))) (* (/ (+ alpha 1.0) t_0) (/ (/ (+ 1.0 beta) t_0) (+ (+ alpha beta) 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return ((alpha + 1.0) / 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 = 2.0d0 + (alpha + beta)
code = ((alpha + 1.0d0) / 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 = 2.0 + (alpha + beta);
return ((alpha + 1.0) / t_0) * (((1.0 + beta) / t_0) / ((alpha + beta) + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return ((alpha + 1.0) / t_0) * (((1.0 + beta) / t_0) / ((alpha + beta) + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(Float64(alpha + beta) + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = ((alpha + 1.0) / 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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\frac{\alpha + 1}{t\_0} \cdot \frac{\frac{1 + \beta}{t\_0}}{\left(\alpha + \beta\right) + 3}
\end{array}
\end{array}
Initial program 93.7%
associate-/l/91.9%
+-commutative91.9%
+-commutative91.9%
associate-+r+91.9%
associate-+r+91.9%
associate-+r+91.9%
distribute-rgt1-in91.9%
+-commutative91.9%
*-commutative91.9%
distribute-rgt1-in91.9%
+-commutative91.9%
metadata-eval91.9%
associate-+l+91.9%
Simplified91.9%
associate-+r+91.9%
metadata-eval91.9%
associate-/l*95.4%
associate-+r+95.4%
metadata-eval95.4%
associate-+r+95.4%
metadata-eval95.4%
associate-+l+95.4%
metadata-eval95.4%
times-frac99.8%
metadata-eval99.8%
+-commutative99.8%
Applied egg-rr99.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4e+16)
(/
(/ (+ 1.0 beta) (+ 2.0 beta))
(* (+ alpha (+ 2.0 beta)) (+ alpha (+ beta 3.0))))
(*
(/ (+ alpha 1.0) (+ 2.0 (+ alpha beta)))
(/ (- 1.0 (* 2.0 (/ alpha beta))) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4d+16) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / ((alpha + (2.0d0 + beta)) * (alpha + (beta + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) * ((1.0d0 - (2.0d0 * (alpha / beta))) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4e+16: tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0))) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) * Float64(Float64(1.0 - Float64(2.0 * Float64(alpha / beta))) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4e+16)
tmp = ((1.0 + beta) / (2.0 + beta)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (2.0 * (alpha / beta))) / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(2.0 * N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)} \cdot \frac{1 - 2 \cdot \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4e16Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
*-commutative99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 80.8%
+-commutative80.8%
Simplified80.8%
if 4e16 < beta Initial program 79.9%
associate-/l/74.3%
+-commutative74.3%
+-commutative74.3%
associate-+r+74.3%
associate-+r+74.3%
associate-+r+74.3%
distribute-rgt1-in74.3%
+-commutative74.3%
*-commutative74.3%
distribute-rgt1-in74.4%
+-commutative74.4%
metadata-eval74.4%
associate-+l+74.4%
Simplified74.4%
associate-+r+74.4%
metadata-eval74.4%
associate-/l*85.6%
associate-+r+85.6%
metadata-eval85.6%
associate-+r+85.6%
metadata-eval85.6%
associate-+l+85.6%
metadata-eval85.6%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 88.7%
mul-1-neg88.7%
metadata-eval88.7%
distribute-lft-in88.7%
Simplified88.7%
Taylor expanded in alpha around inf 88.7%
Final simplification83.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ 2.0 beta))) (t_1 (+ alpha (+ beta 3.0))))
(if (<= beta 1.2e+16)
(/ (/ (+ 1.0 beta) (+ 2.0 beta)) (* t_0 t_1))
(/ (/ (+ alpha 1.0) t_0) t_1))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = alpha + (beta + 3.0);
double tmp;
if (beta <= 1.2e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (t_0 * t_1);
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
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 + (2.0d0 + beta)
t_1 = alpha + (beta + 3.0d0)
if (beta <= 1.2d+16) then
tmp = ((1.0d0 + beta) / (2.0d0 + beta)) / (t_0 * t_1)
else
tmp = ((alpha + 1.0d0) / t_0) / t_1
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (2.0 + beta);
double t_1 = alpha + (beta + 3.0);
double tmp;
if (beta <= 1.2e+16) {
tmp = ((1.0 + beta) / (2.0 + beta)) / (t_0 * t_1);
} else {
tmp = ((alpha + 1.0) / t_0) / t_1;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (2.0 + beta) t_1 = alpha + (beta + 3.0) tmp = 0 if beta <= 1.2e+16: tmp = ((1.0 + beta) / (2.0 + beta)) / (t_0 * t_1) else: tmp = ((alpha + 1.0) / t_0) / t_1 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(2.0 + beta)) t_1 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 1.2e+16) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(2.0 + beta)) / Float64(t_0 * t_1)); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) / t_1); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (2.0 + beta);
t_1 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 1.2e+16)
tmp = ((1.0 + beta) / (2.0 + beta)) / (t_0 * t_1);
else
tmp = ((alpha + 1.0) / t_0) / t_1;
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[(2.0 + beta), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.2e+16], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(2 + \beta\right)\\
t_1 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 1.2 \cdot 10^{+16}:\\
\;\;\;\;\frac{\frac{1 + \beta}{2 + \beta}}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{t\_0}}{t\_1}\\
\end{array}
\end{array}
if beta < 1.2e16Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
*-commutative99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in alpha around 0 80.8%
+-commutative80.8%
Simplified80.8%
if 1.2e16 < beta Initial program 79.9%
associate-/l/74.3%
+-commutative74.3%
+-commutative74.3%
associate-+r+74.3%
associate-+r+74.3%
associate-+r+74.3%
distribute-rgt1-in74.3%
+-commutative74.3%
*-commutative74.3%
distribute-rgt1-in74.4%
+-commutative74.4%
metadata-eval74.4%
associate-+l+74.4%
Simplified74.4%
Taylor expanded in beta around inf 84.4%
associate-+r+84.4%
associate-/r*89.3%
+-commutative89.3%
+-commutative89.3%
associate-+r+89.3%
Applied egg-rr89.3%
Final simplification83.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.0)
(/
(/ (+ alpha 1.0) (+ alpha 2.0))
(* (+ alpha (+ 2.0 beta)) (+ alpha (+ beta 3.0))))
(* (/ (+ alpha 1.0) (+ 2.0 (+ alpha beta))) (/ (- 1.0 (/ 4.0 beta)) beta))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (4.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 <= 9.0d0) then
tmp = ((alpha + 1.0d0) / (alpha + 2.0d0)) / ((alpha + (2.0d0 + beta)) * (alpha + (beta + 3.0d0)))
else
tmp = ((alpha + 1.0d0) / (2.0d0 + (alpha + beta))) * ((1.0d0 - (4.0d0 / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 9.0) {
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
} else {
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (4.0 / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.0: tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0))) else: tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (4.0 / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.0) tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + 2.0)) / Float64(Float64(alpha + Float64(2.0 + beta)) * Float64(alpha + Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(2.0 + Float64(alpha + beta))) * Float64(Float64(1.0 - Float64(4.0 / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 9.0)
tmp = ((alpha + 1.0) / (alpha + 2.0)) / ((alpha + (2.0 + beta)) * (alpha + (beta + 3.0)));
else
tmp = ((alpha + 1.0) / (2.0 + (alpha + beta))) * ((1.0 - (4.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, 9.0], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - N[(4.0 / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + 2}}{\left(\alpha + \left(2 + \beta\right)\right) \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{2 + \left(\alpha + \beta\right)} \cdot \frac{1 - \frac{4}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 9Initial program 99.9%
associate-/l/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
associate-+r+99.9%
associate-+r+99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
*-commutative99.9%
distribute-rgt1-in99.9%
+-commutative99.9%
metadata-eval99.9%
associate-+l+99.9%
Simplified99.9%
Taylor expanded in beta around 0 99.9%
if 9 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 86.5%
mul-1-neg86.5%
metadata-eval86.5%
distribute-lft-in86.5%
Simplified86.5%
Taylor expanded in alpha around 0 86.5%
associate-*r/86.5%
metadata-eval86.5%
Simplified86.5%
Final simplification95.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ alpha beta))))
(if (<= beta 5.8)
(/ 0.25 (+ 1.0 t_0))
(* (/ (+ alpha 1.0) t_0) (/ (- 1.0 (/ 4.0 beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.8) {
tmp = 0.25 / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (4.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) :: t_0
real(8) :: tmp
t_0 = 2.0d0 + (alpha + beta)
if (beta <= 5.8d0) then
tmp = 0.25d0 / (1.0d0 + t_0)
else
tmp = ((alpha + 1.0d0) / t_0) * ((1.0d0 - (4.0d0 / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
double tmp;
if (beta <= 5.8) {
tmp = 0.25 / (1.0 + t_0);
} else {
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (4.0 / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) tmp = 0 if beta <= 5.8: tmp = 0.25 / (1.0 + t_0) else: tmp = ((alpha + 1.0) / t_0) * ((1.0 - (4.0 / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) tmp = 0.0 if (beta <= 5.8) tmp = Float64(0.25 / Float64(1.0 + t_0)); else tmp = Float64(Float64(Float64(alpha + 1.0) / t_0) * Float64(Float64(1.0 - Float64(4.0 / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = 0.0;
if (beta <= 5.8)
tmp = 0.25 / (1.0 + t_0);
else
tmp = ((alpha + 1.0) / t_0) * ((1.0 - (4.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_] := Block[{t$95$0 = N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5.8], N[(0.25 / N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(4.0 / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\alpha + \beta\right)\\
\mathbf{if}\;\beta \leq 5.8:\\
\;\;\;\;\frac{0.25}{1 + t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{t\_0} \cdot \frac{1 - \frac{4}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 5.79999999999999982Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 5.79999999999999982 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 86.5%
mul-1-neg86.5%
metadata-eval86.5%
distribute-lft-in86.5%
Simplified86.5%
Taylor expanded in alpha around 0 86.5%
associate-*r/86.5%
metadata-eval86.5%
Simplified86.5%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) (+ alpha (+ 2.0 beta))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (2.0d0 + beta))) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(2.0 + beta))) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $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 2:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(2 + \beta\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 2 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
Taylor expanded in beta around inf 83.2%
associate-+r+83.2%
associate-/r*86.6%
+-commutative86.6%
+-commutative86.6%
associate-+r+86.6%
Applied egg-rr86.6%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) (+ alpha (+ 2.0 beta))) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.1d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (2.0d0 + beta))) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(2.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 <= 2.1)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.1], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.1:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(2 + \beta\right)}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 2.10000000000000009 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
Taylor expanded in beta around inf 83.2%
associate-+r+83.2%
associate-/r*86.6%
+-commutative86.6%
+-commutative86.6%
associate-+r+86.6%
Applied egg-rr86.6%
Taylor expanded in alpha around 0 86.0%
+-commutative86.0%
Simplified86.0%
Final simplification71.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.3) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / 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.3d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / 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.3) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.3: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.3) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / 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.3)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / 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.3], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $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.3:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.29999999999999982Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 4.29999999999999982 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
Taylor expanded in beta around inf 83.2%
associate-+r+83.2%
associate-/r*86.6%
+-commutative86.6%
+-commutative86.6%
associate-+r+86.6%
Applied egg-rr86.6%
Taylor expanded in beta around inf 85.8%
Final simplification71.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.8) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (/ (/ (+ alpha 1.0) (+ alpha (+ 2.0 beta))) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.8) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.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.8d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / (alpha + (2.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.8) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.8: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / (alpha + (2.0 + beta))) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.8) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / Float64(alpha + Float64(2.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.8)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / (alpha + (2.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.8], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / N[(alpha + N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.8:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha + 1}{\alpha + \left(2 + \beta\right)}}{\beta}\\
\end{array}
\end{array}
if beta < 4.79999999999999982Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 4.79999999999999982 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 85.7%
*-un-lft-identity85.7%
un-div-inv85.8%
+-commutative85.8%
+-commutative85.8%
Applied egg-rr85.8%
*-lft-identity85.8%
associate-+r+85.8%
+-commutative85.8%
Simplified85.8%
Final simplification71.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.6) (/ 0.25 (+ 1.0 (+ 2.0 (+ alpha beta)))) (* (/ (+ alpha 1.0) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / 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 <= 6.6d0) then
tmp = 0.25d0 / (1.0d0 + (2.0d0 + (alpha + beta)))
else
tmp = ((alpha + 1.0d0) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.6) {
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.6: tmp = 0.25 / (1.0 + (2.0 + (alpha + beta))) else: tmp = ((alpha + 1.0) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.6) tmp = Float64(0.25 / Float64(1.0 + Float64(2.0 + Float64(alpha + beta)))); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.6)
tmp = 0.25 / (1.0 + (2.0 + (alpha + beta)));
else
tmp = ((alpha + 1.0) / beta) * (1.0 / 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, 6.6], N[(0.25 / N[(1.0 + N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.6:\\
\;\;\;\;\frac{0.25}{1 + \left(2 + \left(\alpha + \beta\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 6.5999999999999996Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 64.7%
if 6.5999999999999996 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 85.7%
Taylor expanded in beta around inf 85.5%
Final simplification71.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.8) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (* (/ (+ alpha 1.0) beta) (/ 1.0 beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.8d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = ((alpha + 1.0d0) / beta) * (1.0d0 / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.8) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.8: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = ((alpha + 1.0) / beta) * (1.0 / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.8) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(Float64(alpha + 1.0) / beta) * Float64(1.0 / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.8)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = ((alpha + 1.0) / beta) * (1.0 / beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.8], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha + 1.0), $MachinePrecision] / beta), $MachinePrecision] * N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.8:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\alpha + 1}{\beta} \cdot \frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.7999999999999998Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 63.3%
+-commutative63.3%
Simplified63.3%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.7999999999999998 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 85.7%
Taylor expanded in beta around inf 85.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.6) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ 2.0 beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.6d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 1.0d0 / (beta * (2.0d0 + beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.6) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (2.0 + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.6: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / (beta * (2.0 + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.6) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(1.0 / Float64(beta * Float64(2.0 + beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.6)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 1.0 / (beta * (2.0 + beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.6], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.6:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(2 + \beta\right)}\\
\end{array}
\end{array}
if beta < 2.60000000000000009Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 63.3%
+-commutative63.3%
Simplified63.3%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.60000000000000009 < beta Initial program 81.5%
associate-/l/76.4%
+-commutative76.4%
+-commutative76.4%
associate-+r+76.4%
associate-+r+76.4%
associate-+r+76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
*-commutative76.4%
distribute-rgt1-in76.4%
+-commutative76.4%
metadata-eval76.4%
associate-+l+76.4%
Simplified76.4%
associate-+r+76.4%
metadata-eval76.4%
associate-/l*86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+r+86.7%
metadata-eval86.7%
associate-+l+86.7%
metadata-eval86.7%
times-frac99.5%
metadata-eval99.5%
+-commutative99.5%
Applied egg-rr99.5%
Taylor expanded in beta around inf 85.7%
Taylor expanded in alpha around 0 73.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.027777777777777776d0))
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
else
tmp = 0.25 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 63.3%
+-commutative63.3%
Simplified63.3%
Taylor expanded in beta around 0 63.3%
*-commutative63.3%
Simplified63.3%
if 2.7000000000000002 < beta Initial program 81.5%
Taylor expanded in beta around 0 17.2%
Taylor expanded in alpha around 0 7.1%
+-commutative7.1%
Simplified7.1%
Taylor expanded in beta around inf 7.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.0) 0.08333333333333333 (/ 0.25 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / 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.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.25d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.25 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.0: tmp = 0.08333333333333333 else: tmp = 0.25 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.0) tmp = 0.08333333333333333; else tmp = Float64(0.25 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.0)
tmp = 0.08333333333333333;
else
tmp = 0.25 / 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.0], 0.08333333333333333, N[(0.25 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.25}{\beta}\\
\end{array}
\end{array}
if beta < 3Initial program 99.9%
Taylor expanded in beta around 0 99.9%
Taylor expanded in alpha around 0 63.3%
+-commutative63.3%
Simplified63.3%
Taylor expanded in beta around 0 63.2%
if 3 < beta Initial program 81.5%
Taylor expanded in beta around 0 17.2%
Taylor expanded in alpha around 0 7.1%
+-commutative7.1%
Simplified7.1%
Taylor expanded in beta around inf 7.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ beta 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (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 = 0.25d0 / (beta + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (beta + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (beta + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(beta + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (beta + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\beta + 3}
\end{array}
Initial program 93.7%
Taylor expanded in beta around 0 71.8%
Taylor expanded in alpha around 0 44.2%
+-commutative44.2%
Simplified44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 93.7%
Taylor expanded in beta around 0 71.8%
Taylor expanded in alpha around 0 44.2%
+-commutative44.2%
Simplified44.2%
Taylor expanded in beta around 0 43.2%
herbie shell --seed 2024096
(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)))