
(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 18 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)))) (* (/ (+ 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 = alpha + (beta + 2.0);
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 = alpha + (beta + 2.0d0)
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 = alpha + (beta + 2.0);
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 = alpha + (beta + 2.0) 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(alpha + Float64(beta + 2.0)) 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 = alpha + (beta + 2.0);
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[(alpha + N[(beta + 2.0), $MachinePrecision]), $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 := \alpha + \left(\beta + 2\right)\\
\frac{1 + \beta}{t\_0} \cdot \frac{\frac{1 + \alpha}{t\_0}}{\beta + \left(\alpha + 3\right)}
\end{array}
\end{array}
Initial program 94.1%
Simplified83.5%
associate-+r+83.5%
fma-undefine83.5%
*-commutative83.5%
associate-+l+83.5%
+-commutative83.5%
associate-+l+83.5%
*-commutative83.5%
associate-*r*83.5%
associate-+r+83.5%
+-commutative83.5%
associate-/l/92.8%
clear-num92.9%
inv-pow92.9%
Applied egg-rr92.9%
unpow-192.9%
associate-/l*93.7%
associate-+r+93.7%
+-commutative93.7%
+-commutative93.7%
associate-+r+93.7%
+-commutative93.7%
fma-undefine93.7%
+-commutative93.7%
*-commutative93.7%
+-commutative93.7%
associate-+r+93.7%
distribute-rgt1-in93.7%
+-commutative93.7%
associate-+r+93.7%
+-commutative93.7%
+-commutative93.7%
Simplified93.7%
associate-*r/92.9%
associate-+l+92.9%
+-commutative92.9%
clear-num92.9%
*-un-lft-identity92.9%
associate-/l*96.4%
associate-+r+96.4%
+-commutative96.4%
+-commutative96.4%
associate-+r+96.4%
+-commutative96.4%
+-commutative96.4%
+-commutative96.4%
Applied egg-rr96.4%
*-lft-identity96.4%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Final simplification99.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 3.1)
(/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 2.0) (+ 3.0 (+ beta alpha))))
(*
(/ (/ (+ 1.0 alpha) (+ alpha (+ beta 2.0))) (+ beta (+ alpha 3.0)))
(+ 1.0 (/ (- -1.0 alpha) beta)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.1) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.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) :: tmp
if (beta <= 3.1d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 2.0d0) * (3.0d0 + (beta + alpha)))
else
tmp = (((1.0d0 + alpha) / (alpha + (beta + 2.0d0))) / (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 tmp;
if (beta <= 3.1) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
} else {
tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.1: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha))) else: tmp = (((1.0 + alpha) / (alpha + (beta + 2.0))) / (beta + (alpha + 3.0))) * (1.0 + ((-1.0 - alpha) / beta)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.1) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 2.0) * Float64(3.0 + Float64(beta + alpha)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + Float64(beta + 2.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)
tmp = 0.0;
if (beta <= 3.1)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 2.0) * (3.0 + (beta + alpha)));
else
tmp = (((1.0 + alpha) / (alpha + (beta + 2.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_] := If[LessEqual[beta, 3.1], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 2.0), $MachinePrecision] * N[(3.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $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}
\mathbf{if}\;\beta \leq 3.1:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 2\right) \cdot \left(3 + \left(\beta + \alpha\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + \left(\beta + 2\right)}}{\beta + \left(\alpha + 3\right)} \cdot \left(1 + \frac{-1 - \alpha}{\beta}\right)\\
\end{array}
\end{array}
if beta < 3.10000000000000009Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 99.0%
if 3.10000000000000009 < beta Initial program 82.6%
Simplified64.4%
associate-+r+64.4%
fma-undefine64.4%
*-commutative64.4%
associate-+l+64.4%
+-commutative64.4%
associate-+l+64.4%
*-commutative64.4%
associate-*r*64.4%
associate-+r+64.4%
+-commutative64.4%
associate-/l/79.3%
clear-num79.3%
inv-pow79.3%
Applied egg-rr79.3%
unpow-179.3%
associate-/l*81.7%
associate-+r+81.7%
+-commutative81.7%
+-commutative81.7%
associate-+r+81.7%
+-commutative81.7%
fma-undefine81.7%
+-commutative81.7%
*-commutative81.7%
+-commutative81.7%
associate-+r+81.7%
distribute-rgt1-in81.7%
+-commutative81.7%
associate-+r+81.7%
+-commutative81.7%
+-commutative81.7%
Simplified81.7%
associate-*r/79.3%
associate-+l+79.3%
+-commutative79.3%
clear-num79.4%
*-un-lft-identity79.4%
associate-/l*89.8%
associate-+r+89.8%
+-commutative89.8%
+-commutative89.8%
associate-+r+89.8%
+-commutative89.8%
+-commutative89.8%
+-commutative89.8%
Applied egg-rr89.8%
*-lft-identity89.8%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 84.2%
mul-1-neg82.8%
unsub-neg82.8%
Simplified84.2%
Final simplification94.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 2.3e+20)
(/
1.0
(*
(+ 2.0 (+ beta alpha))
(/ (* (+ beta 2.0) (+ beta 3.0)) (+ 1.0 beta))))
(/ (/ (* (+ 1.0 alpha) (/ beta t_0)) t_0) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.3e+20) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (((1.0 + alpha) * (beta / t_0)) / t_0) / (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 <= 2.3d+20) then
tmp = 1.0d0 / ((2.0d0 + (beta + alpha)) * (((beta + 2.0d0) * (beta + 3.0d0)) / (1.0d0 + beta)))
else
tmp = (((1.0d0 + alpha) * (beta / t_0)) / t_0) / (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 <= 2.3e+20) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
} else {
tmp = (((1.0 + alpha) * (beta / t_0)) / t_0) / (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 <= 2.3e+20: tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta))) else: tmp = (((1.0 + alpha) * (beta / t_0)) / t_0) / (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 <= 2.3e+20) tmp = Float64(1.0 / Float64(Float64(2.0 + Float64(beta + alpha)) * Float64(Float64(Float64(beta + 2.0) * Float64(beta + 3.0)) / Float64(1.0 + beta)))); else tmp = Float64(Float64(Float64(Float64(1.0 + alpha) * Float64(beta / t_0)) / t_0) / 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 <= 2.3e+20)
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
else
tmp = (((1.0 + alpha) * (beta / t_0)) / t_0) / (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, 2.3e+20], N[(1.0 / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 + alpha), $MachinePrecision] * N[(beta / t$95$0), $MachinePrecision]), $MachinePrecision] / t$95$0), $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.3 \cdot 10^{+20}:\\
\;\;\;\;\frac{1}{\left(2 + \left(\beta + \alpha\right)\right) \cdot \frac{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{\left(1 + \alpha\right) \cdot \frac{\beta}{t\_0}}{t\_0}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.3e20Initial program 99.9%
Simplified93.4%
associate-+r+93.4%
fma-undefine93.4%
*-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
associate-*r*93.4%
associate-+r+93.4%
+-commutative93.4%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 64.2%
if 2.3e20 < beta Initial program 81.5%
Simplified62.2%
Applied egg-rr78.1%
associate-*r/78.1%
*-rgt-identity78.1%
fma-undefine78.1%
+-commutative78.1%
*-commutative78.1%
+-commutative78.1%
associate-+r+78.1%
distribute-rgt1-in78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
associate-+r+78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
+-commutative78.1%
associate-+l+78.1%
Simplified78.1%
Taylor expanded in beta around inf 78.1%
*-commutative78.1%
Simplified78.1%
*-un-lft-identity78.1%
associate-/r*81.6%
associate-/l*99.8%
associate-+r+99.8%
+-commutative99.8%
associate-+r+99.8%
+-commutative99.8%
+-commutative99.8%
Applied egg-rr99.8%
Final simplification75.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 4.3e+15)
(/ (+ 1.0 beta) (* (+ 2.0 (+ beta alpha)) (* (+ 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 <= 4.3e+15) {
tmp = (1.0 + beta) / ((2.0 + (beta + alpha)) * ((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 <= 4.3d+15) then
tmp = (1.0d0 + beta) / ((2.0d0 + (beta + alpha)) * ((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 <= 4.3e+15) {
tmp = (1.0 + beta) / ((2.0 + (beta + alpha)) * ((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 <= 4.3e+15: tmp = (1.0 + beta) / ((2.0 + (beta + alpha)) * ((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 <= 4.3e+15) tmp = Float64(Float64(1.0 + beta) / Float64(Float64(2.0 + Float64(beta + alpha)) * 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 <= 4.3e+15)
tmp = (1.0 + beta) / ((2.0 + (beta + alpha)) * ((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, 4.3e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * 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 4.3 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\left(2 + \left(\beta + \alpha\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\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 < 4.3e15Initial program 99.9%
Simplified93.3%
associate-+r+93.3%
fma-undefine93.3%
*-commutative93.3%
associate-+l+93.3%
+-commutative93.3%
associate-+l+93.3%
*-commutative93.3%
associate-*r*93.3%
associate-+r+93.3%
+-commutative93.3%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.7%
associate-+l+99.7%
+-commutative99.7%
clear-num99.7%
*-un-lft-identity99.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 64.4%
associate-/r*64.4%
+-commutative64.4%
Simplified64.4%
*-commutative64.4%
associate-/l/64.4%
frac-times64.4%
*-un-lft-identity64.4%
+-commutative64.4%
associate-+r+64.4%
Applied egg-rr64.4%
if 4.3e15 < beta Initial program 81.8%
Simplified62.6%
associate-+r+62.6%
fma-undefine62.6%
*-commutative62.6%
associate-+l+62.6%
+-commutative62.6%
associate-+l+62.6%
*-commutative62.6%
associate-*r*62.6%
associate-+r+62.6%
+-commutative62.6%
associate-/l/78.4%
clear-num78.3%
inv-pow78.3%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*80.8%
associate-+r+80.8%
+-commutative80.8%
+-commutative80.8%
associate-+r+80.8%
+-commutative80.8%
fma-undefine80.8%
+-commutative80.8%
*-commutative80.8%
+-commutative80.8%
associate-+r+80.8%
distribute-rgt1-in80.8%
+-commutative80.8%
associate-+r+80.8%
+-commutative80.8%
+-commutative80.8%
Simplified80.8%
associate-*r/78.4%
associate-+l+78.4%
+-commutative78.4%
clear-num78.4%
*-un-lft-identity78.4%
associate-/l*89.3%
associate-+r+89.3%
+-commutative89.3%
+-commutative89.3%
associate-+r+89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
Applied egg-rr89.3%
*-lft-identity89.3%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.1%
Taylor expanded in beta around inf 85.3%
mul-1-neg85.3%
unsub-neg85.3%
Simplified85.3%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.3e+15)
(*
(/ (+ 1.0 beta) (+ alpha (+ beta 2.0)))
(/ (/ 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 <= 2.3e+15) {
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * ((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 <= 2.3d+15) then
tmp = ((1.0d0 + beta) / (alpha + (beta + 2.0d0))) * ((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 <= 2.3e+15) {
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * ((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 <= 2.3e+15: tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * ((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 <= 2.3e+15) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 2.0))) * Float64(Float64(1.0 / 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 <= 2.3e+15)
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * ((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, 2.3e+15], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 3.0), $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 2.3 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{\alpha + \left(\beta + 2\right)} \cdot \frac{\frac{1}{\beta + 2}}{\beta + 3}\\
\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 < 2.3e15Initial program 99.9%
Simplified93.3%
associate-+r+93.3%
fma-undefine93.3%
*-commutative93.3%
associate-+l+93.3%
+-commutative93.3%
associate-+l+93.3%
*-commutative93.3%
associate-*r*93.3%
associate-+r+93.3%
+-commutative93.3%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.7%
associate-+l+99.7%
+-commutative99.7%
clear-num99.7%
*-un-lft-identity99.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 64.4%
associate-/r*64.4%
+-commutative64.4%
Simplified64.4%
if 2.3e15 < beta Initial program 81.8%
Simplified62.6%
associate-+r+62.6%
fma-undefine62.6%
*-commutative62.6%
associate-+l+62.6%
+-commutative62.6%
associate-+l+62.6%
*-commutative62.6%
associate-*r*62.6%
associate-+r+62.6%
+-commutative62.6%
associate-/l/78.4%
clear-num78.3%
inv-pow78.3%
Applied egg-rr78.4%
unpow-178.4%
associate-/l*80.8%
associate-+r+80.8%
+-commutative80.8%
+-commutative80.8%
associate-+r+80.8%
+-commutative80.8%
fma-undefine80.8%
+-commutative80.8%
*-commutative80.8%
+-commutative80.8%
associate-+r+80.8%
distribute-rgt1-in80.8%
+-commutative80.8%
associate-+r+80.8%
+-commutative80.8%
+-commutative80.8%
Simplified80.8%
associate-*r/78.4%
associate-+l+78.4%
+-commutative78.4%
clear-num78.4%
*-un-lft-identity78.4%
associate-/l*89.3%
associate-+r+89.3%
+-commutative89.3%
+-commutative89.3%
associate-+r+89.3%
+-commutative89.3%
+-commutative89.3%
+-commutative89.3%
Applied egg-rr89.3%
*-lft-identity89.3%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 86.1%
Taylor expanded in beta around inf 85.3%
mul-1-neg85.3%
unsub-neg85.3%
Simplified85.3%
Final simplification71.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 2.75e+20)
(/
1.0
(* (+ 2.0 (+ beta alpha)) (/ (* (+ beta 2.0) (+ beta 3.0)) (+ 1.0 beta))))
(*
(+ 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 <= 2.75e+20) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
} 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 <= 2.75d+20) then
tmp = 1.0d0 / ((2.0d0 + (beta + alpha)) * (((beta + 2.0d0) * (beta + 3.0d0)) / (1.0d0 + beta)))
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 <= 2.75e+20) {
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
} 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 <= 2.75e+20: tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta))) 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 <= 2.75e+20) tmp = Float64(1.0 / Float64(Float64(2.0 + Float64(beta + alpha)) * Float64(Float64(Float64(beta + 2.0) * Float64(beta + 3.0)) / Float64(1.0 + beta)))); 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 <= 2.75e+20)
tmp = 1.0 / ((2.0 + (beta + alpha)) * (((beta + 2.0) * (beta + 3.0)) / (1.0 + beta)));
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, 2.75e+20], N[(1.0 / N[(N[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision] / N[(1.0 + beta), $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 2.75 \cdot 10^{+20}:\\
\;\;\;\;\frac{1}{\left(2 + \left(\beta + \alpha\right)\right) \cdot \frac{\left(\beta + 2\right) \cdot \left(\beta + 3\right)}{1 + \beta}}\\
\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 < 2.75e20Initial program 99.9%
Simplified93.4%
associate-+r+93.4%
fma-undefine93.4%
*-commutative93.4%
associate-+l+93.4%
+-commutative93.4%
associate-+l+93.4%
*-commutative93.4%
associate-*r*93.4%
associate-+r+93.4%
+-commutative93.4%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 64.2%
if 2.75e20 < beta Initial program 81.5%
Simplified62.2%
associate-+r+62.2%
fma-undefine62.2%
*-commutative62.2%
associate-+l+62.2%
+-commutative62.2%
associate-+l+62.2%
*-commutative62.2%
associate-*r*62.2%
associate-+r+62.2%
+-commutative62.2%
associate-/l/78.1%
clear-num78.1%
inv-pow78.1%
Applied egg-rr78.1%
unpow-178.1%
associate-/l*80.6%
associate-+r+80.6%
+-commutative80.6%
+-commutative80.6%
associate-+r+80.6%
+-commutative80.6%
fma-undefine80.6%
+-commutative80.6%
*-commutative80.6%
+-commutative80.6%
associate-+r+80.6%
distribute-rgt1-in80.6%
+-commutative80.6%
associate-+r+80.6%
+-commutative80.6%
+-commutative80.6%
Simplified80.6%
associate-*r/78.1%
associate-+l+78.1%
+-commutative78.1%
clear-num78.1%
*-un-lft-identity78.1%
associate-/l*89.2%
associate-+r+89.2%
+-commutative89.2%
+-commutative89.2%
associate-+r+89.2%
+-commutative89.2%
+-commutative89.2%
+-commutative89.2%
Applied egg-rr89.2%
*-lft-identity89.2%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in beta around inf 87.0%
Taylor expanded in beta around inf 86.4%
mul-1-neg86.4%
unsub-neg86.4%
Simplified86.4%
Final simplification71.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ 2.0 (+ beta alpha))))
(if (<= beta 6.8e+15)
(/ (+ 1.0 beta) (* t_0 (* (+ beta 2.0) (+ beta 3.0))))
(/ (/ (+ 1.0 alpha) t_0) (+ beta (+ alpha 3.0))))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 6.8e+15) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) / (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 = 2.0d0 + (beta + alpha)
if (beta <= 6.8d+15) then
tmp = (1.0d0 + beta) / (t_0 * ((beta + 2.0d0) * (beta + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / t_0) / (beta + (alpha + 3.0d0))
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = 2.0 + (beta + alpha);
double tmp;
if (beta <= 6.8e+15) {
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
} else {
tmp = ((1.0 + alpha) / t_0) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = 2.0 + (beta + alpha) tmp = 0 if beta <= 6.8e+15: tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0))) else: tmp = ((1.0 + alpha) / t_0) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(2.0 + Float64(beta + alpha)) tmp = 0.0 if (beta <= 6.8e+15) tmp = Float64(Float64(1.0 + beta) / Float64(t_0 * Float64(Float64(beta + 2.0) * Float64(beta + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / t_0) / Float64(beta + Float64(alpha + 3.0))); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = 2.0 + (beta + alpha);
tmp = 0.0;
if (beta <= 6.8e+15)
tmp = (1.0 + beta) / (t_0 * ((beta + 2.0) * (beta + 3.0)));
else
tmp = ((1.0 + alpha) / t_0) / (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[(2.0 + N[(beta + alpha), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 6.8e+15], N[(N[(1.0 + beta), $MachinePrecision] / N[(t$95$0 * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := 2 + \left(\beta + \alpha\right)\\
\mathbf{if}\;\beta \leq 6.8 \cdot 10^{+15}:\\
\;\;\;\;\frac{1 + \beta}{t\_0 \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{t\_0}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 6.8e15Initial program 99.9%
Simplified93.3%
associate-+r+93.3%
fma-undefine93.3%
*-commutative93.3%
associate-+l+93.3%
+-commutative93.3%
associate-+l+93.3%
*-commutative93.3%
associate-*r*93.3%
associate-+r+93.3%
+-commutative93.3%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.7%
associate-+l+99.7%
+-commutative99.7%
clear-num99.7%
*-un-lft-identity99.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
times-frac99.8%
+-commutative99.8%
+-commutative99.8%
Simplified99.8%
Taylor expanded in alpha around 0 64.4%
associate-/r*64.4%
+-commutative64.4%
Simplified64.4%
*-commutative64.4%
associate-/l/64.4%
frac-times64.4%
*-un-lft-identity64.4%
+-commutative64.4%
associate-+r+64.4%
Applied egg-rr64.4%
if 6.8e15 < beta Initial program 81.8%
Simplified62.6%
Applied egg-rr78.4%
associate-*r/78.4%
*-rgt-identity78.4%
fma-undefine78.4%
+-commutative78.4%
*-commutative78.4%
+-commutative78.4%
associate-+r+78.4%
distribute-rgt1-in78.4%
+-commutative78.4%
associate-+r+78.4%
+-commutative78.4%
+-commutative78.4%
associate-+r+78.4%
+-commutative78.4%
+-commutative78.4%
+-commutative78.4%
+-commutative78.4%
+-commutative78.4%
associate-+l+78.4%
Simplified78.4%
Taylor expanded in beta around inf 87.2%
*-un-lft-identity87.2%
associate-/r*86.1%
Applied egg-rr86.1%
Final simplification71.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.1)
(*
(/ (+ 1.0 beta) (+ alpha (+ beta 2.0)))
(+ 0.16666666666666666 (* beta -0.1388888888888889)))
(/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.1) {
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (beta * -0.1388888888888889));
} else {
tmp = ((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.1d0) then
tmp = ((1.0d0 + beta) / (alpha + (beta + 2.0d0))) * (0.16666666666666666d0 + (beta * (-0.1388888888888889d0)))
else
tmp = ((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.1) {
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (beta * -0.1388888888888889));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.1: tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (beta * -0.1388888888888889)) else: tmp = ((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.1) tmp = Float64(Float64(Float64(1.0 + beta) / Float64(alpha + Float64(beta + 2.0))) * Float64(0.16666666666666666 + Float64(beta * -0.1388888888888889))); else tmp = 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.1)
tmp = ((1.0 + beta) / (alpha + (beta + 2.0))) * (0.16666666666666666 + (beta * -0.1388888888888889));
else
tmp = ((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.1], N[(N[(N[(1.0 + beta), $MachinePrecision] / N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(0.16666666666666666 + N[(beta * -0.1388888888888889), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 1.1:\\
\;\;\;\;\frac{1 + \beta}{\alpha + \left(\beta + 2\right)} \cdot \left(0.16666666666666666 + \beta \cdot -0.1388888888888889\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.1000000000000001Initial program 99.9%
Simplified93.2%
associate-+r+93.2%
fma-undefine93.2%
*-commutative93.2%
associate-+l+93.2%
+-commutative93.2%
associate-+l+93.2%
*-commutative93.2%
associate-*r*93.2%
associate-+r+93.2%
+-commutative93.2%
associate-/l/99.7%
clear-num99.7%
inv-pow99.7%
Applied egg-rr99.7%
unpow-199.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
fma-undefine99.7%
+-commutative99.7%
*-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
distribute-rgt1-in99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
associate-*r/99.7%
associate-+l+99.7%
+-commutative99.7%
clear-num99.7%
*-un-lft-identity99.7%
associate-/l*99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
associate-+r+99.7%
+-commutative99.7%
+-commutative99.7%
+-commutative99.7%
Applied egg-rr99.7%
*-lft-identity99.7%
times-frac99.7%
+-commutative99.7%
+-commutative99.7%
Simplified99.7%
Taylor expanded in alpha around 0 64.7%
associate-/r*64.7%
+-commutative64.7%
Simplified64.7%
Taylor expanded in beta around 0 64.4%
if 1.1000000000000001 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around 0 83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Simplified83.2%
Final simplification70.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 29.0) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 29.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((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 <= 29.0d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((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 <= 29.0) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 29.0: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 29.0) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = 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 <= 29.0)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((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, 29.0], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 29:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 29Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
if 29 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around 0 83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Simplified83.2%
Final simplification93.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.55) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (* (+ alpha 3.0) (+ alpha 2.0))) (/ (/ (+ 1.0 alpha) (+ 2.0 (+ beta alpha))) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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.55d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / ((alpha + 3.0d0) * (alpha + 2.0d0))
else
tmp = ((1.0d0 + alpha) / (2.0d0 + (beta + alpha))) / (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.55) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
} else {
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.55: tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0)) else: tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.55) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(Float64(alpha + 3.0) * Float64(alpha + 2.0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(2.0 + Float64(beta + alpha))) / 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.55)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / ((alpha + 3.0) * (alpha + 2.0));
else
tmp = ((1.0 + alpha) / (2.0 + (beta + alpha))) / (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.55], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(alpha + 3.0), $MachinePrecision] * N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(2.0 + N[(beta + alpha), $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 1.55:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{\left(\alpha + 3\right) \cdot \left(\alpha + 2\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{2 + \left(\beta + \alpha\right)}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
if 1.55000000000000004 < beta Initial program 82.6%
Simplified64.4%
Applied egg-rr79.3%
associate-*r/79.4%
*-rgt-identity79.4%
fma-undefine79.4%
+-commutative79.4%
*-commutative79.4%
+-commutative79.4%
associate-+r+79.4%
distribute-rgt1-in79.4%
+-commutative79.4%
associate-+r+79.4%
+-commutative79.4%
+-commutative79.4%
associate-+r+79.4%
+-commutative79.4%
+-commutative79.4%
+-commutative79.4%
+-commutative79.4%
+-commutative79.4%
associate-+l+79.4%
Simplified79.4%
Taylor expanded in beta around inf 86.9%
*-un-lft-identity86.9%
associate-/r*83.7%
Applied egg-rr83.7%
Final simplification93.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.4) (/ (/ (+ 1.0 alpha) (+ alpha 2.0)) (+ 6.0 (* alpha 5.0))) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.4) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.0));
} else {
tmp = ((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 <= 2.4d0) then
tmp = ((1.0d0 + alpha) / (alpha + 2.0d0)) / (6.0d0 + (alpha * 5.0d0))
else
tmp = ((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 <= 2.4) {
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.0));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.4: tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.0)) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.4) tmp = Float64(Float64(Float64(1.0 + alpha) / Float64(alpha + 2.0)) / Float64(6.0 + Float64(alpha * 5.0))); else tmp = 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 <= 2.4)
tmp = ((1.0 + alpha) / (alpha + 2.0)) / (6.0 + (alpha * 5.0));
else
tmp = ((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, 2.4], N[(N[(N[(1.0 + alpha), $MachinePrecision] / N[(alpha + 2.0), $MachinePrecision]), $MachinePrecision] / N[(6.0 + N[(alpha * 5.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 2.4:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\alpha + 2}}{6 + \alpha \cdot 5}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.39999999999999991Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 64.7%
*-commutative64.7%
Simplified64.7%
if 2.39999999999999991 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around 0 83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Simplified83.2%
Final simplification70.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.1) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) (+ beta (+ alpha 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((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 <= 2.1d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = ((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 <= 2.1) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.1: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / (beta + (alpha + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.1) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = 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 <= 2.1)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = ((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, 2.1], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $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 2.1:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + \left(\alpha + 3\right)}\\
\end{array}
\end{array}
if beta < 2.10000000000000009Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 2.10000000000000009 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around 0 83.2%
associate-+r+83.2%
+-commutative83.2%
+-commutative83.2%
Simplified83.2%
Final simplification69.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.9) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 1.9d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 1.9) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / (beta * (beta + 3.0));
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 1.9: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / (beta * (beta + 3.0)) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 1.9) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 1.9)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 1.9], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 1.9:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8999999999999999Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 1.8999999999999999 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around 0 75.2%
+-commutative75.2%
Simplified75.2%
Final simplification67.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.45) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (+ 1.0 alpha) (* beta beta))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.45) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.45d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.45) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = (1.0 + alpha) / (beta * beta);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.45: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = (1.0 + alpha) / (beta * beta) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.45) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 3.45)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.45], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 3.45:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1 + \alpha}{\beta \cdot \beta}\\
\end{array}
\end{array}
if beta < 3.4500000000000002Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 3.4500000000000002 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
*-un-lft-identity83.2%
metadata-eval83.2%
associate-+l+83.2%
metadata-eval83.2%
associate-/l/83.4%
+-commutative83.4%
associate-+l+83.4%
Applied egg-rr83.4%
*-lft-identity83.4%
*-commutative83.4%
Simplified83.4%
Taylor expanded in beta around inf 81.0%
Final simplification68.9%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 3.3) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ (/ (+ 1.0 alpha) beta) beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} 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 <= 3.3d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
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 <= 3.3) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = ((1.0 + alpha) / beta) / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 3.3: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = ((1.0 + alpha) / beta) / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 3.3) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); 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 <= 3.3)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
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, 3.3], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $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 3.3:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta}\\
\end{array}
\end{array}
if beta < 3.2999999999999998Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 3.2999999999999998 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in beta around inf 82.9%
Final simplification69.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 10.6) (+ 0.08333333333333333 (* alpha -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 10.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 10.6d0) then
tmp = 0.08333333333333333d0 + (alpha * (-0.027777777777777776d0))
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 10.6) {
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 10.6: tmp = 0.08333333333333333 + (alpha * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 10.6) tmp = Float64(0.08333333333333333 + Float64(alpha * -0.027777777777777776)); else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 10.6)
tmp = 0.08333333333333333 + (alpha * -0.027777777777777776);
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 10.6], N[(0.08333333333333333 + N[(alpha * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 10.6:\\
\;\;\;\;0.08333333333333333 + \alpha \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 10.5999999999999996Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 62.8%
*-commutative62.8%
Simplified62.8%
if 10.5999999999999996 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around inf 6.9%
Final simplification44.0%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 12.0) 0.08333333333333333 (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 12.0d0) then
tmp = 0.08333333333333333d0
else
tmp = 1.0d0 / beta
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 12.0) {
tmp = 0.08333333333333333;
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 12.0: tmp = 0.08333333333333333 else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 12.0) tmp = 0.08333333333333333; else tmp = Float64(1.0 / beta); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 12.0)
tmp = 0.08333333333333333;
else
tmp = 1.0 / beta;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 12.0], 0.08333333333333333, N[(1.0 / beta), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 12:\\
\;\;\;\;0.08333333333333333\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 12Initial program 99.9%
associate-/l/99.7%
+-commutative99.7%
associate-+l+99.7%
*-commutative99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
associate-+l+99.7%
metadata-eval99.7%
metadata-eval99.7%
associate-+l+99.7%
Simplified99.7%
Taylor expanded in beta around 0 98.5%
Taylor expanded in beta around 0 98.6%
+-commutative98.6%
+-commutative98.6%
Simplified98.6%
Taylor expanded in alpha around 0 63.1%
if 12 < beta Initial program 82.6%
Taylor expanded in beta around inf 83.2%
Taylor expanded in alpha around inf 6.9%
Final simplification44.2%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 0.08333333333333333)
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.08333333333333333;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
code = 0.08333333333333333d0
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.08333333333333333;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.08333333333333333
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return 0.08333333333333333 end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.08333333333333333;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := 0.08333333333333333
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
0.08333333333333333
\end{array}
Initial program 94.1%
associate-/l/92.9%
+-commutative92.9%
associate-+l+92.9%
*-commutative92.9%
metadata-eval92.9%
associate-+l+92.9%
metadata-eval92.9%
associate-+l+92.8%
metadata-eval92.8%
metadata-eval92.8%
associate-+l+92.8%
Simplified92.8%
Taylor expanded in beta around 0 84.9%
Taylor expanded in beta around 0 70.2%
+-commutative70.2%
+-commutative70.2%
Simplified70.2%
Taylor expanded in alpha around 0 43.2%
Final simplification43.2%
herbie shell --seed 2024041
(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)))