
(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 2.0) alpha))) (* (/ (+ 1.0 beta) t_0) (/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0))))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 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 + 2.0d0) + alpha
code = ((1.0d0 + beta) / t_0) * (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0)))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha return ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) return Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0)))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = ((1.0 + beta) / t_0) * (((1.0 + alpha) / t_0) / (beta + (alpha + 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[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\frac{1 + \beta}{t_0} \cdot \frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)}
\end{array}
\end{array}
Initial program 94.8%
associate-/l/93.2%
associate-+l+93.2%
+-commutative93.2%
associate-+r+93.2%
associate-+l+93.2%
distribute-rgt1-in93.2%
*-rgt-identity93.2%
distribute-lft-out93.2%
+-commutative93.2%
associate-*l/96.6%
*-commutative96.6%
associate-*r/93.3%
Simplified93.3%
associate-*r/96.5%
+-commutative96.5%
Applied egg-rr96.5%
+-commutative96.5%
*-commutative96.5%
+-commutative96.5%
associate-*r/96.5%
+-commutative96.5%
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 (+ (+ beta 2.0) alpha)))
(if (<= beta 4e+77)
(* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (* t_0 (+ alpha (+ beta 3.0)))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(- 1.0 (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 4e+77) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 4d+77) then
tmp = (1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 - (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 4e+77) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 4e+77: tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 3.0)))) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 4e+77) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 - Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 4e+77)
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / (t_0 * (alpha + (beta + 3.0))));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 4e+77], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 4 \cdot 10^{+77}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_0}}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 - \frac{\alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.99999999999999993e77Initial program 99.3%
associate-/l/99.0%
associate-+l+99.0%
+-commutative99.0%
associate-+r+99.0%
associate-+l+99.0%
distribute-rgt1-in99.0%
*-rgt-identity99.0%
distribute-lft-out99.0%
+-commutative99.0%
associate-*l/99.5%
*-commutative99.5%
associate-*r/95.3%
Simplified95.3%
if 3.99999999999999993e77 < beta Initial program 80.2%
associate-/l/73.9%
associate-+l+73.9%
+-commutative73.9%
associate-+r+73.9%
associate-+l+73.9%
distribute-rgt1-in73.9%
*-rgt-identity73.9%
distribute-lft-out73.9%
+-commutative73.9%
associate-*l/86.9%
*-commutative86.9%
associate-*r/86.9%
Simplified86.9%
associate-*r/86.9%
+-commutative86.9%
Applied egg-rr86.9%
+-commutative86.9%
*-commutative86.9%
+-commutative86.9%
associate-*r/86.9%
+-commutative86.9%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 83.6%
associate-*r/83.6%
distribute-lft-in83.6%
metadata-eval83.6%
neg-mul-183.6%
unsub-neg83.6%
Simplified83.6%
Taylor expanded in alpha around inf 83.6%
associate-*r/83.6%
mul-1-neg83.6%
Simplified83.6%
Final simplification92.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)) (t_1 (/ (+ 1.0 alpha) t_0)))
(if (<= beta 200000000.0)
(* (+ 1.0 beta) (/ t_1 (* t_0 (+ alpha (+ beta 3.0)))))
(* (/ t_1 (+ beta (+ alpha 3.0))) (+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 200000000.0) {
tmp = (1.0 + beta) * (t_1 / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (t_1 / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
t_1 = (1.0d0 + alpha) / t_0
if (beta <= 200000000.0d0) then
tmp = (1.0d0 + beta) * (t_1 / (t_0 * (alpha + (beta + 3.0d0))))
else
tmp = (t_1 / (beta + (alpha + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double t_1 = (1.0 + alpha) / t_0;
double tmp;
if (beta <= 200000000.0) {
tmp = (1.0 + beta) * (t_1 / (t_0 * (alpha + (beta + 3.0))));
} else {
tmp = (t_1 / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha t_1 = (1.0 + alpha) / t_0 tmp = 0 if beta <= 200000000.0: tmp = (1.0 + beta) * (t_1 / (t_0 * (alpha + (beta + 3.0)))) else: tmp = (t_1 / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) t_1 = Float64(Float64(1.0 + alpha) / t_0) tmp = 0.0 if (beta <= 200000000.0) tmp = Float64(Float64(1.0 + beta) * Float64(t_1 / Float64(t_0 * Float64(alpha + Float64(beta + 3.0))))); else tmp = Float64(Float64(t_1 / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
t_1 = (1.0 + alpha) / t_0;
tmp = 0.0;
if (beta <= 200000000.0)
tmp = (1.0 + beta) * (t_1 / (t_0 * (alpha + (beta + 3.0))));
else
tmp = (t_1 / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, Block[{t$95$1 = N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision]}, If[LessEqual[beta, 200000000.0], N[(N[(1.0 + beta), $MachinePrecision] * N[(t$95$1 / N[(t$95$0 * N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
t_1 := \frac{1 + \alpha}{t_0}\\
\mathbf{if}\;\beta \leq 200000000:\\
\;\;\;\;\left(1 + \beta\right) \cdot \frac{t_1}{t_0 \cdot \left(\alpha + \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{t_1}{\beta + \left(\alpha + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 2e8Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*r/99.5%
associate-*r/99.5%
Simplified99.6%
if 2e8 < beta Initial program 83.5%
associate-/l/78.6%
associate-+l+78.6%
+-commutative78.6%
associate-+r+78.6%
associate-+l+78.6%
distribute-rgt1-in78.6%
*-rgt-identity78.6%
distribute-lft-out78.6%
+-commutative78.6%
associate-*l/89.8%
*-commutative89.8%
associate-*r/89.8%
Simplified89.8%
associate-*r/89.8%
+-commutative89.8%
Applied egg-rr89.8%
+-commutative89.8%
*-commutative89.8%
+-commutative89.8%
associate-*r/89.8%
+-commutative89.8%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 79.9%
associate-*r/79.9%
distribute-lft-in79.9%
metadata-eval79.9%
neg-mul-179.9%
unsub-neg79.9%
Simplified79.9%
Final simplification93.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 1150000000.0)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1150000000.0) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1150000000.0d0) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 + (((-1.0d0) - alpha) / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1150000000.0) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1150000000.0: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1150000000.0) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1150000000.0)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1150000000.0], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 1150000000:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1.15e9Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*l/99.5%
*-commutative99.5%
associate-*r/94.9%
Simplified94.9%
associate-*r/99.5%
+-commutative99.5%
Applied egg-rr99.5%
+-commutative99.5%
*-commutative99.5%
+-commutative99.5%
associate-*r/99.5%
+-commutative99.5%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 70.1%
if 1.15e9 < beta Initial program 83.5%
associate-/l/78.6%
associate-+l+78.6%
+-commutative78.6%
associate-+r+78.6%
associate-+l+78.6%
distribute-rgt1-in78.6%
*-rgt-identity78.6%
distribute-lft-out78.6%
+-commutative78.6%
associate-*l/89.8%
*-commutative89.8%
associate-*r/89.8%
Simplified89.8%
associate-*r/89.8%
+-commutative89.8%
Applied egg-rr89.8%
+-commutative89.8%
*-commutative89.8%
+-commutative89.8%
associate-*r/89.8%
+-commutative89.8%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 79.9%
associate-*r/79.9%
distribute-lft-in79.9%
metadata-eval79.9%
neg-mul-179.9%
unsub-neg79.9%
Simplified79.9%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 3.5e+73)
(* (/ (+ 1.0 beta) (+ beta 3.0)) (/ (+ 1.0 alpha) (* t_0 t_0)))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(- 1.0 (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3.5e+73) {
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 3.5d+73) then
tmp = ((1.0d0 + beta) / (beta + 3.0d0)) * ((1.0d0 + alpha) / (t_0 * t_0))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 - (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 3.5e+73) {
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 3.5e+73: tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0)) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 3.5e+73) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(beta + 3.0)) * Float64(Float64(1.0 + alpha) / Float64(t_0 * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 - Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 3.5e+73)
tmp = ((1.0 + beta) / (beta + 3.0)) * ((1.0 + alpha) / (t_0 * t_0));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 3.5e+73], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 + alpha), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 3.5 \cdot 10^{+73}:\\
\;\;\;\;\frac{1 + \beta}{\beta + 3} \cdot \frac{1 + \alpha}{t_0 \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 - \frac{\alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.50000000000000002e73Initial program 99.3%
associate-/l/99.0%
associate-/l/94.8%
associate-+l+94.8%
+-commutative94.8%
associate-+r+94.8%
associate-+l+94.8%
distribute-rgt1-in94.8%
*-rgt-identity94.8%
distribute-lft-out94.8%
+-commutative94.8%
times-frac99.5%
Simplified99.5%
Taylor expanded in alpha around 0 82.8%
if 3.50000000000000002e73 < beta Initial program 80.8%
associate-/l/74.7%
associate-+l+74.7%
+-commutative74.7%
associate-+r+74.7%
associate-+l+74.7%
distribute-rgt1-in74.7%
*-rgt-identity74.7%
distribute-lft-out74.7%
+-commutative74.7%
associate-*l/87.2%
*-commutative87.2%
associate-*r/87.3%
Simplified87.3%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
+-commutative87.2%
*-commutative87.2%
+-commutative87.2%
associate-*r/87.2%
+-commutative87.2%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 84.1%
associate-*r/84.1%
distribute-lft-in84.1%
metadata-eval84.1%
neg-mul-184.1%
unsub-neg84.1%
Simplified84.1%
Taylor expanded in alpha around inf 84.1%
associate-*r/84.1%
mul-1-neg84.1%
Simplified84.1%
Final simplification83.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ (+ beta 2.0) alpha)))
(if (<= beta 1e+15)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(*
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0)))
(- 1.0 (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = (beta + 2.0d0) + alpha
if (beta <= 1d+15) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))) * (1.0d0 - (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (beta + 2.0) + alpha;
double tmp;
if (beta <= 1e+15) {
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (beta + 2.0) + alpha tmp = 0 if beta <= 1e+15: tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(beta + 2.0) + alpha) tmp = 0.0 if (beta <= 1e+15) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))) * Float64(1.0 - Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = (beta + 2.0) + alpha;
tmp = 0.0;
if (beta <= 1e+15)
tmp = ((1.0 + beta) / t_0) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (((1.0 + alpha) / t_0) / (beta + (alpha + 3.0))) * (1.0 - (alpha / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]}, If[LessEqual[beta, 1e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\beta + 2\right) + \alpha\\
\mathbf{if}\;\beta \leq 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t_0}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 - \frac{\alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 1e15Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*l/99.5%
*-commutative99.5%
associate-*r/94.9%
Simplified94.9%
associate-*r/99.5%
+-commutative99.5%
Applied egg-rr99.5%
+-commutative99.5%
*-commutative99.5%
+-commutative99.5%
associate-*r/99.5%
+-commutative99.5%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 69.9%
if 1e15 < beta Initial program 83.0%
associate-/l/78.0%
associate-+l+78.0%
+-commutative78.0%
associate-+r+78.0%
associate-+l+78.0%
distribute-rgt1-in78.0%
*-rgt-identity78.0%
distribute-lft-out78.0%
+-commutative78.0%
associate-*l/89.5%
*-commutative89.5%
associate-*r/89.6%
Simplified89.6%
associate-*r/89.5%
+-commutative89.5%
Applied egg-rr89.5%
+-commutative89.5%
*-commutative89.5%
+-commutative89.5%
associate-*r/89.6%
+-commutative89.6%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 80.6%
associate-*r/80.6%
distribute-lft-in80.6%
metadata-eval80.6%
neg-mul-180.6%
unsub-neg80.6%
Simplified80.6%
Taylor expanded in alpha around inf 80.6%
associate-*r/80.6%
mul-1-neg80.6%
Simplified80.6%
Final simplification73.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 9.5)
(*
(+ 1.0 alpha)
(/ 1.0 (* (+ beta (+ 2.0 alpha)) (* (+ alpha 3.0) (+ 2.0 alpha)))))
(/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5) {
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
} 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 <= 9.5d0) then
tmp = (1.0d0 + alpha) * (1.0d0 / ((beta + (2.0d0 + alpha)) * ((alpha + 3.0d0) * (2.0d0 + alpha))))
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 <= 9.5) {
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
} 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 <= 9.5: tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha)))) 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 <= 9.5) tmp = Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(Float64(beta + Float64(2.0 + alpha)) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha))))); 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 <= 9.5)
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
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, 9.5], N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $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 9.5:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{1}{\left(\beta + \left(2 + \alpha\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 9.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
div-inv93.4%
+-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
+-commutative93.4%
Applied egg-rr93.4%
if 9.5 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification88.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5.5)
(*
(+ 1.0 alpha)
(/ 1.0 (* (+ beta (+ 2.0 alpha)) (* (+ alpha 3.0) (+ 2.0 alpha)))))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.5d0) then
tmp = (1.0d0 + alpha) * (1.0d0 / ((beta + (2.0d0 + alpha)) * ((alpha + 3.0d0) * (2.0d0 + alpha))))
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.5) {
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.5: tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha)))) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.5) tmp = Float64(Float64(1.0 + alpha) * Float64(1.0 / Float64(Float64(beta + Float64(2.0 + alpha)) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha))))); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.5)
tmp = (1.0 + alpha) * (1.0 / ((beta + (2.0 + alpha)) * ((alpha + 3.0) * (2.0 + alpha))));
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.5], N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 / N[(N[(beta + N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.5:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{1}{\left(\beta + \left(2 + \alpha\right)\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
div-inv93.4%
+-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
+-commutative93.4%
Applied egg-rr93.4%
if 5.5 < beta Initial program 84.1%
associate-/l/79.4%
associate-+l+79.4%
+-commutative79.4%
associate-+r+79.4%
associate-+l+79.4%
distribute-rgt1-in79.4%
*-rgt-identity79.4%
distribute-lft-out79.4%
+-commutative79.4%
associate-*l/90.2%
*-commutative90.2%
associate-*r/90.2%
Simplified90.2%
associate-*r/90.2%
+-commutative90.2%
Applied egg-rr90.2%
+-commutative90.2%
*-commutative90.2%
+-commutative90.2%
associate-*r/90.2%
+-commutative90.2%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 78.6%
associate-*r/78.6%
distribute-lft-in78.6%
metadata-eval78.6%
neg-mul-178.6%
unsub-neg78.6%
Simplified78.6%
Taylor expanded in beta around inf 77.0%
Final simplification88.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.85e+15)
(*
(/ (+ 1.0 beta) (+ (+ beta 2.0) alpha))
(/ 1.0 (* (+ beta 2.0) (+ beta 3.0))))
(*
(+ 1.0 (/ (- -1.0 alpha) beta))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) + alpha)) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.85d+15) then
tmp = ((1.0d0 + beta) / ((beta + 2.0d0) + alpha)) * (1.0d0 / ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = (1.0d0 + (((-1.0d0) - alpha) / beta)) * (((1.0d0 + alpha) / beta) / (beta + (alpha + 3.0d0)))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85e+15) {
tmp = ((1.0 + beta) / ((beta + 2.0) + alpha)) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.85e+15: tmp = ((1.0 + beta) / ((beta + 2.0) + alpha)) * (1.0 / ((beta + 2.0) * (beta + 3.0))) else: tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0))) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.85e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) + alpha)) * Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(1.0 + Float64(Float64(-1.0 - alpha) / beta)) * Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + Float64(alpha + 3.0)))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.85e+15)
tmp = ((1.0 + beta) / ((beta + 2.0) + alpha)) * (1.0 / ((beta + 2.0) * (beta + 3.0)));
else
tmp = (1.0 + ((-1.0 - alpha) / beta)) * (((1.0 + alpha) / beta) / (beta + (alpha + 3.0)));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.85e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision]), $MachinePrecision] * N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + N[(N[(-1.0 - alpha), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.85 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) + \alpha} \cdot \frac{1}{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\left(1 + \frac{-1 - \alpha}{\beta}\right) \cdot \frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.85e15Initial program 99.8%
associate-/l/99.5%
associate-+l+99.5%
+-commutative99.5%
associate-+r+99.5%
associate-+l+99.5%
distribute-rgt1-in99.5%
*-rgt-identity99.5%
distribute-lft-out99.5%
+-commutative99.5%
associate-*l/99.5%
*-commutative99.5%
associate-*r/94.9%
Simplified94.9%
associate-*r/99.5%
+-commutative99.5%
Applied egg-rr99.5%
+-commutative99.5%
*-commutative99.5%
+-commutative99.5%
associate-*r/99.5%
+-commutative99.5%
associate-/r*99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 69.9%
if 1.85e15 < beta Initial program 83.0%
associate-/l/78.0%
associate-+l+78.0%
+-commutative78.0%
associate-+r+78.0%
associate-+l+78.0%
distribute-rgt1-in78.0%
*-rgt-identity78.0%
distribute-lft-out78.0%
+-commutative78.0%
associate-*l/89.5%
*-commutative89.5%
associate-*r/89.6%
Simplified89.6%
associate-*r/89.5%
+-commutative89.5%
Applied egg-rr89.5%
+-commutative89.5%
*-commutative89.5%
+-commutative89.5%
associate-*r/89.6%
+-commutative89.6%
associate-/r*99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around inf 80.6%
associate-*r/80.6%
distribute-lft-in80.6%
metadata-eval80.6%
neg-mul-180.6%
unsub-neg80.6%
Simplified80.6%
Taylor expanded in beta around inf 80.1%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))))
(if (<= beta 4.5)
(* (/ (+ 1.0 beta) t_0) (/ 1.0 (+ 4.0 (* beta 4.0))))
(/ (/ (- alpha -1.0) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + beta) / t_0) * (1.0 / (4.0 + (beta * 4.0)));
} else {
tmp = ((alpha - -1.0) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
if (beta <= 4.5d0) then
tmp = ((1.0d0 + beta) / t_0) * (1.0d0 / (4.0d0 + (beta * 4.0d0)))
else
tmp = ((alpha - (-1.0d0)) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double tmp;
if (beta <= 4.5) {
tmp = ((1.0 + beta) / t_0) * (1.0 / (4.0 + (beta * 4.0)));
} else {
tmp = ((alpha - -1.0) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) tmp = 0 if beta <= 4.5: tmp = ((1.0 + beta) / t_0) * (1.0 / (4.0 + (beta * 4.0))) else: tmp = ((alpha - -1.0) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) tmp = 0.0 if (beta <= 4.5) tmp = Float64(Float64(Float64(1.0 + beta) / t_0) * Float64(1.0 / Float64(4.0 + Float64(beta * 4.0)))); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
tmp = 0.0;
if (beta <= 4.5)
tmp = ((1.0 + beta) / t_0) * (1.0 / (4.0 + (beta * 4.0)));
else
tmp = ((alpha - -1.0) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 4.5], N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 / N[(4.0 + N[(beta * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
\mathbf{if}\;\beta \leq 4.5:\\
\;\;\;\;\frac{1 + \beta}{t_0} \cdot \frac{1}{4 + \beta \cdot 4}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{t_0}\\
\end{array}
\end{array}
if beta < 4.5Initial program 99.8%
associate-/l/99.5%
associate-/l/94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
+-commutative94.9%
times-frac99.4%
Simplified99.5%
Taylor expanded in beta around 0 98.6%
Taylor expanded in alpha around 0 69.8%
*-commutative69.8%
Simplified69.8%
if 4.5 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification72.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.0) (/ (+ 1.0 alpha) (* (+ (+ beta 2.0) alpha) (* (+ alpha 3.0) (+ 2.0 alpha)))) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
} 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 <= 7.0d0) then
tmp = (1.0d0 + alpha) / (((beta + 2.0d0) + alpha) * ((alpha + 3.0d0) * (2.0d0 + alpha)))
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 <= 7.0) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
} 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 <= 7.0: tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha))) 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 <= 7.0) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(Float64(alpha + 3.0) * Float64(2.0 + alpha)))); 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 <= 7.0)
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * ((alpha + 3.0) * (2.0 + alpha)));
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, 7.0], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(N[(alpha + 3.0), $MachinePrecision] * N[(2.0 + alpha), $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 7:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(\left(\alpha + 3\right) \cdot \left(2 + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 7Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
if 7 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification88.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 6.4) (/ (+ 1.0 alpha) (* (+ (+ beta 2.0) alpha) (+ 6.0 (* alpha 5.0)))) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 6.4) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
} 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 <= 6.4d0) then
tmp = (1.0d0 + alpha) / (((beta + 2.0d0) + alpha) * (6.0d0 + (alpha * 5.0d0)))
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 <= 6.4) {
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
} 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 <= 6.4: tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0))) 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 <= 6.4) tmp = Float64(Float64(1.0 + alpha) / Float64(Float64(Float64(beta + 2.0) + alpha) * Float64(6.0 + Float64(alpha * 5.0)))); 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 <= 6.4)
tmp = (1.0 + alpha) / (((beta + 2.0) + alpha) * (6.0 + (alpha * 5.0)));
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, 6.4], N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(N[(beta + 2.0), $MachinePrecision] + alpha), $MachinePrecision] * N[(6.0 + N[(alpha * 5.0), $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 6.4:\\
\;\;\;\;\frac{1 + \alpha}{\left(\left(\beta + 2\right) + \alpha\right) \cdot \left(6 + \alpha \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 6.4000000000000004Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 82.0%
if 6.4000000000000004 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification80.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.4) (/ (+ 1.0 beta) (* (+ beta 3.0) (+ 4.0 (* beta 4.0)))) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.4) {
tmp = (1.0 + beta) / ((beta + 3.0) * (4.0 + (beta * 4.0)));
} 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.4d0) then
tmp = (1.0d0 + beta) / ((beta + 3.0d0) * (4.0d0 + (beta * 4.0d0)))
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.4) {
tmp = (1.0 + beta) / ((beta + 3.0) * (4.0 + (beta * 4.0)));
} 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.4: tmp = (1.0 + beta) / ((beta + 3.0) * (4.0 + (beta * 4.0))) 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.4) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 3.0) * Float64(4.0 + Float64(beta * 4.0)))); 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.4)
tmp = (1.0 + beta) / ((beta + 3.0) * (4.0 + (beta * 4.0)));
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.4], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 3.0), $MachinePrecision] * N[(4.0 + N[(beta * 4.0), $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.4:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 3\right) \cdot \left(4 + \beta \cdot 4\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.4000000000000004Initial program 99.8%
associate-/l/99.5%
associate-/l/94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
+-commutative94.9%
times-frac99.4%
Simplified99.5%
Taylor expanded in beta around 0 98.6%
Taylor expanded in alpha around 0 68.5%
if 4.4000000000000004 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification71.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (- alpha -1.0) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((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 <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
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 <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} 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 <= 5.2: tmp = 0.16666666666666666 / (beta + 2.0) 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 <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); 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 <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.0);
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, 5.2], N[(0.16666666666666666 / N[(beta + 2.0), $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 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 5.20000000000000018 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
*-un-lft-identity77.4%
mul-1-neg77.4%
fma-neg77.4%
metadata-eval77.4%
metadata-eval77.4%
associate-+l+77.4%
metadata-eval77.4%
associate-+r+77.4%
Applied egg-rr77.4%
*-lft-identity77.4%
metadata-eval77.4%
fma-neg77.4%
distribute-neg-frac77.4%
sub-neg77.4%
neg-mul-177.4%
distribute-neg-in77.4%
+-commutative77.4%
mul-1-neg77.4%
distribute-lft-in77.4%
metadata-eval77.4%
neg-mul-177.4%
unsub-neg77.4%
+-commutative77.4%
Simplified77.4%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 5.2) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 5.2d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 1.0d0 / (beta * (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 5.2) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5.2: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5.2) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 5.2)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 1.0 / (beta * (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 5.2], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5.2:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 5.20000000000000018Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 5.20000000000000018 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
Taylor expanded in alpha around 0 73.6%
Final simplification69.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.5) (/ 0.16666666666666666 (+ beta 2.0)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = 0.16666666666666666 / (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 <= 8.5d0) then
tmp = 0.16666666666666666d0 / (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 <= 8.5) {
tmp = 0.16666666666666666 / (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 <= 8.5: tmp = 0.16666666666666666 / (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 <= 8.5) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.5)
tmp = 0.16666666666666666 / (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, 8.5], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 8.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 8.5 < beta Initial program 84.1%
associate-/l/79.4%
associate-/l/68.0%
associate-+l+68.0%
+-commutative68.0%
associate-+r+68.0%
associate-+l+68.0%
distribute-rgt1-in68.0%
*-rgt-identity68.0%
distribute-lft-out68.0%
+-commutative68.0%
times-frac90.2%
Simplified90.2%
Taylor expanded in alpha around 0 86.6%
Taylor expanded in beta around inf 76.2%
unpow276.2%
Simplified76.2%
Final simplification70.8%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8.5) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (- alpha -1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 8.5d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = ((alpha - (-1.0d0)) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 8.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = ((alpha - -1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8.5: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = ((alpha - -1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8.5) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(alpha - -1.0) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 8.5)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = ((alpha - -1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 8.5], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8.5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\alpha - -1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 8.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 8.5 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
Taylor expanded in beta around inf 77.1%
*-un-lft-identity77.1%
mul-1-neg77.1%
fma-neg77.1%
metadata-eval77.1%
Applied egg-rr77.1%
*-lft-identity77.1%
metadata-eval77.1%
fma-neg77.1%
distribute-neg-frac77.1%
sub-neg77.1%
mul-1-neg77.1%
distribute-neg-in77.1%
+-commutative77.1%
mul-1-neg77.1%
distribute-lft-in77.1%
metadata-eval77.1%
mul-1-neg77.1%
sub-neg77.1%
Simplified77.1%
Final simplification71.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.5) (/ 0.16666666666666666 (+ beta 2.0)) (/ (/ (- -1.0) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (-(-1.0) / beta) / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.5d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = (-(-1.0d0) / beta) / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = (-(-1.0) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.5: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = (-(-1.0) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.5) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(Float64(Float64(-(-1.0)) / beta) / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.5)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = (-(-1.0) / beta) / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.5], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[((--1.0) / beta), $MachinePrecision] / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{--1}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 7.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 7.5 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
Taylor expanded in beta around inf 77.1%
Taylor expanded in alpha around 0 74.5%
Final simplification70.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 7.5) (/ 0.16666666666666666 (+ beta 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 7.5d0) then
tmp = 0.16666666666666666d0 / (beta + 2.0d0)
else
tmp = 1.0d0 / (beta * beta)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 7.5) {
tmp = 0.16666666666666666 / (beta + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 7.5: tmp = 0.16666666666666666 / (beta + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 7.5) tmp = Float64(0.16666666666666666 / Float64(beta + 2.0)); else tmp = Float64(1.0 / Float64(beta * beta)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 7.5)
tmp = 0.16666666666666666 / (beta + 2.0);
else
tmp = 1.0 / (beta * beta);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 7.5], N[(0.16666666666666666 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta * beta), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 7.5:\\
\;\;\;\;\frac{0.16666666666666666}{\beta + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 7.5Initial program 99.8%
associate-/l/99.5%
associate-/r*94.9%
associate-+l+94.9%
+-commutative94.9%
associate-+r+94.9%
associate-+l+94.9%
distribute-rgt1-in94.9%
*-rgt-identity94.9%
distribute-lft-out94.9%
*-commutative94.9%
metadata-eval94.9%
associate-+l+94.9%
+-commutative94.9%
Simplified94.9%
Taylor expanded in beta around 0 93.3%
Taylor expanded in beta around 0 93.4%
+-commutative93.4%
Simplified93.4%
Taylor expanded in alpha around 0 68.2%
if 7.5 < beta Initial program 84.1%
Taylor expanded in beta around -inf 77.4%
Taylor expanded in beta around inf 77.1%
Taylor expanded in alpha around 0 73.5%
unpow273.5%
Simplified73.5%
Final simplification69.9%
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.8%
associate-/l/93.2%
associate-/r*86.4%
associate-+l+86.4%
+-commutative86.4%
associate-+r+86.4%
associate-+l+86.4%
distribute-rgt1-in86.4%
*-rgt-identity86.4%
distribute-lft-out86.4%
*-commutative86.4%
metadata-eval86.4%
associate-+l+86.4%
+-commutative86.4%
Simplified86.4%
Taylor expanded in beta around 0 81.3%
Taylor expanded in beta around 0 70.6%
+-commutative70.6%
Simplified70.6%
Taylor expanded in alpha around 0 48.7%
Final simplification48.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ -1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return -1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (-1.0d0) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return -1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return -1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(-1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = -1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(-1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{-1}{\beta}
\end{array}
Initial program 94.8%
associate-/l/93.2%
associate-+l+93.2%
+-commutative93.2%
associate-+r+93.2%
associate-+l+93.2%
distribute-rgt1-in93.2%
*-rgt-identity93.2%
distribute-lft-out93.2%
+-commutative93.2%
associate-*l/96.6%
*-commutative96.6%
associate-*r/93.3%
Simplified93.3%
associate-*r/96.5%
+-commutative96.5%
Applied egg-rr96.5%
+-commutative96.5%
*-commutative96.5%
+-commutative96.5%
associate-*r/96.5%
+-commutative96.5%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 26.7%
associate-*r/26.7%
distribute-lft-in26.7%
metadata-eval26.7%
neg-mul-126.7%
unsub-neg26.7%
Simplified26.7%
Taylor expanded in alpha around inf 3.4%
Final simplification3.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ -0.16666666666666666 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return -0.16666666666666666 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = (-0.16666666666666666d0) / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return -0.16666666666666666 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return -0.16666666666666666 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(-0.16666666666666666 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = -0.16666666666666666 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(-0.16666666666666666 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{-0.16666666666666666}{\beta}
\end{array}
Initial program 94.8%
associate-/l/93.2%
associate-+l+93.2%
+-commutative93.2%
associate-+r+93.2%
associate-+l+93.2%
distribute-rgt1-in93.2%
*-rgt-identity93.2%
distribute-lft-out93.2%
+-commutative93.2%
associate-*l/96.6%
*-commutative96.6%
associate-*r/93.3%
Simplified93.3%
associate-*r/96.5%
+-commutative96.5%
Applied egg-rr96.5%
+-commutative96.5%
*-commutative96.5%
+-commutative96.5%
associate-*r/96.5%
+-commutative96.5%
associate-/r*99.8%
+-commutative99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 26.7%
associate-*r/26.7%
distribute-lft-in26.7%
metadata-eval26.7%
neg-mul-126.7%
unsub-neg26.7%
Simplified26.7%
Taylor expanded in alpha around 0 25.5%
Taylor expanded in beta around 0 3.4%
Final simplification3.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 1.0 beta))
assert(alpha < beta);
double code(double alpha, double beta) {
return 1.0 / beta;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 1.0d0 / beta
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 1.0 / beta;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 1.0 / beta
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(1.0 / beta) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 1.0 / beta;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(1.0 / beta), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{1}{\beta}
\end{array}
Initial program 94.8%
Taylor expanded in beta around -inf 26.5%
Taylor expanded in alpha around inf 4.2%
Final simplification4.2%
herbie shell --seed 2023201
(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)))