
(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 20 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) (* 2.0 1.0)))) (/ (/ (/ (+ (+ (+ alpha beta) (* beta alpha)) 1.0) t_0) t_0) (+ t_0 1.0))))
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = (alpha + beta) + (2.0d0 * 1.0d0)
code = (((((alpha + beta) + (beta * alpha)) + 1.0d0) / t_0) / t_0) / (t_0 + 1.0d0)
end function
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + (2.0 * 1.0);
return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0);
}
def code(alpha, beta): t_0 = (alpha + beta) + (2.0 * 1.0) return (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0)
function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * 1.0)) return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) + Float64(beta * alpha)) + 1.0) / t_0) / t_0) / Float64(t_0 + 1.0)) end
function tmp = code(alpha, beta) t_0 = (alpha + beta) + (2.0 * 1.0); tmp = (((((alpha + beta) + (beta * alpha)) + 1.0) / t_0) / t_0) / (t_0 + 1.0); end
code[alpha_, beta_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] + N[(beta * alpha), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2 \cdot 1\\
\frac{\frac{\frac{\left(\left(\alpha + \beta\right) + \beta \cdot \alpha\right) + 1}{t_0}}{t_0}}{t_0 + 1}
\end{array}
\end{array}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 5e+39)
(/ (* (+ 1.0 alpha) (+ 1.0 beta)) (* t_0 (* (+ alpha (+ beta 3.0)) t_0)))
(/
(/
(/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0))
(+ 1.0 (/ (- alpha -1.0) beta)))
(+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 5e+39) {
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 5d+39) then
tmp = ((1.0d0 + alpha) * (1.0d0 + beta)) / (t_0 * ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = (((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (1.0d0 + ((alpha - (-1.0d0)) / beta))) / (beta + (alpha + 3.0d0))
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 <= 5e+39) {
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 5e+39: tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_0 * ((alpha + (beta + 3.0)) * t_0)) else: tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 5e+39) tmp = Float64(Float64(Float64(1.0 + alpha) * Float64(1.0 + beta)) / Float64(t_0 * Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + beta) + 2.0)) / Float64(1.0 + Float64(Float64(alpha - -1.0) / beta))) / Float64(beta + Float64(alpha + 3.0))); 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 <= 5e+39)
tmp = ((1.0 + alpha) * (1.0 + beta)) / (t_0 * ((alpha + (beta + 3.0)) * t_0));
else
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 5e+39], N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $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 5 \cdot 10^{+39}:\\
\;\;\;\;\frac{\left(1 + \alpha\right) \cdot \left(1 + \beta\right)}{t_0 \cdot \left(\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{1 + \frac{\alpha - -1}{\beta}}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.00000000000000015e39Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
if 5.00000000000000015e39 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
div-inv99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.8%
*-rgt-identity99.8%
associate-/l*99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around -inf 99.8%
mul-1-neg99.8%
unsub-neg99.8%
distribute-lft-in99.8%
metadata-eval99.8%
associate-+r+99.8%
metadata-eval99.8%
mul-1-neg99.8%
unsub-neg99.8%
Simplified99.8%
Final simplification93.2%
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 2e+135)
(* (+ 1.0 alpha) (/ (/ (+ 1.0 beta) t_0) (* (+ alpha (+ beta 3.0)) t_0)))
(/
(/
(/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0))
(+ 1.0 (/ (- alpha -1.0) beta)))
(+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2e+135) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 2d+135) then
tmp = (1.0d0 + alpha) * (((1.0d0 + beta) / t_0) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = (((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (1.0d0 + ((alpha - (-1.0d0)) / beta))) / (beta + (alpha + 3.0d0))
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 <= 2e+135) {
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 2e+135: tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2e+135) tmp = Float64(Float64(1.0 + alpha) * Float64(Float64(Float64(1.0 + beta) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + beta) + 2.0)) / Float64(1.0 + Float64(Float64(alpha - -1.0) / beta))) / Float64(beta + Float64(alpha + 3.0))); 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 <= 2e+135)
tmp = (1.0 + alpha) * (((1.0 + beta) / t_0) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2e+135], N[(N[(1.0 + alpha), $MachinePrecision] * N[(N[(N[(1.0 + beta), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $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 2 \cdot 10^{+135}:\\
\;\;\;\;\left(1 + \alpha\right) \cdot \frac{\frac{1 + \beta}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{1 + \frac{\alpha - -1}{\beta}}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.99999999999999992e135Initial program 98.8%
associate-/l/98.1%
associate-+l+98.1%
+-commutative98.1%
associate-+r+98.1%
associate-+l+98.1%
distribute-rgt1-in98.1%
*-rgt-identity98.1%
distribute-lft-out98.1%
+-commutative98.1%
associate-*l/99.1%
*-commutative99.1%
associate-*r/92.2%
Simplified92.2%
if 1.99999999999999992e135 < beta Initial program 75.9%
associate-/l/67.1%
associate-+l+67.1%
+-commutative67.1%
associate-+r+67.1%
associate-+l+67.1%
distribute-rgt1-in67.1%
*-rgt-identity67.1%
distribute-lft-out67.1%
+-commutative67.1%
associate-*l/80.1%
*-commutative80.1%
associate-*r/80.2%
Simplified80.2%
associate-*r/80.1%
+-commutative80.1%
Applied egg-rr80.1%
associate-/r*99.9%
associate-*r/75.9%
+-commutative75.9%
+-commutative75.9%
*-commutative75.9%
+-commutative75.9%
+-commutative75.9%
associate-*r/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Simplified99.9%
div-inv99.9%
+-commutative99.9%
*-commutative99.9%
+-commutative99.9%
+-commutative99.9%
+-commutative99.9%
Applied egg-rr99.9%
associate-*r/99.9%
*-rgt-identity99.9%
associate-/l*99.9%
associate-+r+99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
Simplified99.9%
Taylor expanded in beta around -inf 99.9%
mul-1-neg99.9%
unsub-neg99.9%
distribute-lft-in99.9%
metadata-eval99.9%
associate-+r+99.9%
metadata-eval99.9%
mul-1-neg99.9%
unsub-neg99.9%
Simplified99.9%
Final simplification93.7%
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 40000000.0)
(* (+ 1.0 beta) (/ (/ (+ 1.0 alpha) t_0) (* (+ alpha (+ beta 3.0)) t_0)))
(/
(/
(/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0))
(+ 1.0 (/ (- alpha -1.0) beta)))
(+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 40000000.0) {
tmp = (1.0 + beta) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 40000000.0d0) then
tmp = (1.0d0 + beta) * (((1.0d0 + alpha) / t_0) / ((alpha + (beta + 3.0d0)) * t_0))
else
tmp = (((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (1.0d0 + ((alpha - (-1.0d0)) / beta))) / (beta + (alpha + 3.0d0))
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 <= 40000000.0) {
tmp = (1.0 + beta) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 40000000.0: tmp = (1.0 + beta) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0)) else: tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 40000000.0) tmp = Float64(Float64(1.0 + beta) * Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(Float64(alpha + Float64(beta + 3.0)) * t_0))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + beta) + 2.0)) / Float64(1.0 + Float64(Float64(alpha - -1.0) / beta))) / Float64(beta + Float64(alpha + 3.0))); 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 <= 40000000.0)
tmp = (1.0 + beta) * (((1.0 + alpha) / t_0) / ((alpha + (beta + 3.0)) * t_0));
else
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 40000000.0], N[(N[(1.0 + beta), $MachinePrecision] * N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $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 40000000:\\
\;\;\;\;\left(1 + \beta\right) \cdot \frac{\frac{1 + \alpha}{t_0}}{\left(\alpha + \left(\beta + 3\right)\right) \cdot t_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{1 + \frac{\alpha - -1}{\beta}}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 4e7Initial program 99.8%
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-*r/99.0%
associate-*r/99.0%
Simplified99.0%
if 4e7 < beta Initial program 83.4%
associate-/l/78.2%
associate-+l+78.2%
+-commutative78.2%
associate-+r+78.2%
associate-+l+78.2%
distribute-rgt1-in78.2%
*-rgt-identity78.2%
distribute-lft-out78.2%
+-commutative78.2%
associate-*l/88.2%
*-commutative88.2%
associate-*r/87.1%
Simplified87.1%
associate-*r/88.2%
+-commutative88.2%
Applied egg-rr88.2%
associate-/r*99.7%
associate-*r/83.4%
+-commutative83.4%
+-commutative83.4%
*-commutative83.4%
+-commutative83.4%
+-commutative83.4%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
div-inv99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.7%
*-rgt-identity99.7%
associate-/l*99.7%
associate-+r+99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around -inf 99.8%
mul-1-neg99.8%
unsub-neg99.8%
distribute-lft-in99.8%
metadata-eval99.8%
associate-+r+99.8%
metadata-eval99.8%
mul-1-neg99.8%
unsub-neg99.8%
Simplified99.8%
Final simplification99.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 5e+39)
(/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))))
(/
(/
(/ (+ 1.0 alpha) (+ (+ alpha beta) 2.0))
(+ 1.0 (/ (- alpha -1.0) beta)))
(+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 5e+39) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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 <= 5d+39) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = (((1.0d0 + alpha) / ((alpha + beta) + 2.0d0)) / (1.0d0 + ((alpha - (-1.0d0)) / 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 <= 5e+39) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 5e+39: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / beta))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 5e+39) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(Float64(alpha + beta) + 2.0)) / Float64(1.0 + Float64(Float64(alpha - -1.0) / 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 <= 5e+39)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = (((1.0 + alpha) / ((alpha + beta) + 2.0)) / (1.0 + ((alpha - -1.0) / 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, 5e+39], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(N[(alpha - -1.0), $MachinePrecision] / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 5 \cdot 10^{+39}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1 + \alpha}{\left(\alpha + \beta\right) + 2}}{1 + \frac{\alpha - -1}{\beta}}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 5.00000000000000015e39Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 70.7%
if 5.00000000000000015e39 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
div-inv99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.8%
*-rgt-identity99.8%
associate-/l*99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around -inf 99.8%
mul-1-neg99.8%
unsub-neg99.8%
distribute-lft-in99.8%
metadata-eval99.8%
associate-+r+99.8%
metadata-eval99.8%
mul-1-neg99.8%
unsub-neg99.8%
Simplified99.8%
Final simplification79.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (let* ((t_0 (+ (+ alpha beta) 2.0))) (/ (/ (/ (+ 1.0 alpha) t_0) (/ t_0 (+ 1.0 beta))) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (((1.0 + alpha) / t_0) / (t_0 / (1.0 + beta))) / (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 = (alpha + beta) + 2.0d0
code = (((1.0d0 + alpha) / t_0) / (t_0 / (1.0d0 + beta))) / (beta + (alpha + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = (alpha + beta) + 2.0;
return (((1.0 + alpha) / t_0) / (t_0 / (1.0 + beta))) / (beta + (alpha + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = (alpha + beta) + 2.0 return (((1.0 + alpha) / t_0) / (t_0 / (1.0 + beta))) / (beta + (alpha + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(Float64(alpha + beta) + 2.0) return Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(t_0 / Float64(1.0 + beta))) / Float64(beta + Float64(alpha + 3.0))) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
t_0 = (alpha + beta) + 2.0;
tmp = (((1.0 + alpha) / t_0) / (t_0 / (1.0 + beta))) / (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[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]}, N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \left(\alpha + \beta\right) + 2\\
\frac{\frac{\frac{1 + \alpha}{t_0}}{\frac{t_0}{1 + \beta}}}{\beta + \left(\alpha + 3\right)}
\end{array}
\end{array}
Initial program 94.4%
associate-/l/92.2%
associate-+l+92.2%
+-commutative92.2%
associate-+r+92.2%
associate-+l+92.2%
distribute-rgt1-in92.2%
*-rgt-identity92.2%
distribute-lft-out92.2%
+-commutative92.2%
associate-*l/95.5%
*-commutative95.5%
associate-*r/89.9%
Simplified89.9%
associate-*r/95.5%
+-commutative95.5%
Applied egg-rr95.5%
associate-/r*99.8%
associate-*r/94.4%
+-commutative94.4%
+-commutative94.4%
*-commutative94.4%
+-commutative94.4%
+-commutative94.4%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
div-inv99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.8%
*-rgt-identity99.8%
associate-/l*99.8%
associate-+r+99.8%
associate-+r+99.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 (+ alpha 2.0)))) (/ (/ (* (/ (+ 1.0 alpha) t_0) (+ 1.0 beta)) t_0) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((((1.0 + alpha) / t_0) * (1.0 + beta)) / t_0) / (alpha + (beta + 3.0));
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
t_0 = beta + (alpha + 2.0d0)
code = ((((1.0d0 + alpha) / t_0) * (1.0d0 + beta)) / t_0) / (alpha + (beta + 3.0d0))
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = beta + (alpha + 2.0);
return ((((1.0 + alpha) / t_0) * (1.0 + beta)) / t_0) / (alpha + (beta + 3.0));
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = beta + (alpha + 2.0) return ((((1.0 + alpha) / t_0) * (1.0 + beta)) / t_0) / (alpha + (beta + 3.0))
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(beta + Float64(alpha + 2.0)) return Float64(Float64(Float64(Float64(Float64(1.0 + alpha) / t_0) * Float64(1.0 + beta)) / t_0) / 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) * (1.0 + beta)) / t_0) / (alpha + (beta + 3.0));
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] * N[(1.0 + beta), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \beta + \left(\alpha + 2\right)\\
\frac{\frac{\frac{1 + \alpha}{t_0} \cdot \left(1 + \beta\right)}{t_0}}{\alpha + \left(\beta + 3\right)}
\end{array}
\end{array}
Initial program 94.4%
associate-/l/92.2%
associate-+l+92.2%
+-commutative92.2%
associate-+r+92.2%
associate-+l+92.2%
distribute-rgt1-in92.2%
*-rgt-identity92.2%
distribute-lft-out92.2%
+-commutative92.2%
associate-*l/95.5%
*-commutative95.5%
associate-*r/89.9%
Simplified89.9%
associate-*r/95.5%
+-commutative95.5%
Applied egg-rr95.5%
associate-/r*99.8%
associate-*r/94.4%
+-commutative94.4%
+-commutative94.4%
*-commutative94.4%
+-commutative94.4%
+-commutative94.4%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.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
(if (<= beta 9.2e+39)
(/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0))))
(/
(/ (/ (+ 1.0 alpha) beta) (/ (+ (+ alpha beta) 2.0) (+ 1.0 beta)))
(+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.2e+39) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / beta) / (((alpha + beta) + 2.0) / (1.0 + 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 <= 9.2d+39) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = (((1.0d0 + alpha) / beta) / (((alpha + beta) + 2.0d0) / (1.0d0 + 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 <= 9.2e+39) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = (((1.0 + alpha) / beta) / (((alpha + beta) + 2.0) / (1.0 + beta))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 9.2e+39: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = (((1.0 + alpha) / beta) / (((alpha + beta) + 2.0) / (1.0 + beta))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 9.2e+39) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(Float64(Float64(alpha + beta) + 2.0) / Float64(1.0 + 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 <= 9.2e+39)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = (((1.0 + alpha) / beta) / (((alpha + beta) + 2.0) / (1.0 + 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, 9.2e+39], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 9.2 \cdot 10^{+39}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\frac{1 + \alpha}{\beta}}{\frac{\left(\alpha + \beta\right) + 2}{1 + \beta}}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 9.20000000000000047e39Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 70.7%
if 9.20000000000000047e39 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
div-inv99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
associate-*r/99.8%
*-rgt-identity99.8%
associate-/l*99.8%
associate-+r+99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in beta around inf 90.1%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.56e+41) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (* (+ beta 3.0) (+ beta 2.0)))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.56e+41) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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 <= 1.56d+41) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (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 <= 1.56e+41) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.56e+41: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.56e+41) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / 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 <= 1.56e+41)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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, 1.56e+41], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.56 \cdot 10^{+41}:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.56e41Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 70.7%
if 1.56e41 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 90.1%
Final simplification76.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.6) (/ (+ 1.0 beta) (* (+ alpha (+ beta 2.0)) (+ 6.0 (* beta 5.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.6d0) then
tmp = (1.0d0 + beta) / ((alpha + (beta + 2.0d0)) * (6.0d0 + (beta * 5.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.6) {
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.6: tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.6) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(6.0 + Float64(beta * 5.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.6)
tmp = (1.0 + beta) / ((alpha + (beta + 2.0)) * (6.0 + (beta * 5.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.6], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(6.0 + N[(beta * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.6:\\
\;\;\;\;\frac{1 + \beta}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(6 + \beta \cdot 5\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.5999999999999996Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.5%
*-commutative69.5%
Simplified69.5%
if 4.5999999999999996 < beta Initial program 83.4%
associate-/l/78.2%
associate-+l+78.2%
+-commutative78.2%
associate-+r+78.2%
associate-+l+78.2%
distribute-rgt1-in78.2%
*-rgt-identity78.2%
distribute-lft-out78.2%
+-commutative78.2%
associate-*l/88.2%
*-commutative88.2%
associate-*r/87.1%
Simplified87.1%
associate-*r/88.2%
+-commutative88.2%
Applied egg-rr88.2%
associate-/r*99.7%
associate-*r/83.4%
+-commutative83.4%
+-commutative83.4%
*-commutative83.4%
+-commutative83.4%
+-commutative83.4%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
Taylor expanded in beta around inf 90.1%
Final simplification76.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.55e+41) (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55e+41) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 1.55d+41) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55e+41) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55e+41: tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55e+41) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55e+41)
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 1.55e+41], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55 \cdot 10^{+41}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.55e41Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 70.7%
Taylor expanded in alpha around 0 70.0%
if 1.55e41 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 89.9%
Final simplification75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 8e+39) (/ (+ 1.0 beta) (* (+ beta 2.0) (* (+ beta 3.0) (+ beta 2.0)))) (/ (/ (+ 1.0 alpha) (+ beta (+ alpha 2.0))) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 8e+39) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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 <= 8d+39) then
tmp = (1.0d0 + beta) / ((beta + 2.0d0) * ((beta + 3.0d0) * (beta + 2.0d0)))
else
tmp = ((1.0d0 + alpha) / (beta + (alpha + 2.0d0))) / (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 <= 8e+39) {
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
} else {
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 8e+39: tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0))) else: tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 8e+39) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + 3.0) * Float64(beta + 2.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(beta + Float64(alpha + 2.0))) / 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 <= 8e+39)
tmp = (1.0 + beta) / ((beta + 2.0) * ((beta + 3.0) * (beta + 2.0)));
else
tmp = ((1.0 + alpha) / (beta + (alpha + 2.0))) / (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, 8e+39], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + 3.0), $MachinePrecision] * N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta + N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 8 \cdot 10^{+39}:\\
\;\;\;\;\frac{1 + \beta}{\left(\beta + 2\right) \cdot \left(\left(\beta + 3\right) \cdot \left(\beta + 2\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta + \left(\alpha + 2\right)}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 7.99999999999999952e39Initial program 99.8%
associate-/l/99.0%
associate-/r*90.3%
associate-+l+90.3%
+-commutative90.3%
associate-+r+90.3%
associate-+l+90.3%
distribute-rgt1-in90.3%
*-rgt-identity90.3%
distribute-lft-out90.3%
*-commutative90.3%
metadata-eval90.3%
associate-+l+90.3%
+-commutative90.3%
Simplified90.3%
Taylor expanded in alpha around 0 81.0%
Taylor expanded in alpha around 0 70.7%
Taylor expanded in alpha around 0 70.0%
if 7.99999999999999952e39 < beta Initial program 81.9%
associate-/l/76.3%
associate-+l+76.3%
+-commutative76.3%
associate-+r+76.3%
associate-+l+76.3%
distribute-rgt1-in76.3%
*-rgt-identity76.3%
distribute-lft-out76.3%
+-commutative76.3%
associate-*l/87.2%
*-commutative87.2%
associate-*r/86.1%
Simplified86.1%
associate-*r/87.2%
+-commutative87.2%
Applied egg-rr87.2%
associate-/r*99.8%
associate-*r/81.9%
+-commutative81.9%
+-commutative81.9%
*-commutative81.9%
+-commutative81.9%
+-commutative81.9%
associate-*r/99.8%
+-commutative99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
Simplified99.8%
Taylor expanded in beta around inf 90.1%
Final simplification76.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.7) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 2.7d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else
tmp = ((1.0d0 + alpha) / beta) / (alpha + (beta + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.7) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.7: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.7) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(alpha + Float64(beta + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.7)
tmp = 0.16666666666666666 / (alpha + 2.0);
else
tmp = ((1.0 + alpha) / beta) / (alpha + (beta + 3.0));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 2.7], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.7:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.7000000000000002Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 2.7000000000000002 < beta Initial program 83.4%
associate-/l/78.2%
associate-+l+78.2%
+-commutative78.2%
associate-+r+78.2%
associate-+l+78.2%
distribute-rgt1-in78.2%
*-rgt-identity78.2%
distribute-lft-out78.2%
+-commutative78.2%
associate-*l/88.2%
*-commutative88.2%
associate-*r/87.1%
Simplified87.1%
associate-*r/88.2%
+-commutative88.2%
Applied egg-rr88.2%
associate-/r*99.7%
associate-*r/83.4%
+-commutative83.4%
+-commutative83.4%
*-commutative83.4%
+-commutative83.4%
+-commutative83.4%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
Taylor expanded in beta around inf 90.1%
Final simplification75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.3)
(/ 0.16666666666666666 (+ alpha 2.0))
(if (<= beta 1.55e+149)
(/ 1.0 (* beta (+ beta 3.0)))
(/ 1.0 (/ beta (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 1.55e+149) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = 1.0 / (beta / (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 <= 2.3d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else if (beta <= 1.55d+149) then
tmp = 1.0d0 / (beta * (beta + 3.0d0))
else
tmp = 1.0d0 / (beta / (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 1.55e+149) {
tmp = 1.0 / (beta * (beta + 3.0));
} else {
tmp = 1.0 / (beta / (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.16666666666666666 / (alpha + 2.0) elif beta <= 1.55e+149: tmp = 1.0 / (beta * (beta + 3.0)) else: tmp = 1.0 / (beta / (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); elseif (beta <= 1.55e+149) tmp = Float64(1.0 / Float64(beta * Float64(beta + 3.0))); else tmp = Float64(1.0 / Float64(beta / Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.3)
tmp = 0.16666666666666666 / (alpha + 2.0);
elseif (beta <= 1.55e+149)
tmp = 1.0 / (beta * (beta + 3.0));
else
tmp = 1.0 / (beta / (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, 2.3], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 1.55e+149], N[(1.0 / N[(beta * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta / N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{elif}\;\beta \leq 1.55 \cdot 10^{+149}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{\alpha}{\beta}}}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 2.2999999999999998 < beta < 1.54999999999999993e149Initial program 94.6%
Taylor expanded in beta around -inf 86.8%
Taylor expanded in alpha around 0 84.2%
if 1.54999999999999993e149 < beta Initial program 73.2%
associate-/l/63.4%
associate-+l+63.4%
+-commutative63.4%
associate-+r+63.4%
associate-+l+63.4%
distribute-rgt1-in63.4%
*-rgt-identity63.4%
distribute-lft-out63.4%
+-commutative63.4%
associate-*l/77.9%
*-commutative77.9%
associate-*r/77.9%
Simplified77.9%
associate-*r/77.9%
+-commutative77.9%
Applied egg-rr77.9%
associate-/r*99.9%
associate-*r/73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
associate-*r/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Simplified99.9%
Taylor expanded in beta around inf 77.9%
unpow277.9%
Simplified77.9%
clear-num77.9%
inv-pow77.9%
Applied egg-rr77.9%
unpow-177.9%
associate-/l*89.9%
Simplified89.9%
Taylor expanded in alpha around inf 89.9%
Final simplification74.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.6)
(/ 0.16666666666666666 (+ alpha 2.0))
(if (<= beta 2e+154)
(/ (+ 1.0 alpha) (* beta beta))
(/ 1.0 (/ beta (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 2e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = 1.0 / (beta / (alpha / beta));
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 3.6d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else if (beta <= 2d+154) then
tmp = (1.0d0 + alpha) / (beta * beta)
else
tmp = 1.0d0 / (beta / (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 3.6) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 2e+154) {
tmp = (1.0 + alpha) / (beta * beta);
} else {
tmp = 1.0 / (beta / (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.6: tmp = 0.16666666666666666 / (alpha + 2.0) elif beta <= 2e+154: tmp = (1.0 + alpha) / (beta * beta) else: tmp = 1.0 / (beta / (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.6) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); elseif (beta <= 2e+154) tmp = Float64(Float64(1.0 + alpha) / Float64(beta * beta)); else tmp = Float64(1.0 / Float64(beta / Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 3.6)
tmp = 0.16666666666666666 / (alpha + 2.0);
elseif (beta <= 2e+154)
tmp = (1.0 + alpha) / (beta * beta);
else
tmp = 1.0 / (beta / (alpha / beta));
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 3.6], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 2e+154], N[(N[(1.0 + alpha), $MachinePrecision] / N[(beta * beta), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta / N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 3.6:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{elif}\;\beta \leq 2 \cdot 10^{+154}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{\alpha}{\beta}}}\\
\end{array}
\end{array}
if beta < 3.60000000000000009Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 3.60000000000000009 < beta < 2.00000000000000007e154Initial program 94.6%
associate-/l/94.5%
associate-+l+94.5%
+-commutative94.5%
associate-+r+94.5%
associate-+l+94.5%
distribute-rgt1-in94.5%
*-rgt-identity94.5%
distribute-lft-out94.5%
+-commutative94.5%
associate-*l/99.5%
*-commutative99.5%
associate-*r/97.3%
Simplified97.3%
associate-*r/99.5%
+-commutative99.5%
Applied egg-rr99.5%
associate-/r*99.5%
associate-*r/94.6%
+-commutative94.6%
+-commutative94.6%
*-commutative94.6%
+-commutative94.6%
+-commutative94.6%
associate-*r/99.5%
+-commutative99.5%
+-commutative99.5%
associate-+r+99.5%
+-commutative99.5%
associate-+r+99.5%
Simplified99.5%
Taylor expanded in beta around inf 86.6%
unpow286.6%
Simplified86.6%
if 2.00000000000000007e154 < beta Initial program 73.2%
associate-/l/63.4%
associate-+l+63.4%
+-commutative63.4%
associate-+r+63.4%
associate-+l+63.4%
distribute-rgt1-in63.4%
*-rgt-identity63.4%
distribute-lft-out63.4%
+-commutative63.4%
associate-*l/77.9%
*-commutative77.9%
associate-*r/77.9%
Simplified77.9%
associate-*r/77.9%
+-commutative77.9%
Applied egg-rr77.9%
associate-/r*99.9%
associate-*r/73.2%
+-commutative73.2%
+-commutative73.2%
*-commutative73.2%
+-commutative73.2%
+-commutative73.2%
associate-*r/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Simplified99.9%
Taylor expanded in beta around inf 77.9%
unpow277.9%
Simplified77.9%
clear-num77.9%
inv-pow77.9%
Applied egg-rr77.9%
unpow-177.9%
associate-/l*89.9%
Simplified89.9%
Taylor expanded in alpha around inf 89.9%
Final simplification75.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.3)
(/ 0.16666666666666666 (+ alpha 2.0))
(if (<= beta 5.2e+158)
(/ (/ 1.0 beta) (+ beta 3.0))
(/ 1.0 (/ beta (/ alpha beta))))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 5.2e+158) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = 1.0 / (beta / (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 <= 2.3d0) then
tmp = 0.16666666666666666d0 / (alpha + 2.0d0)
else if (beta <= 5.2d+158) then
tmp = (1.0d0 / beta) / (beta + 3.0d0)
else
tmp = 1.0d0 / (beta / (alpha / beta))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 2.3) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else if (beta <= 5.2e+158) {
tmp = (1.0 / beta) / (beta + 3.0);
} else {
tmp = 1.0 / (beta / (alpha / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.3: tmp = 0.16666666666666666 / (alpha + 2.0) elif beta <= 5.2e+158: tmp = (1.0 / beta) / (beta + 3.0) else: tmp = 1.0 / (beta / (alpha / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.3) tmp = Float64(0.16666666666666666 / Float64(alpha + 2.0)); elseif (beta <= 5.2e+158) tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); else tmp = Float64(1.0 / Float64(beta / Float64(alpha / beta))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.3)
tmp = 0.16666666666666666 / (alpha + 2.0);
elseif (beta <= 5.2e+158)
tmp = (1.0 / beta) / (beta + 3.0);
else
tmp = 1.0 / (beta / (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, 2.3], N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[beta, 5.2e+158], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(beta / N[(alpha / beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.3:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{elif}\;\beta \leq 5.2 \cdot 10^{+158}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{\beta}{\frac{\alpha}{\beta}}}\\
\end{array}
\end{array}
if beta < 2.2999999999999998Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 2.2999999999999998 < beta < 5.2e158Initial program 92.7%
Taylor expanded in beta around -inf 85.6%
Taylor expanded in alpha around 0 80.0%
associate-/r*83.1%
Simplified83.1%
if 5.2e158 < beta Initial program 73.6%
associate-/l/66.4%
associate-+l+66.4%
+-commutative66.4%
associate-+r+66.4%
associate-+l+66.4%
distribute-rgt1-in66.4%
*-rgt-identity66.4%
distribute-lft-out66.4%
+-commutative66.4%
associate-*l/81.9%
*-commutative81.9%
associate-*r/81.9%
Simplified81.9%
associate-*r/81.9%
+-commutative81.9%
Applied egg-rr81.9%
associate-/r*99.9%
associate-*r/73.6%
+-commutative73.6%
+-commutative73.6%
*-commutative73.6%
+-commutative73.6%
+-commutative73.6%
associate-*r/99.9%
+-commutative99.9%
+-commutative99.9%
associate-+r+99.9%
+-commutative99.9%
associate-+r+99.9%
Simplified99.9%
Taylor expanded in beta around inf 81.9%
unpow281.9%
Simplified81.9%
clear-num81.9%
inv-pow81.9%
Applied egg-rr81.9%
unpow-181.9%
associate-/l*94.8%
Simplified94.8%
Taylor expanded in alpha around inf 94.8%
Final simplification75.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.16666666666666666 / (alpha + 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 <= 2.5d0) then
tmp = 0.16666666666666666d0 / (alpha + 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 <= 2.5) {
tmp = 0.16666666666666666 / (alpha + 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 <= 2.5: tmp = 0.16666666666666666 / (alpha + 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 <= 2.5) tmp = Float64(0.16666666666666666 / Float64(alpha + 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 <= 2.5)
tmp = 0.16666666666666666 / (alpha + 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, 2.5], N[(0.16666666666666666 / N[(alpha + 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 2.5:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 2.5 < beta Initial program 83.4%
Taylor expanded in beta around -inf 90.1%
Taylor expanded in alpha around 0 80.9%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 0.16666666666666666 (+ alpha 2.0)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 0.16666666666666666 / (alpha + 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 <= 4.2d0) then
tmp = 0.16666666666666666d0 / (alpha + 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 <= 4.2) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.2: tmp = 0.16666666666666666 / (alpha + 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 <= 4.2) tmp = Float64(0.16666666666666666 / Float64(alpha + 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 <= 4.2)
tmp = 0.16666666666666666 / (alpha + 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, 4.2], N[(0.16666666666666666 / N[(alpha + 2.0), $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 4.2:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 4.20000000000000018 < beta Initial program 83.4%
associate-/l/78.2%
associate-+l+78.2%
+-commutative78.2%
associate-+r+78.2%
associate-+l+78.2%
distribute-rgt1-in78.2%
*-rgt-identity78.2%
distribute-lft-out78.2%
+-commutative78.2%
associate-*l/88.2%
*-commutative88.2%
associate-*r/87.1%
Simplified87.1%
associate-*r/88.2%
+-commutative88.2%
Applied egg-rr88.2%
associate-/r*99.7%
associate-*r/83.4%
+-commutative83.4%
+-commutative83.4%
*-commutative83.4%
+-commutative83.4%
+-commutative83.4%
associate-*r/99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
associate-+r+99.7%
Simplified99.7%
Taylor expanded in beta around inf 82.1%
unpow282.1%
Simplified82.1%
clear-num82.1%
inv-pow82.1%
Applied egg-rr82.1%
unpow-182.1%
associate-/l*88.3%
Simplified88.3%
expm1-log1p-u88.3%
expm1-udef43.2%
associate-/r/43.2%
+-commutative43.2%
Applied egg-rr43.2%
expm1-def89.9%
expm1-log1p89.9%
associate-*l/90.0%
*-lft-identity90.0%
+-commutative90.0%
Simplified90.0%
Final simplification75.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.55) (/ 0.16666666666666666 (+ alpha 2.0)) (/ 1.0 (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.55) {
tmp = 0.16666666666666666 / (alpha + 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 <= 3.55d0) then
tmp = 0.16666666666666666d0 / (alpha + 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 <= 3.55) {
tmp = 0.16666666666666666 / (alpha + 2.0);
} else {
tmp = 1.0 / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.55: tmp = 0.16666666666666666 / (alpha + 2.0) else: tmp = 1.0 / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.55) tmp = Float64(0.16666666666666666 / Float64(alpha + 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 <= 3.55)
tmp = 0.16666666666666666 / (alpha + 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, 3.55], N[(0.16666666666666666 / N[(alpha + 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 3.55:\\
\;\;\;\;\frac{0.16666666666666666}{\alpha + 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.5499999999999998Initial program 99.8%
associate-/l/99.0%
associate-/r*90.0%
associate-+l+90.0%
+-commutative90.0%
associate-+r+90.0%
associate-+l+90.0%
distribute-rgt1-in90.0%
*-rgt-identity90.0%
distribute-lft-out90.0%
*-commutative90.0%
metadata-eval90.0%
associate-+l+90.0%
+-commutative90.0%
Simplified90.0%
Taylor expanded in alpha around 0 80.2%
Taylor expanded in alpha around 0 69.5%
Taylor expanded in beta around 0 69.0%
if 3.5499999999999998 < beta Initial program 83.4%
associate-/l/78.2%
associate-/r*62.7%
associate-+l+62.7%
+-commutative62.7%
associate-+r+62.7%
associate-+l+62.7%
distribute-rgt1-in62.7%
*-rgt-identity62.7%
distribute-lft-out62.7%
*-commutative62.7%
metadata-eval62.7%
associate-+l+62.7%
+-commutative62.7%
Simplified62.7%
Taylor expanded in alpha around 0 71.7%
Taylor expanded in beta around inf 80.9%
unpow280.9%
Simplified80.9%
Final simplification72.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.16666666666666666 (+ alpha 2.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 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 / (alpha + 2.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.16666666666666666 / (alpha + 2.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.16666666666666666 / (alpha + 2.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.16666666666666666 / Float64(alpha + 2.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.16666666666666666 / (alpha + 2.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.16666666666666666 / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.16666666666666666}{\alpha + 2}
\end{array}
Initial program 94.4%
associate-/l/92.2%
associate-/r*81.0%
associate-+l+81.0%
+-commutative81.0%
associate-+r+81.0%
associate-+l+81.0%
distribute-rgt1-in81.0%
*-rgt-identity81.0%
distribute-lft-out81.0%
*-commutative81.0%
metadata-eval81.0%
associate-+l+81.0%
+-commutative81.0%
Simplified81.0%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in alpha around 0 70.2%
Taylor expanded in beta around 0 48.0%
Final simplification48.0%
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%
associate-/l/92.2%
associate-/r*81.0%
associate-+l+81.0%
+-commutative81.0%
associate-+r+81.0%
associate-+l+81.0%
distribute-rgt1-in81.0%
*-rgt-identity81.0%
distribute-lft-out81.0%
*-commutative81.0%
metadata-eval81.0%
associate-+l+81.0%
+-commutative81.0%
Simplified81.0%
Taylor expanded in alpha around 0 77.4%
Taylor expanded in alpha around 0 70.2%
Taylor expanded in beta around 0 48.0%
Taylor expanded in alpha around 0 47.1%
Final simplification47.1%
herbie shell --seed 2023174
(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)))