
(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 23 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t\_0}}{t\_0}}{t\_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (/ (* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (+ alpha (+ beta 3.0)))) t_0)))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / 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 = beta + (alpha + 2.0d0)
code = ((1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / (alpha + (beta + 3.0d0)))) / t_0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / t_0
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(alpha + Float64(beta + 3.0)))) / t_0) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = ((1.0 + alpha) * (((1.0 + beta) / t_0) / (alpha + (beta + 3.0)))) / 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[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t\_0}}{\alpha + \left(\beta + 3\right)}}{t\_0}
\end{array}
\end{array}
Initial program 94.4%
Simplified82.2%
times-frac96.0%
+-commutative96.0%
Applied egg-rr96.0%
associate-*l/96.0%
+-commutative96.0%
associate-+r+96.0%
associate-/r*99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+l+99.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 1.22e+118)
(* (/ (+ 1.0 alpha) t_1) (/ (+ 1.0 beta) (* t_0 t_1)))
(/
(* (+ 1.0 alpha) (/ (+ 1.0 (/ (- -1.0 alpha) beta)) t_0))
(+ beta (+ alpha 2.0))))))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 <= 1.22e+118) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + alpha) * ((1.0 + ((-1.0 - alpha) / beta)) / t_0)) / (beta + (alpha + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 1.22d+118) then
tmp = ((1.0d0 + alpha) / t_1) * ((1.0d0 + beta) / (t_0 * t_1))
else
tmp = ((1.0d0 + alpha) * ((1.0d0 + (((-1.0d0) - alpha) / beta)) / t_0)) / (beta + (alpha + 2.0d0))
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 <= 1.22e+118) {
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
} else {
tmp = ((1.0 + alpha) * ((1.0 + ((-1.0 - alpha) / beta)) / t_0)) / (beta + (alpha + 2.0));
}
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 <= 1.22e+118: tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1)) else: tmp = ((1.0 + alpha) * ((1.0 + ((-1.0 - alpha) / beta)) / t_0)) / (beta + (alpha + 2.0)) 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 <= 1.22e+118) tmp = Float64(Float64(Float64(1.0 + alpha) / t_1) * Float64(Float64(1.0 + beta) / Float64(t_0 * t_1))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) / t_0)) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 1.22e+118)
tmp = ((1.0 + alpha) / t_1) * ((1.0 + beta) / (t_0 * t_1));
else
tmp = ((1.0 + alpha) * ((1.0 + ((-1.0 - alpha) / beta)) / t_0)) / (beta + (alpha + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1.22e+118], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$1), $MachinePrecision] * N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $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 1.22 \cdot 10^{+118}:\\
\;\;\;\;\frac{1 + \alpha}{t\_1} \cdot \frac{1 + \beta}{t\_0 \cdot t\_1}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1 + \frac{-1 - \alpha}{\beta}}{t\_0}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 1.2200000000000001e118Initial program 99.8%
Simplified88.4%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
if 1.2200000000000001e118 < beta Initial program 73.5%
Simplified58.2%
times-frac81.5%
+-commutative81.5%
Applied egg-rr81.5%
associate-*l/81.4%
+-commutative81.4%
associate-+r+81.4%
associate-/r*99.8%
+-commutative99.8%
associate-+l+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+l+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 86.6%
associate-*r/86.6%
mul-1-neg86.6%
Simplified86.6%
Final simplification97.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ beta (+ alpha 2.0))))
(if (<= beta 310000000000.0)
(/
(/ (+ 1.0 beta) (+ beta 2.0))
(* (+ 3.0 (+ alpha beta)) (+ alpha (+ beta 2.0))))
(* (/ (/ (+ 1.0 alpha) t_0) t_0) (- 1.0 (/ (+ alpha 2.0) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 310000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 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) :: t_0
real(8) :: tmp
t_0 = beta + (alpha + 2.0d0)
if (beta <= 310000000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((3.0d0 + (alpha + beta)) * (alpha + (beta + 2.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / t_0) * (1.0d0 - ((alpha + 2.0d0) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
double tmp;
if (beta <= 310000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) tmp = 0 if beta <= 310000000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0))) else: tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 2.0) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) tmp = 0.0 if (beta <= 310000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(3.0 + Float64(alpha + beta)) * Float64(alpha + Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(1.0 - Float64(Float64(alpha + 2.0) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = 0.0;
if (beta <= 310000000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
else
tmp = (((1.0 + alpha) / t_0) / t_0) * (1.0 - ((alpha + 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_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 310000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 - N[(N[(alpha + 2.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\mathbf{if}\;\beta \leq 310000000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(3 + \left(\alpha + \beta\right)\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \left(1 - \frac{\alpha + 2}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.1e11Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 80.3%
+-commutative80.3%
Simplified80.3%
if 3.1e11 < beta Initial program 82.8%
Simplified61.4%
times-frac87.9%
+-commutative87.9%
Applied egg-rr87.9%
associate-*r/88.0%
+-commutative88.0%
+-commutative88.0%
+-commutative88.0%
associate-+r+88.0%
+-commutative88.0%
+-commutative88.0%
Simplified88.0%
times-frac99.8%
associate-+l+99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
Applied egg-rr99.8%
Taylor expanded in beta around inf 83.3%
mul-1-neg83.3%
unsub-neg83.3%
Simplified83.3%
Final simplification81.3%
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))))
(if (<= beta 140000000000.0)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ 3.0 (+ alpha beta)) t_0))
(*
(/ (+ 1.0 alpha) t_0)
(/ (- 1.0 (/ (+ 4.0 (* alpha 2.0)) beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 140000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 140000000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((3.0d0 + (alpha + beta)) * t_0)
else
tmp = ((1.0d0 + alpha) / t_0) * ((1.0d0 - ((4.0d0 + (alpha * 2.0d0)) / beta)) / beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 140000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 140000000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.0 + (alpha * 2.0)) / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 140000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(3.0 + Float64(alpha + beta)) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(Float64(1.0 - Float64(Float64(4.0 + Float64(alpha * 2.0)) / beta)) / beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 140000000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
else
tmp = ((1.0 + alpha) / t_0) * ((1.0 - ((4.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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 140000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 - N[(N[(4.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}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 140000000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(3 + \left(\alpha + \beta\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{4 + \alpha \cdot 2}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 1.4e11Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 80.3%
+-commutative80.3%
Simplified80.3%
if 1.4e11 < beta Initial program 82.8%
Simplified61.4%
times-frac87.9%
+-commutative87.9%
Applied egg-rr87.9%
Taylor expanded in beta around inf 83.0%
mul-1-neg83.0%
Simplified83.0%
Final simplification81.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ beta (+ alpha 2.0)))) (* (/ (/ (+ 1.0 alpha) t_0) t_0) (/ (+ 1.0 beta) (+ alpha (+ beta 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (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 = beta + (alpha + 2.0d0)
code = (((1.0d0 + alpha) / t_0) / t_0) * ((1.0d0 + beta) / (alpha + (beta + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (alpha + (beta + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / t_0) * Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = beta + (alpha + 2.0);
tmp = (((1.0 + alpha) / t_0) / t_0) * ((1.0 + beta) / (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[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(1.0 + beta), $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 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{t\_0} \cdot \frac{1 + \beta}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.4%
Simplified82.2%
times-frac96.0%
+-commutative96.0%
Applied egg-rr96.0%
associate-*r/96.0%
+-commutative96.0%
+-commutative96.0%
+-commutative96.0%
associate-+r+96.0%
+-commutative96.0%
+-commutative96.0%
Simplified96.0%
times-frac99.8%
associate-+l+99.8%
associate-+l+99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.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 (+ 2.0 (+ alpha beta)))) (* (/ (/ (+ 1.0 alpha) t_0) (+ 3.0 (+ alpha beta))) (/ (+ 1.0 beta) t_0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((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 = 2.0d0 + (alpha + beta)
code = (((1.0d0 + alpha) / t_0) / (3.0d0 + (alpha + beta))) * ((1.0d0 + beta) / t_0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (alpha + beta);
return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / t_0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (alpha + beta) return (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((1.0 + beta) / t_0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(alpha + beta)) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(3.0 + Float64(alpha + beta))) * Float64(Float64(1.0 + beta) / t_0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = 2.0 + (alpha + beta);
tmp = (((1.0 + alpha) / t_0) / (3.0 + (alpha + beta))) * ((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[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(3.0 + N[(alpha + beta), $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 := 2 + \left(\alpha + \beta\right)\\
\frac{\frac{1 + \alpha}{t\_0}}{3 + \left(\alpha + \beta\right)} \cdot \frac{1 + \beta}{t\_0}
\end{array}
\end{array}
Initial program 94.4%
Simplified82.2%
times-frac96.0%
+-commutative96.0%
Applied egg-rr96.0%
associate-*r/96.0%
+-commutative96.0%
+-commutative96.0%
+-commutative96.0%
associate-+r+96.0%
+-commutative96.0%
+-commutative96.0%
Simplified96.0%
*-un-lft-identity96.0%
associate-/l*96.0%
associate-+l+96.0%
+-commutative96.0%
+-commutative96.0%
+-commutative96.0%
associate-+r+96.0%
associate-+r+96.0%
associate-/r*99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
associate-/l/96.0%
associate-/l*96.0%
times-frac99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.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 2.0))))
(if (<= beta 2650000000000.0)
(/ (/ (+ 1.0 beta) (+ beta 2.0)) (* (+ 3.0 (+ alpha beta)) t_0))
(* (/ (+ 1.0 alpha) t_0) (/ (- 1.0 (* 2.0 (/ alpha beta))) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2650000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
} else {
tmp = ((1.0 + alpha) / 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 = alpha + (beta + 2.0d0)
if (beta <= 2650000000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((3.0d0 + (alpha + beta)) * t_0)
else
tmp = ((1.0d0 + alpha) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2650000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2650000000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0) else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - (2.0 * (alpha / beta))) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2650000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(3.0 + Float64(alpha + beta)) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2650000000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * t_0);
else
tmp = ((1.0 + alpha) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2650000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2650000000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(3 + \left(\alpha + \beta\right)\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - 2 \cdot \frac{\alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 2.65e12Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 80.3%
+-commutative80.3%
Simplified80.3%
if 2.65e12 < beta Initial program 82.8%
Simplified61.4%
times-frac87.9%
+-commutative87.9%
Applied egg-rr87.9%
Taylor expanded in beta around inf 83.0%
mul-1-neg83.0%
Simplified83.0%
Taylor expanded in alpha around inf 82.8%
Final simplification81.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2650000000000.0)
(/
(/ (+ 1.0 beta) (+ beta 2.0))
(* (+ 3.0 (+ alpha beta)) (+ alpha (+ beta 2.0))))
(/
(* (+ 1.0 alpha) (/ 1.0 (+ alpha (+ beta 3.0))))
(+ beta (+ alpha 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2650000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (beta + (alpha + 2.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 <= 2650000000000.0d0) then
tmp = ((1.0d0 + beta) / (beta + 2.0d0)) / ((3.0d0 + (alpha + beta)) * (alpha + (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) * (1.0d0 / (alpha + (beta + 3.0d0)))) / (beta + (alpha + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2650000000000.0) {
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (beta + (alpha + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2650000000000.0: tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0))) else: tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (beta + (alpha + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2650000000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 2.0)) / Float64(Float64(3.0 + Float64(alpha + beta)) * Float64(alpha + Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(alpha + Float64(beta + 3.0)))) / Float64(beta + Float64(alpha + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2650000000000.0)
tmp = ((1.0 + beta) / (beta + 2.0)) / ((3.0 + (alpha + beta)) * (alpha + (beta + 2.0)));
else
tmp = ((1.0 + alpha) * (1.0 / (alpha + (beta + 3.0)))) / (beta + (alpha + 2.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, 2650000000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(3.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision] * N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2650000000000:\\
\;\;\;\;\frac{\frac{1 + \beta}{\beta + 2}}{\left(3 + \left(\alpha + \beta\right)\right) \cdot \left(\alpha + \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\alpha + \left(\beta + 3\right)}}{\beta + \left(\alpha + 2\right)}\\
\end{array}
\end{array}
if beta < 2.65e12Initial program 99.8%
associate-/l/99.8%
+-commutative99.8%
associate-+l+99.8%
*-commutative99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
associate-+l+99.8%
metadata-eval99.8%
metadata-eval99.8%
associate-+l+99.8%
Simplified99.8%
Taylor expanded in alpha around 0 80.3%
+-commutative80.3%
Simplified80.3%
if 2.65e12 < beta Initial program 82.8%
Simplified61.4%
times-frac87.9%
+-commutative87.9%
Applied egg-rr87.9%
associate-*l/87.9%
+-commutative87.9%
associate-+r+87.9%
associate-/r*99.7%
+-commutative99.7%
associate-+l+99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+l+99.7%
Applied egg-rr99.7%
Taylor expanded in beta around inf 82.7%
Final simplification81.1%
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))))
(if (<= beta 7.1)
(/ (* (+ 1.0 alpha) (/ 1.0 (* (+ alpha 2.0) (+ alpha 3.0)))) t_0)
(* (/ (+ 1.0 alpha) t_0) (/ (- 1.0 (/ 4.0 beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 7.1) {
tmp = ((1.0 + alpha) * (1.0 / ((alpha + 2.0) * (alpha + 3.0)))) / t_0;
} else {
tmp = ((1.0 + alpha) / 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 = alpha + (beta + 2.0d0)
if (beta <= 7.1d0) then
tmp = ((1.0d0 + alpha) * (1.0d0 / ((alpha + 2.0d0) * (alpha + 3.0d0)))) / t_0
else
tmp = ((1.0d0 + alpha) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 7.1) {
tmp = ((1.0 + alpha) * (1.0 / ((alpha + 2.0) * (alpha + 3.0)))) / t_0;
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - (4.0 / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 7.1: tmp = ((1.0 + alpha) * (1.0 / ((alpha + 2.0) * (alpha + 3.0)))) / t_0 else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - (4.0 / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 7.1) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0)))) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 7.1)
tmp = ((1.0 + alpha) * (1.0 / ((alpha + 2.0) * (alpha + 3.0)))) / t_0;
else
tmp = ((1.0 + alpha) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 7.1], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 7.1:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \frac{1}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{4}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.0999999999999996Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
associate-*l/97.9%
+-commutative97.9%
+-commutative97.9%
+-commutative97.9%
Applied egg-rr97.9%
if 7.0999999999999996 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around 0 82.5%
associate-*r/82.5%
metadata-eval82.5%
Simplified82.5%
Final simplification92.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 8.5)
(/ (/ (+ 1.0 alpha) (* (+ alpha 2.0) (+ alpha 3.0))) t_0)
(* (/ (+ 1.0 alpha) t_0) (/ (- 1.0 (/ 4.0 beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8.5) {
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 3.0))) / t_0;
} else {
tmp = ((1.0 + alpha) / 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 = alpha + (beta + 2.0d0)
if (beta <= 8.5d0) then
tmp = ((1.0d0 + alpha) / ((alpha + 2.0d0) * (alpha + 3.0d0))) / t_0
else
tmp = ((1.0d0 + alpha) / 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 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8.5) {
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 3.0))) / t_0;
} else {
tmp = ((1.0 + alpha) / t_0) * ((1.0 - (4.0 / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 8.5: tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 3.0))) / t_0 else: tmp = ((1.0 + alpha) / t_0) * ((1.0 - (4.0 / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 8.5) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + 2.0) * Float64(alpha + 3.0))) / t_0); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 8.5)
tmp = ((1.0 + alpha) / ((alpha + 2.0) * (alpha + 3.0))) / t_0;
else
tmp = ((1.0 + alpha) / 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[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.5], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 8.5:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\left(\alpha + 2\right) \cdot \left(\alpha + 3\right)}}{t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{t\_0} \cdot \frac{1 - \frac{4}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.5Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
associate-*l/97.9%
+-commutative97.9%
+-commutative97.9%
+-commutative97.9%
Applied egg-rr97.9%
associate-*r/97.8%
*-rgt-identity97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
+-commutative97.8%
Simplified97.8%
if 8.5 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around 0 82.5%
associate-*r/82.5%
metadata-eval82.5%
Simplified82.5%
Final simplification92.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))))
(if (<= beta 6.5)
(* t_0 (/ 1.0 (+ 6.0 (* alpha 5.0))))
(* t_0 (/ (- 1.0 (/ 4.0 beta)) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (1.0 + alpha) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 6.5) {
tmp = t_0 * (1.0 / (6.0 + (alpha * 5.0)));
} else {
tmp = 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 = (1.0d0 + alpha) / (alpha + (beta + 2.0d0))
if (beta <= 6.5d0) then
tmp = t_0 * (1.0d0 / (6.0d0 + (alpha * 5.0d0)))
else
tmp = 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 = (1.0 + alpha) / (alpha + (beta + 2.0));
double tmp;
if (beta <= 6.5) {
tmp = t_0 * (1.0 / (6.0 + (alpha * 5.0)));
} else {
tmp = t_0 * ((1.0 - (4.0 / beta)) / beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (1.0 + alpha) / (alpha + (beta + 2.0)) tmp = 0 if beta <= 6.5: tmp = t_0 * (1.0 / (6.0 + (alpha * 5.0))) else: tmp = t_0 * ((1.0 - (4.0 / beta)) / beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) tmp = 0.0 if (beta <= 6.5) tmp = Float64(t_0 * Float64(1.0 / Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(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 = (1.0 + alpha) / (alpha + (beta + 2.0));
tmp = 0.0;
if (beta <= 6.5)
tmp = t_0 * (1.0 / (6.0 + (alpha * 5.0)));
else
tmp = 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[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.5], N[(t$95$0 * N[(1.0 / N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * 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 := \frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}\\
\mathbf{if}\;\beta \leq 6.5:\\
\;\;\;\;t\_0 \cdot \frac{1}{6 + \alpha \cdot 5}\\
\mathbf{else}:\\
\;\;\;\;t\_0 \cdot \frac{1 - \frac{4}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 6.5Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 62.9%
*-commutative62.9%
Simplified62.9%
if 6.5 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around 0 82.5%
associate-*r/82.5%
metadata-eval82.5%
Simplified82.5%
Final simplification69.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.2) (* (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (/ 1.0 (+ 6.0 (* alpha 5.0)))) (* (/ (- 1.0 (/ 4.0 beta)) beta) (/ (+ 1.0 alpha) (+ beta 2.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / (6.0 + (alpha * 5.0)));
} else {
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.2d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (1.0d0 / (6.0d0 + (alpha * 5.0d0)))
else
tmp = ((1.0d0 - (4.0d0 / beta)) / beta) * ((1.0d0 + alpha) / (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.2) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / (6.0 + (alpha * 5.0)));
} else {
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.2: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / (6.0 + (alpha * 5.0))) else: tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.2) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(1.0 / Float64(6.0 + Float64(alpha * 5.0)))); else tmp = Float64(Float64(Float64(1.0 - Float64(4.0 / beta)) / beta) * Float64(Float64(1.0 + alpha) / Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.2)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (1.0 / (6.0 + (alpha * 5.0)));
else
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.2], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 - N[(4.0 / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6.2:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \frac{1}{6 + \alpha \cdot 5}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 - \frac{4}{\beta}}{\beta} \cdot \frac{1 + \alpha}{\beta + 2}\\
\end{array}
\end{array}
if beta < 6.20000000000000018Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 62.9%
*-commutative62.9%
Simplified62.9%
if 6.20000000000000018 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in alpha around 0 82.2%
associate-*r/82.5%
metadata-eval82.5%
Simplified82.2%
Final simplification69.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 6.0)
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(* (/ (- 1.0 (/ 4.0 beta)) beta) (/ (+ 1.0 alpha) (+ beta 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 6.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 - (4.0d0 / beta)) / beta) * ((1.0d0 + alpha) / (beta + 2.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 6.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 6.0: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 6.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 - Float64(4.0 / beta)) / beta) * Float64(Float64(1.0 + alpha) / Float64(beta + 2.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 6.0)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 - (4.0 / beta)) / beta) * ((1.0 + alpha) / (beta + 2.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 6.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 - N[(4.0 / beta), $MachinePrecision]), $MachinePrecision] / beta), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 6:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{1 - \frac{4}{\beta}}{\beta} \cdot \frac{1 + \alpha}{\beta + 2}\\
\end{array}
\end{array}
if beta < 6Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.8%
*-commutative60.8%
Simplified60.8%
if 6 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around inf 83.2%
mul-1-neg83.2%
Simplified83.2%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in alpha around 0 82.2%
associate-*r/82.5%
metadata-eval82.5%
Simplified82.2%
Final simplification67.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.0)
(*
(/ (+ 1.0 alpha) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* alpha -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) beta) (+ 3.0 (+ alpha beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / 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 <= 5.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (alpha * (-0.1388888888888889d0)))
else
tmp = ((1.0d0 + alpha) / 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 <= 5.0) {
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.0: tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889)) else: tmp = ((1.0 + alpha) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(alpha * -0.1388888888888889))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 5.0)
tmp = ((1.0 + alpha) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (alpha * -0.1388888888888889));
else
tmp = ((1.0 + alpha) / 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, 5.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(alpha * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 5:\\
\;\;\;\;\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \alpha \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 5Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.8%
*-commutative60.8%
Simplified60.8%
if 5 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
Simplified82.1%
Final simplification67.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ 3.0 (+ alpha beta)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / 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 <= 5.3d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / 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 <= 5.3) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (3.0 + (alpha + beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.3: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (3.0 + (alpha + beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.3) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / 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 <= 5.3)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((1.0 + alpha) / 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, 5.3], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $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 5.3:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{3 + \left(\alpha + \beta\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
div-inv60.6%
Applied egg-rr60.6%
if 5.29999999999999982 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
Simplified82.1%
Final simplification67.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.4) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.4d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.4) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.4: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.4) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.4)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.4], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.4:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.4000000000000004Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
div-inv60.6%
Applied egg-rr60.6%
if 5.4000000000000004 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around 0 81.9%
+-commutative81.9%
Simplified81.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.8) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.8d0) then
tmp = 0.16666666666666666d0 * (1.0d0 / (beta + 2.0d0))
else
tmp = ((1.0d0 + alpha) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.8) {
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.8: tmp = 0.16666666666666666 * (1.0 / (beta + 2.0)) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.8) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.8)
tmp = 0.16666666666666666 * (1.0 / (beta + 2.0));
else
tmp = ((1.0 + alpha) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.8], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.8:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.79999999999999982Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
div-inv60.6%
Applied egg-rr60.6%
if 7.79999999999999982 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in beta around inf 81.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 * (1.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 <= 5.3d0) then
tmp = 0.16666666666666666d0 * (1.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 <= 5.3) {
tmp = 0.16666666666666666 * (1.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 <= 5.3: tmp = 0.16666666666666666 * (1.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 <= 5.3) tmp = Float64(0.16666666666666666 * Float64(1.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 <= 5.3)
tmp = 0.16666666666666666 * (1.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, 5.3], N[(0.16666666666666666 * N[(1.0 / 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 5.3:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
div-inv60.6%
Applied egg-rr60.6%
if 5.29999999999999982 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around 0 82.1%
+-commutative82.1%
Simplified82.1%
Taylor expanded in alpha around 0 70.2%
associate-/r*72.5%
+-commutative72.5%
Simplified72.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.3) (* 0.16666666666666666 (/ 1.0 (+ beta 2.0))) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.3) {
tmp = 0.16666666666666666 * (1.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 <= 5.3d0) then
tmp = 0.16666666666666666d0 * (1.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 <= 5.3) {
tmp = 0.16666666666666666 * (1.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 <= 5.3: tmp = 0.16666666666666666 * (1.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 <= 5.3) tmp = Float64(0.16666666666666666 * Float64(1.0 / Float64(beta + 2.0))); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.3)
tmp = 0.16666666666666666 * (1.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, 5.3], N[(0.16666666666666666 * N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.3:\\
\;\;\;\;0.16666666666666666 \cdot \frac{1}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.29999999999999982Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
div-inv60.6%
Applied egg-rr60.6%
if 5.29999999999999982 < beta Initial program 83.0%
Taylor expanded in beta around inf 82.1%
Taylor expanded in alpha around 0 70.2%
+-commutative70.2%
Simplified70.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.6) (+ 0.08333333333333333 (* beta -0.041666666666666664)) (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.6d0) then
tmp = 0.08333333333333333d0 + (beta * (-0.041666666666666664d0))
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.6) {
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.6: tmp = 0.08333333333333333 + (beta * -0.041666666666666664) else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.6) tmp = Float64(0.08333333333333333 + Float64(beta * -0.041666666666666664)); else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.6)
tmp = 0.08333333333333333 + (beta * -0.041666666666666664);
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.6], N[(0.08333333333333333 + N[(beta * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.6:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.041666666666666664\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 1.6000000000000001Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
Taylor expanded in beta around 0 60.6%
*-commutative60.6%
Simplified60.6%
if 1.6000000000000001 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around 0 15.9%
Taylor expanded in alpha around 0 7.3%
+-commutative7.3%
Simplified7.3%
Taylor expanded in beta around inf 7.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.0) 0.08333333333333333 (/ 0.16666666666666666 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 0.16666666666666666d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.0) {
tmp = 0.08333333333333333;
} else {
tmp = 0.16666666666666666 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.0: tmp = 0.08333333333333333 else: tmp = 0.16666666666666666 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.0) tmp = 0.08333333333333333; else tmp = Float64(0.16666666666666666 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.0)
tmp = 0.08333333333333333;
else
tmp = 0.16666666666666666 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.0], 0.08333333333333333, N[(0.16666666666666666 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{0.16666666666666666}{\beta}\\
\end{array}
\end{array}
if beta < 2Initial program 99.8%
Simplified91.8%
times-frac99.7%
+-commutative99.7%
Applied egg-rr99.7%
Taylor expanded in beta around 0 97.9%
Taylor expanded in alpha around 0 60.6%
+-commutative60.6%
Simplified60.6%
Taylor expanded in beta around 0 60.6%
if 2 < beta Initial program 83.0%
Simplified61.9%
times-frac88.0%
+-commutative88.0%
Applied egg-rr88.0%
Taylor expanded in beta around 0 15.9%
Taylor expanded in alpha around 0 7.3%
+-commutative7.3%
Simplified7.3%
Taylor expanded in beta around inf 7.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ beta 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.16666666666666666d0 / (beta + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (beta + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (beta + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(beta + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (beta + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\beta + 2}
\end{array}
Initial program 94.4%
Simplified82.2%
times-frac96.0%
+-commutative96.0%
Applied egg-rr96.0%
Taylor expanded in beta around 0 71.6%
Taylor expanded in alpha around 0 43.5%
+-commutative43.5%
Simplified43.5%
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 94.4%
Simplified82.2%
times-frac96.0%
+-commutative96.0%
Applied egg-rr96.0%
Taylor expanded in beta around 0 71.6%
Taylor expanded in alpha around 0 43.5%
+-commutative43.5%
Simplified43.5%
Taylor expanded in beta around 0 42.4%
herbie shell --seed 2024116
(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)))