
(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 17 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 1e+151)
(/ (/ (* (+ beta 1.0) (+ 1.0 alpha)) t_0) (* (+ (+ beta alpha) 3.0) t_0))
(/ (/ (+ 1.0 alpha) beta) (pow (sqrt (+ alpha (+ beta 3.0))) 2.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 1e+151) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / pow(sqrt((alpha + (beta + 3.0))), 2.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 1d+151) then
tmp = (((beta + 1.0d0) * (1.0d0 + alpha)) / t_0) / (((beta + alpha) + 3.0d0) * t_0)
else
tmp = ((1.0d0 + alpha) / beta) / (sqrt((alpha + (beta + 3.0d0))) ** 2.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 <= 1e+151) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / Math.pow(Math.sqrt((alpha + (beta + 3.0))), 2.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 1e+151: tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0) else: tmp = ((1.0 + alpha) / beta) / math.pow(math.sqrt((alpha + (beta + 3.0))), 2.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 <= 1e+151) tmp = Float64(Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / t_0) / Float64(Float64(Float64(beta + alpha) + 3.0) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / (sqrt(Float64(alpha + Float64(beta + 3.0))) ^ 2.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 <= 1e+151)
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
else
tmp = ((1.0 + alpha) / beta) / (sqrt((alpha + (beta + 3.0))) ^ 2.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 1e+151], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[Power[N[Sqrt[N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $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 10^{+151}:\\
\;\;\;\;\frac{\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_0}}{\left(\left(\beta + \alpha\right) + 3\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{{\left(\sqrt{\alpha + \left(\beta + 3\right)}\right)}^{2}}\\
\end{array}
\end{array}
if beta < 1.00000000000000002e151Initial program 99.3%
associate-/l/98.1%
+-commutative98.1%
associate-+l+98.1%
*-commutative98.1%
metadata-eval98.1%
associate-+l+98.1%
metadata-eval98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
metadata-eval98.1%
metadata-eval98.1%
associate-+l+98.1%
Simplified98.1%
+-commutative98.1%
associate-+r+98.1%
*-commutative98.1%
associate-+r+98.1%
metadata-eval98.1%
*-un-lft-identity98.1%
+-commutative98.1%
*-commutative98.1%
associate-+r+98.1%
+-commutative98.1%
distribute-rgt1-in98.1%
fma-define98.1%
metadata-eval98.1%
associate-+r+98.1%
Applied egg-rr98.1%
*-lft-identity98.1%
+-commutative98.1%
fma-undefine98.1%
+-commutative98.1%
*-commutative98.1%
+-commutative98.1%
associate-+r+98.1%
distribute-lft1-in98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 1.00000000000000002e151 < beta Initial program 71.3%
Taylor expanded in beta around inf 94.0%
metadata-eval94.0%
associate-+l+94.0%
metadata-eval94.0%
add-sqr-sqrt94.0%
pow294.0%
associate-+r+94.0%
Applied egg-rr94.0%
Final simplification97.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 2.0))))
(if (<= beta 8.5e+150)
(/ (/ (* (+ beta 1.0) (+ 1.0 alpha)) t_0) (* (+ (+ beta alpha) 3.0) t_0))
(/ (/ (+ 1.0 alpha) beta) (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8.5e+150) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: tmp
t_0 = alpha + (beta + 2.0d0)
if (beta <= 8.5d+150) then
tmp = (((beta + 1.0d0) * (1.0d0 + alpha)) / t_0) / (((beta + alpha) + 3.0d0) * t_0)
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 2.0);
double tmp;
if (beta <= 8.5e+150) {
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 2.0) tmp = 0 if beta <= 8.5e+150: tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0) else: tmp = ((1.0 + alpha) / beta) / (beta + 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 <= 8.5e+150) tmp = Float64(Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / t_0) / Float64(Float64(Float64(beta + alpha) + 3.0) * t_0)); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 8.5e+150)
tmp = (((beta + 1.0) * (1.0 + alpha)) / t_0) / (((beta + alpha) + 3.0) * t_0);
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 8.5e+150], N[(N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 8.5 \cdot 10^{+150}:\\
\;\;\;\;\frac{\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_0}}{\left(\left(\beta + \alpha\right) + 3\right) \cdot t\_0}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 8.4999999999999999e150Initial program 99.3%
associate-/l/98.1%
+-commutative98.1%
associate-+l+98.1%
*-commutative98.1%
metadata-eval98.1%
associate-+l+98.1%
metadata-eval98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
metadata-eval98.1%
metadata-eval98.1%
associate-+l+98.1%
Simplified98.1%
+-commutative98.1%
associate-+r+98.1%
*-commutative98.1%
associate-+r+98.1%
metadata-eval98.1%
*-un-lft-identity98.1%
+-commutative98.1%
*-commutative98.1%
associate-+r+98.1%
+-commutative98.1%
distribute-rgt1-in98.1%
fma-define98.1%
metadata-eval98.1%
associate-+r+98.1%
Applied egg-rr98.1%
*-lft-identity98.1%
+-commutative98.1%
fma-undefine98.1%
+-commutative98.1%
*-commutative98.1%
+-commutative98.1%
associate-+r+98.1%
distribute-lft1-in98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
+-commutative98.1%
Simplified98.1%
if 8.4999999999999999e150 < beta Initial program 71.3%
Taylor expanded in beta around inf 94.0%
Taylor expanded in alpha around 0 94.0%
+-commutative94.0%
Simplified94.0%
Final simplification97.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(let* ((t_0 (+ alpha (+ beta 3.0))) (t_1 (+ alpha (+ beta 2.0))))
(if (<= beta 2.7e+31)
(/ (* (+ beta 1.0) (+ 1.0 alpha)) (* t_1 (* t_1 t_0)))
(/ (/ (+ 1.0 alpha) beta) t_0))))assert(alpha < beta);
double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.7e+31) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: t_0
real(8) :: t_1
real(8) :: tmp
t_0 = alpha + (beta + 3.0d0)
t_1 = alpha + (beta + 2.0d0)
if (beta <= 2.7d+31) then
tmp = ((beta + 1.0d0) * (1.0d0 + alpha)) / (t_1 * (t_1 * t_0))
else
tmp = ((1.0d0 + alpha) / beta) / t_0
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double t_0 = alpha + (beta + 3.0);
double t_1 = alpha + (beta + 2.0);
double tmp;
if (beta <= 2.7e+31) {
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
} else {
tmp = ((1.0 + alpha) / beta) / t_0;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): t_0 = alpha + (beta + 3.0) t_1 = alpha + (beta + 2.0) tmp = 0 if beta <= 2.7e+31: tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_1 * (t_1 * t_0)) else: tmp = ((1.0 + alpha) / beta) / t_0 return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) t_0 = Float64(alpha + Float64(beta + 3.0)) t_1 = Float64(alpha + Float64(beta + 2.0)) tmp = 0.0 if (beta <= 2.7e+31) tmp = Float64(Float64(Float64(beta + 1.0) * Float64(1.0 + alpha)) / Float64(t_1 * Float64(t_1 * t_0))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / t_0); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
t_0 = alpha + (beta + 3.0);
t_1 = alpha + (beta + 2.0);
tmp = 0.0;
if (beta <= 2.7e+31)
tmp = ((beta + 1.0) * (1.0 + alpha)) / (t_1 * (t_1 * t_0));
else
tmp = ((1.0 + alpha) / beta) / t_0;
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function.
code[alpha_, beta_] := Block[{t$95$0 = N[(alpha + N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[beta, 2.7e+31], N[(N[(N[(beta + 1.0), $MachinePrecision] * N[(1.0 + alpha), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * N[(t$95$1 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / t$95$0), $MachinePrecision]]]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
t_0 := \alpha + \left(\beta + 3\right)\\
t_1 := \alpha + \left(\beta + 2\right)\\
\mathbf{if}\;\beta \leq 2.7 \cdot 10^{+31}:\\
\;\;\;\;\frac{\left(\beta + 1\right) \cdot \left(1 + \alpha\right)}{t\_1 \cdot \left(t\_1 \cdot t\_0\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{t\_0}\\
\end{array}
\end{array}
if beta < 2.69999999999999986e31Initial program 99.9%
Simplified93.2%
if 2.69999999999999986e31 < beta Initial program 81.6%
Taylor expanded in beta around inf 90.5%
*-un-lft-identity90.5%
metadata-eval90.5%
associate-+l+90.5%
metadata-eval90.5%
associate-+r+90.5%
Applied egg-rr90.5%
associate-*r/90.5%
*-lft-identity90.5%
+-commutative90.5%
+-commutative90.5%
Simplified90.5%
Final simplification92.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.8e+24)
(/
1.0
(* (+ beta 2.0) (/ (* (+ beta 2.0) (+ (+ beta alpha) 3.0)) (+ beta 1.0))))
(/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.8e+24) {
tmp = 1.0 / ((beta + 2.0) * (((beta + 2.0) * ((beta + alpha) + 3.0)) / (beta + 1.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.8d+24) then
tmp = 1.0d0 / ((beta + 2.0d0) * (((beta + 2.0d0) * ((beta + alpha) + 3.0d0)) / (beta + 1.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.8e+24) {
tmp = 1.0 / ((beta + 2.0) * (((beta + 2.0) * ((beta + alpha) + 3.0)) / (beta + 1.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.8e+24: tmp = 1.0 / ((beta + 2.0) * (((beta + 2.0) * ((beta + alpha) + 3.0)) / (beta + 1.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.8e+24) tmp = Float64(1.0 / Float64(Float64(beta + 2.0) * Float64(Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.0)) / Float64(beta + 1.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.8e+24)
tmp = 1.0 / ((beta + 2.0) * (((beta + 2.0) * ((beta + alpha) + 3.0)) / (beta + 1.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.8e+24], N[(1.0 / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $MachinePrecision]), $MachinePrecision] / N[(beta + 1.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.8 \cdot 10^{+24}:\\
\;\;\;\;\frac{1}{\left(\beta + 2\right) \cdot \frac{\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}{\beta + 1}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.79999999999999992e24Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 82.3%
+-commutative82.3%
Simplified82.3%
Taylor expanded in alpha around 0 69.3%
+-commutative69.3%
Simplified69.3%
clear-num69.3%
inv-pow69.3%
*-commutative69.3%
associate-+l+69.3%
Applied egg-rr69.3%
unpow-169.3%
associate-/r/69.3%
associate-+r+69.3%
+-commutative69.3%
+-commutative69.3%
+-commutative69.3%
+-commutative69.3%
Simplified69.3%
if 1.79999999999999992e24 < beta Initial program 82.0%
Taylor expanded in beta around inf 90.7%
*-un-lft-identity90.7%
metadata-eval90.7%
associate-+l+90.7%
metadata-eval90.7%
associate-+r+90.7%
Applied egg-rr90.7%
associate-*r/90.7%
*-lft-identity90.7%
+-commutative90.7%
+-commutative90.7%
Simplified90.7%
Final simplification76.3%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 9.5e+23) (/ (/ (+ beta 1.0) (+ beta 2.0)) (* (+ beta 2.0) (+ (+ beta alpha) 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 9.5e+23) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * ((beta + alpha) + 3.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 <= 9.5d+23) then
tmp = ((beta + 1.0d0) / (beta + 2.0d0)) / ((beta + 2.0d0) * ((beta + alpha) + 3.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 <= 9.5e+23) {
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * ((beta + alpha) + 3.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 <= 9.5e+23: tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * ((beta + alpha) + 3.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 <= 9.5e+23) tmp = Float64(Float64(Float64(beta + 1.0) / Float64(beta + 2.0)) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.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 <= 9.5e+23)
tmp = ((beta + 1.0) / (beta + 2.0)) / ((beta + 2.0) * ((beta + alpha) + 3.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, 9.5e+23], N[(N[(N[(beta + 1.0), $MachinePrecision] / N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $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 9.5 \cdot 10^{+23}:\\
\;\;\;\;\frac{\frac{\beta + 1}{\beta + 2}}{\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 9.50000000000000038e23Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 82.3%
+-commutative82.3%
Simplified82.3%
Taylor expanded in alpha around 0 69.3%
+-commutative69.3%
Simplified69.3%
if 9.50000000000000038e23 < beta Initial program 82.0%
Taylor expanded in beta around inf 90.7%
*-un-lft-identity90.7%
metadata-eval90.7%
associate-+l+90.7%
metadata-eval90.7%
associate-+r+90.7%
Applied egg-rr90.7%
associate-*r/90.7%
*-lft-identity90.7%
+-commutative90.7%
+-commutative90.7%
Simplified90.7%
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.85e+31) (/ (+ beta 1.0) (* (+ alpha (+ beta 2.0)) (* (+ beta 2.0) (+ beta 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.85e+31) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.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.85d+31) then
tmp = (beta + 1.0d0) / ((alpha + (beta + 2.0d0)) * ((beta + 2.0d0) * (beta + 3.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.85e+31) {
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.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.85e+31: tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.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.85e+31) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(alpha + Float64(beta + 2.0)) * Float64(Float64(beta + 2.0) * Float64(beta + 3.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.85e+31)
tmp = (beta + 1.0) / ((alpha + (beta + 2.0)) * ((beta + 2.0) * (beta + 3.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.85e+31], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(alpha + N[(beta + 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(beta + 2.0), $MachinePrecision] * N[(beta + 3.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.85 \cdot 10^{+31}:\\
\;\;\;\;\frac{\beta + 1}{\left(\alpha + \left(\beta + 2\right)\right) \cdot \left(\left(\beta + 2\right) \cdot \left(\beta + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8499999999999999e31Initial program 99.9%
Simplified93.2%
Taylor expanded in alpha around 0 80.7%
Taylor expanded in alpha around 0 68.8%
+-commutative68.8%
+-commutative68.8%
Simplified68.8%
if 1.8499999999999999e31 < beta Initial program 81.6%
Taylor expanded in beta around inf 90.5%
*-un-lft-identity90.5%
metadata-eval90.5%
associate-+l+90.5%
metadata-eval90.5%
associate-+r+90.5%
Applied egg-rr90.5%
associate-*r/90.5%
*-lft-identity90.5%
+-commutative90.5%
+-commutative90.5%
Simplified90.5%
Final simplification75.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 1.82e+31) (/ (+ beta 1.0) (* (+ beta 2.0) (+ 6.0 (* beta (+ beta 5.0))))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.82e+31) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (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 <= 1.82d+31) then
tmp = (beta + 1.0d0) / ((beta + 2.0d0) * (6.0d0 + (beta * (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 <= 1.82e+31) {
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (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 <= 1.82e+31: tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (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 <= 1.82e+31) tmp = Float64(Float64(beta + 1.0) / Float64(Float64(beta + 2.0) * Float64(6.0 + Float64(beta * 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 <= 1.82e+31)
tmp = (beta + 1.0) / ((beta + 2.0) * (6.0 + (beta * (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, 1.82e+31], N[(N[(beta + 1.0), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(6.0 + N[(beta * N[(beta + 5.0), $MachinePrecision]), $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.82 \cdot 10^{+31}:\\
\;\;\;\;\frac{\beta + 1}{\left(\beta + 2\right) \cdot \left(6 + \beta \cdot \left(\beta + 5\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 1.8200000000000001e31Initial program 99.9%
associate-/l/98.9%
+-commutative98.9%
associate-+l+98.9%
*-commutative98.9%
metadata-eval98.9%
associate-+l+98.9%
metadata-eval98.9%
+-commutative98.9%
+-commutative98.9%
+-commutative98.9%
metadata-eval98.9%
metadata-eval98.9%
associate-+l+98.9%
Simplified98.9%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in beta around 0 82.5%
Taylor expanded in alpha around 0 67.9%
+-commutative67.9%
+-commutative67.9%
+-commutative67.9%
Simplified67.9%
if 1.8200000000000001e31 < beta Initial program 81.6%
Taylor expanded in beta around inf 90.5%
*-un-lft-identity90.5%
metadata-eval90.5%
associate-+l+90.5%
metadata-eval90.5%
associate-+r+90.5%
Applied egg-rr90.5%
associate-*r/90.5%
*-lft-identity90.5%
+-commutative90.5%
+-commutative90.5%
Simplified90.5%
Final simplification75.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ (+ 0.5 (* beta 0.25)) (* (+ beta 2.0) (+ (+ beta alpha) 3.0))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.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.2d0) then
tmp = (0.5d0 + (beta * 0.25d0)) / ((beta + 2.0d0) * ((beta + alpha) + 3.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.2) {
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.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.2: tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.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.2) tmp = Float64(Float64(0.5 + Float64(beta * 0.25)) / Float64(Float64(beta + 2.0) * Float64(Float64(beta + alpha) + 3.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.2)
tmp = (0.5 + (beta * 0.25)) / ((beta + 2.0) * ((beta + alpha) + 3.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.2], N[(N[(0.5 + N[(beta * 0.25), $MachinePrecision]), $MachinePrecision] / N[(N[(beta + 2.0), $MachinePrecision] * N[(N[(beta + alpha), $MachinePrecision] + 3.0), $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.2:\\
\;\;\;\;\frac{0.5 + \beta \cdot 0.25}{\left(\beta + 2\right) \cdot \left(\left(\beta + \alpha\right) + 3\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
*-commutative68.4%
Simplified68.4%
if 4.20000000000000018 < beta Initial program 82.6%
Taylor expanded in beta around inf 89.3%
*-un-lft-identity89.3%
metadata-eval89.3%
associate-+l+89.3%
metadata-eval89.3%
associate-+r+89.3%
Applied egg-rr89.3%
associate-*r/89.3%
*-lft-identity89.3%
+-commutative89.3%
+-commutative89.3%
Simplified89.3%
Final simplification75.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.2) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ alpha (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.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.2d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.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.2) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.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.2: tmp = 1.0 / (4.0 * (beta + (alpha + 3.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.2) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.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.2)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.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.2], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.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.2:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\alpha + \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 4.20000000000000018Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
clear-num69.3%
inv-pow69.3%
*-commutative69.3%
associate-+l+69.3%
Applied egg-rr69.3%
unpow-169.3%
associate-/r/69.4%
associate-+r+69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
distribute-lft-out68.4%
+-commutative68.4%
Simplified68.4%
if 4.20000000000000018 < beta Initial program 82.6%
Taylor expanded in beta around inf 89.3%
*-un-lft-identity89.3%
metadata-eval89.3%
associate-+l+89.3%
metadata-eval89.3%
associate-+r+89.3%
Applied egg-rr89.3%
associate-*r/89.3%
*-lft-identity89.3%
+-commutative89.3%
+-commutative89.3%
Simplified89.3%
Final simplification75.5%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 4.0) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (/ (+ 1.0 alpha) beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
NOTE: alpha and beta should be sorted in increasing order before calling this function.
real(8) function code(alpha, beta)
real(8), intent (in) :: alpha
real(8), intent (in) :: beta
real(8) :: tmp
if (beta <= 4.0d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.0d0)))
else
tmp = ((1.0d0 + alpha) / beta) / (beta + 3.0d0)
end if
code = tmp
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
double tmp;
if (beta <= 4.0) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.0: tmp = 1.0 / (4.0 * (beta + (alpha + 3.0))) else: tmp = ((1.0 + alpha) / beta) / (beta + 3.0) return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 4.0) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(Float64(1.0 + alpha) / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.0)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
else
tmp = ((1.0 + alpha) / beta) / (beta + 3.0);
end
tmp_2 = tmp;
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := If[LessEqual[beta, 4.0], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 + alpha), $MachinePrecision] / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1 + \alpha}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
clear-num69.3%
inv-pow69.3%
*-commutative69.3%
associate-+l+69.3%
Applied egg-rr69.3%
unpow-169.3%
associate-/r/69.4%
associate-+r+69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
distribute-lft-out68.4%
+-commutative68.4%
Simplified68.4%
if 4 < beta Initial program 82.6%
Taylor expanded in beta around inf 89.3%
Taylor expanded in alpha around 0 89.2%
+-commutative89.2%
Simplified89.2%
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.3) (/ 1.0 (* 4.0 (+ beta (+ alpha 3.0)))) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 4.3) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.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 <= 4.3d0) then
tmp = 1.0d0 / (4.0d0 * (beta + (alpha + 3.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 <= 4.3) {
tmp = 1.0 / (4.0 * (beta + (alpha + 3.0)));
} else {
tmp = (1.0 / beta) / (beta + 3.0);
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 4.3: tmp = 1.0 / (4.0 * (beta + (alpha + 3.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 <= 4.3) tmp = Float64(1.0 / Float64(4.0 * Float64(beta + Float64(alpha + 3.0)))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 4.3)
tmp = 1.0 / (4.0 * (beta + (alpha + 3.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, 4.3], N[(1.0 / N[(4.0 * N[(beta + N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 4.3:\\
\;\;\;\;\frac{1}{4 \cdot \left(\beta + \left(\alpha + 3\right)\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 4.29999999999999982Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in alpha around 0 69.4%
+-commutative69.4%
Simplified69.4%
clear-num69.3%
inv-pow69.3%
*-commutative69.3%
associate-+l+69.3%
Applied egg-rr69.3%
unpow-169.3%
associate-/r/69.4%
associate-+r+69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
+-commutative69.4%
Simplified69.4%
Taylor expanded in beta around 0 68.4%
distribute-lft-out68.4%
+-commutative68.4%
Simplified68.4%
if 4.29999999999999982 < beta Initial program 82.6%
Taylor expanded in beta around inf 89.3%
Taylor expanded in alpha around 0 83.0%
associate-/r*83.7%
Simplified83.7%
Final simplification73.6%
NOTE: alpha and beta should be sorted in increasing order before calling this function.
(FPCore (alpha beta)
:precision binary64
(if (<= beta 1.55)
(+
0.08333333333333333
(* beta (- (* beta -0.011574074074074073) 0.027777777777777776)))
(/ (/ 1.0 beta) (+ beta 3.0))))assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 1.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 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.55d0) then
tmp = 0.08333333333333333d0 + (beta * ((beta * (-0.011574074074074073d0)) - 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.55) {
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 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.55: tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 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.55) tmp = Float64(0.08333333333333333 + Float64(beta * Float64(Float64(beta * -0.011574074074074073) - 0.027777777777777776))); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 1.55)
tmp = 0.08333333333333333 + (beta * ((beta * -0.011574074074074073) - 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.55], N[(0.08333333333333333 + N[(beta * N[(N[(beta * -0.011574074074074073), $MachinePrecision] - 0.027777777777777776), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 1.55:\\
\;\;\;\;0.08333333333333333 + \beta \cdot \left(\beta \cdot -0.011574074074074073 - 0.027777777777777776\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 1.55000000000000004Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.4%
+-commutative82.4%
Simplified82.4%
Taylor expanded in beta around 0 82.5%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
+-commutative67.4%
+-commutative67.4%
Simplified67.4%
Taylor expanded in beta around 0 67.1%
if 1.55000000000000004 < beta Initial program 82.8%
Taylor expanded in beta around inf 88.5%
Taylor expanded in alpha around 0 82.2%
associate-/r*82.9%
Simplified82.9%
Final simplification72.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.08333333333333333 (* beta -0.027777777777777776)) (/ (/ 1.0 beta) (+ beta 3.0))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-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 <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5: tmp = 0.08333333333333333 + (beta * -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 <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -0.027777777777777776)); else tmp = Float64(Float64(1.0 / beta) / Float64(beta + 3.0)); end return tmp end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp_2 = code(alpha, beta)
tmp = 0.0;
if (beta <= 2.5)
tmp = 0.08333333333333333 + (beta * -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, 2.5], N[(0.08333333333333333 + N[(beta * -0.027777777777777776), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / beta), $MachinePrecision] / N[(beta + 3.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\begin{array}{l}
\mathbf{if}\;\beta \leq 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{1}{\beta}}{\beta + 3}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.4%
+-commutative82.4%
Simplified82.4%
Taylor expanded in beta around 0 82.5%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
+-commutative67.4%
+-commutative67.4%
Simplified67.4%
Taylor expanded in beta around 0 66.9%
*-commutative66.9%
Simplified66.9%
if 2.5 < beta Initial program 82.8%
Taylor expanded in beta around inf 88.5%
Taylor expanded in alpha around 0 82.2%
associate-/r*82.9%
Simplified82.9%
Final simplification72.4%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.5) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 (* beta (+ beta 3.0)))))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5d0) then
tmp = 0.08333333333333333d0 + (beta * (-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 <= 2.5) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.5: tmp = 0.08333333333333333 + (beta * -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 <= 2.5) tmp = Float64(0.08333333333333333 + Float64(beta * -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 <= 2.5)
tmp = 0.08333333333333333 + (beta * -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, 2.5], N[(0.08333333333333333 + N[(beta * -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 2.5:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta \cdot \left(\beta + 3\right)}\\
\end{array}
\end{array}
if beta < 2.5Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.4%
+-commutative82.4%
Simplified82.4%
Taylor expanded in beta around 0 82.5%
Taylor expanded in alpha around 0 67.4%
+-commutative67.4%
+-commutative67.4%
+-commutative67.4%
Simplified67.4%
Taylor expanded in beta around 0 66.9%
*-commutative66.9%
Simplified66.9%
if 2.5 < beta Initial program 82.8%
Taylor expanded in beta around inf 88.5%
Taylor expanded in alpha around 0 82.2%
Final simplification72.1%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (if (<= beta 2.95) (+ 0.08333333333333333 (* beta -0.027777777777777776)) (/ 1.0 beta)))
assert(alpha < beta);
double code(double alpha, double beta) {
double tmp;
if (beta <= 2.95) {
tmp = 0.08333333333333333 + (beta * -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 <= 2.95d0) then
tmp = 0.08333333333333333d0 + (beta * (-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 <= 2.95) {
tmp = 0.08333333333333333 + (beta * -0.027777777777777776);
} else {
tmp = 1.0 / beta;
}
return tmp;
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): tmp = 0 if beta <= 2.95: tmp = 0.08333333333333333 + (beta * -0.027777777777777776) else: tmp = 1.0 / beta return tmp
alpha, beta = sort([alpha, beta]) function code(alpha, beta) tmp = 0.0 if (beta <= 2.95) tmp = Float64(0.08333333333333333 + Float64(beta * -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 <= 2.95)
tmp = 0.08333333333333333 + (beta * -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, 2.95], N[(0.08333333333333333 + N[(beta * -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 2.95:\\
\;\;\;\;0.08333333333333333 + \beta \cdot -0.027777777777777776\\
\mathbf{else}:\\
\;\;\;\;\frac{1}{\beta}\\
\end{array}
\end{array}
if beta < 2.9500000000000002Initial program 99.9%
associate-/l/98.8%
+-commutative98.8%
associate-+l+98.8%
*-commutative98.8%
metadata-eval98.8%
associate-+l+98.8%
metadata-eval98.8%
+-commutative98.8%
+-commutative98.8%
+-commutative98.8%
metadata-eval98.8%
metadata-eval98.8%
associate-+l+98.8%
Simplified98.8%
Taylor expanded in alpha around 0 82.5%
+-commutative82.5%
Simplified82.5%
Taylor expanded in beta around 0 82.6%
Taylor expanded in alpha around 0 67.6%
+-commutative67.6%
+-commutative67.6%
+-commutative67.6%
Simplified67.6%
Taylor expanded in beta around 0 66.6%
*-commutative66.6%
Simplified66.6%
if 2.9500000000000002 < beta Initial program 82.6%
Taylor expanded in beta around inf 89.3%
Taylor expanded in alpha around inf 6.7%
NOTE: alpha and beta should be sorted in increasing order before calling this function. (FPCore (alpha beta) :precision binary64 (/ 0.25 (+ alpha 3.0)))
assert(alpha < beta);
double code(double alpha, double beta) {
return 0.25 / (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
code = 0.25d0 / (alpha + 3.0d0)
end function
assert alpha < beta;
public static double code(double alpha, double beta) {
return 0.25 / (alpha + 3.0);
}
[alpha, beta] = sort([alpha, beta]) def code(alpha, beta): return 0.25 / (alpha + 3.0)
alpha, beta = sort([alpha, beta]) function code(alpha, beta) return Float64(0.25 / Float64(alpha + 3.0)) end
alpha, beta = num2cell(sort([alpha, beta])){:}
function tmp = code(alpha, beta)
tmp = 0.25 / (alpha + 3.0);
end
NOTE: alpha and beta should be sorted in increasing order before calling this function. code[alpha_, beta_] := N[(0.25 / N[(alpha + 3.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[alpha, beta] = \mathsf{sort}([alpha, beta])\\
\\
\frac{0.25}{\alpha + 3}
\end{array}
Initial program 94.1%
associate-/l/92.7%
+-commutative92.7%
associate-+l+92.7%
*-commutative92.7%
metadata-eval92.7%
associate-+l+92.7%
metadata-eval92.7%
+-commutative92.7%
+-commutative92.7%
+-commutative92.7%
metadata-eval92.7%
metadata-eval92.7%
associate-+l+92.7%
Simplified92.7%
Taylor expanded in alpha around 0 83.3%
+-commutative83.3%
Simplified83.3%
Taylor expanded in alpha around 0 74.1%
+-commutative74.1%
Simplified74.1%
Taylor expanded in beta around 0 46.7%
Final simplification46.7%
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%
Simplified83.8%
Taylor expanded in alpha around 0 77.8%
Taylor expanded in alpha around 0 69.7%
+-commutative69.7%
+-commutative69.7%
Simplified69.7%
Taylor expanded in beta around 0 46.1%
+-commutative46.1%
Simplified46.1%
Taylor expanded in alpha around 0 45.4%
herbie shell --seed 2024118
(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)))